No label defined (Q4713675)

A graph is \(k\)-self-centered if its radius \(r\) and diameter \(d\) are both equal to \(k\). For a vertex \(v\) of the (simple) graph \(G\), \(E_ G(v)\) denotes the set of eccentric vertices of \(v\) (vertices at maximum distance from \(v\)). If \(G\) is a subgraph of \(H\), \(H\) is \(G\)- eccentricity preserving if the eccentricity of every \(v\in V(G)\) is the same in \(G\) and \(H\). The authors prove the following: (1) For every \(v\in V\), \(E_ G(v)\) is an independent set if and only if \(T(G)\), the total graph of \(G\), is \(G\)-eccentricity preserving. (2) If \(G\) is \(k\)-self-centered, for every \(v\in V\), \(E_ G(v)\) is an independent set iff \(T(G)\) is \(k\)-self-centered. As these results are not generalizable to iterated total graphs, the authors study, in two short theorems, the diameter of \(T^ N(G)\).