Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
By Yi-Zheng Fan, Bit-Shun Tam. 2008
69 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/e19a14ced749ee2de0e6ec38bc8847876bdc4e99
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
In Discrete Mathematics and Combinatorics
In Geometry and Topology
Citations in the corpus
- Unoriented Laplacian maximizing graphs are degree maximal (2008, background): “Previous results on unoriented Laplacian maximizing graphs as obtained in [14,15] are recovered readily.”
- ON THREE CONJECTURES INVOLVING THE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS (2009, unknown): “In [10], Fan et al.”