3-path-connectivity of Cayley graphs generated by transposition trees
From MaRDI portal
Recommendations
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- The generalized 3-connectivity of complete-transposition graphs
- Reliability assessment of the Cayley graph generated by trees
- 3-extra connectivity of Cayley graphs generated by transposition generating trees
- scientific article; zbMATH DE number 5139492
Cites work
- A family of path properties for graphs
- A group-theoretic model for symmetric interconnection networks
- A kind of conditional vertex connectivity of star graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Edge disjoint cycles in graphs
- Graph theory
- Hamilton path decompositions of complete multipartite graphs
- Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
- scientific article; zbMATH DE number 1054728 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
- On tree-connectivity and path-connectivity of graphs
- Orienting Cayley graphs generated by transposition trees
- Path 3-(edge-)connectivity of lexicographic product graphs
- Path-connectivity in graphs
- Path-connectivity of lexicographic product graphs
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- The 3-path-connectivity of the \(k\)-ary \(n\)-cube
- The 3-path-connectivity of the hypercubes
- The generalized 3-connectivity of star graphs and bubble-sort graphs
Cited in
(10)- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- Restricted connectivity of Cayley graph generated by transposition trees
- The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
- The 3-path-connectivity of the star graphs
- Reliability analysis of exchanged hypercubes based on the path connectivity
- Packing internally disjoint Steiner paths of modified bubble-sort networks
- \(k\)-path-connectivity of the complete balanced tripartite graph \(K_{n, n, n}\) for \(n + 1 \leq k \leq 2 n - 4\)
- The cyclic diagnosability of Cayley graphs generated by transposition trees
- k-path-edge-connectivity of the complete balanced bipartite graph
- k-path-connectivity of balanced hypercubes for k = 3, 4
This page was built for publication: 3-path-connectivity of Cayley graphs generated by transposition trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064862)