The Maximum Hosoya Index of Unicyclic Graphs with Diameter at Most Four
The Hosoya index of a graph is defined by the total number of the matchings of the graph. In this paper, we determine the maximum Hosoya index of unicyclic graphs with <i>n</i> vertices and diameter 3 or 4. Our results somewhat answer a question proposed by Wagner and Gutman in 2010 for...
Main Authors: | Weijun Liu, Jingwen Ban, Lihua Feng, Tao Cheng, Frank Emmert-Streib, Matthias Dehmer |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-08-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/11/8/1034 |
Similar Items
-
The Hosoya Entropy of a Graph
by: Abbe Mowshowitz, et al.
Published: (2015-03-01) -
On the Estrada Indices of Unicyclic Graphs with Fixed Diameters
by: Wenjie Ning, et al.
Published: (2021-09-01) -
Erratum: Liu, W.; Ban, J.; Feng, L.; Cheng, T.; Emmert-Streib, F.; Dehmer, M. The Maximum Hosoya Index of Unicyclic Graphs with Diameter at Most Four. <em>Symmetry</em> 2019, <em>11</em>, 1034
by: Weijun Liu, et al.
Published: (2020-09-01) -
Linear Algorithms for the Hosoya Index and Hosoya Matrix of a Tree
by: Aleksander Vesel
Published: (2021-01-01) -
The extremal unicyclic graphs with given diameter and minimum edge revised Szeged index
by: Shengjie He, et al.
Published: (2023-09-01)