On the Bruhat order of labeled graphs

Detalhes bibliográficos
Autor(a) principal: Brualdi, Richard A.
Data de Publicação: 2019
Outros Autores: Fernandes, Rosário, Furtado, Susana
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.dam.2018.10.039
Resumo: The second author’s work was partially supported by the Fundação para a Ciência e a Tecnologia through the project UID/MAT/00297/2013 . The third author’s work was partially supported by the Fundação para a Ciência e a Tecnologia through the project UID/MAT/04721/2013 .
id RCAP_5c76cd96bb0804a394705f564d2b9466
oai_identifier_str oai:run.unl.pt:10362/66747
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 On the Bruhat order of labeled graphsAdjacency matrixBruhat orderDegree sequenceLabeled graphSwitchingSymmetric matrixDiscrete Mathematics and CombinatoricsApplied MathematicsThe second author’s work was partially supported by the Fundação para a Ciência e a Tecnologia through the project UID/MAT/00297/2013 . The third author’s work was partially supported by the Fundação para a Ciência e a Tecnologia through the project UID/MAT/04721/2013 .We investigate two Bruhat (partial) orders on graphs with vertices labeled 1,2,…,n and with a specified degree sequence R, equivalently, symmetric (0,1)-matrices with zero trace and a specified row sum vector R (adjacency matrices of such graphs). One is motivated by the classical Bruhat order on permutations while the other one, more restrictive, is defined by a switch of a pair of disjoint edges. In the Bruhat order, one seeks to concentrate the edges of a graph with a given degree sequence among the vertices with smallest labels, thereby producing a minimal graph in this order. We begin with a discussion of graphs whose isomorphism class does not change under a switch. Then we are interested in when the two Bruhat orders are identical. For labeled graphs of regular degree k, we show that the two orders are identical for k≤2 but not for k=3.CMA - Centro de Matemática e AplicaçõesDM - Departamento de MatemáticaRUNBrualdi, Richard A.Fernandes, RosárioFurtado, Susana2019-04-15T22:13:06Z2019-04-152019-04-15T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article16application/pdfhttps://doi.org/10.1016/j.dam.2018.10.039eng0166-218XPURE: 12540639http://www.scopus.com/inward/record.url?scp=85057041913&partnerID=8YFLogxKhttps://doi.org/10.1016/j.dam.2018.10.039info: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:43Zoai:run.unl.pt:10362/66747Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:34:33.335406Repositó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 On the Bruhat order of labeled graphs
title On the Bruhat order of labeled graphs
spellingShingle On the Bruhat order of labeled graphs
Brualdi, Richard A.
Adjacency matrix
Bruhat order
Degree sequence
Labeled graph
Switching
Symmetric matrix
Discrete Mathematics and Combinatorics
Applied Mathematics
title_short On the Bruhat order of labeled graphs
title_full On the Bruhat order of labeled graphs
title_fullStr On the Bruhat order of labeled graphs
title_full_unstemmed On the Bruhat order of labeled graphs
title_sort On the Bruhat order of labeled graphs
author Brualdi, Richard A.
author_facet Brualdi, Richard A.
Fernandes, Rosário
Furtado, Susana
author_role author
author2 Fernandes, Rosário
Furtado, Susana
author2_role author
author
dc.contributor.none.fl_str_mv CMA - Centro de Matemática e Aplicações
DM - Departamento de Matemática
RUN
dc.contributor.author.fl_str_mv Brualdi, Richard A.
Fernandes, Rosário
Furtado, Susana
dc.subject.por.fl_str_mv Adjacency matrix
Bruhat order
Degree sequence
Labeled graph
Switching
Symmetric matrix
Discrete Mathematics and Combinatorics
Applied Mathematics
topic Adjacency matrix
Bruhat order
Degree sequence
Labeled graph
Switching
Symmetric matrix
Discrete Mathematics and Combinatorics
Applied Mathematics
description The second author’s work was partially supported by the Fundação para a Ciência e a Tecnologia through the project UID/MAT/00297/2013 . The third author’s work was partially supported by the Fundação para a Ciência e a Tecnologia through the project UID/MAT/04721/2013 .
publishDate 2019
dc.date.none.fl_str_mv 2019-04-15T22:13:06Z
2019-04-15
2019-04-15T00: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 https://doi.org/10.1016/j.dam.2018.10.039
url https://doi.org/10.1016/j.dam.2018.10.039
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 0166-218X
PURE: 12540639
http://www.scopus.com/inward/record.url?scp=85057041913&partnerID=8YFLogxK
https://doi.org/10.1016/j.dam.2018.10.039
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 16
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_ 1799137967271313408

Registros relacionados