English

A note on median eigenvalues of subcubic graphs

Combinatorics 2023-11-06 v1

Abstract

Let GG be an simple graph of order nn whose adjacency eigenvalues are λ1λn\lambda_1\ge\dots\ge\lambda_n. The HL--index of GG is defined to be R(G)=max{λh,λl}R(G)= \max\{|\lambda_{h}|, |\lambda_{l}|\} with h=n+12h=\left\lfloor\frac{n+1}{2}\right\rfloor and l=n+12. l=\left\lceil\frac{n+1}{2}\right\rceil. Mohar conjectured that R(G)1R(G)\le 1 for every planar subcubic graph GG. In this note, we prove that Mohar's Conjecture holds for every K4K_4-minor-free subcubic graph. Note that a K4K_4-minor-free graph is also called a series--parallel graph. In addition, R(G)1R(G)\le 1 for every subcubic graph GG which contains a subgraph K2,3K_{2,3}.

Keywords

Cite

@article{arxiv.2311.01884,
  title  = {A note on median eigenvalues of subcubic graphs},
  author = {Yuzhenni Wang and Xiao-Dong Zhang},
  journal= {arXiv preprint arXiv:2311.01884},
  year   = {2023}
}

Comments

6 pages, 1figure

R2 v1 2026-06-28T13:10:37.679Z