Hamiltonian-laceability of star graphs
Top Cited Papers
- 6 November 2000
- Vol. 36 (4) , 225-232
- https://doi.org/10.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-g
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optimal information dissemination in star and pancake networksIEEE Transactions on Parallel and Distributed Systems, 1996
- Balanced spanning trees in complete and incomplete star graphsIEEE Transactions on Parallel and Distributed Systems, 1996
- Embedding an arbitrary binary tree into the star graphIEEE Transactions on Computers, 1996
- Optimal Communication Algorithms on Star Graphs Using Spanning Tree ConstructionsJournal of Parallel and Distributed Computing, 1995
- A parallel algorithm for computing Fourier transforms on the star graphIEEE Transactions on Parallel and Distributed Systems, 1994
- A comparative study of topological properties of hypercubes and star graphsIEEE Transactions on Parallel and Distributed Systems, 1994
- On the fault-diameter of the star graphInformation Processing Letters, 1993
- Optimal broadcasting on the star graphIEEE Transactions on Parallel and Distributed Systems, 1992
- EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHSJournal of Circuits, Systems and Computers, 1991
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989