Spectral characterization of families of split graphs

Detalhes bibliográficos
Autor(a) principal: Andelic, M.
Data de Publicação: 2015
Outros Autores: Cardoso, Domingos M.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10773/13461
Resumo: An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.
id RCAP_750ca2786e034053d763bc6c65cf23fe
oai_identifier_str oai:ria.ua.pt:10773/13461
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Spectral characterization of families of split graphsSplit graphLargest eigenvaluePrincipal eigenvectorProgramming involving graphsAn upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.Springer20152015-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/pdfhttp://hdl.handle.net/10773/13461eng0911-011910.1007/s00373-013-1387-8Andelic, M.Cardoso, Domingos M.info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:24:28Zoai:ria.ua.pt:10773/13461Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:49:18.065401Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Spectral characterization of families of split graphs
title Spectral characterization of families of split graphs
spellingShingle Spectral characterization of families of split graphs
Andelic, M.
Split graph
Largest eigenvalue
Principal eigenvector
Programming involving graphs
title_short Spectral characterization of families of split graphs
title_full Spectral characterization of families of split graphs
title_fullStr Spectral characterization of families of split graphs
title_full_unstemmed Spectral characterization of families of split graphs
title_sort Spectral characterization of families of split graphs
author Andelic, M.
author_facet Andelic, M.
Cardoso, Domingos M.
author_role author
author2 Cardoso, Domingos M.
author2_role author
dc.contributor.author.fl_str_mv Andelic, M.
Cardoso, Domingos M.
dc.subject.por.fl_str_mv Split graph
Largest eigenvalue
Principal eigenvector
Programming involving graphs
topic Split graph
Largest eigenvalue
Principal eigenvector
Programming involving graphs
description An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k-regular subgraph is introduced and applied to the determination of an upper bound on the order of such induced subgraphs. Furthermore, for some connected graphs we establish a lower bound for the sum of squares of the entries of the principal eigenvector corresponding to the vertices of an independent set. Moreover, a spectral characterization of families of split graphs, involving its index and the entries of the principal eigenvector corresponding to the vertices of the maximum independent set is given. In particular, the complete split graph case is highlighted.
publishDate 2015
dc.date.none.fl_str_mv 2015
2015-01-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/13461
url http://hdl.handle.net/10773/13461
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0911-0119
10.1007/s00373-013-1387-8
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137543696941056

Registros relacionados