Fractional Matching Preclusion for (n,k)-Star Graphs
From MaRDI portal
Publication:5087845
DOI10.1142/S0129626418500172zbMath1492.05131OpenAlexW2905723504MaRDI QIDQ5087845
Jinling Wang, Eddie Cheng, Tianlong Ma, Yaping Mao
Publication date: 4 July 2022
Published in: Parallel Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129626418500172
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (6)
The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs ⋮ Fractional Matching Preclusion for Data Center Networks ⋮ Fractional Strong Matching Preclusion for DHcube ⋮ Fractional Matching Preclusion for Data Center Networks ⋮ The fractional (strong) matching preclusion number of complete \(k\)-partite graph ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching preclusion for vertex-transitive networks
- Strong matching preclusion for augmented cubes
- The conditional fault diagnosability of \((n, k)\)-star graphs
- Strong matching preclusion
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- Strong matching preclusion of \((n,k)\)-star graphs
- Conditional matching preclusion sets
- The \((n,k)\)-star graph: A generalized star graph
- A kind of conditional fault tolerance of \((n, k)\)-star graphs
- Strong matching preclusion number of graphs
- Fractional matching preclusion of graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- Matching preclusion for some interconnection networks
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- The Factorization of Linear Graphs
This page was built for publication: Fractional Matching Preclusion for (n,k)-Star Graphs
