Estimating Circular Distance in Graph Nodes
J. Veeranjaneyulu1, Varma. P. L. N.2
1J. Veeranjaneyulu, Division of Mathematics, Department of S&H, Vignan’s Foundation for Science, Technology & Research,Vadlamudi Guntur (A.P), India.
2Varma. P. L. N, Division of Mathematics, Department of S&H, Vignan’s Foundation for Science, Technology & Research,Vadlamudi Guntur (A.P), India.
Manuscript received on 25 November 2019 | Revised Manuscript received on 19 December 2019 | Manuscript Published on 30 December 2019 | PP: 311-316 | Volume-9 Issue-1S5 December 2019 | Retrieval Number: A11131291S52019/19©BEIESP | DOI: 10.35940/ijeat.A1113.1291S519
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In the current article we propose the concept of circular D-distance between nodes which is sum of D-distance and detour D-distance. We show that this distance is a metric. Also we study some properties. Further we compute the circular D-distance of some classes of graphs and show that some of them are circular D-self-centered.
Keywords: Circular D-Distance, Circular D Radius, Circular D-Diameter. Article Type: Research Article.
Scope of the Article: Cryptography and Applied Mathematics