Median eigenvalues of sparse subcubic graphs

DOI10.1016/J.DISC.2025.114611MaRDI QIDQ6933615zbMATH OpenFDO

Authors Zhengbo Chen, Zhouningxin Wang, Xiao-Dong Zhang

Publication date 4 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114611

zbMATH Keywords

HL-indexmedian eigenvaluesplanar graphssubcubic graphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Chemical graph theory (05C92) Eigenvalues, singular values, and eigenvectors (15A18) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

This paper investigates the behavior of median eigenvalues in the class of sparse subcubic graphs, i.e., graphs with maximum degree at most \(3\) and additional sparsity conditions. The focus is on bounding the HL-index (HOMO-LUMO index), which is defined for a graph \(G\) of order \(n\) with adjacency eigenvalues\N\[\N\lambda_1 \ge \lambda_2 \ge \cdots \ge \lambda_n\N\]\Nas\N\[\NR(G) := \max\{ |\lambda_h|, |\lambda_\ell| \}, \quad \text{where} \quad h = \left\lfloor \frac{n+1}{2} \right\rfloor,\quad \ell = \left\lceil \frac{n+1}{2} \right\rceil.\N\]\NThis index is relevant in chemical graph theory. Two graph parameters are used to estimate the sparsity of a graph \(G\): planarity and maximum average degree (the maximum of the average degree over all the subgraphs of \(G\)).\N\NThe main results of the paper are as follows:\N\begin{itemize}\N\item Every subcubic graph with the maximum average degree less than \(\frac{44}{17}\) has \(R(G)\) less than \(1\).\N\item Every subcubic planar graph \(G\) of girth at lest \(8\) satisfies \(R(G)\leq 1\).\N\end{itemize}\N\NThe results of the paper are motivated by a conjecture of \textit{B. Mohar} [J. Comb. Theory, Ser. B 112, 78--92 (2015; Zbl 1310.05140)], which asserts that \(R(G)\leq 1\) for planar graphs.

Cites work

• A note on median eigenvalues of subcubic graphs
• An introduction to the theory of graph spectra
• HL-index of a graph
• scientific article; zbMATH DE number 6792925 (Why is no real title available?)
• Median eigenvalues and the HOMO-LUMO index of graphs
• Median eigenvalues of bipartite graphs
• Median eigenvalues of bipartite planar graphs
• Median eigenvalues of bipartite subcubic graphs
• Spectra of graphs
• Unfriendly partitions of a graph

This page was built for publication: Median eigenvalues of sparse subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933615)