On the Maximal-Adjacency-Spectrum Unicyclic Graphs with Given Maximum Degree

Haizhou Song and Lulu Tian

Mathematical Problems in Engineering, 2020, vol. 2020, 1-23

Abstract:

In this paper, we study the properties and structure of the maximal-adjacency-spectrum unicyclic graphs with given maximum degree. We obtain some necessary conditions on the maximal-adjacency-spectrum unicyclic graphs in the set of unicyclic graphs with vertices and maximum degree and describe the structure of the maximal-adjacency-spectrum unicyclic graphs in the set. Besides, we also give a new upper bound on the adjacency spectral radius of unicyclic graphs, and this new upper bound is the best upper bound expressed by vertices and maximum degree from now on.

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2020/9861834.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2020/9861834.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:9861834

DOI: 10.1155/2020/9861834

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().