Minimum rank and path cover number for generalized and double generalized cycle star graphs

Detalhes bibliográficos
Autor(a) principal: Perdigão, Cecília
Data de Publicação: 2018
Outros Autores: Fonseca, Amélia
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: https://doi.org/10.1016/j.laa.2018.05.016
Resumo: This work was partially supported by the "Fundacao para a Ciencia e Tecnologia" (Portuguese Foundation for Science and Technology) through the project UID/MAT/00297/2013 (Centro de Matematica e Aplicacoes). This work was partially supported by the "Fundacao para a Ciencia e Tecnologia" (Portuguese Foundation for Science and Technology) through the project UID/MAT/04721/2013 (Centro de Analise Funcional e Estruturas Lineares).
id RCAP_5216cf85f76f253589e62a6378dc0847
oai_identifier_str oai:run.unl.pt:10362/65739
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 Minimum rank and path cover number for generalized and double generalized cycle star graphsCycleDouble generalized cycle starGeneralized cycle starGeneralized starGraphsMaximum multiplicityMinimum rankPath cover numberSymmetric matricesAlgebra and Number TheoryNumerical AnalysisGeometry and TopologyDiscrete Mathematics and CombinatoricsThis work was partially supported by the "Fundacao para a Ciencia e Tecnologia" (Portuguese Foundation for Science and Technology) through the project UID/MAT/00297/2013 (Centro de Matematica e Aplicacoes). This work was partially supported by the "Fundacao para a Ciencia e Tecnologia" (Portuguese Foundation for Science and Technology) through the project UID/MAT/04721/2013 (Centro de Analise Funcional e Estruturas Lineares).For a given connected (undirected) graph G=(V,E), with V={1,…,n}, the minimum rank of G is defined to be the smallest possible rank over all symmetric matrices A=[aij] such that for i≠j, aij=0 if, and only if, {i,j}∉E. The path cover number of G is the minimum number of vertex-disjoint paths occurring as induced subgraphs of G that cover all the vertices of G. When G is a tree, the values of the minimum rank and of the path cover number are known as well the relationship between them. We study these values and their relationship for all graphs that have at most two vertices of degree greater than two: generalized cycle stars and double generalized cycle stars.DM - Departamento de MatemáticaCMA - Centro de Matemática e AplicaçõesRUNPerdigão, CecíliaFonseca, Amélia2019-04-05T22:23:25Z2018-10-012018-10-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article24application/pdfhttps://doi.org/10.1016/j.laa.2018.05.016eng0024-3795PURE: 12558914http://www.scopus.com/inward/record.url?scp=85047871391&partnerID=8YFLogxKhttps://doi.org/10.1016/j.laa.2018.05.016info: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-03-11T04:31:21Zoai:run.unl.pt:10362/65739Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:34:24.741071Repositó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 Minimum rank and path cover number for generalized and double generalized cycle star graphs
title Minimum rank and path cover number for generalized and double generalized cycle star graphs
spellingShingle Minimum rank and path cover number for generalized and double generalized cycle star graphs
Perdigão, Cecília
Cycle
Double generalized cycle star
Generalized cycle star
Generalized star
Graphs
Maximum multiplicity
Minimum rank
Path cover number
Symmetric matrices
Algebra and Number Theory
Numerical Analysis
Geometry and Topology
Discrete Mathematics and Combinatorics
title_short Minimum rank and path cover number for generalized and double generalized cycle star graphs
title_full Minimum rank and path cover number for generalized and double generalized cycle star graphs
title_fullStr Minimum rank and path cover number for generalized and double generalized cycle star graphs
title_full_unstemmed Minimum rank and path cover number for generalized and double generalized cycle star graphs
title_sort Minimum rank and path cover number for generalized and double generalized cycle star graphs
author Perdigão, Cecília
author_facet Perdigão, Cecília
Fonseca, Amélia
author_role author
author2 Fonseca, Amélia
author2_role author
dc.contributor.none.fl_str_mv DM - Departamento de Matemática
CMA - Centro de Matemática e Aplicações
RUN
dc.contributor.author.fl_str_mv Perdigão, Cecília
Fonseca, Amélia
dc.subject.por.fl_str_mv Cycle
Double generalized cycle star
Generalized cycle star
Generalized star
Graphs
Maximum multiplicity
Minimum rank
Path cover number
Symmetric matrices
Algebra and Number Theory
Numerical Analysis
Geometry and Topology
Discrete Mathematics and Combinatorics
topic Cycle
Double generalized cycle star
Generalized cycle star
Generalized star
Graphs
Maximum multiplicity
Minimum rank
Path cover number
Symmetric matrices
Algebra and Number Theory
Numerical Analysis
Geometry and Topology
Discrete Mathematics and Combinatorics
description This work was partially supported by the "Fundacao para a Ciencia e Tecnologia" (Portuguese Foundation for Science and Technology) through the project UID/MAT/00297/2013 (Centro de Matematica e Aplicacoes). This work was partially supported by the "Fundacao para a Ciencia e Tecnologia" (Portuguese Foundation for Science and Technology) through the project UID/MAT/04721/2013 (Centro de Analise Funcional e Estruturas Lineares).
publishDate 2018
dc.date.none.fl_str_mv 2018-10-01
2018-10-01T00:00:00Z
2019-04-05T22:23:25Z
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 https://doi.org/10.1016/j.laa.2018.05.016
url https://doi.org/10.1016/j.laa.2018.05.016
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0024-3795
PURE: 12558914
http://www.scopus.com/inward/record.url?scp=85047871391&partnerID=8YFLogxK
https://doi.org/10.1016/j.laa.2018.05.016
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 24
application/pdf
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_ 1799137965427916800

Registros relacionados