On unicyclic reflexive graphs
On unicyclic reflexive graphs
A simple graph is said to be reflexive if the second largest eigenvalue of its (0, 1)-adjacency matrix does not exceed 2. Based on some recent results on reflexive graphs with more cycles and some new observations, we construct in this paper several classes of maximal unicyclic reflexive graphs.