Logo do repositório
 
Publicação

The trees for which maximum multiplicity implies the simplicity of other eigenvalues

dc.contributor.authorJohnson, Charles R.
dc.contributor.authorSaiago, Carlos Manuel
dc.contributor.institutionDM - Departamento de Matemática
dc.contributor.institutionCMA - Centro de Matemática e Aplicações
dc.contributor.pblElsevier Science B.V., Inc
dc.date.accessioned2019-01-23T23:19:35Z
dc.date.available2019-01-23T23:19:35Z
dc.date.issued2006-12-06
dc.description.abstractAmong 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$.en
dc.description.versionpublishersversion
dc.description.versionpublished
dc.format.extent6
dc.format.extent189296
dc.identifier.doi10.1016/j.disc.2005.04.026
dc.identifier.issn0012-365X
dc.identifier.otherPURE: 354119
dc.identifier.otherPURE UUID: 7eef470d-13b3-4d3a-81c4-60be6035cabf
dc.identifier.otherresearchoutputwizard: 11750
dc.identifier.otherWOS: 000242276000017
dc.identifier.otherScopus: 33750975068
dc.identifier.otherORCID: /0000-0001-9843-3821/work/53864377
dc.identifier.urihttp://hdl.handle.net/10362/58384
dc.language.isoeng
dc.peerreviewedyes
dc.subjectReal symmetric matrices
dc.subjectEigenvalues
dc.subjectMultiplicities
dc.subjectMaximum multiplicity
dc.subjectTrees
dc.subjectNIM trees
dc.subjectVertex degrees
dc.titleThe trees for which maximum multiplicity implies the simplicity of other eigenvaluesen
dc.typejournal article
degois.publication.firstPage3130
degois.publication.issue23(SI)
degois.publication.lastPage3135
degois.publication.titleDiscrete Mathematics
degois.publication.volume306
dspace.entity.typePublication
rcaap.rightsopenAccess

Ficheiros

Principais
A mostrar 1 - 1 de 1
A carregar...
Miniatura
Nome:
NIM_Trees_Publicado.pdf
Tamanho:
184.86 KB
Formato:
Adobe Portable Document Format