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

Joint Authors

Song, Haizhou
Tian, Lulu

Source

Mathematical Problems in Engineering

Issue

Vol. 2020, Issue 2020 (31 Dec. 2020), pp.1-23, 23 p.

Publisher

Hindawi Publishing Corporation

Publication Date

2020-07-06

Country of Publication

Egypt

No. of Pages

23

Main Subjects

Civil Engineering

Abstract EN

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 n 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 n and maximum degree Δ from now on.

American Psychological Association (APA)

Song, Haizhou& Tian, Lulu. 2020. On the Maximal-Adjacency-Spectrum Unicyclic Graphs with Given Maximum Degree. Mathematical Problems in Engineering،Vol. 2020, no. 2020, pp.1-23.
https://search.emarefa.net/detail/BIM-1202529

Modern Language Association (MLA)

Song, Haizhou& Tian, Lulu. On the Maximal-Adjacency-Spectrum Unicyclic Graphs with Given Maximum Degree. Mathematical Problems in Engineering No. 2020 (2020), pp.1-23.
https://search.emarefa.net/detail/BIM-1202529

American Medical Association (AMA)

Song, Haizhou& Tian, Lulu. On the Maximal-Adjacency-Spectrum Unicyclic Graphs with Given Maximum Degree. Mathematical Problems in Engineering. 2020. Vol. 2020, no. 2020, pp.1-23.
https://search.emarefa.net/detail/BIM-1202529

Data Type

Journal Articles

Language

English

Notes

Includes bibliographical references

Record ID

BIM-1202529