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

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 in corpus (4)

• The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
• A spectral extremal problem on non-bipartite triangle-free graphs
• Spectral conditions for the existence of specified paths and cycles in graphs
• The spectral radius of graphs without paths and cycles of specified length