Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
From MaRDI portal
(Redirected from Publication:6669825)
Recommendations
- Bounding neighbor-connectivity of Abelian Cayley graphs
- A new bound for neighbor-connectivity of abelian Cayley graphs
- Neighbor connectivity of two kinds of Cayley graphs
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Hamiltonian connectivity of 2-tree-generated networks
Cites work
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Extra (component) connectivity and diagnosability of bubble sort networks
- Fault resiliency of Cayley graphs generated by transpositions
- Graph theoretic reliability analysis for the Boolean n cube networks
- scientific article; zbMATH DE number 3628999 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 2187684 (Why is no real title available?)
- Linearly many faults in Cayley graphs generated by transposition trees
- Neighbor connectivity of two kinds of Cayley graphs
- Neighbour-connectivity in regular graphs
- On connectivity of the cartesian product of two graphs
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- Structure connectivity and substructure connectivity of star graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The generalized 3-connectivity of star graphs and bubble-sort graphs
This page was built for publication: Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6669825)
