Results 21 to 30 of about 990 (211)
On Solvable Groups and Circulant Graphs
European Journal of Combinatorics, 2000 Let ϕ be Euler’s phi function. We prove that a vertex-transitive graph Ɣ of order n, with gcd(n, ϕ(n)) = 1, is isomorphic to a circulant graph of order n if and only if Aut(Ɣ) contains a transitive solvable subgroup.
Edward Dobson, Dobson, Edward
core +2 more sources
The Existence of Selfcomplementary Circulant Graphs
European Journal of Combinatorics, 1996 All values ofnfor which there exist a selfcomplementary circulant graph of ordernare ...
Širáň, Jozef +2 more
core +2 more sources
Products of circulant graphs are metacirculant
Journal of Combinatorial Theory, Series B, 2002 The standard products—cartesian, lexicographic, tensor, and strong—all belong to a class of products introduced by W. Imrich and H. Izbicki (1975, Monatsh. Math.80, 277–281) and later called B-products by I. Broere and J. H. Hattingh (1990, Quaest.
Robin S. Sanders, Sanders, Robin S.
core +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 magic and supermagic circulant graphs
Discrete Mathematics, 2006 A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex.
Semaničová, Andrea
core +2 more sources
On the chromatic number of circulant graphs
Discrete Mathematics, 2009 Given a set D of a cyclic group C, we study the chromatic number of the circulant graph G(C,D) whose vertex set is C, and there is an edge ij whenever i−j∈D∪−D.
Serra, Oriol, Barajas, Javier
core +2 more sources
HS-integral and Eisenstein integral mixed circulant graphs
Theory and Applications of Graphs, 2023 A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers.
Monu Kadyan, Bikash Bhattacharjya
doaj +1 more source
Alexandria Engineering Journal, 2022 Graph theory is a powerful and essential tool for applied scientists and engineers in analyzing and designing algorithms for several problems. Graph theory has a vital role in complex systems, especially in computer sciences. Applications of graph theory
A. El-Mesady +2 more
doaj +1 more source
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
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