Aggressive is an option to PseudoDiameter that specifies whether an extra iteration is to be carried out.
Bicomponents[g] gives the biconnected components of the undirected graph g.
ClosenessCentrality[g] finds the closeness centrality.
CommunityModularity[g, partition] gives the community modularity of a partition.CommunityModularity[g, assignment] gives the community modularity of an assignment.
CommunityStructureAssignment[g] gives the assignment of vertices of a graph g into communities.
CommunityStructurePartition[g] gives the partition of a graph g into communities.
EdgeList
(Graph Utilities Package Symbol) EdgeList[g] gives a list of edges in the graph g
ExpressionTree[e] plots the expression tree of e.ExpressionTreePlot[e, pos] plots the expression tree of e with its root placed at position pos.ExpressionTreePlot[e, pos, ...
FindHamiltonianCycle[g] attempts to find a Hamiltonian cycle.
GraphCoordinates3D[g, options] calculates a visually appealing 3D layout of the vertices of a graph g and returns the coordinates of the vertices.