Proof that pyramid networks are 1-Hamiltonian-connected with high probability-Reference-Cited by-同舟云学术

Proof that pyramid networks are 1-Hamiltonian-connected with high probability

Published:2007-10 Issue:19 Volume:177 Page:4188-4199
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Duh Dyi-Rong,Chen Yi-Ching,Wu Ruei-Yu

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. An efficient selection algorithm on the pyramid;Aggarwal;Information Processing Letters,1995

2. Embedding and reconfiguration of spanning trees in faulty hypercubes;Avresky;IEEE Transactions on Parallel and Distributed Systems,1999

3. A Textbook of Graph Theory;Balakrishnan,1999

4. 9-connected claw-free graphs are Hamiltonian-connected;Brandt;Journal of Combinatorial Theory Series B,1999

5. Fault tolerance properties of pyramid networks;Cao;IEEE Transactions on Computers,1999

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

1. Matching Preclusion for Enhanced Pyramid Networks;Journal of Interconnection Networks;2019-09

2. Some new topological properties of the triangular pyramid networks;Information Sciences;2013-11

3. The spanning laceability on the faulty bipartite hypercube-like networks;Applied Mathematics and Computation;2013-04

4. ω-wide diameters of enhanced pyramid networks;Theoretical Computer Science;2011-07

5. An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs;Journal of Information Processing Systems;2011-03-31