Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition

1998 ◽  
pp. 227-241 ◽  
Author(s):  
G. Gauyacq ◽  
C. Micheneau ◽  
A. Raspaud
Keyword(s):  
Circulant Graphs ◽  
Hamiltonian Decomposition

scholarly journals On hamiltonian decompositions of tensor products of graphs

2019 ◽  
Vol 13 (1) ◽  
pp. 178-202
Author(s):  
P. Paulraja ◽  
Kumar Sampath
Keyword(s):  
Graph Theory ◽  
Tensor Product ◽  
Tensor Products ◽  
Circulant Graph ◽  
Circulant Graphs ◽  
Hamiltonian Decompositions ◽  
Hamiltonian Decomposition

Finding a hamiltonian decomposition of G is one of the challenging problems in graph theory. We do not know for what classes of graphs G and H, their tensor product G x H is hamiltonian decomposable. In this paper, we have proved that, if G is a hamiltonian decomposable circulant graph with certain properties and H is a hamiltonian decomposable multigraph, then G x H is hamiltonian decomposable. In particular, tensor products of certain sparse hamiltonian decomposable circulant graphs are hamiltonian decomposable.

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.

scholarly journals Some star extremal circulant graphs

2003 ◽  
Vol 271 (1-3) ◽  
pp. 169-177 ◽  
Author(s):  
Wensong Lin
Keyword(s):  
Circulant Graphs

Kernel in Oriented Circulant Graphs

2009 ◽  
pp. 396-407 ◽  
Author(s):  
Paul Manuel ◽  
Indra Rajasingh ◽  
Bharati Rajan ◽  
Joice Punitha
Keyword(s):  
Circulant Graphs

scholarly journals Cycle Embedding in Generalized Recursive Circulant Graphs

2018 ◽  
Vol E101.D (12) ◽  
pp. 2916-2921
Author(s):  
Shyue-Ming TANG ◽  
Yue-Li WANG ◽  
Chien-Yi LI ◽  
Jou-Ming CHANG
Keyword(s):  
Circulant Graphs
Sign in / Sign up

Export Citation Format

Share Document