The spectral radius of graphs without paths and cycles of specified length

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2009-03-31
dc.date.accessioned2026-07-07T12:58:28Z
dc.date.available2026-07-07T12:58:28Z
dc.descriptionLet G be a graph with n vertices and mu(G) be the largest eigenvalue of the adjacency matrix of G. We study how large mu(G) can be when G does not contain cycles and paths of specified order. In particular, we determine the maximum spectral radius of graphs without paths of given length, and give tight bounds on the spectral radius of graphs without given even cycles. We also raise a number of natural open problems.
dc.identifierhttps://arxiv.org/abs/0903.5351
dc.identifierhttp://arxiv.org/abs/0903.5351
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225255
dc.subjectCombinatorics
dc.subject05C35, 05C50
dc.titleThe spectral radius of graphs without paths and cycles of specified length
dc.typetext

Files

Collections

arXiv