A kind of conditional connectivity of Cayley graphs generated by wheel graphs
From MaRDI portal
Publication:1735259
DOI10.1016/j.amc.2016.12.015zbMath1411.05120OpenAlexW2569222324MaRDI QIDQ1735259
Yukang Zhou, Guifu Su, Jian-hua Tu
Publication date: 28 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2016.12.015
Related Items
Reliability analysis of the cactus-based networks ⋮ The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Equal relation between \(g\)-good-neighbor diagnosability under the PMC model and \(g\)-good-neighbor diagnosability under the MM\(^\ast\) model of a graph ⋮ Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model ⋮ Two kinds of generalized connectivity of dual cubes ⋮ The 1-good neighbor connectivity of unidirectional star graph networks ⋮ Super \(R^k\)-vertex-connectedness ⋮ Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions ⋮ The \(1,2\)-good-neighbor conditional diagnosabilities of regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Some conditional vertex connectivities of complete-transposition graphs
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- A kind of conditional vertex connectivity of star graphs
- A survey of integrity
- A faster algorithm for computing the strength of a network
- A kind of conditional fault tolerance of alternating group graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Linearly many faults in Cayley graphs generated by transposition trees
- Toughness in graphs -- a survey
- Cyclic Vertex Connectivity of Star Graphs
- Optimal attack and reinforcement of a network
- Transposition networks as a class of fault-tolerant robust networks
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
This page was built for publication: A kind of conditional connectivity of Cayley graphs generated by wheel graphs