Total graph
Материал из WikiGrapp
Total graph --- тотальный граф.
Given a graph [math]\displaystyle{ G = (V,E) }[/math], a total graph is the graph [math]\displaystyle{ T(G) = (V \cup E, E'') }[/math], where: [math]\displaystyle{ E'' = E \cup \{(e_{1},e_{2}) | e_{1}, e_{2} \in E \mbox{ and }e_{1}, e_{2} \mbox{ are adjacent in }G\} }[/math]
[math]\displaystyle{ \cup\{(v,e)| v \in V, e \in E \mbox{ and }v \mbox{ is one of the ends of }e \mbox{ in }G\}. }[/math]
