Modified hyper-Wiener index of trees
DOI10.1016/J.DAM.2023.03.005zbMATH Open1512.05089OpenAlexW4353031977MaRDI QIDQ6157422FDOQ6157422
Authors: Ş. Burcu Bozkurt, Igor Ž. Milovanović, E. I. Milovanović, Marjan M. Matejić 
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.005
Recommendations
Trees (05C05) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
Cites Work
- Laplacian matrices of graphs: A survey
- Connections between Wiener index and matchings
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- Trees with minimal Laplacian coefficients
- The Laplacian spectral radius of some graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sharp upper bound for the number of spanning trees of a graph
- Comparing Zagreb indices and coindices of trees
- On the Arithmetic and Geometric Means and on Holder's Inequality
- The best lower bound depended on two fixed variables for Jensen's inequality with ordered variables
- Title not available (Why is that?)
- Laplacian coefficients of trees
- Mathematical aspects of Wiener index
- Title not available (Why is that?)
- Beyond the Zagreb indices
- Title not available (Why is that?)
- Laplacian coefficients and Zagreb indices of trees
- A note on the first Zagreb index and coindex of graphs
- An Upper Bound on the First Zagreb Index in Trees
Cited In (2)
This page was built for publication: Modified hyper-Wiener index of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157422)
