Maximum atom-bond connectivity index with given graph parameters

DOI10.1016/J.DAM.2016.06.021MaRDI QIDQ323084zbMATH OpenOpenAlexFDO

Authors Xiumei Zhang, Hua Wang, Xiao-Dong Zhang, Yu Yang

Publication date 7 October 2016

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.06998

zbMATH Keywords

chromatic numberatom-bond connectivity indexindependence numberedge-connectivitypendent vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Abstract: The atom-bond connectivity (ABC) index is a degree-based topological index. It was introduced due to its applications in modeling the properties of certain molecular structures and has been since extensively studied. In this note, we examine the influence on the extremal values of the ABC index by various graph parameters. More specifically, we consider the maximum ABC index of connected graphs of given order, with fixed independence number, number of pendent vertices, chromatic number and edge-connectivity respectively. We provide characterizations of extremal structures as well as some conjectures. Numerical analysis of the extremal values are also presented.

Recommendations

• Remarks on maximum atom-bond connectivity index with given graph parameters
• Extreme atom-bond connectivity index of graphs
• On atom-bond connectivity index of connected graphs
• On atom-bond connectivity index of graphs
• Atom–bond connectivity index of graphs: a review over extremal results and bounds

Cites work

• ABC index of trees with fixed number of leaves
• Atom-bond connectivity index of trees
• Extremal trees with fixed degree sequence for atom-bond connectivity index
• Extreme atom-bond connectivity index of graphs
• Further results on atom-bond connectivity index of trees
• On atom-bond connectivity index
• On atom-bond connectivity index of connected graphs
• On structural properties of trees with minimal atom-bond connectivity index
• On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on B₁- and B₂-branches
• On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
• Some upper bounds for the atom-bond connectivity index of graphs
• The ABC index of trees with given degree sequence
• Which tree has the smallest ABC index among trees with \(k\) leaves?

Cited in

(15)

• Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
• Extremal graphs with respect to generalized ABC index
• On the maximum ABC index of graphs without pendent vertices
• Remarks on maximum atom-bond connectivity index with given graph parameters
• On general \(A B C\)-type index of connected graphs
• On the maximal general ABC index of graphs with given maximum degree
• The greatest values for atom-bond sum-connectivity index of graphs with given parameters
• The ABC Index Conundrum's Complete Solution
• On structural properties of ABC-minimal chemical trees
• Proofs to some open problems on the maximum Sombor index of graphs
• Extremal augmented Zagreb index of trees with given numbers of vertices and leaves
• The maximum atom-bond connectivity index for graphs with edge-connectivity one
• On the ABC index of connected graphs with given degree sequences
• Atom–bond connectivity index of graphs: a review over extremal results and bounds
• On extremality of ABC spectral radius of a tree

This page was built for publication: Maximum atom-bond connectivity index with given graph parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323084)