Актуальность исследования. Надежность является важнейшим аспектом при
использовании вычислительных систем в критических областях. Авиация, энергетика …

A set W of the vertices of a connected graph G is called a resolving set for G if for every two
distinct vertices u, υ∈ V (G) there is a vertex w∈ W such that d (u, w)≠ d (υ, w). A resolving …

A vertex coloring of a graph GG is called distinguishing if no nonidentity automorphisms of
GG can preserve it. The distinguishing number of GG, denoted by D (G) D(G), is the …

Circulant graph Cn (R) is said to have the Cayley Isomorphism (CI) property if whenever Cn
(S) is isomorphic to Cn (R), there is some a∈ Z* n for which S= aR. In this paper, we define …

Abstract Let $ X $ and $ Y $ be connected Cayley graphs on abelian groups, such that no
two distinct vertices of $ X $ have exactly the same neighbours, and the same is true about …

A subset W of vertices of a graph G is called a resolving set for G if for every pair of distinct
vertices u and v of G, there exists a vertex w∈ W such that the distance between u and w is …

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

We study quantum automorphism group of vertex-transitive graphs using intertwinner
spaces of the magic unitary matrix associated to this quantum subgroups of $ S_n^+ $. We …

The derived graph of a voltage graph consisting of a single vertex and two loops of different
voltages is a circulant graph with two generators. We characterize the automorphism groups …

A circulant graph C_n (R) C n (R) is said to have the Cayley isomorphism (CI) property if
whenever C_n (S) C n (S) is isomorphic to C_n (R) C n (R), there is some a ∈ Z _n^* a∈ Z …