Hamiltonian laceability of bubble-sort graphs with edge faults-Reference-Cited by-同舟云学术

Hamiltonian laceability of bubble-sort graphs with edge faults

Published:2007-07 Issue:13 Volume:177 Page:2679-2691
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Araki Toru,Kikuchi Yosuke

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference15 articles.

1. A group-theoretic model for symmetric interconnection networks;Akers;IEEE Transactions on Computers,1989

2. Complete path embeddings in crossed cubes;Fan;Information Sciences,2006

3. Longest fault-free paths in hypercubes with vertex faults;Fu;Information Sciences,2006

4. Hamiltonian-laceability of star graphs;Hsieh;Networks,2000

5. K. Kaneko, Y. Suzuki, Node-to-node internally disjoint paths problem in bubble-sort graphs, in: Proceeding of 10th IEEE Pacific Rim International Symposium on Dependable Computing, 2004, pp. 173–182.

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree;Discrete Applied Mathematics;2024-10

2. The Strong Connectivity of Bubble-Sort Graphs;Advances in Applied Mathematics;2024

3. A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks;Journal of Parallel and Distributed Computing;2023-11

4. Novel schemes for embedding Hamiltonian paths and cycles in balanced hypercubes with exponential faulty edges;Journal of Parallel and Distributed Computing;2023-07

5. The spanning cyclability of Cayley graphs generated by transposition trees;Discrete Applied Mathematics;2023-03