Abstract
Let G be a connected graph. The eccentric connectivity index ξc(G) of G is defined as ξc(G)=∑v∈VGdG(v)ϵG(v), where the eccentricity ϵG(v)=maxu∈VGdG(v,u). Zhang et al. (2012) studied the minimal eccentric connectivity indices of graphs. As a continuance of it, in this paper we consider these problems on bipartite graphs. We obtain lower bounds on ξc(G) in terms of the number of edges among n-vertex connected bipartite graphs with given diameter. Among all connected bipartite graphs on n vertices with m edges and diameter at least s, and connected bipartite graphs on n vertices with diameter at least s, we establish the lower bounds on ξc(G), respectively. All the corresponding extremal graphs are identified.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.