Reliability analysis of godan graphs in terms of generalized 4-connectivity
From MaRDI portal
Cites work
- \(k\)-tree connectivity of line graphs
- Component Connectivity of Alternating Group Networks and Godan Graphs
- Congruent graphs and the connectivity of graphs
- Graph theory
- Note on the generalized connectivity.
- Note on the hardness of generalized connectivity
- Rainbow trees in graphs and generalized connectivity
- Reliability analysis of godan graphs
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Steiner tree packing number and tree connectivity
- The 4-set tree connectivity of (n, k)-star networks
- The \(\kappa_k\)-connectivity of line graphs
- The generalized 3-connectivity of burnt pancake graphs and godan graphs
- The generalized 3-connectivity of Cartesian product
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- The generalized 3-connectivity of two kinds of regular networks
- The generalized 4-connectivity of exchanged hypercubes
- The generalized 4-connectivity of hypercubes
- The generalized 4-connectivity of pancake graphs
- The generalized connectivity of alternating group graphs and \((n, k)\)-star graphs
- The generalized connectivity of bubble-sort star graphs
- The generalized connectivity of complete bipartite graphs.
- The reliability analysis based on the generalized connectivity in balanced hypercubes
- Two kinds of generalized connectivity of dual cubes
This page was built for publication: Reliability analysis of godan graphs in terms of generalized 4-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969947)