A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
From MaRDI portal
(Redirected from Publication:497258)
Recommendations
- A kind of conditional connectivity of transposition networks generated by k-trees
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- A kind of conditional vertex connectivity of Cayley graphs generated by transposition trees
- Conditional connectivity of Cayley graphs generated by transposition trees
Cites work
- A kind of conditional fault tolerance of alternating group graphs
- A kind of conditional vertex connectivity of star graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- Extraconnectivity of graphs with large girth
- Extraconnectivity of hypercubes
- Fault resiliency of Cayley graphs generated by transpositions
- Generalized measures of fault tolerance in hypercube networks
- Graph theory with applications
- scientific article; zbMATH DE number 1054728 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 857069 (Why is no real title available?)
- Linearly many faults in Cayley graphs generated by transposition trees
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The existence and upper bound for two types of restricted connectivity
Cited in
(33)- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- A kind of conditional connectivity of transposition networks generated by k-trees
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs
- Reliability analysis of Cayley graphs generated by transpositions
- Super \(R^k\)-vertex-connectedness
- Embedded connectivity of ternary \(n\)-cubes
- Reliability assessment for modified bubble-sort networks
- Structure fault tolerance of WK-recursive networks
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- The fault tolerance of \(( n , k )\)-bubble-sort networks
- Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
- The 3-good-neighbor connectivity of modified bubble-sort graphs
- Structure fault tolerance of \(k\)-ary \(n\)-cube networks
- The \(1,2\)-good-neighbor conditional diagnosabilities of regular graphs
- Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM^ model of a graph
- Path and cycle fault tolerance of bubble-sort graph networks
- Structure connectivity and substructure connectivity of hypercubes
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- Conditional connectivity of recursive interconnection networks respect to embedding restriction
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Some conditional vertex connectivities of complete-transposition graphs
- Relation of extra edge connectivity and component edge connectivity for regular networks
- Component (edge) connectivity of pancake graphs
- The (n,k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph
- Fault-tolerant strong Menger connectivity of modified bubble-sort graphs
- Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
- Edge-fault-tolerant edge-bipancyclicity of modified bubble-sort graphs
- Fault tolerability of Cayley graphs generated by transposition unicyclic graphs with a triangle
- Packing internally disjoint Steiner paths of modified bubble-sort networks
- The strong diagnosability of multiprocessor systems under the PMC model
- \(\{ 1, 2 \}\)-good-neighbor conditional diagnosability of Cayley graphs generated by \(k\)-trees
- A characterization of 1, 2-extra-cut set for hierarchical graph
- Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
This page was built for publication: A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497258)