Which tree has the smallest ABC index among trees with \(k\) leaves?
type: Item
instance of: scholarly article
title: Which tree has the smallest ABC index among trees with \(k\) leaves?
zbMATH Open document ID: 1319.05039
author: Colton Magnant
author: Pouria Salehi Nowbandegani
author: Ivan Gutman
published in: Discrete Applied Mathematics
publication date: 2015-09-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 6477268
zbMATH Keywords: atom-bond connectivity index
zbMATH Keywords: ABC index
MaRDI profile type: Publication
full work available at URL: j.dam.2015.05.008
OpenAlex ID: W875733777
cites work: Q2975353
cites work: On structural properties of trees with minimal atom-bond connectivity index
cites work: Atom-bond connectivity index of trees
cites work: Q2975291
cites work: Q2975349
cites work: The ABC index conundrum
cites work: Q2975356
cites work: On atom-bond connectivity index of connected graphs
DOI: 10.1016/J.DAM.2015.05.008
Recommended article: Q5280043
Recommended article: On the minimal ABC index of trees with \(k\) leaves
Recommended article: Q5280044
Recommended article: Q5279167
Recommended article: The structure of ABC-minimal trees with given number of leaves
Recommended article: The ABC index of trees with given degree sequence
Recommended article: The smallest Randić index for trees
Recommended article: Q5367816
Recommended article: The minimal-ABC trees with \(B_2\)-branches
description: scientific article; zbMATH DE number 6477268