Comparative results between the number of subtrees and Wiener index of graphs
From MaRDI portal
Publication:5104618
DOI10.1051/ro/2022118zbMath1505.05044OpenAlexW4285093555MaRDI QIDQ5104618
Publication date: 15 September 2022
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2022118
Trees (05C05) Enumeration in graph theory (05C30) 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) Chemical graph theory (05C92)
Related Items (5)
Comparing Wiener, Szeged and revised Szeged index on cactus graphs ⋮ Extremal problems for connected set enumeration ⋮ On the Wiener index of orientations of graphs ⋮ On inverse symmetric division deg index of graphs ⋮ On the Harary Index of Graphs with Given Dissociation Number
This page was built for publication: Comparative results between the number of subtrees and Wiener index of graphs