The super connectivity of the pancake graphs and the super laceability of the star graphs
From MaRDI portal
Publication:557901
DOI10.1016/J.TCS.2005.02.007zbMATH Open1074.05054OpenAlexW2013391457MaRDI QIDQ557901FDOQ557901
Authors: Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu 
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.02.007
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)
Cites Work
- Graph theory
- A group-theoretic model for symmetric interconnection networks
- Title not available (Why is that?)
- On the embedding of cycles in pancake graphs
- Hyper Hamiltonian laceability on edge fault star graph
- On the fault-diameter of the star graph
- Bounds for sorting by prefix reversal
- On the Diameter of the Pancake Network
- Hamiltonian-laceability of star graphs
- On \(3^*\)-connected graphs
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Ring embedding in faulty pancake graphs
- Decomposing a star graph into disjoint cycles
- Embedding complete binary trees into star and Pancake graphs
- Fault tolerant routing in the star and pancake interconnection networks
Cited In (34)
- Conditional matching preclusion for the arrangement graphs
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- Component (edge) connectivity of pancake graphs
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- On cubic 2-independent Hamiltonian connected graphs
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Fault-tolerant panconnectivity of augmented cubes
- On spanning connected graphs
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- One-to-one disjoint path covers on multi-dimensional tori
- Survey on path and cycle embedding in some networks
- The Super Spanning Connectivity of Arrangement Graphs
- The \(3^{*}\)-connected property of pyramid networks
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- The super laceability of the hypercubes
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- On the equitable \(k^{*}\)-laceability of hypercubes
- THE SUPER SPANNING CONNECTIVITY AND SUPER SPANNING LACEABILITY OF TORI WITH FAULTY ELEMENTS
- The spanning laceability on the faulty bipartite hypercube-like networks
- Structure connectivity and substructure connectivity of star graphs
- On Some Structural Properties of Star and Pancake Graphs
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- 2-spanning cyclability problems of some generalized Petersen graphs
- The super-connected property of recursive circulant graphs
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- The spanning connectivity of folded hypercubes
- The spanning connectivity of line graphs
- On the spanning connectivity of graphs
- On the spanning fan-connectivity of graphs
- A new approach to finding the extra connectivity of graphs
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- On the spanning connectivity of tournaments
- Neighbor connectivity of pancake graphs and burnt pancake graphs
This page was built for publication: The super connectivity of the pancake graphs and the super laceability of the star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557901)
