Spectral characterization of trees.
| dc.contributor.author | Faisal Abdul-Karim Fairag | |
| dc.date | 1989 | |
| dc.date.accessioned | 2022-05-18T06:09:58Z | |
| dc.date.available | 2022-05-18T06:09:58Z | |
| dc.degree.department | College of Sciences | |
| dc.degree.grantor | King Fahad for Petrolem University | |
| dc.description.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. | |
| dc.identifier.other | 5440 | |
| dc.identifier.uri | https://drepo.sdl.edu.sa/handle/20.500.14154/2195 | |
| dc.language.iso | en | |
| dc.publisher | Saudi Digital Library | |
| dc.thesis.level | Master | |
| dc.thesis.source | King Fahad for Petrolem University | |
| dc.title | Spectral characterization of trees. | |
| dc.type | Thesis |