Results 91 to 100 of about 332 (178)
Strong regularity and circulant graphs
Discrete Mathematics, 1989 Let p be a prime number. The paper characterizes a strong regular \(p^ k\)-circulant graph. Also, the paper gives a representation of Paley graphs of order \(p^ 2\). Specifically, it is shown that a \(p^ k\)- circulant graph is a nontrivial strongly regular graph if and only if \(k=1\) and it is isomorphic to the Paley graph of order p.
openaire +2 more sources
On Ádám's conjecture for circulant graphs
Discrete Mathematics, 1997 The content of this article is analogous to the one of the author's former paper [J. Comb. Theory, Ser. A 72, No. 1, 118-134 (1995; Zbl 0833.05063)]. Now the author proves the reviewer's conjecture in case of an \(n\) (number of vertices) such that \(n/4\) is a square-free odd integer.
openaire +1 more source
Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip. [PDF]
Micromachines (Basel), 2023 Romanov AY +4 more
europepmc +1 more source
On the page-number of a circulant graph
AKCE International Journal of Graphs and CombinatoricsThe page-number of a graph G, denoted by p(G), is the minimum k such that G has an embedding in a k-book. The circulant graph C(m, n) is such a graph that its vertex set is [Formula: see text] and edge set is [Formula: see text], where m, n are positive integers satisfying [Formula: see text] and indices is read modulo m.
Xiaoyuan Dong, Dengju Ma
openaire +2 more sources
On the symmetries of some classes of recursive circulant graphs
Transactions on Combinatorics, 2014 A recursive-circulant $G(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties.
Seyed Morteza Mirafzal
doaj
On Edge Transitive Circulant Graphs
Tokyo Journal of Mathematics, 1996 This paper classifies those circulant graphs for which both the graph and its complement are edge-transitive. The author shows that such a graph must be either a disjoint union of copies of a complete graph, or the complement of such a disjoint union, or a Paley graph on a prime number of vertices.
openaire +3 more sources
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
On magic and supermagic circulant graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Quantum LDPC Codes Based on Cocyclic Block Matrices. [PDF]
Entropy (Basel), 2023 Li Y, Guo Y.
europepmc +1 more source
Boosted Binary Quantum Classifier via Graphical Kernel. [PDF]
Entropy (Basel), 2023 Li Y, Huang D.
europepmc +1 more source