Distant divisor graph of subdivision of a Graph
Journal: International Journal of Mathematics and Soft Computing (Vol.4, No. 1)Publication Date: 2014-01-01
Authors : Seenivasan Saravanakumar; K Nagarajan;
Page : 51-60
Keywords : Distant divisor path; distant divisor graph; antipodal graph;
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.
Other Latest Articles
- The Chain is Only as Strong as its Weakest Link: Understanding the Endoscopic Optical Chain
- Algorithms to compute some dominating sets of ES (n, k) and ESC (n, k)
- Intra Cerebral Changes Detected by CT Scan of Brain in Eclampsia
- Economic Categories in Tax Relations System: Interconnection, Interdependence and Semantic Differences in the Nature of Concepts
- Development of the Approaches to the Selection of Criteria for Tax Planning Classification
Last modified: 2017-08-30 18:58:40