The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
From MaRDI portal
Publication:6585257
DOI10.1016/j.dam.2024.05.036zbMATH Open1546.05073MaRDI QIDQ6585257
Eminjan Sabir, Jixiang Meng, Hongwei Qiao
Publication date: 9 August 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
- Automorphism groups of Cayley graphs generated by connected transposition sets
- Paired many-to-many disjoint path covers in faulty hypercubes
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Longest paths and cycles in faulty star graphs
- Hyper Hamiltonian laceability on edge fault star graph
- Paired many-to-many disjoint path covers of hypertori
- Paired many-to-many disjoint path covers of hypercubes with faulty edges
- Optimal fault-tolerant embedding of paths in twisted cubes
- Hamiltonian laceability of bubble-sort graphs with edge faults
- An efficient algorithm to construct disjoint path covers of DCell networks
- Ore-type degree conditions for disjoint path covers in simple graphs
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- Path embedding in star graphs
- Conditional connectivity of Cayley graphs generated by transposition trees
- Restricted connectivity of Cayley graph generated by transposition trees
- Torus-like graphs and their paired many-to-many disjoint path covers
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- Many-to-many two-disjoint path covers in restricted hypercube-like graphs
- Single-source three-disjoint path covers in cubes of connected graphs
- Paired many-to-many disjoint path covers of the hypercubes
- Disjoint path covers in cubes of connected graphs
- Linearly many faults in Cayley graphs generated by transposition trees
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- The spanning cyclability of Cayley graphs generated by transposition trees
- Hamiltonian-laceability of star graphs
- Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
This page was built for publication: The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6585257)