MaximalIndependentEdgeSet (Graph Utilities Package Symbol)

MaximalIndepndentEdgeSet[g] gives a maximal independent edge set of an undirected graph g.

MaximalIndependentVertexSet (Graph Utilities Package Symbol)

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

MinCut (Graph Utilities Package Symbol)

MinCut[g, k] partitions the undirected graph g into k parts where the number of edge cuts is approximately minimized.

MinimumBandwidthOrdering (Graph Utilities Package Symbol)

MinimumBandwidthOrdering[g] attempts to find a vertex ordering that minimizes the bandwidth of the undirected graph g.MinimumBandwidthOrdering[m] attempts to find row and ...

NeighborhoodSubgraph (Graph Utilities Package Symbol)

NeighborhoodSubgraph[g, i, r] gives a subgraph consists of vertices that can be reached from vertex i within r hops.NeighborhoodSubgraph[g, i] gives a subgraph consists of ...

NeighborhoodVertices (Graph Utilities Package Symbol)

NeighborhoodVertices[g, i, r] gives vertices that can be reached from vertex i within r hops.NeighborhoodVertices[g, i] gives vertices that can be reached from vertex i.

PageRanks (Graph Utilities Package Symbol)

PageRanks[g] give the page rank of the graph g as a rule list.

PageRankVector (Graph Utilities Package Symbol)

PageRankVector[g] returns the page rank of the graph g.

PseudoDiameter (Graph Utilities Package Symbol)

PseudoDiameter[g] give the pseudo-diameter of the undirected graph g, and the two vertices that achieve this diameter.

RecursionMethod (Graph Utilities Package Symbol)

RecursionMethod is an option to MinimumBandwidthOrdering that specifies whether to employ a multilevel process to find a minimal bandwidth ordering.