A Conjecture on the Maximum Value of the Principal Eigenvalue of a Planar Graph
By B. Boots, G. Royle. 2010
54 citations recorded by the source corpus.
Subfields: Computational Mathematics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/c5442febf4bfc73c82396140acb4c54d3aef1a1b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Andries E. Brouwer
- Willem H. Haemers
- Sebastian M. Cioaba
- Dragos M. Cvetkovic
- David A. Gregory
- Slobodan K. Simic
Citations in the corpus
- Spectra of Graphs (2011, background): “Boots & Royle [41] conjecture that among not necessarily 4-connected graphs the one with largest spectral radius is the join of K2 and Pn−2 (with two vertices of degree 3), except for n = 7, 8, where the split graphs obtained from K4 by adding a vertex of valency 3 in all but one, or in all of the f”