CompleteKaryTree[n] gives the complete binary tree with n levels.CompleteKaryTree[n, k] gives the complete k-ary tree with n levels.
CompleteKaryTree[n, k] returns a complete k-ary tree on n vertices.
CompleteBinaryTree[n] returns a complete binary tree on n vertices.
TreeGraphQ[g] yields True if the graph g is a tree and False otherwise.
In Mathematica, graphs can be constructed in a variety of ways. They can be built from vertices and edges directly in a symbolic form. They can come from built-in curated ...
BetweennessCentrality[g] gives a list of betweenness centralities for the vertices in the graph g.
DirectedEdges is an option for Graph, GraphPlot, and related functions that specifies whether edges should be taken to be directed.
GraphCenter[g] gives the set of vertices with minimum eccentricity in the graph g.
GraphRadius[g] gives the minimum eccentricity of the vertices in the graph g.
GraphPeriphery[g] gives the set of vertices with maximum eccentricity in the graph g.