The Spanning Connectivity of the Burnt Pancake Graphs
Authors:
- 1 January 2009
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E92-D (3) , 389-400
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- Graph Theory and Interconnection Networks2008
- On the equitable k *-laceability of hypercubesJournal of Combinatorial Optimization, 2007
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHSInternational Journal of Foundations of Computer Science, 2006
- The super laceability of the hypercubesInformation Processing Letters, 2004
- A 2-approximation algorithm for genome rearrangements by reversals and transpositionsTheoretical Computer Science, 1999
- On the Diameter of the Pancake NetworkJournal of Algorithms, 1997
- On the problem of sorting burnt pancakesDiscrete Applied Mathematics, 1995
- A group-theoretic model for symmetric interconnection networksIEEE Transactions on Computers, 1989
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935