Fractional strong matching preclusion of some Cartesian product graphs
2021 ◽
Vol 2132
(1)
◽
pp. 012033
Keyword(s):
Abstract The fractional strong matching preclusion number of a graph is the minimum number of edges and vertices whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional strong matching preclusion number for the Cartesian product of a graph and a cycle. As an application, the fractional strong matching preclusion number for torus networks is also obtained.
2015 ◽
Vol 9
(1)
◽
pp. 13-28
◽
Keyword(s):
2004 ◽
Vol 8
(2)
◽
pp. 171-181
◽
2008 ◽
Vol 308
(24)
◽
pp. 6441-6448
◽
2016 ◽
Vol 138
(3)
◽
pp. 26-29
◽
2015 ◽
Vol 35
(4)
◽
pp. 615
◽
Keyword(s):
2017 ◽
Vol 75
(2)
◽
pp. 255-267
◽