An upper bound on the largest signless Laplacian of an odd unicyclic graph

Autor:	Oscar Rojo, Pamela Pizarro, Macarena Collao
Jazyk:	angličtina
Rok vydání:	2012
Předmět:	Discrete mathematics spectral radius Algebraic connectivity Degree (graph theory) adjacency matrix General Mathematics signless Laplacian matrix Mathematics::Spectral Theory Signless laplacian Upper and lower bounds generalized Bethe tree Graph Combinatorics Bound graph Laplacian matrix Mathematics
Zdroj:	Proyecciones (Antofagasta) v.31 n.1 2012 SciELO Chile CONICYT Chile instacron:CONICYT Proyecciones (Antofagasta), Volume: 31, Issue: 1, Pages: 39-49, Published: MAR 2012
Popis:	We derive an upper bound on the largest signless Laplacian eigen­value of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained re­moving the edges of the unique cycle in the graph.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8083ee4e9b40cc242a14ee021a173bd http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000100005 Zobrazit plný text záznamu