Combinatorial properties of modified chordal rings degree four networks
Farah, R.N. and Othman, M. and Selamat, M.H. (2010) Combinatorial properties of modified chordal rings degree four networks. Journal of Computer Science, 6 (3). pp. 279-284. ISSN 1549-3636
Full text not available from this repository.
Problem statement: Modified Chordal Rings Degree Four, called CHRm4 is the first modified structure of chordal rings. This CHRm4 is an undirected circulant graph and is a double loop graph. Approach: This study presented the main properties of CHRm4. There are connectivity, Hamiltonian cycle and asymmetric. Results: Several definitions, postulates, corollary, theorems and lemmas were constructed according to these three main properties. It is about interconnection between nodes, how the Hamiltonian cycle was occurred and why CHRm4 is not symmetric. Conclusion: From these three properties, there are two dominant properties obviously shown that the CHRm4 is contrary from the previous traditional Chordal Rings Degree Four (CR4). It is connectivity and asymmetric. There are different connections for odd and even nodes, therefore CHRm4 is not symmetric. The Hamiltonian cycle property has the same concept with CR4.
|Keyword:||Circulant graphs; Interconnection network; Connectivity; Hamiltonian cycle; Asymmetric; Computer network; Parallel computing|
|Subject:||Computer networks - Mathematical models|
|Faculty or Institute:||Faculty of Computer Science and Information Technology|
|Deposited By:||Umikalthom Abdullah|
|Deposited On:||29 Mar 2012 04:31|
|Last Modified:||13 Dec 2012 03:09|
Repository Staff Only: Edit item detail
Document Download Statistics
This item has been downloaded for since 29 Mar 2012 04:31.