Results 11 to 20 of about 8,162 (190)
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 +4 more sources
Resolvability in Subdivision Graph of Circulant Graphs
Symmetry, 2023 Circulant networks are a very important and widely studied class of graphs due to their interesting and diverse applications in networking, facility location problems, and their symmetric properties. The structure of the graph ensures that it is symmetric about any line that cuts the graph into two equal parts.
Syed Ahtsham Ul Haq Bokhary +5 more
openaire +3 more sources
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Typical circulant double coverings of a circulant graph
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Feng, RQ, Kwak, JH
openaire +5 more sources
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 +3 more sources
Computational and Mathematical MethodsThe generalized Mycielskian graphs are known for their advantageous properties employed in interconnection networks in parallel computing to provide efficient and optimized network solutions. This paper focuses on investigating the bounds and computation
Pooja Danushri Namidass +1 more
doaj +2 more sources
Layout of random circulant graphs [PDF]
Linear Algebra and its Applications, 2018 A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{ 1,\ldots,\lceil\frac{n-1}{2}\rceil\right\} . A random circulant graph results from deleting edges of H with probability 1-p.
Sebastian Richter, Israel Rocha
openaire +3 more sources
Domination in Cayley graphs: A survey
AKCE International Journal of Graphs and Combinatorics, 2019 Let be a symmetric generating set of a finite group . Assume that be such that and satisfies the two conditions : the identity element and : if , then Given satisfying and define a Cayley graph with and .
T. Tamizh Chelvam, M. Sivagami
doaj +2 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
Electronic Journal of Graph Theory and Applications, 2021 A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj +1 more source