ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Distant divisor graph of subdivision of a Graph

Journal: International Journal of Mathematics and Soft Computing (Vol.4, No. 1)

Publication Date:

Authors : ; ;

Page : 51-60

Keywords : Distant divisor path; distant divisor graph; antipodal graph;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Let G = (V;E) be a (p; q) - graph. A shortest path P is called a distant divisor path if l(P) divides q. Distance divisor graphD(G) of a graph G = (V;E) has the vertex set V = V (G) and two vertices in D(G) are adjacent if they have the distant divisor path in G. In this paper, we deal with distant divisor graph of subdivision of some graphs such as path, cycle, star and complete bipartite graph etc. Further we generalize the concept of antipodal graphs and prove that some distant divisor graphs are the generalized antipodal graphs. We also deal with the distant divisor graph of some graphs of diameter 4 and below.

Last modified: 2017-08-30 18:58:40