Integer k-matching preclusion of twisted cubes and (n,s)-star graphs

Caibing Chang, Xianfu Li and Yan Liu

Applied Mathematics and Computation, 2023, vol. 440, issue C

Abstract: An integer k-matching of a graph G is a function f from E(G) to {0,1,⋯,k} such that the sum of f(e) is not more than k for any vertex u, where the sum is taken over all edges e incident to u. When k=1, the integer k-matching is a matching. The (strong) integer k-matching preclusion number of G, denoted by mpk(G) (smpk(G)), is the minimum number of edges (vertices and edges) whose deletion results in a graph with neither perfect integer k-matching nor almost perfect integer k-matching. This is an extension of the (strong) matching preclusion problem that was introduced by Brigham, Park and Ihm et al. The twisted cubes and the (n,s)-star graphs have more desirable properties. In this paper, MPk number and SMPk number of the twisted cubes and (n,s)-star graphs are given, respectively.

Keywords: Integer k-matching; (Strong) integer k-matching preclusion number; Twisted cube; (n,s)-Star graph (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630032200710X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:440:y:2023:i:c:s009630032200710x

DOI: 10.1016/j.amc.2022.127638

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().