The A ? -Spectral Radii of Graphs with Given Connectivity

Chunxiang Wang and Shaohui Wang
Additional contact information
Chunxiang Wang: School of Mathematics and Statistics and Hubei key Laboratory Mathematics Sciences, Central China Normal University, Wuhan 430079, China
Shaohui Wang: Department of Mathematics, Savannah State University, Savannah, GA 31419, USA

Mathematics, 2019, vol. 7, issue 1, 1-6

Abstract: The A α -matrix is A α ( G ) = α D ( G ) + ( 1 − α ) A ( G ) with α ∈ [ 0 , 1 ] , given by Nikiforov in 2017, where A ( G ) is adjacent matrix, and D ( G ) is its diagonal matrix of the degrees of a graph G . The maximal eigenvalue of A α ( G ) is said to be the A α -spectral radius of G . In this work, we determine the graphs with largest A α ( G ) -spectral radius with fixed vertex or edge connectivity. In addition, related extremal graphs are characterized and equations satisfying A α ( G ) -spectral radius are proposed.

Keywords: adjacent matrix; signless Laplacian; spectral radius; connectivity (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/1/44/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/1/44/ (text/html)

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:gam:jmathe:v:7:y:2019:i:1:p:44-:d:194975

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().