NeighborhoodGraph[g, v] gives the graph neighborhood vertex v in the graph g. NeighborhoodGraph[g, {a_1, a_2, ...}] gives the graph neighborhood of the a_i that can be ...
GraphDiameter[g] gives the maximum eccentricity of the vertices in the graph g.
HITSCentrality[g] gives a list of authority and hub centralities for the vertices in the graph g.
KatzCentrality[g, \[Alpha]] gives a list of Katz centralities for the vertices in the graph g and weight \[Alpha].KatzCentrality[g, \[Alpha], \[Beta]] gives a list of Katz ...
PageRankCentrality[g, \[Alpha]] gives a list of page-rank centralities for the vertices in the graph g and weight \[Alpha].PageRankCentrality[g, \[Alpha], \[Beta]] gives a ...
AcyclicGraphQ[g] yields True if the graph g is an acyclic graph and False otherwise.
ClosenessCentrality[g] gives a list of closeness centralities for the vertices in the graph g.
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 ...
All the functionality in DiscreteMath`Combinatorica` is available in the newly created Combinatorica Package.
ConnectedComponents[g] gives the connected components of the graph g.ConnectedComponents[g, {v_1, v_2, ...}] gives the connected components that include at least one of the ...