Superdominance order and distance of trees with bounded maximum degree
From MaRDI portal
Publication:1861561
DOI10.1016/S0166-218X(02)00195-6zbMath1009.05052MaRDI QIDQ1861561
Publication date: 9 March 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (20)
Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree ⋮ Binary trees with the largest number of subtrees ⋮ Wiener indices of balanced binary trees ⋮ Wiener index of graphs with fixed number of pendant or cut-vertices ⋮ The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices ⋮ Maximizing Graovac-Ghorbani Index of Trees with Fixed Maximum Degree ⋮ On the eccentric distance sum of trees with given maximum degree ⋮ The largest Wiener index of unicyclic graphs given girth or maximum degree ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Trees with large numbers of subtrees ⋮ The sum of the distances between the leaves of a tree and the `semi-regular' property ⋮ A note on extremal trees with degree conditions ⋮ On subtrees of trees ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Extremal problems on \(k\)-ary trees with respect to the cover cost and reverse cover cost ⋮ Wiener index of graphs with more than one cut-vertex ⋮ Extremal trees with respect to the Steiner Wiener index ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Unnamed Item ⋮ Superdominance order and distance of trees with bounded maximum degree
Cites Work
This page was built for publication: Superdominance order and distance of trees with bounded maximum degree
