On bicyclic reflexive graphs

Zoran Radosavljević, Bojana Mihailović, Marija Rašajski
2008 Discrete Mathematics  
A simple graph is said to be reflexive if the second largest eigenvalue of a (0, 1)-adjacency matrix does not exceed 2. We use graph modifications involving Smith trees to construct four classes of maximal bicyclic reflexive graphs.
doi:10.1016/j.disc.2007.07.057 fatcat:zm6xbotqt5f3dedr44d2rnopfm