A class of trees and its Wiener index
From MaRDI portal
Publication:2501129
DOI10.1007/S10440-006-9026-5zbMATH Open1100.05031OpenAlexW2039912427MaRDI QIDQ2501129FDOQ2501129
Authors: Stephan Wagner 
Publication date: 4 September 2006
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-006-9026-5
Recommendations
Cites Work
- Title not available (Why is that?)
- Wiener index of trees: Theory and applications
- Title not available (Why is that?)
- Graphs, partitions and Fibonacci numbers
- On the expansion of the partition functions in a series
- A simplified proof of the partition formula
- The expected number of parts in a partition of n
Cited In (37)
- On an extremal inverse problem in graph theory
- Title not available (Why is that?)
- On the \(\sigma_t\)-irregularity and the inverse irregularity problem
- Some results about the inset edge and average distance of trees
- A survey of recent extremal results on the Wiener index of trees
- The maximum Wiener index of maximal planar graphs
- Title not available (Why is that?)
- Graphs with a given diameter that maximise the Wiener index
- On the Wiener index of graphs
- Mean Row Values in (u, v)-Calkin–Wilf Trees
- Inverse problem on the Steiner Wiener index
- Title not available (Why is that?)
- Title not available (Why is that?)
- The WP-Bailey Tree and its Implications
- Inverse problem for Zagreb indices
- A note on the inverse problem for the Wiener index
- Some new results on distance-based graph invariants
- Title not available (Why is that?)
- Some remarks on inverse Wiener index problem
- Minimal Harary index of unicyclic graphs with diameter at most 4
- A congruence relation for Wiener and Szeged indices
- Title not available (Why is that?)
- \(U(n+1)\) WP-Bailey tree
- Bounding the \(k\)-Steiner Wiener and Wiener-type indices of trees in terms of eccentric sequence
- On the two conjectures of the Wiener index
- Wiener Index and Remoteness in Triangulations and Quadrangulations
- The Steiner \(k\)-Wiener index of graphs with given minimum degree
- Vertex version of the Wiener theorem
- Complexity of splits reconstruction for low-degree trees
- Molecular graphs and the inverse Wiener index problem
- The Wiener index of random digital trees
- Inverse problem for Bell index
- On the Wiener indices of trees ordering by diameter-growing transformation relative to the pendent edges
- On Wiener inverse interval problem of trees
- On the inverse Mostar index problem for molecular graphs
- A general asymptotic scheme for the analysis of partition statistics
- The inverse problem for certain tree parameters
This page was built for publication: A class of trees and its Wiener index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501129)
