Open AccessA result related to the largest eigenvalue of a tree
Author(s) -
G.R. Vijayakumar
Publication year - 2008
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1427
Subject(s) - mathematics , combinatorics , tree (set theory) , eigenvalues and eigenvectors , quantum mechanics , physics
In this note we prove that {0, 1, √ 2, √ 3, 2} is the set of all real numbers ` such that the following holds: every tree having an eigenvalue which is larger than ` has a subtree whose largest eigenvalue is `.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom