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.
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: