On the spread of outerplanar graphs
Combinatorics
2021-11-24 v1
Abstract
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 , the -vertex outerplanar graph with maximum spread is a vertex joined to a linear forest with edges. We conjecture that the extremal graph is a vertex joined to a path on vertices.
Cite
@article{arxiv.2111.11820,
title = {On the spread of outerplanar graphs},
author = {Daniel Gotshall and Megan O'Brien and Michael Tait},
journal= {arXiv preprint arXiv:2111.11820},
year = {2021}
}