Conditional Matching preclusion for (n, k)-Star Graphs

@article{Cheng2013ConditionalMP,
  title={Conditional Matching preclusion for (n, k)-Star Graphs},
  author={Eddie Cheng and L{\'a}szl{\'o} Lipt{\'a}k},
  journal={Parallel Processing Letters},
  year={2013},
  volume={23}
}
The matching preclusion number of an even graph G, denoted by mp(G), is the minimum number of edges whose deletion leaves the resulting graph without perfect matchings. The conditional matching preclusion number of an even graph G, denoted by mp1(G), is the minimum number of edges whose deletion leaves the resulting graph with neither perfect matchings nor isolated vertices. The class of (n, k)-star graphs is a popular class of interconnection networks for which the matching preclusion number… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
1 Citations
14 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…