Univ. Beograd. Publ. Elektrotehn. Fak.

Ser. Mat. 10 (1999), 95{105.

THERE ARE EXACTLY 150 CONNECTED

INTEGRAL GRAPHS UP TO 10 VERTICES
Krystyna Balinska, Dragos Cvetkovic, Mirko Lepovic, Slobodan Simic
A graph is called integral if its spectrum consists entirely of integers. Using
existing graph catalogues we established that there are exactly 150 connected
integral graphs up to 10 vertices. Adjacency matrices and/or pictures, and spectra
of these graphs together with some comments are given in this paper.

The spectrum of a graph is the spectrum of its (0 1) adjacency matrix. A

is called integral if its spectrum consists only of integers.
By the aid of computer we establish that there are exactly 150 connected
integral graphs up to 10 vertices. In Section 1 we present data on graphs while in
Section 2 we give some comments.

graph

1. DATA ON INTEGRAL GRAPHS

Integral graphs up to 7 vertices can easily be found in published tables of
graph spectra [3, 4, 6]. We have recently generated by a computer the les of all
non-isomorphic graphs with 8 9 and 10 vertices [8]. Using these les, we easily
obtain all connected non-isomorphic integral graphs of order = 8 9 10. Independently, these graphs have been generated in [1].
The numbers of connected integral graphs with vertices are given for
=1 2
10 in the following table:
;

in

;:::;

n
in

1 2 3 4 5 6 7 8 9 10
1 1 1 2 3 6 7 22 24 83
Table 1.

Connected integral graphs with up to 5 vertices are easily obtained from the
tables of spectra of connected graphs up to 5 vertices of [4]. They are 1 , 2 , 3 ,
4,
4,
5, 2 1 [
3 and
1 4.
The six connected integral graphs on 6 vertices have identication numbers
1 9 51 52 106 and 109 in the table of connected graphs with 6 vertices of [6]. They
K

K ;

1991 Mathematics Subject Classication: 05C50

96
are

Krystyna Balinska, Dragos Cvetkovic, Mirko Lepovic, Slobodan Simic

, cocktail party graph (3), the graph of 3-sided prism 3 + 2, 6 and

(+ and  stand for graph sum (NEPS with basis f(0 1) (1 0)g - see, e.g.,
[4], pp. 65-66) and corona).
There are 7 connected integral graphs on 7 vertices with identication numbers 4 191 235 300 710 841 and 853 in the table of connected graphs on 7 vertices
of [3]. They are ( 1 3 ), 1 5 3 2, ( 1 2 + 2), ( 3 3 ), 3 [ 4 , 4 [ 3 1
and 7 ( , and 5 stand for graph subdivision, line graph and graph join, respectively).
Integral graphs with 8, 9 and 10 vertices are displayed in Lists 1, 2 and 3,
respectively. Graphs in the lists are represented in the form:
K2

K6

CP

2

K1

L K ;

L K ;

n1

where

S K ;

a12 a13 a23

:::

a1n a2n : : : an

1;n ;

is the identication number of the corresponding integral graph, and

is the upper diagonal part of its adjacency ma1
2
1
trix. For each graph we have chosen the adjacency matrix which corresponds to
lexicographical ordering of vertices with respect to vertex angle sequences [7].
The integral graphs with 8 9 and 10 vertices are ordered lexicographically by
their eigenvalues in non-increasing order; eigenvalues are given in Lists 4 5, and 6,
respectively. In these lists, a multiple eigenvalue is not repeated and its multiplicity
is given in the form of an exponent. In the sets of cospectral integral graphs the
(common) spectrum is given only once. Cospectral graphs are ordered by means
of their angles [7].
n1

a12 a13 a23

:::

a n a n : : : an

;n

LIST 1. ADJACENCY MATRICES OF INTEGRAL GRAPHS WITH 8

VERTICES
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.

1
1
1
1
1
1
1
1
1
0
1
1
1
1
1
1
0
1
0
1
0
1

11
10
11
10
11
11
11
10
11
11
11
11
11
11
10
11
11
10
11
11
11
11

111
011
110
110
110
111
111
010
110
110
110
111
111
111
100
110
111
010
111
110
110
110

1111
1111
1110
1010
1110
1111
1110
1010
1101
1100
1110
1011
1001
1110
1000
1100
0100
0010
0100
1000
1100
1000

11111
11110
11010
01111
11011
11110
11100
01110
10100
11100
11010
11000
01010
01100
01111
11000
10000
00011
10000
01001
11000
01000

111111
111111
111010
111110
111000
101000
111000
101110
011001
110100
100000
000011
101000
100000
011110
110000
010010
100110
100010
001000
010000
100000

1111111
1111110
1101010
0111110
1101001
0101000
1110000
0101110
0001100
1100100
0100001
0100000
0110000
1000000
0111100
1100000
1000010
0110010
0100010
0001000
1000000
0100000

There are exactly 150 connected integral graphs up to 10 vertices

LIST 2. ADJACENCY MATRICES OF INTEGRAL

GRAPHS WITH 9 VERTICES
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0

1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
1
1

11
11
11
10
11
11
11
11
00
00
00
00
11
00
11
10
11
11
11
11
11
01
11
00

111
111
111
101
111
110
111
110
001
001
001
101
011
101
110
011
110
100
100
110
101
111
110
001

11
11
11
00
11
11
11
00
11
11
11
11
11
11
11
00
11
10
00
11
11
11
10
11
10
11

111
111
111
001
111
111
111
001
111
111
111
111
000
111
110
110
111
010
001
111
111
111
011
111
101
111

1111
1111
1111
1111
1111
1111
1111
1111
1100
1101
1110
1111
0001
1111
1101
1011
1111
0010
1111
1111
1110
1111
1111
1111
1011
1100

1111
1110
1110
0110
1110
1100
1111
1100
1111
1100
0011
1011
0111
0111
1011
1111
0011
1001
0010
1011
1101
1111
1100
1011

11111
11010
10111
01011
11100
10111
11000
10111
11110
00110
11001
01110
10100
01110
10000
10100
00111
01010
01000
01010
00101
11000
10100
01110

111111
111011
110111
111111
110111
101110
101001
101110
111100
100111
110010
011011
110001
101011
100001
101000
110000
010011
010111
001011
010101
101000
101000
110000

1111111
1101110
1111000
1111110
1101110
0111111
0110011
1101000
1111000
0110110
0011011
1100000
1000000
1100000
1000010
0101000
1100000
0011010
0011110
0110000
0110000
1010000
0110000
1000000

11111111
11110000
11101000
11111100
11110000
01111110
00011000
11100000
11110000
11110000
11110000
11000000
10000001
11000000
10000011
01010000
11000000
00101011
10011100
10000000
10000000
11000000
01100000
01000000

LIST 3. ADJACENCY MATRICES OF INTEGRAL

GRAPHS WITH 10 VERTICES
11111
11110
11111
11111
11111
11111
11111
11110
11001
11011
11101
11110
00011
11111
10110
01110
11111
00011
11111
11111
11100
11110
11110
11110
10111
11001

111111
111011
111111
111110
111111
111111
111100
111111
001101
111010
111100
111011
111111
111000
101011
111011
111000
111111
111111
011110
110111
111100
111100
000010
011000
110011

1111111
1101111
1111110
1111101
1110100
1111000
1111001
1111110
0011101
1110011
1100110
0110000
1111110
1110000
0111010
1110001
1001010
1111110
1111000
1001100
1101110
1111000
1111000
0000101
0101001
1111000

11111111
10111111
11111100
11110110
11010010
11001100
11110000
11110011
00111111
00011100
11010010
11000001
11111100
00011100
01101011
10111101
01001100
11111100
11110000
11100000
00011100
11000000
11110000
00000111
01001011
00110001

111111111
011111111
111111000
111101011
101101000
001111000
111100001
111111001
110011110
001000111
100100010
101000011
111111000
000111000
000111111
011111010
001110000
111111000
111100000
100000000
001000111
001100000
111100000
000001111
010001111
000011100

97

98

Krystyna Balinska, Dragos Cvetkovic, Mirko Lepovic, Slobodan Simic

27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
61.
62.
63.
64.
65.
66.
67.
68.
69.
70.
71.
72.
73.
74.
75.
76.
77.
78.
79.
80.
81.
82.
83.

1
0
1
1
1
1
1
1
1
1
0
1
1
1
1
0
1
1
1
1
1
0
1
1
1
1
1
1
1
0
1
1
0
1
1
1
0
1
1
0
0
0
0
1
0
0
0
1
0
1
1
1
1
1
0
1
1

11
11
11
11
11
11
10
11
11
10
11
10
11
11
11
11
11
10
11
11
11
11
10
10
11
10
11
11
11
10
11
00
10
11
11
11
11
11
10
10
11
11
00
11
11
10
00
00
11
00
11
11
10
10
11
10
10

111
110
111
110
111
110
011
110
111
011
110
011
111
111
111
111
110
100
111
101
110
110
011
011
111
110
111
101
110
101
110
001
011
111
100
110
110
110
100
010
110
110
111
111
110
010
000
001
110
001
100
100
100
100
110
011
100

1100
1111
1100
1101
1111
1101
1111
1100
1100
1111
1110
1111
1001
1100
1111
1111
1100
1000
1100
1101
1100
1001
1100
1001
1000
1010
0100
1101
1100
1110
1011
1111
0111
1100
1101
1100
1010
1010
1000
1111
1100
1100
1110
1100
1100
1010
1100
1100
1100
1010
1001
1001
0100
1000
1100
1001
1000

11001
11111
10101
10110
11100
11100
11111
10111
11001
11111
11010
11111
10010
11001
10110
11111
10111
10000
11001
00011
11000
10101
11000
10011
10001
10011
11001
00011
11000
11100
01001
11110
10111
11001
10110
11000
10010
10010
01110
11110
00111
11000
11100
10100
11000
01010
00111
00110
11000
01010
01000
00011
01000
10000
11000
01100
10000

101100
011000
100111
101011
100110
101100
100100
101110
101010
110000
110011
110000
100100
110000
011100
110000
101110
011111
000100
111000
000101
010100
001101
011000
100011
111000
000110
011001
001100
110100
001101
110000
110000
000100
000111
001010
011001
100011
011010
100100
110000
001110
111000
011000
110000
001100
001100
011000
001000
010100
001001
010000
001010
010001
000001
100000
100000

1000110
1010000
0111000
0001111
0000011
1011000
1001001
0001111
1001010
1010000
1111000
0011001
0110110
1100001
1100000
1100000
0100011
0111110
0010001
0000010
0010100
0110001
1100000
0110001
0100001
0101000
0010101
0000011
0000111
1101000
1000000
0011000
1100000
0010001
0110000
0011000
0101100
0100001
0101100
1100000
1100000
0011010
1100000
1000000
1100000
0000110
0011000
0101000
0001000
0101000
0001000
0010000
0010010
0110000
0010000
0100000
1000000

01100100
10010001
00001111
01100000
00000110
01001100
01100000
01100000
01100100
00110010
00001101
10010000
01101010
11000000
10000000
10000000
00111001
01111100
00000011
00000101
00100101
11000000
00110001
11000000
00101000
00101000
10000000
10000000
11000000
01000000
10000001
10100000
11000000
00001000
01000000
00001101
11000000
00100100
00111000
01100000
00110010
00101100
10100000
01000000
11000000
00000011
11000010
10010000
00000011
10100000
00001001
00100000
00011001
01010000
00010000
00100000
10000000

010110000
010100100
100000000
011000000
100000011
010011000
011000001
011000000
010110000
010100010
001100100
011000001
011001100
110000001
010000000
010000000
100000000
011111000
000000111
000001011
000110100
001100001
001110000
001100001
000101000
000001100
100000001
100000001
000000110
010000001
000001100
010100000
110000000
000001001
001000000
000101100
001100001
000110000
000001111
001100000
001100010
110000000
011000000
001000000
110000000
110000001
110000010
101000000
000000110
101000000
100000000
010000000
000101100
010010000
000010000
000100000
100000000

There are exactly 150 connected integral graphs up to 10 vertices

LIST 4. SPECTRA OF INTEGRAL GRAPHS WITH 8 VERTICES

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11-13.
14.
15.
16.
17.
18.
19.
20.
21.
22.

5
4
4
4
4
3
3
3

5
5
5
1
5
4
2
12
12
1
4
2
3
3
12
1
3

6
2
12
12
02
04
2
02
0
0
03
4
05
1
13
13
02
04
1

7
04
15
14
13
12
12
03
12
13
12
1
06
1
14
13
12
1
1
04

17
23
2
3
22
22
3
23
22
3
22
22
4
3
2
3
22
22
3
22

LIST 5. SPECTRA OF INTEGRAL GRAPHS WITH 9 VERTICES

1.
2-3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15-16.
17.
18.
19.
20.
21-22.
23.
24.

6
5
4

2
4
4
4

6
6
1

12
1
03

5
12
5
4
1
2
2
2

2
02
1
2
02
1
1
04
4
2

4
4

4
4
12

13
13
03
4
1

0
04
12
6
03
12
04
12
12
02
0
1
2
03
4
02
0
1
12
02

8
12
22
2
06
1
2
12
12
2
1
13
2
04
13
14
22
1
2
03
12

18
23
3
3
32
23
3
4
23
3
23
22
3
23
3
24
3
23
3
23
22

99

100

Krystyna Balinska, Dragos Cvetkovic, Mirko Lepovic, Slobodan Simic

LIST 6. SPECTRA OF INTEGRAL GRAPHS WITH 10 VERTICES

1.
2.
3.
4.
5-6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27-28.
29-30.
31-33.
34.
35-36.
37.
38.
39.
40.
41.
42.
43.
44.
45-46.
47-50.
51-54.
55-59.
60-61.
62-63.
64.
65.
66.

12
7

2
6
6

7
1
2
2
6
6
6

6
6
6

12
6
6
1
1
5

2
5

5
5
5
1
5
5
13
5
5
5
5

4
4

4
2
4
2
4
4

3
12
2
1
2
14
4

8
02
12
7
1
02
1
1
6
2
2
13
6
03
12
12
05
04
6
3
5
3
2
2
02
2
5
13
02
13
5
12
12
1
1
0
12
03
1
0
4
4
13

8
03
12
0
12
04
12
02
0
2
03
02
6
02
13
12
02
02
1
12
07
1
3
02
12
1
13
05
14
02
1
0
13
03
02
06
5
0
13
0
12
03
1
14
14
03

9
05
15
22
13
16
12
22
1
13
04
14
15
14
23
13
2
14
12
2
2
2
15
04
15
13
03
2
22
1
12
22
14
15
1
14
2
08
14
2
12
2
1
22
0
14
22

19
24
3
3
23
3
32
3
24
23
24
4
3
25
3
23
4
4
23
4
3
4
22
24
3
23
24
3
3
24
32
3
4
3
23
3
4
5
22
3
23
3
23
3
24
4
3

There are exactly 150 connected integral graphs up to 10 vertices

67-68.
69.
70.
71.
72.
73.
74.
75-76.
77.
78.
79.
80.
81-82.
83.

2
3
2

4
4

13
12
4

3
12
2
1
3
2

2
02
12
04
2
1

3
13

02
04
12
4
13
12
02
1
1
03
3
14
02
3

13
12
04
08
12
2
1
2
04
12
15
14
13
08

101

4
4
23
4
23
3
23
3
23
22
24
3
3
3

Integral graphs with 8 and 9 vertices are depicted in Figures 1 and 2, respectively.

2. SOME COMMENTS

Based on the data on integral graphs presented in this paper several observations can be made. We shall rst comment some facts concerning sets of cospectral
integral graphs.
No two non-isomorphic connected integral graphs on less than 8 vertices are
cospectral. There are just one triplet of connected integral graphs on 8 vertices,
3 pairs on 9 vertices and 10 pairs, 1 triplet, 2 quadruples and 1 quintuple on 10
vertices. All graphs contained in these sets are non-regular.
The above cospectral graphs can be distingushed by angles. Indeed, smallest
cospectral graphs with the same angles have 10 vertices [5] and among 58 pairs of
such cospectral graphs no one has an integral spectrum.
There are integral cospectral graphs on less than 8 vertices but then at least
one of them is disconnected. These cases include the smallest pair of cospectral
graphs: 1 4 4 [ 1 . The common spectrum is 2 03 2. It is also known that
integral graph ( 1 3) has a cospectral-mate in the disconnected graph 6 [ 1
with the spectrum 2 12 0 12 2. An interesting case of two disconnected integral
graphs has been noted in [2]. Graphs in question have 20 vertices. One consists of
two components equal to graph No. 73 of List 6 and the components of the other
one are the graph of a hexagonal prism ( 6 + 2) on 12 vertices and the cube graph
( 4 + 2 ) on 8 vertices (graph No. 18 of List 4).
Some of cospectral graphs have the same main angles. This happens in the
following pairs of cospectral graphs: 2 and 3 on 9 vertices, 5 and 6, 45 and 46, 51 and
52, 53 and 54, 55 and 56, 67 and 68 on 10 vertices, as well as in the triplet 48, 49 and
50 on 10 vertices. Note that main angles are not mutually equal in all four graphs
from the cospectral quadruples 47-50 and 51-54. The complements of cospectral
graphs sharing the same main angles are cospectral. Complements of graphs from
cospectral quadruple 51-54 form two pairs of cospectral graphs but not a cospectral
K ; ;C

S K ;
;

102

Krystyna Balinska, Dragos Cvetkovic, Mirko Lepovic, Slobodan Simic

Fig. 1.

There are exactly 150 connected integral graphs up to 10 vertices

Fig. 2.

103

104

Krystyna Balinska, Dragos Cvetkovic, Mirko Lepovic, Slobodan Simic

quadruple. Similarly, the complements of graphs 47-50 do not provide a cospectral

quadruple; we get in this case only a cospectral triplet (complements of graphs
48, 49 and 50). However, among graphs of all these sets of cospectral graphs only
complements of graphs 2 and 3 on 9 vertices are integral. Both complements are
disconnected (the rst has three components two of them being isolated vertices,
while the second has two components one being an isolated vertex) and therefore
do not appear in List 2. Cospectral integral graphs with cospectral integral complements were noted for the rst time in [9], where an example with 11 vertices is
given. It is interesting that we have the same situation with isolated vertices as
above: adding two isolated vertices to graph 18 on 9 vertices (List 5) and adding
an isolated vertex to graph 64 on 10 vertices (List 6) produce the example from [9].
However, several other graphs of our lists have integral complements. If the
complement is connected, it is included in the lists. In this way we can identify the
following pairs of complementary integral graphs: 8 and 18 on 8 vertices, 10 and
19 on 9 vertices, 9 and 73, 15 and 79, 16 and 72, 25 and 65 on 10 vertices. The
smallest such pair is with 6 vertices: 6 and 3 + 2 . All these graphs are regular.
Selfcomplementary graphs appear in our lists as well: graph 13 on 8 vertices (nonregular) and graphs 11 and 18 on 9 vertices (both regular). The following graphs
have integral disconnected complements: 1-5, 7, 10, 15, 16 on 8 vertices, 1-6, 8, 9,
15 on 9 vertices and 1-4, 7, 8, 13, 18, 23, 40, 44, 71, 83 on 10 vertices.
Several other observations and data on integral graphs up to 10 vertices are
contained in [1]. In particular, the number of automorphisms is given for each
graph.
C

REFERENCES
1. K. Balinska, M. Kupczyk, K. Zwierzynski: Methods of generating integral graphs,
The Technical University of Poznan, Poland, Computer Science Center Report, No.
457, Poznan, June 26, 1998.

2. F.C. Bussemaker, S. Cobelji
c, D. Cvetkovic, J.J. Seidel: Computer investigation of cubic graphs, Tecnological University Eindhoven, T.H. - Report, 76-WSK-01,
1976.
3. D. Cvetkovic, M. Doob, I. Gutman, A. Torgasev: Recent results in the theory of
graph spectra, North-Holland, Amsterdam, 1988.
4. D. Cvetkovic, M. Doob, H. Sachs: Spectra of graphs { Theory and applications,
3rd edition, Johann Ambrosius Barth Verlag, Heidelberg { Leipzig, 1995.
5. D. Cvetkovic, M. Lepovic: Cospectral graphs with the same angles and with a minimal number of vertices, Univ. Beograd, Publ. Elektrotehn. Fak., Ser. Mat. 8 (1997),
88-102.
6. D. Cvetkovic, M. Petric: A table of connected graphs on six vertices, Discrete
Math., 50 (1984), 37{49.
7. D. Cvetkovic, P. Rowlinson, S. Simic: Eigenspaces of graphs, Cambridge University Press, Cambridge, 1997.
8. M. Lepovic: Some statistical data on graphs with 10 vertices, Univ. Beograd, Publ.
Elektrotehn. Fak., Ser. Mat., 9 (1998), 79{88.

There are exactly 150 connected integral graphs up to 10 vertices

105

9. Z. Radosavljevic, S. Simic: Computer aided search for all graphs such that graph
and its complement have its spectrum bounded from below by 2, Ars. Combinatoria,
24A(1987), 21{27.
The Technical University of Poznan,
pl. M. Sklodowskiej-Curie 5,
60-965 Poznan, Poland

kbal@agat.sk-kari.put.poznan.pl
University of Belgrade,
Faculty of Electrical Engineering,
P.O. Box 35-54, 11120 Belgrade,
Yugoslavia

ecvetkod@ubbg.etf.bg.ac.yu
esimics@ubbg.etf.bg.ac.yu

Tihomira Vuksanovica 32,

34000 Kragujevac, Yugoslavia

lepovic@uis0.uis.kg.ac.yu

(Received May 19, 1999)