A kind of conditional connectivity of Cayley graphs generated by wheel graphs
From MaRDI portal
Publication:1735259
DOI10.1016/J.AMC.2016.12.015zbMATH Open1411.05120OpenAlexW2569222324MaRDI QIDQ1735259FDOQ1735259
Authors: Yukang Zhou, Guifu Su, Jianhua 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
Recommendations
- The classification problem for operator algebraic varieties and their multiplier algebras
- The complexity of the homeomorphism relation between compact metric spaces
- The noncommutative Choquet Boundary III
- Turbulence, orbit equivalence, and the classification of nuclear \(C^*\)-algebras
- Borel equivalence relations in the space of bounded operators
Cites Work
- Graph theory
- A kind of conditional vertex connectivity of star graphs
- 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
- Graph theory with applications
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
- Fault-tolerant edge-pancyclicity of locally twisted cubes
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Transposition networks as a class of fault-tolerant robust networks
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- A survey of integrity
- Toughness in graphs -- a survey
- Cyclic Vertex Connectivity of Star Graphs
- Optimal attack and reinforcement of a network
- A faster algorithm for computing the strength of a network
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
- Some conditional vertex connectivities of complete-transposition graphs
Cited In (14)
- Reliability analysis of the cactus-based networks
- The 1-good neighbor connectivity of unidirectional star graph networks
- Two kinds of generalized connectivity of dual cubes
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- Super \(R^k\)-vertex-connectedness
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- 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
- Subhomogeneous Operator Systems and Classification of Operator Systems Generated by $\Lambda$-Commuting Unitaries
- The \(1,2\)-good-neighbor conditional diagnosabilities of regular graphs
- Title not available (Why is that?)
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
This page was built for publication: A kind of conditional connectivity of Cayley graphs generated by wheel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735259)