Loading…
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 n vertices and diameter 3 or 4. Our results somewhat answer a question proposed by Wagner and Gutman in 2010 for unicyclic graphs wi...
Saved in:
Published in: | Symmetry (Basel) 2019-08, Vol.11 (8), p.1034 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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 n vertices and diameter 3 or 4. Our results somewhat answer a question proposed by Wagner and Gutman in 2010 for unicyclic graphs with small diameter. |
---|---|
ISSN: | 2073-8994 2073-8994 |
DOI: | 10.3390/sym11081034 |