EdgeDelete[g, e] makes a graph by deleting the edge e from the graph g.EdgeDelete[g, {e_1, e_2, ...}] deletes a collection of edges from g.EdgeDelete[g, patt] deletes all ...
Manipulate[expr, {u, u_min, u_max}] generates a version of expr with controls added to allow interactive manipulation of the value of u. Manipulate[expr, {u, u_min, u_max, ...
EdgeAdd
(Built-in Mathematica Symbol) EdgeAdd[g, e] makes a graph by adding the edge e to the graph g.EdgeAdd[g, {e_1, e_2, ...}] adds a collection of edges to g.
Property[item, name -> value] associates the property name -> value with item.
UndirectedEdge[u, v] or u \[UndirectedEdge] v represents an undirected edge of a graph with vertices u and v.
UniformGraphDistribution[n, m] represents a uniform graph distribution on n-vertex, m-edge graphs.
VertexReplace[g, {v_1 -> w_1, v_2 -> w_2, ...}] replaces each vertex v_i in the graph g by w_i.
Introduction Core Language Mathematics and Algorithms
VertexEccentricity[g, s] gives the length of the longest shortest path from the source s to every other vertex in the graph g.
DiscreteWaveletTransform[data] gives the discrete wavelet transform (DWT) of an array of data.DiscreteWaveletTransform[data, wave] gives the discrete wavelet transform using ...