Search Results for ""

The set of graph eigenvalues of the adjacency matrix is called the spectrum of the graph. (But note that in physics, the eigenvalues of the Laplacian matrix of a graph are ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...

The fish graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["FishGraph"].

The rising sun graph is the graph on 7 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RisingSunGraph"].

The Johnson graph J(n,k) has vertices given by the k-subsets of {1,...,n}, with two vertices connected iff their intersection has size k-1. Special classes are summarized in ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

The gear graph, also sometimes known as a bipartite wheel graph (Brandstädt et al. 1987), is a wheel graph with a graph vertex added between each pair of adjacent graph ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

The Hoffman graph is the bipartite graph on 16 nodes and 32 edges illustrated above that is cospectral to the tesseract graph Q_4 (Hoffman 1963, van Dam and Haemers 2003). ...