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

We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.

Guardado en:

Detalles Bibliográficos
Autores principales:	Collao,Macarena, Pizarro,Pamela, Rojo,Oscar
Lenguaje:	English
Publicado:	Universidad Católica del Norte, Departamento de Matemáticas 2012
Materias:	Laplacian matrix signless Laplacian matrix adjacency matrix spectral radius generalized Bethe tree
Acceso en línea:	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000100005
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:scielo:S0716-09172012000100005
record_format	dspace
spelling	oai:scielo:S0716-091720120001000052012-04-13An upper bound on the largest signless Laplacian of an odd unicyclic graphCollao,MacarenaPizarro,PamelaRojo,Oscar Laplacian matrix signless Laplacian matrix adjacency matrix spectral radius generalized Bethe tree We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.info:eu-repo/semantics/openAccessUniversidad Católica del Norte, Departamento de MatemáticasProyecciones (Antofagasta) v.31 n.1 20122012-03-01text/htmlhttp://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000100005en10.4067/S0716-09172012000100005
institution	Scielo Chile
collection	Scielo Chile
language	English
topic	Laplacian matrix signless Laplacian matrix adjacency matrix spectral radius generalized Bethe tree
spellingShingle	Laplacian matrix signless Laplacian matrix adjacency matrix spectral radius generalized Bethe tree Collao,Macarena Pizarro,Pamela Rojo,Oscar An upper bound on the largest signless Laplacian of an odd unicyclic graph
description	We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.
author	Collao,Macarena Pizarro,Pamela Rojo,Oscar
author_facet	Collao,Macarena Pizarro,Pamela Rojo,Oscar
author_sort	Collao,Macarena
title	An upper bound on the largest signless Laplacian of an odd unicyclic graph
title_short	An upper bound on the largest signless Laplacian of an odd unicyclic graph
title_full	An upper bound on the largest signless Laplacian of an odd unicyclic graph
title_fullStr	An upper bound on the largest signless Laplacian of an odd unicyclic graph
title_full_unstemmed	An upper bound on the largest signless Laplacian of an odd unicyclic graph
title_sort	upper bound on the largest signless laplacian of an odd unicyclic graph
publisher	Universidad Católica del Norte, Departamento de Matemáticas
publishDate	2012
url	http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172012000100005
work_keys_str_mv	AT collaomacarena anupperboundonthelargestsignlesslaplacianofanoddunicyclicgraph AT pizarropamela anupperboundonthelargestsignlesslaplacianofanoddunicyclicgraph AT rojooscar anupperboundonthelargestsignlesslaplacianofanoddunicyclicgraph AT collaomacarena upperboundonthelargestsignlesslaplacianofanoddunicyclicgraph AT pizarropamela upperboundonthelargestsignlesslaplacianofanoddunicyclicgraph AT rojooscar upperboundonthelargestsignlesslaplacianofanoddunicyclicgraph
_version_	1718439781669535744

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

Ejemplares similares