In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes...

In graph theory, a graph or digraph whose adjacency matrix is circulant is called a circulant graph/digraph. Equivalently, a graph is circulant if its...

The smallest graphs that are regular but not strongly regular are the cycle graph and the circulant graph on 6 vertices. The complete graph Km is strongly...

in graphs Other similarly-named concepts include Cycle graph (algebra), a graph that illustrates the cyclic subgroups of a group Circulant graph, a graph...

generators as well. The Cayley graphs of cyclic groups with arbitrary generator sets are called circulant graphs. These graphs may be represented geometrically...

related to Cycle graphs. Complete bipartite graph Complete graph Circulant graph Cycle graph (algebra) Null graph Path graph Some simple graph spectra. win...

Klin, M. H., M. Muzychuk and R. Poschel: The isomorphism problem for circulant graphs via Schur ring theory, Codes and Association Schemes, American Math...

Planar graphs (In fact, planar graph isomorphism is in log space, a class contained in P) Interval graphs Permutation graphs Circulant graphs Bounded-parameter...

associated Paley graph is a Hamiltonian circulant graph. Paley graphs are quasi-random: the number of times each possible constant-order graph occurs as a...

Cayley graph is the cycle C n {\displaystyle C_{n}} . More generally, the Cayley graphs of finite cyclic groups are exactly the circulant graphs. The Cayley...

vertices in the cycle. It is a cubic, circulant graph, so-named because (with the exception of M6 (the utility graph K3,3), Mn has exactly n/2 four-cycles...

triangle-free graphs with arbitrarily large chromatic number and minimum degree (1/3 − ε)n for any ε > 0. Andrásfai graph, a family of triangle-free circulant graphs...

upon some affine planes by adding one point Möbius ladder, a cubic circulant graph Moebius: The Orb of Celestial Harmony (1985) Moebius: Empire Rising...

Many other symmetric graphs can be classified as circulant graphs (but not all). The Rado graph forms an example of a symmetric graph with infinitely many...

by the LCF notation [4]8. It is an instance of an Andrásfai graph, a type of circulant graph in which the vertices can be arranged in a cycle and each vertex...

different sequence of graphs. An antiprism graph is a special case of a circulant graph, Ci2n(2,1). Other infinite sequences of polyhedral graph formed in a similar...

In graph theory, an Andrásfai graph is a triangle-free, circulant graph named after Béla Andrásfai. The Andrásfai graph And(n) for any natural number n...

the graph distance-transitive). For rectangular chessboards whose width and height are relatively prime, the rook's graphs are circulant graphs. With...

undirected graph, which turns out to be isomorphic to the Rado graph. Another construction of the Rado graph shows that it is an infinite circulant graph, with...

graph, a connected, 2-regular graph Cycle graph (algebra), a diagram representing the cycles determined by taking powers of group elements Circulant graph...

disproven Ádám's conjecture from 1967. Both conjectures concern circulant graphs. These are graphs defined from a positive integer n {\displaystyle n} and a...

graphs that can occur as distance-regular circulant graphs. Agarwal et al. (1994) describe polygons that have crown graphs as their visibility graphs;...

odd order into odd cycles. Their proof relies on Cayley graphs, in particular, circulant graphs, and many of their decompositions come from the action...

Heping; Yang, Yujun (2007). "Resistance distance and Kirchhoff index in circulant graphs". Int. J. Quantum Chem. 107 (2): 330–339. Bibcode:2007IJQC..107..330Z...

Cayley graph has r and f (or r, r−1, and f) as its generators. The n-gonal prism graphs with odd values of n may be constructed as circulant graphs C 2 n...

circulant matrix is manifestly regular, and therefore a circulant Hadamard matrix would have to be of square order. Moreover, if an n × n circulant Hadamard...

doi:10.37236/772. ——; —— (September 2009). "On the chromatic number of circulant graphs". Discrete Mathematics. 309 (18): 5687–5696. doi:10.1016/j.disc.2008...

combinatorics and particular in the symmetries of combinatorial designs, circulant graphs, and abstract polytopes. She is a researcher in the Institute of Mathematics...

In graph theory, circular coloring is a kind of coloring that may be viewed as a refinement of the usual graph coloring. The circular chromatic number...

bipartite graphs. Degree matrix — a diagonal matrix defining the degree of each vertex in a graph. Edmonds matrix — a square matrix of a bipartite graph. Incidence...