Average Eccentricity of Graphs W.R.T. D-Distance
Venkateswara Rao. V.1, Varma. P. L. N2, Reddy Babu. D3
1Venkateswara Rao V., Division of Mathematics, Department of Sciences and Humanities, Vignan’s Foundation for Science, Technology and Research, Vadlamudi, Guntur (A.P), India.
2Varma, P. L. N, Division of Mathematics, Department of Sciences and Humanities, Vignan’s Foundation for Science, Technology and Research, Vadlamudi Guntur (A.P), India.
3Reddy Babu D, Department of Mathematics, GST, GITAM University, Doddaballapura, Bengaluru North (Karnataka), India.
Manuscript received on 13 February 2019 | Revised Manuscript received on 04 March 2019 | Manuscript Published on 08 June 2019 | PP: 208-210 | Volume-7 Issue-5S4, February 2019 | Retrieval Number: E10400275S419/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: The average distance is one of the important index which can be used in many applications, in particular, for finding out the network signals, minimum distance etc. Similarly, the average eccentricity of a graph is applicable in the network signals. In this article, we study the average eccentricity of graph using D-distance, which we call average D-eccentricity and derive some of its properties. Also we obtain the bounds for the average D-eccentricity of a graph.
Keywords: D-Distance, D-Eccentricity, Average D-Eccentricity.
Scope of the Article: Cryptography and Applied Mathematics