Abstract
The atom-bond connectivity (ABC) index has been, in recent years, one of the most actively studied vertex-degree-based graph invariants in chemical graph theory. For a given graph G, the ABC index is defined as ∑uv∈Ed(u)+d(v)−2d(u)d(v), where d(u) is the degree of vertex u in G and E denotes the set of edges of G. In this paper, we present some new structural properties of trees with a minimal ABC index (also refer to as a minimal-ABC tree), which is a step further towards understanding their complete characterization. We show that a minimal-ABC tree cannot simultaneously contain a B4-branch and B1 or B2-branches.
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 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.
