Results 111 to 120 of about 8,142 (196)

On Solvable Groups and Circulant Graphs

open access: yesEuropean Journal of Combinatorics, 2000
Solvable graphs are defined to be graphs whose automorphism group contains a solvable subgroup. A circulant graph of order \(n\) has an automorphism group which contains an \(n\)-cycle. In this paper every vertex-transitive graph \(\Gamma\) of order \(n\) with \(\text{gcd}(n,\varphi(n))= 1\) is proved to be isomorphic to a circulant graph of order \(n\)
openaire   +1 more source

Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]

open access: yesMicromachines (Basel), 2023
Romanov AY   +4 more
europepmc   +1 more source

Products of Circulant Graphs Are Metacirculant

open access: yesJournal of Combinatorial Theory, Series B, 2002
Broere and Hattingh studied \(B\)-products of graphs (introduced by Imrich and Izbicki) and proved that the lexicographic product of two circulant graphs is again circulant, but this is not the case with other products. In the present paper any \(B\)-product of two circulant graphs is proved to be a metacirculant graph with parameters that are easily ...
openaire   +1 more source

Some new optimal and suboptimal infinite families of undirected double-loop networks

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
Let n, s be positive integers such that 2≤s<n and s≠ n / 2. An undirected double-loop network G(n; 1, s) is an undirected graph (V, E), where V = ℤ n = {0, 1, 2, …, n-1 } and E = { (i, i+1 mod n), (i, i+s mod n)  |  i ∈ℤ}.
Bao Xing Chen   +2 more
doaj  

Home - About - Disclaimer - Privacy