On the second minimizing graph in the set of complements of trees
Let G be a graph of order n and A(G)=[ai,j]be its adjacency matrix such that ai,j=1 if viis adjacent to vjand ai,j=0 otherwise, where 1≤i,j≤n. 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 se...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860016301554 |