On bicyclic reflexive graphs (Q2470436): Difference between revisions

Let \(\lambda_2\) be the second largest eigenvalue of the adjacency matrix of a graph. Graphs having \(\lambda_2\leq 2\) are called reflexive graphs. Since this property is hereditary, these graphs may be represented through sets of maximal graphs. In this paper, authors continue their previous line of study and construct maximal bicyclic reflexive graphs (called pouring) of Smith trees into graphs and by replacing free cycles with Smith trees. In addition, they provide characterizations of some rather specific classes of reflexive graphs.