Results 21 to 30 of about 8,142 (196)
Graphs having no quantum symmetry [PDF]
, 2006 We consider circulant graphs having $p$ vertices, with $p$ prime. To any such graph we associate a certain number $k$, that we call type of the graph. We prove that for $p>>k$ the graph has no quantum symmetry, in the sense that the quantum automorphism ...
Banica, Teodor +2 more
core +4 more sources
Resolvability in Subdivision of Circulant Networks Cn1,k
Discrete Dynamics in Nature and Society, 2020 Circulant networks form a very important and widely explored class of graphs due to their interesting and wide-range applications in networking, facility location problems, and their symmetric properties.
Jianxin Wei +3 more
doaj +1 more source
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 ...
Kainen, Paul C. +2 more
openaire +3 more sources
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
Stability of circulant graphs [PDF]
Journal of Combinatorial Theory, Series B, 2019 The canonical double cover $\mathrm{D}(Γ)$ of a graph $Γ$ is the direct product of $Γ$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(Γ))=\mathrm{Aut}(Γ)\times\mathbb{Z}_2$ then $Γ$ is called stable; otherwise $Γ$ is called unstable. An unstable graph is nontrivially unstable if it is connected, non-bipartite and distinct vertices have different neighborhoods.
Yan-Li Qin, Binzhou Xia, Sanming Zhou
openaire +2 more sources
Linear Algebra and its Applications, 2022 26 ...
Ivan Damnjanović, Dragan Stevanović
openaire +2 more sources
Counting 2-circulant graphs [PDF]
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1985 AbstractAlspach and Sutcliffe call a graph X(S, q, F) 2-circulant if it consists of two isomorphic copies of circulant graphs X(p, S) and X(p, qS) on p vertices with “cross-edges” joining one another in a prescribed manner. In this paper, we enumerate the nonisomorphic classes of 2-circulant graphs X(S, q, F) such that |S| = m and |F| = k.
Chia, Gek-Ling, Lim, Chong-Keang
openaire +2 more sources
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
Cohen–Macaulay Circulant Graphs [PDF]
Communications in Algebra, 2014 Let G be the circulant graph C n (S) with , and let I(G) denote the edge ideal in the ring R = k[x 1,…, x n ]. We consider the problem of determining when G is Cohen–Macaulay, i.e, R/I(G) is a Cohen–Macaulay ring. Because a Cohen–Macaulay graph G must be well-covered, we focus on known families of well-covered circulant graphs of the form C n (1, 2 ...
Kevin N. Vander Meulen +2 more
openaire +1 more source