Strong matching preclusion number of graphs
From MaRDI portal
Publication:1694672
DOI10.1016/j.tcs.2017.12.035zbMath1387.05209WikidataQ56638368 ScholiaQ56638368MaRDI QIDQ1694672
Eddie Cheng, Yaping Mao, Zhao Wang, Christopher Melekian
Publication date: 6 February 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.035
05C82: Small world graphs, complex networks (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A Short Note of Strong Matching Preclusion for a Class of Arrangement Graphs, Fractional Matching Preclusion for (n,k)-Star Graphs, Fractional matching preclusion for radix triangular mesh, Conditional matching preclusion number of graphs, Matching preclusion number of graphs, Fractional matching preclusion number of graphs, A note on the strong matching preclusion problem for data center networks, Fractional matching preclusion of product networks, Fractional matching preclusion for arrangement graphs, Conditional fractional matching preclusion for burnt pancake graphs and pancake-like graphs (extended abstract)
Cites Work
- Strong matching preclusion for augmented cubes
- On the NP-completeness of the perfect matching free subgraph problem
- Matching preclusion and conditional matching preclusion for regular interconnection networks
- Matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional matching preclusion for the arrangement graphs
- Strong matching preclusion
- Strong matching preclusion of \((n,k)\)-star graphs
- Conditional matching preclusion for hypercube-like interconnection networks
- A survey of Nordhaus-Gaddum type relations
- Strong matching preclusion under the conditional fault model
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- 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
- Matching preclusion for the (n, k)-bubble-sort graphs
- Note on Hamilton Circuits
- Matching preclusion for some interconnection networks
- The Factorization of Linear Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
