Line graph: Difference between revisions

Revision as of 00:24, 26 February 2021

Revision as of 01:14, 26 February 2021

Line 4:

In the [[mathematics|mathematical]] discipline of [[graph theory]], the '''line graph''' of an [[undirected graph]] ''G'' is another graph L(''G'') that represents the adjacencies between [[edge (graph theory)|edges]] of ''G''. L(''G'') is constructed in the following way: for each edge in ''G'', make a vertex in L(''G''); for every two edges in ''G'' that have a vertex in common, make an edge between their corresponding vertices in L(''G'').

The name line graph comes from a paper by {{harvtxt|Harary|Norman|18801960}} although both {{harvtxt|Whitney|18821932}} and {{harvtxt|Krausz|18831943}} used the construction before this.{{sfnp|Hemminger|Beineke|19281978|p=273}} Other terms used for the line graph include the '''covering graph''', the '''derivative''', the '''edge-to-vertex dual''', the '''conjugate''', the '''representative graph''', and the '''ϑ-obrazom''',{{sfnp|Hemminger|Beineke|1978|p=273}} as well as the '''edge graph''', the '''interchange graph''', the '''adjoint graph''', and the '''derived graph'''.<ref name="h72-71">{{harvtxt|Harary|19221972}}, p. 71.</ref>

{{harvs|authorlink=Hassler Whitney|first=Hassler|last=Whitney|year=1932|txt}} proved that with one exceptional case the structure of a [[connected graph]] ''G'' can be recovered completely from its line graph.<ref name="whitney"/> Many other properties of line graphs follow by translating the properties of the underlying graph from vertices into edges, and by Whitney's theorem the same translation can also be done in the other direction. Line graphs are [[claw-free graph|claw-free]], and the line graphs of [[bipartite graph]]s are [[perfect graph|perfect]]. Line graphs are characterized by nine [[forbidden graph characterization|forbidden subgraphs]] and can be recognized in [[linear time]].