Derived graphs of some graphs


Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt




The derived graph of a simple graph $G$, denoted by $G^\dagger$, is the graph having the same vertex set as $G$, in which two vertices are adjacent if and only if their distance in $G$ is two. Continuing the studies communicated in Kragujevac J. Math. {\bf 34} (2010), 139-146, we examined derived graphs of some graphs and determine their spectra.