Abstract
The eccentric connectivity coindex of a graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the vertex set of [Formula: see text], [Formula: see text] is the edge set of [Formula: see text], [Formula: see text] is the eccentricity of [Formula: see text] and [Formula: see text] is the degree of [Formula: see text] in [Formula: see text]. We present lower bounds on the eccentric connectivity coindex for bipartite graphs of given order and vertex connectivity, order and matching number, order and odd diameter. The extremal graphs are presented as well. To the best of our knowledge, our extremal graphs of given order and vertex connectivity are not extremal graphs for any other research problem in graph theory.
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.
