The Pappus graph, a Levi graph with 18 vertices formed from the Pappus configuration. Vertices labeled with single letters correspond to points in the configuration; vertices labeled with three letters correspond to lines through three points.
Girth
≥ 6
Table of graphs and parameters
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure.[1][2] From a collection of points and lines in an incidence geometry or a projective configuration, we form a graph with one vertex per point, one vertex per line, and an edge for every incidence between a point and a line. They are named for Friedrich Wilhelm Levi, who wrote about them in 1942.[1][3]
The Levi graph of a system of points and lines usually has girth at least six: Any 4-cycles would correspond to two lines through the same two points. Conversely any bipartite graph with girth at least six can be viewed as the Levi graph of an abstract incidence structure.[1] Levi graphs of configurations are biregular, and every biregular graph with girth at least six can be viewed as the Levi graph of an abstract configuration.[4]
Levi graphs may also be defined for other types of incidence structure, such as the incidences between points and planes in Euclidean space. For every Levi graph, there is an equivalent hypergraph, and vice versa.
^ abcGrünbaum, Branko (2006), "Configurations of points and lines", The Coxeter Legacy, Providence, RI: American Mathematical Society, pp. 179–225, MR 2209028. See in particular p. 181.
^Polster, Burkard (1998), A Geometrical Picture Book, Universitext, New York: Springer-Verlag, p. 5, doi:10.1007/978-1-4419-8526-2, ISBN 0-387-98437-2, MR 1640615.
^Levi, F. W. (1942), Finite Geometrical Systems, Calcutta: University of Calcutta, MR 0006834.
^Gropp, Harald (2007), "VI.7 Configurations", in Colbourn, Charles J.; Dinitz, Jeffrey H. (eds.), Handbook of combinatorial designs, Discrete Mathematics and its Applications (Boca Raton) (Second ed.), Chapman & Hall/CRC, Boca Raton, Florida, pp. 353–355.
In combinatorial mathematics, a Levigraph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points...
to a bipartite graph called the Levigraph or incidence graph of the structure. As any bipartite graph is two-colorable, the Levigraph can be given a...
has order 168. As with any incidence structure, the Levigraph of the Fano plane is a bipartite graph, the vertices of one part representing the points...
"incidence graph" or "Levigraph" corresponding to every hypergraph, and conversely, every bipartite graph can be regarded as the incidence graph of a hypergraph...
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets...
matrix is also a biadjacency matrix of the Levigraph of the structure. As there is a hypergraph for every Levigraph, and vice versa, the incidence matrix...
2009) states that every planar graph can be represented as the intersection graph of line segments in the plane. A Levigraph of a family of points and lines...
planar graph with eight vertices and twelve edges. The graph Q4 is the Levigraph of the Möbius configuration. It is also the knight's graph for a toroidal...
mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. The graph is cubic, and...
points of one decagon to the corresponding points of the other. It is the Levigraph of the Desargues configuration. This configuration consists of ten points...
visualization which is then projected onto a two-dimensional surface. The word graph is sometimes used as a synonym for diagram. The term "diagram" in its commonly...
edge-transitive graph is either regular or biregular. The Levigraphs of geometric configurations are biregular; a biregular graph is the Levigraph of an (abstract)...
field of graph theory, the Pappus graph is a bipartite, 3-regular, undirected graph with 18 vertices and 27 edges, formed as the Levigraph of the Pappus...
corresponding incidence graph (Levigraph), namely the length of the shortest path between two vertices in this bipartite graph. The distance between two...
through it, and each line has exactly three points on it. The Gray graph is the Levigraph of this configuration; it has a vertex for every point and every...
of dimension five is the Clebsch graph. The folded cube graph of dimension six is the Kummer graph, i.e. the Levigraph of the Kummer point-plane configuration...
The Levigraph of the Desargues configuration, a graph having one vertex for each point or line in the configuration, is known as the Desargues graph. Because...
per circle and three circles through each point. Its Levigraph is the Rhombic dodecahedral graph, the skeleton of both Rhombic dodecahedron and Bilinski...
Mathematics Department at the University of Calcutta. He introduced the Levigraph in 1940 at a series of lectures on finite geometry. He contributed to...
configuration has a corresponding biregular bipartite graph known as its incidence or Levigraph. Given a finite set X (of elements called points) and...
In the mathematical field of graph theory, the Nauru graph is a symmetric, bipartite, cubic graph with 24 vertices and 36 edges. It was named by David...
Global Information