ToCombinatoricaGraph[g] return the Combinatorica representation of the graph g.ToCombinatoricaGraph[g, n] return the graph g, adding additional unconnected vertices, if ...

IsomorphicQ[g, h] yields True if graphs g and h are isomorphic.

GridGraph[n, m] constructs an n*m grid graph, the product of paths on n and m vertices. GridGraph[p, q, r] constructs a p*q*r grid graph, the product of GridGraph[p, q] and a ...

Bicomponents[g] gives the biconnected components of the undirected graph g.

AcyclicQ[g] yields True if graph g is acyclic.

BipartiteQ[g] yields True if graph g is bipartite.

CliqueQ[g, c] yields True if the list of vertices c defines a clique in graph g.

CostOfPath[g, p] sums up the weights of the edges in graph g defined by the path p.

DegreesOf2Neighborhood[g, v] returns the sorted list of degrees of vertices of graph g within a distance of 2 from v.

EmptyQ[g] yields True if graph g contains no edges.