%0 Journal Article
%T r个点并圈的补图的色等价图类<br>The Chromatic Equivalence Classes of the Complements of Union Graphs of r Vertices and a Cycle
%A 李丹阳
%A 马海成
%J Pure Mathematics
%P 1112-1120
%@ 2160-7605
%D 2021
%I Hans Publishing
%R 10.12677/PM.2021.116125
%X <div style=\"text-align:justify;\">
	两个图G 和H 色等价当且仅当它们的补图伴随等价. 图G 色唯一当且仅当<span style=\"text-decoration:overline;\">G</span> 伴随唯一. 在这篇文章中, 我们计算了<span>rK<sub>1</sub>UC<sub>m</sub></span>(r ≥ 1, m ≥ 3) 的伴随等价图的个数, 并刻画了它的伴随等价图类. 因而, 我们也计算了<span style='border-top:1px solid #000; '>rK<sub>1</sub>UC<sub>m</sub></span>的色等价图的个数, 刻画了<span style='border-top:1px solid #000; '>rK<sub>1</sub>UC<sub>m</sub></span>的色等价图类.<br />
Two graphs G and H are chromatically equivalent if and only if <span style=\"text-decoration:overline;\">G</span> and <span style=\"text-decoration:overline;\">H</span> are adjointly equivalent. G is chromatically unique if and only if <span style=\"text-decoration:overline;\">G</span> adjointly unique. In this paper, the number of the adjoint equivalence graphs of <span>rK<sub>1</sub>UC<sub>m</sub></span>(r ≥ 1, m ≥ 3) is calculated, and the adjoint equivalence classes of <span>rK<sub>1</sub>UC<sub>m</sub></span> can also be characterized. As a result, the number of the chromatic equivalence graphs of <span style='border-top:1px solid #000; '>rK<sub>1</sub>UC<sub>m</sub></span> is calculated, and the chromatic equivalence classes of <span style='border-top:1px solid #000; '>rK<sub>1</sub>UC<sub>m</sub></span> can also be characterized.
</div>
%K 色多项式，伴随多项式，色等价，伴随等价，色唯一，伴随唯一<br>Chromatic Polynomial
%K Adjoint Polynomial
%K Chromatically Equivalent
%K Adjointly Equivalent
%K Chromatically Unique
%K Adjointly Unique
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=43160