Name
Abstract | ||
|---|---|---|
Gaussian networks are degree four symmetric networks and these are designed based on the concept of Gaussian integers. The Gaussian network can be described in terms of a generator = a + bi, where a and b are integers and i = p 1. When gcd(a; b) = 1, how to find edge disjoint Hamiltonian cycles has been shown before. In this paper for any generator = a + bi; even when gcd(a; b) = d > 1, how to obtain two edge disjoint Hamiltonian cycles in these networks is described. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TC.2015.2409843 | Computers, IEEE Transactions |
Keywords | Field | DocType |
gaussian networks,hamiltonian cycles,interconnection networks,parallel processing,algorithm design and analysis,network topology,generators,topology | Integer,Discrete mathematics,Gaussian integer,Combinatorics,Disjoint sets,Hamiltonian (quantum mechanics),Parallel processing,Network topology,Gaussian,Multiprocessor interconnection,Mathematics | Journal |
Volume | Issue | ISSN |
PP | 99 | 0018-9340 |
Citations | PageRank | References |
2 | 0.37 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bader Albader | 1 | 21 | 1.43 |
| Bella Bosa | 2 | 1282 | 125.07 |