| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650768 | Discrete Mathematics | 2008 | 11 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zoran Radosavljević, Bojana Mihailović, Marija Rašajski,