Connected Cubic Network Graph

dc.authoridSelçuk, Burhan/0000-0002-5141-5148
dc.authoridKarci, Ali/0000-0002-8489-8617;
dc.authorwosidSelçuk, Burhan/JDV-5524-2023
dc.authorwosidKarci, Ali/AAG-5337-2019
dc.authorwosidKARCI, Ali/A-9604-2019
dc.contributor.authorSelcuk, Burhan
dc.contributor.authorKarci, Ali
dc.date.accessioned2024-08-04T20:43:13Z
dc.date.available2024-08-04T20:43:13Z
dc.date.issued2017
dc.departmentİnönü Üniversitesien_US
dc.description.abstractHypercube 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.en_US
dc.identifier.doi10.1016/j.jestch.2017.04.005
dc.identifier.endpage943en_US
dc.identifier.issn2215-0986
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85021375815en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage934en_US
dc.identifier.urihttps://doi.org/10.1016/j.jestch.2017.04.005
dc.identifier.urihttps://hdl.handle.net/11616/97867
dc.identifier.volume20en_US
dc.identifier.wosWOS:000410699300010en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherElsevier - Division Reed Elsevier India Pvt Ltden_US
dc.relation.ispartofEngineering Science and Technology-An International Journal-Jestechen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectHamilton pathen_US
dc.subjectHypercubeen_US
dc.subjectGray codeen_US
dc.subjectInterconnection networken_US
dc.subjectConnected Cubic Network Graphen_US
dc.titleConnected Cubic Network Graphen_US
dc.typeArticleen_US

Dosyalar