Results 11 to 20 of about 1,046 (212)
The irregularity strength of circulant graphs
Discrete Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Baril, Jean-Luc +2 more
openaire +3 more sources
Products of Circulant Graphs Are Metacirculant
Journal of Combinatorial Theory, Series B, 2002 Broere and Hattingh studied \(B\)-products of graphs (introduced by Imrich and Izbicki) and proved that the lexicographic product of two circulant graphs is again circulant, but this is not the case with other products. In the present paper any \(B\)-product of two circulant graphs is proved to be a metacirculant graph with parameters that are easily ...
Robin S. Sanders, Sanders, Robin S.
openaire +2 more sources
The hyperbolicity constant of infinite circulant graphs [PDF]
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 +2 more sources
Discrete Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jason I. Brown, Richard Hoshino
openaire +3 more sources
Combinatorial refinement on circulant graphs
computational complexity, 2022 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
Kluge, Laurence
core +4 more sources
Circulant Double Coverings of a Circulant Graph of Valency Four
Graphs and Combinatorics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, RQ, Kwak, JH
openaire +4 more sources
On magic and supermagic circulant graphs
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semaničová, Andrea
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.
Muzychuk, Mikhail, Mikhail Muzychuk
openaire +2 more sources
On Dispersability of Some Circulant Graphs [PDF]
Journal of Graph Algorithms and Applications, 2022 20 pages, 14 figures, accepted for publication in the Journal of Graph Algorithms and ...
Paul C. Kainen +2 more
openaire +3 more sources
On Embeddings of Circulant Graphs [PDF]
The Electronic Journal of Combinatorics, 2015 A circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$, and as such, admits a transitive action of $\mathbb{Z}_n$ on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces.
Conder, Marston, Grande, Ricardo
openaire +3 more sources