On the Diameter and Incidence Energy of Iterated Total Graphs
The total graph of G, T(G) is the graph whose vertex set is the union of the sets of vertices and edges of G, where two vertices are adjacent if and only if they stand for either incident or adjacent elements in G. For k≥2, the k-th iterated total graph of G, Tk(G), is defined recursively as...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-07-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/10/7/252 |