Conditional matching preclusion for the star graphs.
From MaRDI portal
Publication:2804852
zbMATH Open1349.05179MaRDI QIDQ2804852FDOQ2804852
Lih-Hsing Hsu, Cheng-Kuan Lin, L. Lipták, Jimmy J. M. Tan, Eddie Cheng
Publication date: 4 May 2016
Published in: Ars Combinatoria (Search for Journal in Brave)
Recommendations
- CONDITIONAL MATCHING PRECLUSION FOR (n,k)-STAR GRAPHS
- Conditional matching preclusion sets for an mixed-graph of the star graph and the bubble-sort graph
- Conditional matching preclusion for the alternating group graphs and Split-stars
- Strong matching preclusion of \((n,k)\)-star graphs
- Conditional matching preclusion for the arrangement graphs
- Fractional matching preclusion for \((n,k)\)-star graphs
- Conditional matching preclusion number of graphs
- A kind of conditional vertex connectivity of star graphs
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Conditional matching preclusion for regular bipartite graphs and their Cartesian product
Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (2)
This page was built for publication: Conditional matching preclusion for the star graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804852)