mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches...

In the mathematical field of graph theory, an edge-transitive graph is a graph G such that, given any two edges e1 and e2 of G, there is an automorphism...

In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points...

graphs include the Gray graph (the smallest semi-symmetric cubic graph), the Ljubljana graph, and the Tutte 12-cage. The Frucht graph is one of the five...

Telegraph. The graph is commonly known as the Gray graph. Marion Gray was born in Ayr, Scotland on 26 March 1902 to Marion (née Cameron) and James Gray. She attended...

In graph theory, the hypercube graph Qn is the graph formed from the vertices and edges of an n-dimensional hypercube. For instance, the cube graph Q3...

Coxeter graph Tutte–Coxeter graph Dyck graph Klein graph Foster graph Biggs–Smith graph The Rado graph Folkman graph Gray graph Ljubljana graph Tutte 12-cage...

mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that...

quadrillé, 'large square', is a common form of graph paper with a sparse grid printed in light blue or gray and right to the edge of the paper. In the U...

In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a...