Search Results for ""

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

An edge-transitive graph is a graph such that any two edges are equivalent under some element of its automorphism group. More precisely, a graph is edge-transitive if for all ...

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

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

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

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

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

An (n,k)-firecracker is a graph obtained by the concatenation of n k-stars by linking one leaf from each (Chen et al. 1997, Gallian 2007). Firecracker graphs are graceful ...

A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...