Circulant Double Coverings of a Circulant Graph of Valency Four

2005 ◽  
Vol 21 (4) ◽  
pp. 385-400
Author(s):  
Rongquan Feng ◽  
Jin Ho Kwak
Keyword(s):  
Circulant Graph ◽  
Double Coverings

scholarly journals Typical circulant double coverings of a circulant graph

2004 ◽  
Vol 277 (1-3) ◽  
pp. 73-85 ◽  
Author(s):  
Rongquan Feng ◽  
Jin Ho Kwak
Keyword(s):  
Circulant Graph ◽  
Double Coverings

scholarly journals The energy of integral circulant graphs with prime power order

2011 ◽  
Vol 5 (1) ◽  
pp. 22-36 ◽  
Author(s):  
J.W. Sander ◽  
T. Sander
Keyword(s):  
Adjacency Matrix ◽  
Prime Power ◽  
Prime Power Order ◽  
Circulant Graph ◽  
Closed Formula ◽  
Circulant Graphs ◽  
Vertex Set

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized by its vertex count n and a set D of divisors of n such that its vertex set is Zn and its edge set is {{a,b} : a, b ? Zn; gcd(a-b, n)? D}. For an integral circulant graph on ps vertices, where p is a prime, we derive a closed formula for its energy in terms of n and D. Moreover, we study minimal and maximal energies for fixed ps and varying divisor sets D.

Enumerating Typical Circulant Covering Projections Onto a Circulant Graph

2005 ◽  
Vol 19 (1) ◽  
pp. 196-207 ◽  
Author(s):  
Rongquan Feng ◽  
Jin Ho Kwak ◽  
Young Soo Kwon
Keyword(s):  
Circulant Graph

HAMILTONIAN PROPERTIES OF FAULTY RECURSIVE CIRCULANT GRAPHS

2002 ◽  
Vol 03 (03n04) ◽  
pp. 273-289 ◽  
Author(s):  
CHANG-HSIUNG TSAI ◽  
JIMMY J. M. TAN ◽  
YEN-CHU CHUANG ◽  
LIH-HSING HSU
Keyword(s):  
Bipartite Graph ◽  
Hamiltonian Path ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Vertex Set ◽  
Regular Node ◽  
Hamiltonian Properties

We present some results concerning hamiltonian properties of recursive circulant graphs in the presence of faulty vertices and/or edges. The recursive circulant graph G(N, d) with d ≥ 2 has vertex set V(G) = {0, 1, …, N - 1} and the edge set E(G) = {(v, w)| ∃ i, 0 ≤ i ≤ ⌈ log d N⌉ - 1, such that v = w + di (mod N)}. When N = cdk where d ≥ 2 and 2 ≤ c ≤ d, G(cdk, d) is regular, node symmetric and can be recursively constructed. G(cdk, d) is a bipartite graph if and only if c is even and d is odd. Let F, the faulty set, be a subset of V(G(cdk, d)) ∪ E(G(cdk, d)). In this paper, we prove that G(cdk, d) - F remains hamiltonian if |F| ≤ deg (G(cdk, d)) - 2 and G(cdk, d) is not bipartite. Moreover, if |F| ≤ deg (G(cdk, d)) - 3 and G(cdk, d) is not a bipartite graph, we prove a more stronger result that for any two vertices u and v in V(G(cdk, d)) - F, there exists a hamiltonian path of G(cdk, d) - F joining u and v.

scholarly journals Pretty Good State Transfer on Circulant Graphs

10.37236/6388 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Hiranmoy Pal ◽  
Bikash Bhattacharjya
Keyword(s):  
Complex Number ◽  
Adjacency Matrix ◽  
Transition Matrix ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Real Numbers ◽  
Cartesian Products ◽  
Edge Disjoint ◽  
State Transfer ◽  
Good State

Let $G$ be a graph with adjacency matrix $A$. The transition matrix of $G$ relative to $A$ is defined by $H(t):=\exp{\left(-itA\right)}$, where $t\in {\mathbb R}$. The graph $G$ is said to admit pretty good state transfer between a pair of vertices $u$ and $v$ if there exists a sequence of real numbers $\{t_k\}$ and a complex number $\gamma$ of unit modulus such that $\lim\limits_{k\rightarrow\infty} H(t_k) e_u=\gamma e_v.$ We find that the cycle $C_n$ as well as its complement $\overline{C}_n$ admit pretty good state transfer if and only if $n$ is a power of two, and it occurs between every pair of antipodal vertices. In addition, we look for pretty good state transfer in more general circulant graphs. We prove that union (edge disjoint) of an integral circulant graph with a cycle, each on $2^k$ $(k\geq 3)$ vertices, admits pretty good state transfer. The complement of such union also admits pretty good state transfer. Using Cartesian products, we find some non-circulant graphs admitting pretty good state transfer.

scholarly journals Quasi-Random Graphs, Pseudo-Random Graphs and Pseudorandom Binary Sequences, I. (Quasi-Random Graphs)

2019 ◽  
Vol 14 (2) ◽  
pp. 103-126
Author(s):  
József Borbély ◽  
András Sárközy
Keyword(s):  
Random Graphs ◽  
Adjacency Matrix ◽  
Binary Sequence ◽  
Binary Sequences ◽  
Circulant Graph ◽  
Large Families

AbstractIn the last decades many results have been proved on pseudo-randomness of binary sequences. In this series our goal is to show that using many of these results one can also construct large families of quasi-random, pseudo-random and strongly pseudo-random graphs. Indeed, it will be proved that if the first row of the adjacency matrix of a circulant graph forms a binary sequence which possesses certain pseudorandom properties (and there are many large families of binary sequences known with these properties), then the graph is quasi-random, pseudo-random or strongly pseudo-random, respectively. In particular, here in Part I we will construct large families of quasi-random graphs along these lines. (In Parts II and III we will present and study constructions for pseudo-random and strongly pseudo-random graphs, respectively.)

Sign in / Sign up

Export Citation Format

Share Document