2-switch：图和森林上的转换和稳定性
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
