Search Results for ""

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

The triangular grid graph T_n is the lattice graph obtained by interpreting the order-(n+1) triangular grid as a graph, with the intersection of grid lines being the vertices ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...