Search Results for ""

The biconnected graph theta_0 on seven nodes and seven edges illustrated above. It has chromatic polynomial pi_(theta_0)(z)=z^7-8z^6+28z^5-56z^4+68z^3-47z^2+14z and chromatic ...

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 coarseness xi(G) of a graph G is the maximum number of edge-disjoint nonplanar subgraphs contained in a given graph G. The coarseness of a planar graph G is therefore ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

The kite graph is the 5-vertex graph illustrated above (Brandstädt et al. 1987, p. 18). It is implemented in the Wolfram Language as GraphData["KiteGraph"]. Unfortunately, ...

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...