Extremal values for ratios of distances in trees
From MaRDI portal
Publication:1377615
DOI10.1016/S0166-218X(97)00068-1zbMath0886.05059OpenAlexW2077737311MaRDI QIDQ1377615
László A. Székely, Roger Entringer, Curtiss Barefoot
Publication date: 8 April 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (26)
Wiener index versus maximum degree in trees ⋮ On the eccentric subtree number in trees ⋮ Eccentricity sums in trees ⋮ Proximity in triangulations and quadrangulations ⋮ On different ``middle parts of a tree ⋮ On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs ⋮ Centers of complex networks ⋮ Proximity, remoteness and maximum degree in graphs ⋮ Maximizing Graovac-Ghorbani Index of Trees with Fixed Maximum Degree ⋮ MAD trees and distance-hereditary graphs ⋮ Extremal values of ratios: distance problems vs. subtree problems in trees. II ⋮ A note on PM-compact bipartite graphs ⋮ Maximal buttonings of trees ⋮ Proximity and remoteness in directed and undirected graphs ⋮ Sum of weighted distances in trees ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ Average distance and generalised packing in graphs ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Proximity and remoteness in triangle-free and \(C_4\)-free graphs in terms of order and minimum degree ⋮ The distances between internal vertices and leaves of a tree ⋮ A linear-time algorithm to compute a MAD tree of an interval graph ⋮ Wiener Index and Remoteness in Triangulations and Quadrangulations ⋮ Proximity, remoteness and minimum degree ⋮ Enumeration of BC-subtrees of trees ⋮ Centroid, leaf-centroid, and internal-centroid ⋮ Branch-weight unique trees
Cites Work
This page was built for publication: Extremal values for ratios of distances in trees
