Small graphs with exactly two non-negative eigenvalues

Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Let G be a graph with eigenvalues 1(G) n(G). In this paper we nd all simple graphs G such that G has at most twelve vertices and G has exactly two non-negative eigenvalues. In other words we nd all graphs G on n vertices such that n  12 and 1(G)  0, 2(G)  0 and 3(G) 0, 2(G) > 0 and 3(G)
Language:
English
Published:
Journal of Algebraic Structures and Their Applications, Volume:4 Issue: 1, Winter - Spring 2017
Pages:
1 to 18
https://www.magiran.com/p1813931