Abstract
Let G be a simple connected graph with the vertex set V ( G ) . The eccentric distance sum of G is defined as ξ d ( G ) = ∑ v ∈ V ( G ) ε ( v ) D G ( v ) , where ε ( v ) is the eccentricity of the vertex v and D G ( v ) = ∑ u ∈ V ( G ) d ( u , v ) is the sum of all distances from the vertex v. In this paper we characterize the extremal unicyclic graphs among n-vertex unicyclic graphs with given girth having the minimal and second minimal eccentric distance sum. In addition, we characterize the extremal trees with given diameter and minimal eccentric distance sum.
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 callDisclaimer: 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.
