Open AccessReflexive cacti: A survey
Author(s) -
Bojana Mihailović,
Marija Rašajski,
Zoran Stanić
Publication year - 2016
Publication title -
applicable analysis and discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.69
H-Index - 26
eISSN - 2406-100X
pISSN - 1452-8630
DOI - 10.2298/aadm160929022m
Subject(s) - mathematics , bipartite graph , combinatorics , eigenvalues and eigenvectors , graph , discrete mathematics , physics , quantum mechanics
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.