Editing Line graph (section)

=== Disjointness graph ===
The '''disjointness graph''' of {{mvar|G}}, denoted {{math|''D''(''G'')}}, is constructed in the following way: for each edge in {{mvar|G}}, make a vertex in {{math|''D''(''G'')}}; for every two edges in {{mvar|G}} that do ''not'' have a vertex in common, make an edge between their corresponding vertices in {{math|''D''(''G'')}}.<ref>{{Cite journal|last=Meshulam|first=Roy|date=2001-01-01|title=The Clique Complex and Hypergraph Matching|journal=Combinatorica|language=en|volume=21|issue=1|pages=89–94|doi=10.1007/s004930170006|s2cid=207006642|issn=1439-6912}}</ref> In other words, {{math|''D''(''G'')}} is the [[complement graph]] of {{math|''L''(''G'')}}. A [[Clique (graph theory)|clique]] in {{math|''D''(''G'')}} corresponds to an independent set in {{math|''L''(''G'')}}, and vice versa.