Connected Cubic Network Graph
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 th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2017-06-01
|
| Series: | Engineering Science and Technology, an International Journal |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2215098617303439 |
| _version_ | 1818721136041525248 |
|---|---|
| author | Burhan Selçuk Ali Karci |
| author_facet | Burhan Selçuk Ali Karci |
| author_sort | Burhan Selçuk |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-17T20:33:56Z |
| format | Article |
| id | doaj.art-87a1803bd12342dd94860209fa16a8f1 |
| institution | Directory Open Access Journal |
| issn | 2215-0986 |
| language | English |
| last_indexed | 2024-12-17T20:33:56Z |
| publishDate | 2017-06-01 |
| publisher | Elsevier |
| record_format | Article |
| series | Engineering Science and Technology, an International Journal |
| spelling | doaj.art-87a1803bd12342dd94860209fa16a8f12022-12-21T21:33:30ZengElsevierEngineering Science and Technology, an International Journal2215-09862017-06-0120393494310.1016/j.jestch.2017.04.005Connected Cubic Network GraphBurhan Selçuk0Ali Karci1Computer Engineering Department, Karabük University, Karabük, TurkeyComputer Engineering Department, İnönü University, Malatya, TurkeyHypercube 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.http://www.sciencedirect.com/science/article/pii/S2215098617303439Hamilton pathHypercubeGray codeInterconnection networkConnected Cubic Network Graph |
| spellingShingle | Burhan Selçuk Ali Karci Connected Cubic Network Graph Engineering Science and Technology, an International Journal Hamilton path Hypercube Gray code Interconnection network Connected Cubic Network Graph |
| title | Connected Cubic Network Graph |
| title_full | Connected Cubic Network Graph |
| title_fullStr | Connected Cubic Network Graph |
| title_full_unstemmed | Connected Cubic Network Graph |
| title_short | Connected Cubic Network Graph |
| title_sort | connected cubic network graph |
| topic | Hamilton path Hypercube Gray code Interconnection network Connected Cubic Network Graph |
| url | http://www.sciencedirect.com/science/article/pii/S2215098617303439 |
| work_keys_str_mv | AT burhanselcuk connectedcubicnetworkgraph AT alikarci connectedcubicnetworkgraph |