Graphs with three distinct eigenvalues and largest eigenvalue less than 8 |
| |
| Authors: | H Chuang GR Omidi |
| |
| Institution: | 1. Department of Mathematical Sciences, Isfahan University of Technology, Isfahan 84156-83111, Iran;2. School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran |
| |
| Abstract: | In this paper we consider graphs with three distinct eigenvalues and, we characterize those with the largest eigenvalue less than 8. We also prove a simple result which gives an upper bound on the number of vertices of graphs with a given number of distinct eigenvalues in terms of the largest eigenvalue. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
