Concept information
Preferred term
Levi graph
Definition(s)
-
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. 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.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Levi_graph)
Broader concept(s)
Synonym(s)
- incidence graph
In other languages
-
French
-
graphe d'incidence
URI
http://data.loterre.fr/ark:/67375/PSR-RXJBMDT3-R
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}