Partial characterization of graphs having a single large Laplacian eigenvalue

dc.contributor.author	Allem, Luiz Emílio	pt_BR
dc.contributor.author	Cafure, Antonio Artemio	pt_BR
dc.contributor.author	Dratman, Ezequiel	pt_BR
dc.contributor.author	Grippo, Luciano Norberto	pt_BR
dc.contributor.author	Safe, Martín Darío	pt_BR
dc.contributor.author	Trevisan, Vilmar	pt_BR
dc.date.accessioned	2019-02-20T02:36:52Z	pt_BR
dc.date.issued	2018	pt_BR
dc.identifier.issn	1077-8926	pt_BR
dc.identifier.uri	http://hdl.handle.net/10183/188908	pt_BR
dc.description.abstract	The parameter (G) of a graph G stands for the number of Laplacian eigenvalues greater than or equal to the average degree of G. In this work, we address the problem of characterizing those graphs G having (G) = 1. Our conjecture is that these graphs are stars plus a (possible empty) set of isolated vertices. We establish a link between (G) and the number of anticomponents of G. As a by-product, we present some results which support the conjecture, by restricting our analysis to cographs, forests, and split graphs.	en
dc.format.mimetype	application/pdf	pt_BR
dc.language.iso	eng	pt_BR
dc.relation.ispartof	The Electronic Journal of Combinatorics. United States. Vol. 25, n. 4, 2018, p. 1-10, P4.65	pt_BR
dc.rights	Open Access	en
dc.subject	Graphs	en
dc.subject	Grafos	pt_BR
dc.subject	Laplacian matrix	en
dc.subject	Matriz laplaciana	pt_BR
dc.subject	Laplacian eigenvalues	en
dc.title	Partial characterization of graphs having a single large Laplacian eigenvalue	pt_BR
dc.type	Artigo de periódico	pt_BR
dc.identifier.nrb	001088424	pt_BR
dc.type.origin	Estrangeiro	pt_BR

Este ítem está licenciado en la Creative Commons License