PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE (BEOGRAD) (N.S.) Vol. 45(59), pp. 710 (1989) 

MAXIMAL CANONICAL GRAPHS WITH THREE NEGATIVE EIGENVALUESAleksandar TorgasevMatematicki fakultet, Beograd, YugoslaviaAbstract: A connected graph $G$ is called canonical if no two of its nonadjacent vertices have the same neighbours in $G$. Let $C(3)$ be the class of all nonisomorphic canonical graphs with exactly 3 negative eigenvalues (including also their multiplicities). In this paper we prove that the class $C(3)$ contains exactly 32 maximal graphs with respect to relation to be induced subgraph. The orders of these graphs run over the set $\{9, 10, 11, 12, 13, 14\}$. Classification (MSC2000): 05C50 Full text of the article:
Electronic fulltext finalized on: 2 Nov 2001. This page was last modified: 16 Nov 2001.
© 2001 Mathematical Institute of the Serbian Academy of Science and Arts
