ThomassenGraph returns a hypotraceable graph, a graph G that has no Hamiltonian path but whose subgraph G - v for every vertex v has a Hamiltonian path.
Turan
(Combinatorica Package Symbol) Turan[n, p] constructs the Turán graph, the extremal graph on n vertices that does not contain CompleteGraph[p].
Mathematica's symbolic graphics representation allows for immediate interchange with all standard vector graphics formats.
GridCreationSettings -> {opt_1 -> val_1, opt_2 -> val_2, ...} is a global option that specifies settings for the Create Table/Matrix dialog.
LinkRankMatrix[g] returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u -> v is defined as the PageRanks of u, divided by the ...
One of the most powerful aspects of graphics in Mathematica is their interactivity. Rotating, zooming, and panning your graphics allows for a more complete visualization ...
The following sequence shows how to select an object inside a graphic. To begin editing within a graphic, single-click or double-click the background or an object in the ...
EdgeCoverQ[g, elist] yields True if the edge list elist is an edge cover of the graph g and False otherwise.
FindEulerianCycle[g] finds an Eulerian cycle in the graph g if one exists.FindEulerianCycle[g, k] finds at most k Eulerian cycles.
ClosenessCentrality[g] gives a list of closeness centralities for the vertices in the graph g.