Line graph: Difference between revisions

From Graph
No edit summary
No edit summary
Line 1: Line 1:
{{undirected graph operation}}
==Name==
==Name==



Revision as of 15:59, 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 is an undirected graph. The line graphof , denoted , is defined as follows:

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