Results 31 to 40 of about 975,970 (227)
Achromatic Numbers for Circulant Graphs and Digraphs
Discussiones Mathematicae Graph Theory, 2021 In this paper, we determine the achromatic and diachromatic numbers of some circulant graphs and digraphs each one with two lengths and give bounds for other circulant graphs and digraphs with two lengths.
Araujo-Pardo Gabriela +3 more
doaj +1 more source
On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
Proyecciones (Antofagasta), 2023 An edge labeling of a graph G = (V,E) is said to be local antimagic if there is a bijection f : E → {1,..., |E|} such that for any pair of adjacent vertices x and y, f +(x) ≠ f +(y), where the induced vertex label is f +(x) = 𝜮 f(e), with e ranging over ...
G. Lau +3 more
semanticscholar +1 more source
Parameters of Integral Circulant Graphs and Periodic Quantum Dynamics [PDF]
, 2007 The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a circulant ...
Centrum Voor Wiskunde En Informatica +3 more
core +3 more sources
Total colorings of some classes of four regular circulant graphs [PDF]
AKCE Int. J. Graphs Comb., 2021 The total chromatic number, $\chi''(G)$ is the minimum number of colors which need to be assigned to obtain a total coloring of the graph $G$. The Total Coloring Conjecture (TCC) made independently by Behzad and Vizing that for any graph, $\chi''(G) \leq
R. Navaneeth +3 more
semanticscholar +1 more source
Automorphism Groups of Rational Circulant Graphs [PDF]
The Electronic Journal of Combinatorics, 2012 The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to consider the automorphism groups of orthogonal group block structures of cyclic groups.
Klin, Mikhail, Kovács, István
openaire +3 more sources
Block circulant graphs and the graphs of critical pairs of crowns
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
Asymptotic energy of connected cubic circulant graphs
AKCE International Journal of Graphs and Combinatorics, 2021 In this article, we compute the oblique asymptote of the energy function for all connected cubic circulant graphs. Moreover, we show that this oblique asymptote is an upper bound for the energies of two of the subclasses of Möbius ladder graphs and lower
Alper Bulut, Ilhan Hacioglu
doaj +1 more source
Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks [PDF]
Journal of combinatorial theory. Series AWe completely characterize circulant graphs with valency up to $4$ that admit perfect state transfer. Those of valency $3$ do not admit it. On the other hand, circulant graphs with valency $4$ admit perfect state transfer only in two infinite families ...
Sho Kubota, Kiyoto Yoshino
semanticscholar +1 more source
On the Metric Dimension of Directed and Undirected Circulant Graphs
Discussiones Mathematicae Graph Theory, 2020 The undirected circulant graph Cn(±1, ±2, . . . , ±t) consists of vertices v0, v1, . . . , vn−1 and undirected edges vivi+j, where 0 ≤ i ≤ n − 1, 1 ≤ j ≤ t (2 ≤ t ≤ n2{n \over 2} ), and the directed circulant graph Cn(1, t) consists of vertices v0, v1, .
Vetrík Tomáš
doaj +1 more source
The hyperbolicity constant of infinite circulant graphs
Open Mathematics, 2017 If X is a geodesic metric space and x1, x2, x3 ∈ X, a geodesic triangle T = {x1, x2, x3} is the union of the three geodesics [x1x2], [x2x3] and [x3x1] in X.
Rodríguez José M., Sigarreta José M.
doaj +1 more source