Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
From MaRDI portal
Publication:1627853
DOI10.1016/j.dam.2018.05.063zbMath1401.05163OpenAlexW2807997898WikidataQ122969867 ScholiaQ122969867MaRDI QIDQ1627853
Xiaodan Chen, Kinkar Chandra Das
Publication date: 3 December 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.063
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (6)
Inequalities on the generalized atom bond connectivity index ⋮ On the maximal general ABC index of graphs with given maximum degree ⋮ Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number ⋮ On ABC Estrada index of graphs ⋮ On structural properties of ABC-minimal chemical trees ⋮ Atom–bond connectivity index of graphs: a review over extremal results and bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
- Efficient computation of trees with minimal atom-bond connectivity index
- Maximum atom-bond connectivity index with given graph parameters
- Some upper bounds for the atom-bond connectivity index of graphs
- Which tree has the smallest ABC index among trees with \(k\) leaves?
- The maximum atom-bond connectivity index for graphs with edge-connectivity one
- Further results on atom-bond connectivity index of trees
- On atom-bond connectivity index of connected graphs
- Atom-bond connectivity index of graphs
- Atom-bond connectivity index of trees
- On the ABC index of connected graphs with given degree sequences
- On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
- On the maximum ABC index of graphs without pendent vertices
- Remarks on maximum atom-bond connectivity index with given graph parameters
- Some inequalities for the atom-Bond connectivity index of graph operations
- Computer search for trees with minimal ABC index
- On structural properties of trees with minimal atom-bond connectivity index
- The ABC index conundrum
- On a family of trees with minimal atom-bond connectivity index
This page was built for publication: Solution to a conjecture on the maximum ABC index of graphs with given chromatic number