Equivalences[g, h] lists the vertex equivalence classes between graphs g and h defined by their vertex degrees. Equivalences[g] lists the vertex equivalences for graph g ...

Mathematica 6.0 fundamentally redefined Mathematica and introduced a major new paradigm for computation. Building on Mathematica's time-tested core symbolic architecture, ...

MaximalIndependentVertexSet[g] gives a maximal independent vertex set of an undirected graph g.MaximalIndependentVertexSet[g, w] gives a maximal independent vertex set of g ...

CompleteGraph[n] creates a complete graph on n vertices. An option Type that takes on the values Directed or Undirected is allowed. The default setting for this option is ...

GraphDistanceMatrix[g] gives the matrix of distances between vertices for the graph g.GraphDistanceMatrix[g, d] gives the matrix of distances between vertices of maximal ...

EigenvectorCentrality[g] gives a list of eigenvector centralities for the vertices in the graph g.EigenvectorCentrality[g, "In"] gives a list of in-centralities for a ...

CubicalGraph returns the graph corresponding to the cube, a Platonic solid.

DodecahedralGraph returns the graph corresponding to the dodecahedron, a Platonic solid.

GraphComplement[g] gives the complement of graph g.

IcosahedralGraph returns the graph corresponding to the icosahedron, a Platonic solid.