The maximum spectral radius of C₄-free graphs of given order and size

2007/12/08 by Vladimir Nikiforov, Nikiforov, Vladimir · 8 citations
Mathematics · Computer Science · #Graph theory and applications #Limits and Structures in Graph Theory #Graph Labeling and Dimension Problems

paper · pdf · doi:10.48550/arxiv.0712.1301

Abstract

Let G be a graph of n vertices and m edges, and let G has no cycles of length 4. We give upper bounds on the adjacency spectral radius of G in terms of n and m.

Cited by

• A survey of edge-spectral-Turán type problems in spectral graph theory: Results, conjectures and open problems
• Edge-spectral Turán theorems for color-critical graphs with applications
• Spectral extrema of graphs of given even size forbidding H(4,3)
• The spectral radius of graphs without paths and cycles of specified length
• An edge-spectral Erdős-Stone-Simonovits theorem and its stability
• More on Nosal's spectral theorem: Books and 4-cycles
• Subdivision-free graphs with the maximum spectral radius
• Spectral extremal problem for the odd prism

Related

• The spectral radius of graphs without paths and cycles of specified length
• On the signless Laplacian spectral radius of C₄-free k-cyclic graphs
• On the maximum spectral radius of connected graphs with a prescribed order and size
• The spectral even cycle problem
• Spectral Radius and Degree Sequence of a Graph