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

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-12-08
dc.date.accessioned2026-07-07T08:48:08Z
dc.date.available2026-07-07T08:48:08Z
dc.descriptionLet 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.
dc.identifierhttps://arxiv.org/abs/0712.1301
dc.identifierhttp://arxiv.org/abs/0712.1301
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143843
dc.subjectCombinatorics
dc.subject05C50, 05C35
dc.titleThe maximum spectral radius of C_4-free graphs of given order and size
dc.typetext

Files

Collections

arXiv