Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices (Q3090721): Difference between revisions
From MaRDI portal
Latest revision as of 10:00, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices |
scientific article |
Statements
Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices (English)
0 references
1 September 2011
0 references
adjacency matrix
0 references
signless Laplacian
0 references
diameter
0 references
cut vertices
0 references
spectral radius
0 references