Tricyclic graphs with exactly two main eigenvalues
classification
🧮 math.CO
math.SP
keywords
maineigenvalueeigenvaluesexactlygraphstricycliccalledconnected
read the original abstract
An eigenvalue of a graph $G$ is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected tricyclic graphs with exactly two main eigenvalues are determined.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.