2019
DOI: 10.1142/s0219265919400103
|View full text |Cite
|
Sign up to set email alerts
|

Fractional Matching Preclusion for Restricted Hypercube-Like Graphs

Abstract: The restricted hypercube-like graphs, variants of the hypercube, were proposed as desired interconnection networks of parallel systems. The matching preclusion number of a graph is the minimum number of edges whose deletion results in the graph with neither perfect matchings nor almost perfect matchings. The fractional perfect matching preclusion and fractional strong perfect matching preclusion are generalizations of the concept matching preclusion. In this paper, we obtain fractional matching preclusion numb… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 16 publications
0
0
0
Order By: Relevance