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.
The maximum spectral radius of $θ_{1,3,3}$-free graphs with given size
The maximum spectral radius of graphs of given size with forbidden subgraph
The maximum spectral radius of irregular bipartite graphs
![QR code for arXiv:0712.1301 [math.CO]](http://oss.arxitics.com/images/favicon.svg)