Conditional matching preclusion number of graphs
From MaRDI portal
Publication:6045913
DOI10.1155/2023/5571724zbMath1515.05148MaRDI QIDQ6045913
Yalan Li, Chengfu Ye, Shu-Min Zhang
Publication date: 15 May 2023
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Conditional matching preclusion for the arrangement graphs
- Strong matching preclusion
- Conditional matching preclusion sets
- Strong matching preclusion number of graphs
- Matching preclusion number in product graphs
- Strong matching preclusion under the conditional fault model
- Matching preclusion and conditional matching preclusion problems for the folded Petersen cube
- Fractional matching preclusion of graphs
- Strong matching preclusion for \(k\)-ary \(n\)-cubes
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Conditional matching preclusion for the alternating group graphs and split-stars
- The Mobius cubes
- Matching preclusion for some interconnection networks
This page was built for publication: Conditional matching preclusion number of graphs
