IdenticalQ (Combinatorica Package Symbol)

IdenticalQ[g, h] yields True if graphs g and h have identical edge lists, even though the associated graphics information need not be the same.

IncidenceMatrix (Built-in Mathematica Symbol)

IncidenceMatrix[g] gives the vertex-edge incidence matrix of the graph g.

FindVertexCover (Built-in Mathematica Symbol)

FindVertexCover[g] finds a vertex cover of the graph g with a minimum number of vertices.

MakeUndirected (Combinatorica Package Symbol)

MakeUndirected[g] gives the underlying undirected graph of the given directed graph g.

RemoveSinks (Graph Utilities Package Symbol)

RemoveSinks is an option of PageRanks, PageRankVector, LinkRanks and LinkRankMatrix that specifies whether sinks are removed by linking with all vertices.

FindIndependentVertexSet (Built-in Mathematica Symbol)

FindIndependentVertexSet[g] finds an independent vertex set of the graph g with a maximum number of vertices.

VertexShapeFunction (Built-in Mathematica Symbol)

VertexShapeFunction is an option and property for Graph and related functions that specifies a function to use to generate primitives for rendering each vertex.

GraphCenter (Combinatorica Package Symbol)

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.

HasseDiagram (Combinatorica Package Symbol)

HasseDiagram[g] constructs a Hasse diagram of the relation defined by directed acyclic graph g.

MaximalMatching (Combinatorica Package Symbol)

MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.