This is a preview. Log in through your library . Abstract A simple graph is reflexive if its second largest eigenvalue λ₂ is less than or equal to 2. A graph is a cactus, or a treelike graph, if any ...