Line graph of a hypergraph: Difference between revisions

Content deleted Content added
cleanup citations
SmackBot (talk | contribs)
m Date the maintenance tags or general fixes
Line 1:
{{Cleanup|date=April 2008}}
{{cleanup}}
In [[mathematics]], a [[hypergraph]] is a generalization of a [[graph (mathematics)|graph]], where edges can contain any finite number of vertices, and the line graph of a hypergraph is a generalization of the [[line graph]] of a graph. The precise definition is that the '''line graph''' of a hypergraph is the graph whose vertex set is the set of edges of the hypergraph, with two edges adjacent when they have nonempty intersection. Thus, the line graph of a hypergraph is the same as the [[intersection graph]] of a family of finite sets.