Conditional connectivity of star graph networks under embedding restriction
From MaRDI portal
Publication:712688
DOI10.1016/j.ins.2012.02.025zbMath1248.68103OpenAlexW2020274332MaRDI QIDQ712688
Publication date: 17 October 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2012.02.025
Related Items (14)
Embedded connectivity of recursive networks ⋮ Structure connectivity and substructure connectivity of split-star networks ⋮ Embedded edge connectivity of \(k\)-ary \(n\)-cubes ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Reliability of \(m\)-ary \(n\)-dimensional hypercubes under embedded restriction ⋮ Embedded Edge-Connectivity Reliability Evaluation of Augmented Hypercube Interconnection Networks ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ The \(h\)-restricted connectivity of balanced hypercubes ⋮ An optimal time algorithm for minimum linear arrangement of chord graphs ⋮ Hamiltonian properties of honeycomb meshes ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Embedded connectivity of ternary \(n\)-cubes ⋮ Structure connectivity and substructure connectivity of star graphs
Cites Work
- Unnamed Item
- Edge fault tolerance of graphs with respect to super edge connectivity
- Edge fault tolerance of super edge connectivity for three families of interconnection networks
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Super \(p\)-restricted edge connectivity of line graphs
- Fault tolerance in bubble-sort graph networks
- Substar reliability analysis in star networks
- Orienting Cayley graphs generated by transposition trees
- K-restricted edge connectivity for some interconnection networks
- Improving bounds on link failure tolerance of the star graph
- Strong structural properties of unidirectional star graphs
- Fault-free longest paths in star networks with conditional link faults
- On 3-restricted edge connectivity of undirected binary Kautz graphs
- A kind of conditional vertex connectivity of star graphs
- On the 3-restricted edge connectivity of permutation graphs
- The \(k\)-restricted edge connectivity of undirected Kautz graphs
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- A kind of conditional fault tolerance of alternating group graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Cuts leaving components of given minimum order
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- On the extraconnectivity of graphs
- A bound on 4-restricted edge connectivity of graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- Conditional connectivity
- A group-theoretic model for symmetric interconnection networks
- Fault Tolerance on Star Graphs
- Longest fault-free paths in star graphs with vertex faults
This page was built for publication: Conditional connectivity of star graph networks under embedding restriction
