The trees for which maximum multiplicity implies the simplicity of other eigenvalues
| Autor(a) principal: | |
|---|---|
| Data de Publicação: | 2006 |
| Outros Autores: | |
| 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/10362/58384 |
Resumo: | Among those real symmetric matrices whose graph is a given tree $T$, the maximum multiplicity is known to be the path cover number of $T$. An explicit characterization is given for those trees for which whenever the maximum multiplicity is attained, all other multiplicities are $1$. |
| id |
RCAP_3c2926309368900dcfa6aa1dc65b8d7d |
|---|---|
| oai_identifier_str |
oai:run.unl.pt:10362/58384 |
| 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 |
The trees for which maximum multiplicity implies the simplicity of other eigenvaluesReal symmetric matricesEigenvaluesMultiplicitiesMaximum multiplicityTreesNIM treesVertex degreesAmong those real symmetric matrices whose graph is a given tree $T$, the maximum multiplicity is known to be the path cover number of $T$. An explicit characterization is given for those trees for which whenever the maximum multiplicity is attained, all other multiplicities are $1$.DM - Departamento de MatemáticaCMA - Centro de Matemática e AplicaçõesRUNJohnson, Charles R.Saiago, Carlos Manuel2019-01-23T23:19:35Z2006-12-062006-12-06T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article6application/pdfhttp://hdl.handle.net/10362/58384eng0012-365XPURE: 354119https://doi.org/10.1016/j.disc.2005.04.026info: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:28:12Zoai:run.unl.pt:10362/58384Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:33:15.880719Repositó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 |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| title |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| spellingShingle |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues Johnson, Charles R. Real symmetric matrices Eigenvalues Multiplicities Maximum multiplicity Trees NIM trees Vertex degrees |
| title_short |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| title_full |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| title_fullStr |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| title_full_unstemmed |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| title_sort |
The trees for which maximum multiplicity implies the simplicity of other eigenvalues |
| author |
Johnson, Charles R. |
| author_facet |
Johnson, Charles R. Saiago, Carlos Manuel |
| author_role |
author |
| author2 |
Saiago, Carlos Manuel |
| 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 |
Johnson, Charles R. Saiago, Carlos Manuel |
| dc.subject.por.fl_str_mv |
Real symmetric matrices Eigenvalues Multiplicities Maximum multiplicity Trees NIM trees Vertex degrees |
| topic |
Real symmetric matrices Eigenvalues Multiplicities Maximum multiplicity Trees NIM trees Vertex degrees |
| description |
Among those real symmetric matrices whose graph is a given tree $T$, the maximum multiplicity is known to be the path cover number of $T$. An explicit characterization is given for those trees for which whenever the maximum multiplicity is attained, all other multiplicities are $1$. |
| publishDate |
2006 |
| dc.date.none.fl_str_mv |
2006-12-06 2006-12-06T00:00:00Z 2019-01-23T23:19:35Z |
| 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/10362/58384 |
| url |
http://hdl.handle.net/10362/58384 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
0012-365X PURE: 354119 https://doi.org/10.1016/j.disc.2005.04.026 |
| dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
6 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_ |
1799137954256388096 |