Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number
From MaRDI portal
Abstract: In this article, we determine the maximum Wiener indices of unicyclic graphs with given number of vertices and matching number. We also characterize the extremal graphs. This solves an open problem of Du and Zhou.
Recommendations
- scientific article; zbMATH DE number 6116805
- The Wiener index of unicyclic graphs with perfect matching
- The largest Wiener index of unicyclic graphs given girth or maximum degree
- scientific article; zbMATH DE number 6255456
- Unicyclic graphs with maximum hyper-Wiener index
- Largest Wiener index of unicyclic graphs with given bipartition
- The Wiener index of unicyclic graphs with girth and matching number.
- The hyper-Wiener index of unicyclic graphs with given matching number.
- On the Wiener index of unicyclic graphs
- The maximum Wiener polarity index of unicyclic graphs
Cited in
(13)- Maximal Estrada index of unicyclic graphs with perfect matching
- Proof of a conjecture on Wiener index and eccentricity of a graph due to edge contraction
- On transmission irregular starlike trees
- Connections between Wiener index and matchings
- The Wiener index of unicyclic graphs with girth and matching number.
- Minimum on Wiener indices of trees and unicyclic graphs of the given matching number
- The Wiener index of unicyclic graphs with perfect matching
- Upper bounds on some indices of graphs with a given matching number
- scientific article; zbMATH DE number 6116805 (Why is no real title available?)
- Five results on maximizing topological indices in graphs
- Extremal unicyclic graphs with respect to vertex-degree-based topological indices
- On extremal bipartite graphs with given number of cut edges
- Extremal values of the Sombor index in unicyclic and bicyclic graphs
This page was built for publication: Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5157504)
