Talk:Levi graph
Add topicLatest comment: 13 years ago by David Eppstein in topic incidence graph
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
incidence graph
[edit]From Burkhard Polster, p 5:
- The complete information about any geometry is contained in its incidence graph This graph is constructed as follows: The vertices of the graph are the points and lines of the geometry, and two vertices of the graph are connected by an edge iff and only if they correspond to a point and a line of the geometry such that the point is contained in the line. A geometry is connected if its incidence graph is connected.
Use of the term Levi graph is missing, but the alternative label applies.Rgdboer (talk) 21:46, 30 August 2012 (UTC)
- Ok, I've added it back, but as a proper reference within the text this time rather than merely as something added to the references section without being used within the text. —David Eppstein (talk) 22:07, 30 August 2012 (UTC)