The maximum spectral radius of C₄-free graphs of given order and size
classification
🧮 math.CO
keywords
radiusspectraladjacencyboundscyclesedgesfreegive
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.