Fractional matching preclusion numbers of Cartesian product graphs
From MaRDI portal
Publication:6110597
DOI10.1016/j.dam.2023.05.021zbMath1520.05079OpenAlexW4380569853MaRDI QIDQ6110597
Publication date: 2 August 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.05.021
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Matching preclusion for vertex-transitive networks
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion and conditional matching preclusion problems for tori and related Cartesian products
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Matching preclusion number in product graphs
- Fractional matching preclusion of product networks
- Matching preclusion for direct product of regular graphs
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Matching preclusion for cube-connected cycles
- Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars
- Unnamed Item
- Unnamed Item