Definitions for line graph
line graph

WikipediaRate this definition:0.0 / 0 votes

1. Line graph

   In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between 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 Harary & Norman (1960) although both Whitney (1932) and Krausz (1943) used the construction before this. 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, as well as the edge graph, the interchange graph, the adjoint graph, and the derived graph.Hassler Whitney (1932) proved that with one exceptional case the structure of a connected graph G can be recovered completely from its line graph. 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, and the line graphs of bipartite graphs are perfect. Line graphs are characterized by nine forbidden subgraphs and can be recognized in linear time. Various extensions of the concept of a line graph have been studied, including line graphs of line graphs, line graphs of multigraphs, line graphs of hypergraphs, and line graphs of weighted graphs.

WikidataRate this definition:1.8 / 4 votes

1. Line graph

   In the mathematical discipline of graph theory, the line graph L of an undirected graph G is another graph L that represents the adjacencies between edges of G. The name line graph comes from a paper by Harary & Norman although both Whitney and Krausz used the construction before this . Other terms used for the line graph include the theta-obrazom, the covering graph, the derivative, the edge-to-vertex dual, the conjugate, and the representative graph, as well as the edge graph, the interchange graph, the adjoint graph, and the derived graph . One of the earliest and most important theorems about line graphs is due to Hassler Whitney, who proved that with one exceptional case the structure of G can be recovered completely from its line graph. In other words, with that one exception, the entire graph can be deduced from knowing the adjacencies of edges.

How to pronounce line graph?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say line graph in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of line graph in Chaldean Numerology is: 6

2. Pythagorean Numerology

   The numerical value of line graph in Pythagorean Numerology is: 9

References

1. ^ Wikipedia
   https://en.wikipedia.org/wiki/Line_Graph
2. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=line graph