Fractional matching preclusion for (n,k)-star graphs
From MaRDI portal
Publication:5087845
DOI10.1142/S0129626418500172zbMATH Open1492.05131OpenAlexW2905723504MaRDI QIDQ5087845FDOQ5087845
Authors: Tianlong Ma, Yaping Mao, Eddie Cheng, Jinling Wang 
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
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fractional graph theory, fuzzy graph theory (05C72)
Cites Work
- The Factorization of Linear Graphs
- The \((n,k)\)-star graph: A generalized star graph
- The conditional fault diagnosability of \((n, k)\)-star graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong matching preclusion for augmented cubes
- Matching preclusion for some interconnection networks
- Strong matching preclusion
- Strong matching preclusion of \((n,k)\)-star graphs
- Matching preclusion for vertex-transitive networks
- A kind of conditional fault tolerance of \((n, k)\)-star graphs
- Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- Conditional matching preclusion sets
- Strong matching preclusion number of graphs
- Strong matching preclusion of 2-matching composition networks
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Fractional matching preclusion of graphs
Cited In (18)
- Fractional matching preclusion number of graphs
- Title not available (Why is that?)
- Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
- Fractional matching preclusion of graphs
- The fractional (strong) matching preclusion number of complete \(k\)-partite graph
- Strong matching preclusion of \((n,k)\)-star graphs
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for data center networks
- Fractional matching preclusion for arrangement graphs
- Fractional matching preclusion for generalized augmented cubes
- Conditional matching preclusion for the star graphs.
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- The fractional matching preclusion number of complete \(n\)-balanced \(k\)-partite graphs
- Fractional matching preclusion for radix triangular mesh
- Fractional Strong Matching Preclusion for DHcube
- Integer \(k\)-matching preclusion of graphs
- Fractional matching preclusion of the restricted HL-graphs
- Fractional matching preclusion for butterfly derived networks
This page was built for publication: Fractional matching preclusion for \((n,k)\)-star graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087845)
