Spectral characterization of trees.

(1989) Spectral characterization of trees. Masters thesis, King Fahd University of Petroleum and Minerals.


Download (1MB) | Preview

Arabic Abstract


English Abstract

The eigenvalues of a graph are the eigenvalues of its adjacency matrix. Let ?1and ?2 denote the largest and the second largest eigenvalue, respectively. The family of trees having only three end vertices and satisfying a certain equality involving ?1and ?2 is characterized. Also, bounds on ?2 for the above family of trees are investigated.

Item Type: Thesis (Masters)
Subjects: Math
Department: College of Computing and Mathematics > Mathematics
Committee Advisor: Alameddine, Ahmad F.
Committee Members: Al-Bar, Mohammad A. and Abu-Sbeih, Mohammad Z.
Depositing User: Mr. Admin Admin
Date Deposited: 22 Jun 2008 13:51
Last Modified: 01 Nov 2019 13:52
URI: https://eprints.kfupm.edu.sa/id/eprint/9873