Search Results for ""
81 - 90 of 328 for Transitive reductionSearch Results
View search results from all Wolfram sites (2171 matches)A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...
The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...
The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...
The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...
The word "convergent" has a number of different meanings in mathematics. Most commonly, it is an adjective used to describe a convergent sequence or convergent series, where ...
A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...
The Gray graph is a cubic semisymmetric graph on 54 vertices. It was discovered by Marion C. Gray in 1932, and was first published by Bouwer (1968). Malnič et al. (2002) ...
The great dirhombicosidodecahedral graph is the skeleton of the great dirhombicosidodecahedron and the second octahedron 20-compound. It is illustrated above in a few ...
...