Search Results for ""

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...

A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...

The great rhombicuboctahedral graph is the cubic Archimedean graph on 48 nodes and 72 edges that is the skeleton of the great rhombicuboctahedron as well as the great ...

The M_(22) graph, also known as the 77-graph, is a strongly regular graph on 77 nodes related to the Mathieu group M_(22) and to the Witt design. It is illustrated above in ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...