Reflexive cacti: A survey
Open Access
- 1 January 2016
- journal article
- research article
- Published by National Library of Serbia in Applicable Analysis and Discrete Mathematics
- Vol. 10 (2) , 552-568
Abstract
A graph is called reexive if its second largest eigenvalue does not exceed 2. We survey the results on reexive cacti obtained in the last two decades. We also discuss various patterns of appearing of Smith graphs as subgraphs of reexive cacti. In the Appendix, we survey the recent results concerning reexive bipartite regular graphs.Keywords
Funding Information
- Ministry of Education, Science and Technological Development of the Republic of Serbia (174033 i 174012)
This publication has 19 references indexed in Scilit:
- On tricyclic graphs whose second largest eigenvalue does not exceed 1Linear Algebra and its Applications, 2011
- On nested split graphs whose second largest eigenvalue is less than 1Linear Algebra and its Applications, 2009
- On bicyclic reflexive graphsDiscrete Mathematics, 2008
- Decomposition of Smith graphs in maximal reflexive cactiDiscrete Mathematics, 2008
- On graphs whose second largest eigenvalue equals 1 – the star complement techniqueLinear Algebra and its Applications, 2007
- On bicyclic graphs whose second largest eigenvalue does not exceed 1Linear Algebra and its Applications, 2005
- Multicyclic treelike reflexive graphsDiscrete Mathematics, 2005
- On graphs whose second largest eigenvalue does not exceed (√5−1)2Discrete Mathematics, 1995
- Discrete hyperbolic geometryCombinatorica, 1983
- The second largest eigenvalue of a treeLinear Algebra and its Applications, 1982