The spectral radius of graphs without paths and cycles of specified length - Mathematics > CombinatoricsReportar como inadecuado




The spectral radius of graphs without paths and cycles of specified length - Mathematics > Combinatorics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Let G be a graph with n vertices and muG be the largest eigenvalue of theadjacency matrix of G. We study how large muG can be when G does not containcycles and paths of specified order. In particular, we determine the maximumspectral radius of graphs without paths of given length, and give tight boundson the spectral radius of graphs without given even cycles. We also raise anumber of natural open problems.



Autor: Vladimir Nikiforov

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados