-edge-fault-tolerant weak-pancyclicity of-star graphs
Authors:
- Dyi-Rong DuhDDDyi-Rong Duh
- Tzu-Lung ChenTCTzu-Lung Chen
- Yue-Li WangYWYue-Li Wang
- 1 January 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 516, 28-39
Abstract
No abstract availableFunding Information
- National Science Council of the Republic of China, Taiwan (NSC 97-2221-E-260-001-, NSC 101-2221-E-146-014-)
This publication has 26 references indexed in Scilit:
- Weak-vertex-pancyclicity of (n, k)-star graphsTheoretical Computer Science, 2008
- Embedding of Cycles in Twisted Cubes with Edge-PancyclicAlgorithmica, 2007
- Geodesic-pancyclic graphsDiscrete Applied Mathematics, 2007
- Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edgesIEEE Transactions on Computers, 2006
- Node-pancyclicity and edge-pancyclicity of crossed cubesInformation Processing Letters, 2005
- Panconnectivity, fault‐tolerant hamiltonicity and hamiltonian‐connectivity in alternating group graphsNetworks, 2004
- TOPOLOGICAL PROPERTIES OF THE (n,k)-STAR GRAPHInternational Journal of Foundations of Computer Science, 1998
- The (n, k)-star graph: A generalized star graphInformation Processing Letters, 1995
- Cycles in bipartite tournamentsJournal of Combinatorial Theory, Series B, 1982
- Pancyclic graphs IJournal of Combinatorial Theory, Series B, 1971