Line graph: Difference between revisions

From Graph
No edit summary
No edit summary
 
Line 7: Line 7:
==Definition==
==Definition==


Suppose <math>G</math> is an [[undirected graph]]. The '''line graph'''of <math>G</math>, denoted <math>L(G)</math>, is defined as follows:
Suppose <math>G</math> is an [[undirected graph]]. The '''line graph''' of <math>G</math>, denoted <math>L(G)</math>, is defined as follows:


# The vertex set of <math>L(G)</matH> is defined as the edge set of <math>G</math>.
# The vertex set of <math>L(G)</matH> is defined as the edge set of <math>G</math>.
# The edges of <math>L(G)</math> are defined as follows: two vertices of <math>L(G)</math> are adjacent if and only if, when viewed as edges of <math>G</math>, they share a common vertex.
# The edges of <math>L(G)</math> are defined as follows: two vertices of <math>L(G)</math> are adjacent if and only if, when viewed as edges of <math>G</math>, they share a common vertex.

Latest revision as of 16:00, 29 May 2012

Template:Undirected graph operation

Name

The construction outlined here goes by the name of the line graph. Alternate names are 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.

Definition

Suppose G is an undirected graph. The line graph of G, denoted L(G), is defined as follows:

  1. The vertex set of L(G) is defined as the edge set of G.
  2. The edges of L(G) are defined as follows: two vertices of L(G) are adjacent if and only if, when viewed as edges of G, they share a common vertex.