VertexColoring[g] uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph g.

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 ...

TopologicalSort[g] gives a list of vertices of g in topologically sorted order for a directed acyclic graph g.

The graphics language of Mathematica is fully integrated with dynamic interactivity. This lets you create graphics that can respond to input devices in a variety of ways.

HITSCentrality[g] gives a list of authority and hub centralities for the vertices in the graph g.

MinimumVertexCover[g] finds a minimum vertex cover of graph g.

CompleteKaryTree[n] gives the complete binary tree with n levels.CompleteKaryTree[n, k] gives the complete k-ary tree with n levels.

KaryTree[n] gives a binary tree with n vertices.KaryTree[n, k] gives a k-ary tree with n vertices.

FunctionalGraph[f, v] takes a set v and a function f from v to v and constructs a directed graph with vertex set v and edges (x, f[x]) for each x in v. FunctionalGraph[{f_1, ...

Mathematica provides flexible options for labeling plots, allowing you to present ideas more clearly in presentations and publications.