Authors: SeogJin Kim SuhRyung Kim Jung Yeun Lee Won Jin Park Yoshio Sano
Publish Date: 2011/09/27
Volume: 28, Issue: 6, Pages: 831-842
Abstract
Given a graph G the mstep graph of G denoted by S m G has the same vertex set as G and an edge between two distinct vertices u and v if there is a walk of length m from u to v The line graph of G denoted by LG is a graph such that the vertex set of LG is the edge set of G and two vertices u and v of LG are adjacent if the edges corresponding to u and v share a common end vertex in G We characterize connected graphs G such that S m G and LG are isomorphic
Keywords: