Abstract
The eccentricity of a vertex is the maximum distance from it to any other vertex and the average eccentricity avec(G) of a graph G is the mean value of eccentricities of all vertices of G. In this paper we present some lower and upper bounds for the average eccentricity of a connected (molecular) graph in terms of its structural parameters such as number of vertices, diameter, clique number, independence number and the first Zagreb index. Also, we obtain a relation between average eccentricity and first Zagreb index. Moreover, we compare average eccentricity with graph energy, ABC index and \(GA_1\) index.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the National Academy of Sciences, India Section A: Physical Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
