On the second minimizing graph in the set of complements of trees
Let be a graph of order and be its adjacency matrix such that if is adjacent to and otherwise, where . In a certain family of graphs, a graph is called minimizing (or second minimizing) if the least eigenvalue of its adjacency matrix attains the minimum (or second minimum). In this paper, we charact...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.11.005 |