Spectral radius and Hamiltonicity of graphs

Simple item page
dc.creatorFiedler, Miroslav
dc.creatorNikiforov, Vladimir
dc.date2009-03-31
dc.date.accessioned2026-07-07T12:58:29Z
dc.date.available2026-07-07T12:58:29Z
dc.descriptionLet G be a graph of given order and mu(G) be the largest eigenvalue of its adjacency matrix. We give conditions on mu(G) that imply Hamiltonicity of G and of its complement.
dc.identifierhttps://arxiv.org/abs/0903.5353
dc.identifierhttp://arxiv.org/abs/0903.5353
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/225257
dc.subjectCombinatorics
dc.subject05C35, 05C50
dc.titleSpectral radius and Hamiltonicity of graphs
dc.typetext

Files

Collections

arXiv