An upper bound on the Laplacian spectral radius of the signed graphs | Zendy

Honghai Li | Zendy; Jiong Sheng Li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An upper bound on the Laplacian spectral radius of the signed graphs

Author(s) -

Honghai Li,

Jiong Sheng Li

Publication year - 2008

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1410

Subject(s) - mathematics , spectral radius , combinatorics , upper and lower bounds , laplace operator , radius , discrete mathematics , eigenvalues and eigenvectors , mathematical analysis , physics , computer science , computer security , quantum mechanics

In this paper, we established a connection between the Laplacian eigenvalues of a signed graph and those of a mixed graph, gave a new upper bound for the largest Laplacian eigenvalue of a signed graph and characterized the extremal graph whose largest Laplacian eigenvalue achieved the upper bound. In addition, an example showed that the upper bound is the best in known upper bounds for some cases.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research