On bicyclic reflexive graphs

A simple graph is said to be reflexive if the second largest eigenvalue of a (0,1)(0,1)-adjacency matrix does not exceed 2. We use graph modifications involving Smith trees to construct four classes of maximal bicyclic reflexive graphs.