We prove that the spectrum of a Cayley graph over a finite group with a normal generating
set S containing with every its element s all generators of the cyclic group〈 s〉 is integral. In …

Resolving parameters are a fundamental area of combinatorics with applications not only to
many branches of combinatorics but also to other sciences. In this study, we construct a …

Resolving parameters are a fundamental area of combinatorics with applications not only to
many branches of combinatorics but also to other sciences. In this study, we construct a …

1. Introduction e graphs in this paper are simple, undirected, and connected. We always
assume that Γ denotes the complement graph of Γ. e eigenvalues of a graph Γ are the …

Let n be an even integer is greater than or equal 4, and Λ= Cay (D2n, Ψ), be a Cayley graph
on dihedral group D2n, where D2n=< a, b| an= b2= 1, ba= an− 1b>, is the dihedral group of …

For an ordered subset S={s1, s2,..., sl} of vertices in a connected graph Γ the metric
representation of a vertex v in Γ, is the l-vector r (v| S)=(d (v, s1), d (v, s2),..., d (v, sl)) with …

Let Γ=(V, E) be a graph. If all the eigenvalues of the adjacency matrix of the graph Γ are
integers, then we say that Γ is an integral graph. A graph Γ is determined by its spectrum if …

Актуальность исследования. Современные фундаментальные и прикладные
исследования в огромной мере используют компьютерные вычисления, поэтому …