Distance-based indices of complete m-ary trees

DOI10.1142/S179383092050041XzbMath1457.05021OpenAlexW3011714495MaRDI QIDQ5858152

Tomáš Vetrík, Mesfin Masre, Samuel Asefa Fufa

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s179383092050041x

zbMATH Keywords

binary treeWiener index\(m\)-ary treedistance-based index

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• The smallest harmonic index of trees with given maximum degree
• Maximizing Wiener index for trees with given vertex weight and degree sequences
• Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
• Relationship between the Hosoya polynomial and the hyper-Wiener index
• On extremal multiplicative Zagreb indices of trees with given domination number
• A note on chemical trees with minimum Wiener polarity index
• On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree
• The first three smallest Estrada indices for trees
• Relationship Between the Hosoya Polynomial and the Edge-Hosoya Polynomial of Trees
• Trees with smaller harmonic indices
• WIENER INDEX OF TREES OF GIVEN ORDER AND DIAMETER AT MOST
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Distance-based indices of complete m-ary trees