The integral circulant graph ICG n (D) has the vertex set Z n={0, 1, 2,…, n− 1} and vertices a
and b are adjacent if gcd (a− b, n)∈ D, where D⊆{d: d∣ n, 1≤ d< n}. In this paper we prove …

The spread of a graph G is the difference between the largest and smallest eigenvalues of
the adjacency matrix of G. In this paper, we consider the family of graphs which contain no K …

The spread of a graph $ G $ is the difference between the largest and smallest eigenvalue of
the adjacency matrix of $ G $. Gotshall, O'Brien and Tait conjectured that for sufficiently large …

The spread of a graph is the difference between the largest and most negative eigenvalue of
its adjacency matrix. We show that for sufficiently large n, the n-vertex outerplanar graph with …

The integral circulant graph $ ICG_n (D) $ has the vertex set $ Z_n=\{0, 1, 2,\ldots, n-1\} $,
where vertices $ a $ and $ b $ are adjacent if $\gcd (ab, n)\in D $, with $ D\subseteq\{d …

A graph's spread is defined as the difference between the largest eigenvalue and the least
eigenvalue of the graph's adjacency matrix. Characterizing a graph with maximal spread is …

Spectral graph theory is an important interdisciplinary field of science and mathematics in
which methods of linear algebra are used to solve problems in graph theory. It has …

Ъ ЧЮС СТ Т Ц ТХ Я У Ъ УЬ ЪСЫЬС Ц ЮЪ ЦЧЫЬ ХСЦСХ ФЦ Э Ц УСХ УФ Ы Х Ъ ЧЮ
Page 1 Эв к жо и и й Уж й к й Шж жг вгЙб и б и йаи и Ь и в а з Ъ ЧЮС СТ Т Ц ТХ Я У Ъ УЬ …