On the spread of outerplanar graphs
The spread of a graph is the difference between the largest and most negative eigenvalue of its adjacency matrix. We show that for sufficiently large nn, the nn-vertex outerplanar graph with maximum spread is a vertex joined to a linear forest with ω(n)\Omega \left(n) edges. We conjecture that the e...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter Open Ltd
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |