|dc.description.abstract||Let T be a tree of order n>6 with μ as a positive eigenvalue of multiplicity k. Star complements are used to show that (i) if k>n/3 then μ=1, (ii) if μ=1 then, without restriction on k, T has k+1 pendant edges that form an induced matching. The results are used to identify the trees with a non-zero eigenvalue of maximum possible multiplicity.||en_UK|
|dc.relation||Rowlinson P (2010) On multiple eigenvalues of trees, Linear Algebra and Its Applications, 432 (11), pp. 3007-3011.||-|
|dc.rights||Published in Linear Algebra and its Applications by Elsevier; Elsevier believes that individual authors should be able to distribute their accepted author manuscripts for their personal voluntary needs and interests, e.g. posting to their websites or their institution’s repository, e-mailing to colleagues. The Elsevier Policy is as follows: Authors retain the right to use the accepted author manuscript for personal use, internal institutional use and for permitted scholarly posting provided that these are not for purposes of commercial use or systematic distribution. An "accepted author manuscript" is the author’s version of the manuscript of an article that has been accepted for publication and which may include any author-incorporated changes suggested through the processes of submission processing, peer review, and editor-author communications.||-|
|dc.title||On multiple eigenvalues of trees||en_UK|
|dc.citation.jtitle||Linear Algebra and Its Applications||-|
|dc.type.status||Post-print (author final draft post-refereeing)||-|
|dc.contributor.affiliation||Mathematics - CSM Dept||-|
|Appears in Collections:||Computing Science and Mathematics Journal Articles|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.