Increasing the connectivity of split-stars
Let \(n\geq 3\) be an integer and let \(S_n\) be the symmetric group on \(\{1,2,\ldots,n\}\). The authors define the split-star \(S_n^2\) as the following graph. The vertex set of \(S_n^2\) consists of the \(n!\) permutations in \(S_n\). Two permutations \(g,f\in S_n\) are adjacent if and only if \(g(1,2)=f\), \(g(1,2,i)=f\), or \(g(1,i,2)=f\) for \(i\geq 3\), where \((1,2)\) is a transposition and \((1,2,i)\) and \((1,i,2)\) are 3-cycles. The authors study connectivity properties of this special family of \((2n-3)\)-regular graphs. For example, Theorem 3.2 states: If \(X\) is a set of \(2n-2\) vertices of \(S_n^2\), then \(S_n^2-X\) is either connected or has two components, one of which consists of exactly one vertex.
- Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
- Super spanning connectivity of split-star networks
- Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- A new approach to finding the extra connectivity of graphs
- Linearly many faults in 2-tree-generated networks
- Conditional diagnosability and strong diagnosability of split-star networks under the PMC model
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model
- Combinatorial analysis of the subsystem reliability of the split-star network
This page was built for publication: Increasing the connectivity of split-stars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2716670)
