The super connectivity of the pancake graphs and the super laceability of the star graphs
From MaRDI portal
Publication:557901
Recommendations
Cites work
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- Bounds for sorting by prefix reversal
- Decomposing a star graph into disjoint cycles
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Embedding complete binary trees into star and Pancake graphs
- Fault tolerant routing in the star and pancake interconnection networks
- Graph theory
- Hamiltonian-laceability of star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- On \(3^*\)-connected graphs
- On the Diameter of the Pancake Network
- On the embedding of cycles in pancake graphs
- On the fault-diameter of the star graph
- On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network
- Ring embedding in faulty pancake graphs
Cited in
(34)- Neighbor connectivity of pancake graphs and burnt pancake graphs
- On the spanning connectivity of tournaments
- The super laceability of the hypercubes
- On the spanning connectivity of graphs
- The super-connected property of recursive circulant graphs
- Survey on path and cycle embedding in some networks
- Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
- THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS
- The super spanning connectivity of arrangement graphs
- On the spanning fan-connectivity of graphs
- On cubic 2-independent Hamiltonian connected graphs
- Fault tolerance and diagnosability of burnt pancake networks under the comparison model
- On Some Structural Properties of Star and Pancake Graphs
- Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
- On the spanning connectivity and spanning laceability of hypercube-like networks
- Component (edge) connectivity of pancake graphs
- One-to-one disjoint path covers on multi-dimensional tori
- Conditional matching preclusion for the arrangement graphs
- The spanning laceability on the faulty bipartite hypercube-like networks
- Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
- The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks
- The spanning connectivity of folded hypercubes
- Fault-tolerant panconnectivity of augmented cubes
- Disjoint cycles in hypercubes with prescribed vertices in each cycle
- On the equitable \(k^{*}\)-laceability of hypercubes
- A new approach to finding the extra connectivity of graphs
- 2-spanning cyclability problems of some generalized Petersen graphs
- The super spanning connectivity and super spanning laceability of tori with faulty elements
- On spanning connected graphs
- The \(3^{*}\)-connected property of pyramid networks
- Structure connectivity and substructure connectivity of star graphs
- Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
- Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
- The spanning connectivity of line 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)
