Results 111 to 120 of about 8,142 (196)
On Solvable Groups and Circulant Graphs
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
Quantum LDPC Codes Based on Cocyclic Block Matrices. [PDF]
Li Y, Guo Y.
europepmc +1 more source
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]
Romanov AY +4 more
europepmc +1 more source
Products of Circulant Graphs Are Metacirculant
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
Quantum Coding via Quasi-Cyclic Block Matrix. [PDF]
Li Y, Li JY.
europepmc +1 more source
Some new optimal and suboptimal infinite families of undirected double-loop networks
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
Boosted Binary Quantum Classifier via Graphical Kernel. [PDF]
Li Y, Huang D.
europepmc +1 more source
An Energy-Efficient Sensing Matrix for Wireless Multimedia Sensor Networks. [PDF]
Skosana V, Abu-Mahfouz A.
europepmc +1 more source
Generalizable preconditioning strategies for MAP PET reconstruction using Poisson likelihood. [PDF]
Colombo MN, Paganoni M, Presotto L.
europepmc +1 more source
RL-Based Parallel LDPC Decoding with Clustered Scheduling. [PDF]
Ozkan Y, Yakimenka Y, Kliewer J.
europepmc +1 more source

