图的联接与 corona 结构中的 2-可移动全支配
组合数学
2025-08-18 v1
摘要
设G为一张连通图。若非空集合T⊆V(G)满足:T为全支配集,且对于任意x,y∈T,T\{x,y}在G中仍为全支配集,或存在u,v∈V(G)\T,使得u和v分别与x和y相邻,且(T\{x,y})∪{u,v}在G中仍为全支配集,则称T为G的2-可移动全支配集。G的2-可移动支配数记为γ_mt²(G),指的是G的2-可移动全支配集的最小基数。若2-可移动全支配集的基数等于γ_mt²(G),则称其为G的γ_mt²-集。本文介绍了图的联接与 corona 结构中的2-可移动支配。
引用
@article{arxiv.2508.10952,
title = {On 2-Movable Total Domination in the Join and Corona of Graphs},
author = {Ariel C. Pedrano and Rolando N. Paluga},
journal= {arXiv preprint arXiv:2508.10952},
year = {2025}
}
备注
This is a new study about movable domination