Proof of conjectures on adjacency eigenvalues of graphs
Author:
- 1 January 2013
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (1) , 19-25
Abstract
No abstract availableKeywords
Funding Information
- Sungkyunkwan University, Suwon, Republic of Korea
This publication has 17 references indexed in Scilit:
- Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphsDiscrete Mathematics, 2012
- Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphsLinear Algebra and its Applications, 2011
- Conjectures on index and algebraic connectivity of graphsLinear Algebra and its Applications, 2010
- On conjectures involving second largest signless Laplacian eigenvalue of graphsLinear Algebra and its Applications, 2010
- Nordhaus–Gaddum relations for proximity and remoteness in graphsComputers & Mathematics with Applications, 2010
- A survey of automated conjectures in spectral graph theoryLinear Algebra and its Applications, 2010
- Estimating the Szeged indexApplied Mathematics Letters, 2009
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence numberDiscrete Applied Mathematics, 2008
- Graphs with maximum connectivity indexComputational Biology and Chemistry, 2003
- Variable neighborhood search for extremal graphs: 1 The AutoGraphiX systemDiscrete Mathematics, 2000