On the minimal ABC index of trees with \(k\) leaves
type: Item
instance of: scholarly article
title: On the minimal ABC index of trees with \(k\) leaves
zbMATH Open document ID: 1358.05163
author: Wenshui Lin
author: Peixi Li
author: Chi Ma
author: Dongzhan Zhang
author: Yuan Zhang
author: Jianfeng Chen
published in: Discrete Applied Mathematics
publication date: 2017-03-15T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6695128
zbMATH Keywords: atom-bond connectivity index
zbMATH Keywords: extremal graphs
zbMATH Keywords: pendent vertices
MaRDI profile type: Publication
full work available at URL: j.dam.2016.10.007
OpenAlex ID: W2547547077
cites work: Q2975353
cites work: Efficient computation of trees with minimal atom-bond connectivity index
cites work: On structural properties of trees with minimal atom-bond connectivity index
cites work: On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on \(B_1\)- and \(B_2\)-branches
cites work: On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
cites work: Computer search for trees with minimal ABC index
cites work: The ABC index of trees with given degree sequence
cites work: Q5280044
cites work: Q5279167
cites work: The ABC index conundrum
cites work: Q2975356
cites work: Q5280043
cites work: Q5403539
cites work: Q5403536
cites work: Q5279113
cites work: Which tree has the smallest ABC index among trees with \(k\) leaves?
DOI: 10.1016/J.DAM.2016.10.007
description: scientific article; zbMATH DE number 6695128