Search Results for ""

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...

The Tutte 8-cage (Godsil and Royle 2001, p. 59; right figure) is a cubic graph on 30 nodes and 45 edges which is the Levi graph of the Cremona-Richmond configuration. It ...

The girth of a graphs is the length of one of its (if any) shortest graph cycles. Acyclic graphs are considered to have infinite girth (Skiena 1990, p. 191). The girth of a ...

A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).

The central point in a wheel graph W_n. The hub has degree n-1.

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...