Maximum degree and spectral radius of graphs in terms of size

DOI10.1007/S10801-023-01289-5arXiv2208.13139MaRDI QIDQ6154430FDOQ6154430

Authors: Zhi-Wen Wang, Jiming Guo 

Publication date: 15 February 2024

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Research on the relationship of the (signless Laplacian) spectral radius of a graph with its structure properties is an important research project in spectral graph theory. Denote by $ho(G)$ and $q(G)$ the spectral radius and the signless Laplacian spectral radius of a graph $G$, respectively. Let $kge0$ be a fixed integer and $G$ be a graph of size $m$ which is large enough. We show that if $ho(G)gesqrtm-k$, then $C_{4}subseteqG$ or $K_{1,m-k}subseteqG$. Furthermore, we prove that if $q(G)gem-k$, then $K_{1,m-k}subseteqG$. Both these two results extend some known results.

Full work available at URL: https://arxiv.org/abs/2208.13139

Recommendations

• Spectral radius of graphs of given size with forbidden subgraphs
• A note on the signless Laplacian spectral ordering of graphs with given size
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• The signless Laplacian spectral radius of graphs with a prescribed number of edges
• Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\)

zbMATH Keywords

sizespectral radiusmaximum degree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12)

Cites Work

• Towards a spectral theory of graphs based on the signless Laplacian, III
• Title not available (Why is that?)
• Some Inequalities for the Largest Eigenvalue of a Graph
• Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
• The spectral radius of graphs without paths and cycles of specified length
• Which graphs are determined by their spectrum?
• Über ein Problem von K. Zarankiewicz
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Bounds on graph eigenvalues. II
• Bounds on the index of the signless Laplacian of a graph
• Title not available (Why is that?)
• Signless Laplacian spectral radii of graphs with given chromatic number
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• Maxima of the \(Q\)-index: forbidden odd cycles
• The signless Laplacian spectral radius of graphs with a prescribed number of edges
• A spectral version of Mantel's theorem
• Maxima of the \(Q\)-index: forbidden even cycles
• The signless Laplacian spectral radius of graphs with no intersecting triangles
• The maximum spectral radius of graphs without friendship subgraphs
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Eigenvalues and triangles in graphs
• Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
• The signless Laplacian spectral radius of graphs with forbidding linear forests
• Generalizing theorems of Nosal and Nikiforov: triangles and quadrilaterals

Cited In (3)

• Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\)
• Spectral radius of graphs with given size and odd girth
• Spectral radius of graphs of given size with forbidden subgraphs

This page was built for publication: Maximum degree and spectral radius of graphs in terms of size

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