论文标题
2个开关：图和森林的过渡和稳定性
2-switch: transition and stability on graphs and forests
论文作者
论文摘要
鉴于任何两个具有相同程度序列的森林，我们以一种算法的方式表明，一个可以通过一系列2个切口转化为另一个森林，以使所有转化的中间图都是森林。我们还证明，2个开关的操作在具有相同程度序列的图形家族中最少一些众所周知的整数参数。然后，我们将这些结果应用得出结论，即所研究的参数具有这些家庭的间隔属性。
Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We also prove that the 2-switch operation perturbs minimally some well-known integer parameters in families of graphs with the same degree sequence. Then, we apply these results to conclude that the studied parameters have the interval property on those families.
