Circular D-Distance and Path Graphs
J. Veeranjaneyulu1, Varma2, P. L. N.3
1J. Veeranjaneyulu, Division, Department of Mathematics, S & H, Vignan’s Foundation for Science, Technology & Research, Vadlamudi, Guntur (A.P), India.
2Varma, Division, Department of Mathematics, S & H, Vignan’s Foundation for Science, Technology & Research, Vadlamudi, Guntur (A.P), India.
3P. L. N., Division, Department of Mathematics, S & H, Vignan’s Foundation for Science, Technology & Research, Vadlamudi, Guntur (A.P), India.
Manuscript received on 13 February 2019 | Revised Manuscript received on 04 March 2019 | Manuscript Published on 08 June 2019 | PP: 219-223 | Volume-7 Issue-5S4, February 2019 | Retrieval Number: E10430275S419/19©BEIESP
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 present study we deal with the concept of circular D-distance which is the sum of D-distance and detour D-distance. We study some properties. We also obtain some results on circular D-distance, circular D-radius, circular D-self-centered graphs etc. In the areas of network theory, communications, data mining etc finding the shortest path plays an important role. Sometimes, depending on application we may have to find the longest path or both.
Keywords: D-Distance, Detour D-Distance, Circular D-Distance, Circular D-Radius, Circular D-Diameter.
Scope of the Article: Cryptography and Applied Mathematics