Maximum Wiener Indices of Unicyclic Graphs of Given Matching Number

2018/07/16 by Stijn Cambie, Cambie, Stijn
Chemistry · Mathematics · #05C12 #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Synthesis and Properties of Aromatic Compounds

paper · pdf · doi:10.48550/arxiv.1807.05893

openalex publication_date 2018/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Maximum Wiener index of unicyclic graphs with given bipartition
• The Wiener Index of Unicyclic Graphs with Girth and the Matching Number
• Upper and Lower Bounds for Generalized Wiener Indices on unicyclic graphs
• The Maximum Wiener Index of Trees with Given Degree Sequences
• Wiener index of unicycle graphs with given number of even degree vertices