field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after Girard Desargues, arises...

projective geometry. Desargues' theorem, the Desargues graph, and the crater Desargues on the Moon are named in his honour. Born in Lyon, Desargues came from a...

space. For every Levi graph, there is an equivalent hypergraph, and vice versa. The Desargues graph is the Levi graph of the Desargues configuration, composed...

after Girard Desargues. The Desargues configuration can be constructed in two dimensions from the points and lines occurring in Desargues's theorem, in...

10 , 2 ) {\displaystyle G(10,2)} , the Desargues graph G ( 10 , 3 ) {\displaystyle G(10,3)} and the Nauru graph G ( 12 , 5 ) {\displaystyle G(12,5)} ....

Petersen graphs are the n-prism G(n, 1), the Dürer graph G(6, 2), the Möbius-Kantor graph G(8, 3), the dodecahedron G(10, 2), the Desargues graph G(10, 3)...

3-regular graphs. Every strongly regular graph is symmetric, but not vice versa. Heawood graph Möbius–Kantor graph Pappus graph Desargues graph Nauru graph Coxeter...

In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G. A k-factor of a graph is a spanning...

graph, the Desargues graph, the Nauru graph, the Coxeter graph, the Tutte–Coxeter graph, the Dyck graph, the Foster graph and the Biggs–Smith graph. W. T....

vertices. The bipartite Kneser graph H(5, 2) is the Desargues graph and the bipartite Kneser graph H(n, 1) is a crown graph. Watkins (1970). Lovász (1978)...

The smallest 6-crossing cubic graph is the Desargues graph, with 20 vertices. None of the four 7-crossing cubic graphs, with 22 vertices, are well known...

In the mathematical field of graph theory, a graph G is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices u1—v1 and u2—v2 of...

Tutte–Coxeter graph, the Dodecahedral graph, the Desargues graph, Tutte 12-cage, the Biggs–Smith graph, and the Foster graph. Bang, S.; Dubickas, A.; Koolen...

In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color...

10 , 2 ) {\displaystyle G(10,2)} , the Desargues graph G ( 10 , 3 ) {\displaystyle G(10,3)} and the Nauru graph G ( 12 , 5 ) {\displaystyle G(12,5)} ....

is the Desargues graph: K2 × G(5,2) = G(10,3). The bipartite double cover of a complete graph Kn is a crown graph (a complete bipartite graph Kn,n minus...

Nauru graph and the Desargues graph are integral. The Higman–Sims graph, the Hall–Janko graph, the Clebsch graph, the Hoffman–Singleton graph, the Shrikhande...

{\displaystyle G(10,2)} and the Desargues graph G ( 10 , 3 ) {\displaystyle G(10,3)} . The Nauru graph is a Cayley graph of S4, the symmetric group of permutations...

graph is the Desargues graph: K2 × G(5,2) = G(10,3). The bipartite double cover of a complete graph Kn is a crown graph (a complete bipartite graph Kn...

In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and any...

various individual (finite) graphs. The columns 'vertices', 'edges', 'radius', 'diameter', 'girth', 'P' (whether the graph is planar), χ (chromatic number)...

resulting graph is a bipartite Kneser graph; the graph formed in this way with n = 2 has 20 vertices and 30 edges, and is called the Desargues graph. All median...

graph and the Desargues graph. Any hypercube graph, such as the four-dimensional hypercube shown below, is also bivariegated. However, the graph shown below...

projective spaces; such embeddability is a consequence of a property known as Desargues' theorem, not shared by all projective planes. A projective plane consists...

Thesis, University of Tübingen, 2018 Kagno, I. N. (1947), "Desargues' and Pappus' graphs and their groups", American Journal of Mathematics, 69 (4),...

plane is the real projective plane provided with a metric. Kepler and Desargues used the gnomonic projection to relate a plane σ to points on a hemisphere...

trivial configuration (11), DCD(2) is the trilateral (32) and DCD(3) is the Desargues configuration (103). In configurations DCD(n) were further generalized...

distance-transitive graphs into C-UH graphs that yielded the above-mentioned paper and also allowed to confront, as digraphs, the Pappus graph to the Desargues graph. These...

plane, even though the plane is too small to contain a non-degenerate Desargues configuration (which requires 10 points and 10 lines). The lines of the...

In the mathematical field of graph theory, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by H. S. M. Coxeter and Robert...