https://orcid.org/0000-0002-7053-8530
References
- Jacobs DP, Trevisan V. Locating the eigenvalues of trees. Linear Algebra Appl. 2011;434:81–88. doi: 10.1016/j.laa.2010.08.006
- Hindenburg CF. Infinitinomii dignitatum exponentis indeterminati. Göttingen: Joann. Christ. Dieterich; 1779. p. 73–91
- Knuth DE. Generating all partitions, The art of computer programming, Pre-fascicle 3B, A draft of sections 7.2.1.4-5: Generating all partitions. Available from: http://www-cs-faculty.stanford.edu/knuth/fasc3b.ps.gz
- Smith JH. Some properties of the spectrum of a graph. In: Guy R, Hanani H, Sauer N, Schönheim J, editors. Combinatorial structures and their applications. New York: Gordon & Breach; 1970. p. 403–406.
- Li Q, Feng K. On the largest eigenvalue of a graph. Acta Math Appl Sinica. 1979;2:167–175.
- Collatz L, Sinogowitz U. Spektren endlicher Grafen. Abh Math Semin Univ Hamb. 1957;21:63–77. doi: 10.1007/BF02941924
- Cvetković DM, Doob M, Sachs H. Spectra of graphs–theory and applications. New York: Academic Press; 1980.
- Lepović M, Gutman I. Some spectral properties of starlike trees. Bull Cl Sci Math Nat Sci Math. 2001;26:107–113.