Search Results for ""

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

There are at least two graphs associated with H. Walther. A graph on 25 vertices which appears somewhat similar to Tutte's fragment is implemented without discussion or ...

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

A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

There are a number of graphs associated with J. H. Conway. The first is the unique rank-3 strongly regular graph with parameters (nu,k,lambda,mu)=(1408,567,246,216) with ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

There are a number of hypotraceable and hypohamiltonian graphs associated with Carsten Thomassen. These graphs, illustrated above, are implemented in the Wolfram Language as ...

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...