Wiener index of unicycle graphs with given number of even degree vertices
From MaRDI portal
(Redirected from Publication:5858163)
Abstract: The Wiener index of a connected graph is the sum of the distance of all pairs of distinct vertices. It was introduced by Wiener in 1947 to analyze some aspects of branching by fitting experimental data for several properties of alkane compounds. Denote by the set of unicyclic graphs with vertices and vertices of even degree. In this paper we present a structural result on the graphs in with minimum Wiener index and completely characterize such graphs when .
Recommendations
- On the Wiener index of unicyclic graphs
- A note on Wiener indices of unicyclic graphs
- The Wiener index of unicyclic graphs with perfect matching
- On the Wiener index of unicyclic graphs with given girth.
- The Wiener index of unicyclic graphs with girth and matching number.
- Hyper-Wiener index of unicyclic graphs
- Remarks on the Wiener index of unicyclic graphs
- The hyper-Wiener index of unicyclic graphs
- scientific article; zbMATH DE number 6255456
- The hyper-Wiener index of unicyclic graphs with given matching number.
Cites work
- scientific article; zbMATH DE number 3972909 (Why is no real title available?)
- scientific article; zbMATH DE number 6116805 (Why is no real title available?)
- scientific article; zbMATH DE number 6282152 (Why is no real title available?)
- scientific article; zbMATH DE number 5251354 (Why is no real title available?)
- A survey on graphs extremal with respect to distance-based topological indices
- Cacti with \(n\)-vertices and \(t\) cycles having extremal Wiener index
- Distance and eccentric sequences to bound the Wiener index, Hosoya polynomial and the average eccentricity in the strong products of graphs
- Extremal Wiener index of trees with given number of vertices of even degree
- Hitting times, cover cost, and the Wiener index of a tree
- Mathematical aspects of Wiener index
- On Wiener and multiplicative Wiener indices of graphs
- On some degree-and-distance-based graph invariants of trees
- On the Wiener index of unicyclic graphs
- On the Wiener index of unicyclic graphs with given girth.
- The maximum Wiener polarity index of unicyclic graphs
- The minimum Wiener index of unicyclic graphs with a fixed diameter
- Total distance, Wiener index and opportunity index in wreath products of star graphs
- Wiener index of Eulerian graphs
- Wiener index of generalized 4-stars and of their quadratic line graphs
- Wiener index of trees: Theory and applications
Cited in
(7)- Wiener index of families of unicyclic graphs obtained from a tree
- On Wiener index of graph complements
- The Wiener index of unicyclic graphs given number of pendant vertices or cut vertices
- The Wiener index of unicyclic graphs with perfect matching
- Extremal arithmetic-geometric index of bicyclic graphs
- Remarks on the Wiener index of unicyclic graphs
- Extremal Wiener Index of Graphs with Given Number of Vertices of Odd Degree
This page was built for publication: Wiener index of unicycle graphs with given number of even degree vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5858163)