The distance d(u, v) from a vertex u of G to a vertex v is the length of a shortest u to v path. The distance degree sequence (dds) of a vertex v in a graph G is a list of the number of vertices at distance 1, 2, . . . . , e(v); in that order, where e(v) denotes the eccentricity of v in G. Thus, the sequenceis the distance degree sequence of the vertex v i in G where, d i j denotes the number of vertices at distance j from v i . In this article we present results to find distance degree sequences of some of the derived graphs viz., the line graph, the sub-division graph, the total graph, the powers of a graph, the Mycieleskian of a graph etc.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.