Search Results for ""

The torus grid graph T_(m,n) is the graph formed from the graph Cartesian product C_m square C_n of the cycle graphs C_m and C_n. C_m square C_n is isomorphic to C_n square ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

A planar graph G is said to be triangulated (also called maximal planar) if the addition of any edge to G results in a nonplanar graph. If the special cases of the triangle ...

The cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated cube. It is implemented in the Wolfram Language as ...

The truncated dodecadodecahedral graph is the skeleton of the truncated dodecadodecahedron, which is the only uniform polyhedron for which this is the case. It will be ...

The truncated icosahedral graph is the cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated icosahedron. It is sometimes known as the ...