New bounds for the signless Laplacian spread
Main Author: | |
---|---|
Publication Date: | 2019 |
Other Authors: | , , |
Format: | Article |
Language: | eng |
Source: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
Download full: | http://hdl.handle.net/10773/25061 |
Summary: | Let $G$ be an undirected simple graph. The signless Laplacian spread of $G$ is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian spread. Several of these bounds depend on invariant parameters of the graph. We also use a minmax principle to find several lower bounds for this spectral invariant. |
id |
RCAP_b22a8052a2c839bfe1011547b00e52a6 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/25061 |
network_acronym_str |
RCAP |
network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository_id_str |
https://opendoar.ac.uk/repository/7160 |
spelling |
New bounds for the signless Laplacian spreadMatrix spreadSignless Laplacian spreadSignless Laplacian matrixLet $G$ be an undirected simple graph. The signless Laplacian spread of $G$ is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian spread. Several of these bounds depend on invariant parameters of the graph. We also use a minmax principle to find several lower bounds for this spectral invariant.Elsevier2019-042019-04-01T00:00:00Z2020-05-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/25061eng0024-379510.1016/j.laa.2018.12.019Andrade, EnideDahl, GeirLeal, LauraRobbiano, Maríainfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-06T04:18:37Zoai:ria.ua.pt:10773/25061Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T14:04:05.974617Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
dc.title.none.fl_str_mv |
New bounds for the signless Laplacian spread |
title |
New bounds for the signless Laplacian spread |
spellingShingle |
New bounds for the signless Laplacian spread Andrade, Enide Matrix spread Signless Laplacian spread Signless Laplacian matrix |
title_short |
New bounds for the signless Laplacian spread |
title_full |
New bounds for the signless Laplacian spread |
title_fullStr |
New bounds for the signless Laplacian spread |
title_full_unstemmed |
New bounds for the signless Laplacian spread |
title_sort |
New bounds for the signless Laplacian spread |
author |
Andrade, Enide |
author_facet |
Andrade, Enide Dahl, Geir Leal, Laura Robbiano, María |
author_role |
author |
author2 |
Dahl, Geir Leal, Laura Robbiano, María |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Andrade, Enide Dahl, Geir Leal, Laura Robbiano, María |
dc.subject.por.fl_str_mv |
Matrix spread Signless Laplacian spread Signless Laplacian matrix |
topic |
Matrix spread Signless Laplacian spread Signless Laplacian matrix |
description |
Let $G$ be an undirected simple graph. The signless Laplacian spread of $G$ is defined as the maximum distance of pairs of its signless Laplacian eigenvalues. This paper establishes some new bounds, both lower and upper, for the signless Laplacian spread. Several of these bounds depend on invariant parameters of the graph. We also use a minmax principle to find several lower bounds for this spectral invariant. |
publishDate |
2019 |
dc.date.none.fl_str_mv |
2019-04 2019-04-01T00:00:00Z 2020-05-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/25061 |
url |
http://hdl.handle.net/10773/25061 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0024-3795 10.1016/j.laa.2018.12.019 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
repository.mail.fl_str_mv |
info@rcaap.pt |
_version_ |
1833594258850840576 |