Endline graph

Endline graph --- концевой граф.

Let [math]\displaystyle{ G=(V,E) }[/math] be a graph and [math]\displaystyle{ V(G) = \{v_{1}, \ldots, v_{n}\} }[/math]. We added to [math]\displaystyle{ G }[/math] [math]\displaystyle{ n }[/math] new vertices and [math]\displaystyle{ n }[/math] edges [math]\displaystyle{ \{u_{i},v_{i}\}, \; (i = 1,2, \ldots, n) }[/math], where [math]\displaystyle{ u_{i} }[/math] are different from any vertex of [math]\displaystyle{ G }[/math] and from each other. A new graph [math]\displaystyle{ G^{+} }[/math] with [math]\displaystyle{ 2n }[/math] vertices is called the endline graph of [math]\displaystyle{ G }[/math].

See also

• Middle graph.