Results 121 to 130 of about 1,046 (212)
Recognizing Recursive Circulant Graphs G(cd m ,d)
, 2007 Recursive circulant graphs G(N, d) have been introduced in 1994 by Park and Chwa [PC94] as a new topology for interconnection networks. Recursive circulant graphs G(N, d) are circulant graphs with N nodes and with jumps of powers of d.
Guillaume Fertin, André Raspaud
core
Routing in circulant graphs based on a virtual coordinate system
Учёные записки Казанского университета: Серия Физико-математические наукиThis article explores routing methods in two-dimensional circulant graphs where each vertex is linked to four neighboring ones. The unique symmetries of the circulant graph make it a viable topology for high-performance computing devices, such as ...
A. M. Sukhov +2 more
doaj +1 more source
Distance spectra and distance energy of integral circulant graphs
, 2010 The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G.
Ilić, Aleksandar
core +1 more source
Quantum LDPC Codes Based on Cocyclic Block Matrices. [PDF]
Entropy (Basel), 2023 Li Y, Guo Y.
europepmc +1 more source
New Qubit Codes from Multidimensional Circulant Graphs
, 2023 Two new qubit stabilizer codes with parameters $[77, 0, 19]_2$ and $[90, 0, 22]_2$ are constructed for the first time by employing additive symplectic self-dual $\F_4$ codes from multidimensional circulant (MDC) graphs.
Seekamp, Kerry +4 more
core
Boosted Binary Quantum Classifier via Graphical Kernel. [PDF]
Entropy (Basel), 2023 Li Y, Huang D.
europepmc +1 more source
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
Computation of the Lovasz Theta Function for Circulant Graphs [PDF]
, 2003 The Lovasz theta function (G) of a graph G has attracted a lot of attention for its connection with diverse issues, such as communicating without errors and computing large cliques in graphs.
Codenotti, Bruno
core
Exact Recursive Calculation of Circulant Permanents: A Band of Different Diagonals inside a Uniform Matrix. [PDF]
Entropy (Basel), 2021 Kocharovsky V +3 more
europepmc +1 more source
Defensive alliances in regular graphs and circulant graphs
In this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph $G$ induce, if $G$ is $6$-regular and the cardinality of the alliance is at most $8$.
Barrière Figueroa, Eulalia +1 more
core