Maximizing the spectral radius of \(k\)-connected graphs with given diameter (Q896859)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximizing the spectral radius of k-connected graphs with given diameter |
scientific article; zbMATH DE number 6521192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the spectral radius of \(k\)-connected graphs with given diameter |
scientific article; zbMATH DE number 6521192 |
Statements
Maximizing the spectral radius of \(k\)-connected graphs with given diameter (English)
0 references
14 December 2015
0 references
spectral radius
0 references
\(k\)-connected graphs
0 references
adjacency matrix
0 references
diameter
0 references
0.9669332
0 references
0.96652544
0 references
0.96520793
0 references
0.95685124
0 references
0.9516859
0 references
0.94580716
0 references
0.9403639
0 references
0.9365699
0 references
0.93479806
0 references
0.9324918
0 references
