Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs
From MaRDI portal
Publication:6669825
DOI10.5614/ejgta.2024.12.2.13MaRDI QIDQ6669825
Publication date: 22 January 2025
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- Structure connectivity and substructure connectivity of star graphs
- Neighbour-connectivity in regular graphs
- On connectivity of the cartesian product of two graphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Conditional connectivity of Cayley graphs generated by transposition trees
- Neighbor connectivity of two kinds of Cayley graphs
- Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Linearly many faults in 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
This page was built for publication: Bounds for neighbor connectivity of Cayley graphs generated by trees and unicyclic graphs