笛卡尔积图的分式强匹配排除
组合数学
2021-12-22 v3
摘要
图强匹配排除数由Park和Ihm于2011年引入,是指删去最少数量的顶点和边后,所得图既无完美匹配也无几乎完美匹配的顶点与边的数目。作为其推广,图的分式强匹配排除数是指删去最少数量的边和顶点后,所得图不存在分式完美匹配的边与顶点的数目。本文中,我们得到了笛卡尔积图的分式强匹配排除数。作为应用,给出了环面网络的分式强匹配排除数。
引用
@article{arxiv.2001.02526,
title = {Fractional strong matching preclusion for Cartesian product graphs},
author = {Bo Zhu and Tianlong Ma},
journal= {arXiv preprint arXiv:2001.02526},
year = {2021}
}
备注
In this paper, there are many situations in the proof of Cartesian product of a graph and a cycle that have not been considered