The maximum spectral radius of graphs of even size forbidding \H(3, 3), H(4, 3)\

DOI10.1007/S40314-025-03257-0MaRDI QIDQ6947870zbMATH OpenFDO

Authors Shariefuddin Pirzada, Amir Rehman

Publication date 5 August 2025

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40314-025-03257-0

zbMATH Keywords

\(H\)-free graphadjacency matrixforbidden subgraphspectral radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size
• A spectral condition for odd cycles in graphs
• Eigenvalues and triangles in graphs
• scientific article; zbMATH DE number 3372065 (Why is no real title available?)
• Maximum \(A_\alpha\)-spectral radius of \(\{C(3, 3), C(4, 3)\}\)-free graphs
• On maximum spectral radius of \(\{H(3,3),H(4,3)\}\)-free graphs
• On the spectral radius of graphs without a star forest
• Some new results in extremal graph theory
• Spectral extrema of graphs with fixed size: cycles and complete bipartite graphs
• Spectral extremal graphs for the bowtie
• The maximum spectral radius of C₄-free graphs of given order and size
• The maximum spectral radius of graphs of given size with forbidden subgraph
• The spectral radius of graphs with no odd wheels
• The spectral radius of graphs without long cycles
• The spectral radius of graphs without paths and cycles of specified length
• The spectral Turán problem about graphs of given size with forbidden subgraphs

Cited in

(1)

• Spectral extremal problem for intersecting one even and one odd cycle

This page was built for publication: The maximum spectral radius of graphs of even size forbidding \(\{H(3, 3), H(4, 3)\}\)

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