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 ...
This is a preview. Log in through your library . Abstract A simple graph is reflexive if the second largest eigenvalue of its (0, 1) adjacency matrix does not exceed 2. A graph is a cactus, or a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback