New results on the energy of integral circulant graphs
Aleksandar Ilić, Milan Bašić
Abstract
Open-access reader
Aleksandar Ilić, Milan Bašić
Abstract
Open-access reader
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. 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)\in D$, where $D \subseteq \{d : d \mid n,\ 1\leq d
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Circulant graphs are an important class of interconnection networks in parallel and distributed computing. Integral circulant graphs play an important role in modeling quantum spin networks supporting the perfect state transfer as well. 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)\in D$, where $D \subseteq \{d : d \mid n,\ 1\leq d
Key concepts: Circulant matrix, Circulant graph, Mathematics, Combinatorics, Cayley graph, Odd graph, Integral graph, Vertex (graph theory)