Connected Cubic Network Graph
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier - Division Reed Elsevier India Pvt Ltd
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Hypercube is a popular interconnection network. Due to the popularity of hypercube, more researchers pay a great effort to develop the different variants of hypercube. In this paper, we have proposed a variant of hypercube which is called as Connected Cubic Network Graphs, and have investigated the Hamilton-like properties of Connected Cubic Network Graphs (CCNG). Firstly, we defined CCNG and showed the characteristic analyses of CCNG. Then, we showed that the CCNG has the properties of Hamilton graph, and can be labeled using a Gray coding based recursive algorithm. Finally, we gave the comparison results, a routing algorithm and a bitonic sort algorithm for CCNG. In case of sparsity and cost, CCNG is better than Hypercube. (C) 2017 Karabuk University. Publishing services by Elsevier B.V.
Açıklama
Anahtar Kelimeler
Hamilton path, Hypercube, Gray code, Interconnection network, Connected Cubic Network Graph
Kaynak
Engineering Science and Technology-An International Journal-Jestech
WoS Q Değeri
N/A
Scopus Q Değeri
Q1
Cilt
20
Sayı
3
