Results 131 to 140 of about 990 (211)

Symmetry Parameters of Two-Generator Circulant Graphs

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 of connected, two-generator circulant graphs, and give their ...
Cockburn, Sally, Loeb, Sarah
core  

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

Discrete 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, Ji Xiang Meng, Wen Jun Xiao   +2 more
doaj  

Boosted Binary Quantum Classifier via Graphical Kernel. [PDF]

Entropy (Basel), 2023
Li Y, Huang D.
europepmc   +1 more source

Recognizing Circulant Graphs of Prime Order in Polynomial Time

, 1998
A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a
Mikhail E. Muzychuk, Gottfried Tinhofer
core  

An Energy-Efficient Sensing Matrix for Wireless Multimedia Sensor Networks. [PDF]

Sensors (Basel), 2023
Skosana V, Abu-Mahfouz A.
europepmc   +1 more source

Generalizable preconditioning strategies for MAP PET reconstruction using Poisson likelihood. [PDF]

Front Nucl Med
Colombo MN, Paganoni M, Presotto L.
europepmc   +1 more source

RL-Based Parallel LDPC Decoding with Clustered Scheduling. [PDF]

Entropy (Basel)
Ozkan Y, Yakimenka Y, Kliewer J.
europepmc   +1 more source

Combinatorial refinement on circulant graphs

computational complexity
AbstractThe combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a low-complexity class. We investigate the round complexity of the two-dimensional Weisfeiler--Leman algorithm on
openaire   +2 more sources

Coexistence rules for small, antagonistically interacting microbial communities. [PDF]

PLoS Comput Biol
Athreya GS, Gokhale CS, Verma P.
europepmc   +1 more source

The local vertex anti-magic coloring for certain graph operations. [PDF]

Heliyon
Uma L, Rajasekaran G.
europepmc   +1 more source