Fault-tolerant hamiltonian connectivity of the WK-recursive networks
| Autor: | Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu, Cheng-Kuan Lin |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Vertex (graph theory)
Discrete mathematics Information Systems and Management Complete graph Fault tolerance Hamiltonian path Computer Science Applications Theoretical Computer Science Combinatorics symbols.namesake Artificial Intelligence Control and Systems Engineering symbols Software Mathematics Hamiltonian path problem |
| Zdroj: | Information Sciences. 271:236-245 |
| ISSN: | 0020-0255 |
| DOI: | 10.1016/j.ins.2014.02.087 |
| Popis: | Many research on the WK-recursive network has been published during the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity of the WK-recursive network. We use K ( d , t ) to denote the WK-recursive network of level t , each of which basic modules is a d -vertex complete graph, where d > 1 and t ⩾ 1 . The fault-tolerant hamiltonian connectivity H f κ ( G ) is defined to be the maximum integer k such that G is k fault-tolerant hamiltonian connected if G is hamiltonian connected and is undefined otherwise. In this paper, we prove that H f κ ( K ( d , t ) ) = d - 4 if d ⩾ 4 . |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect