【摘要】 本文应用 De Bruijn 的幂群计数定理和偶图计数结果,解决了偶自补图的计数问题,获得了 m 个顶点独立集与 n 个顶点独立集的所有偶自补图的数目:当 m≠n 时是a_mn^C=Z（S_m×S_n;0,2、0,2,…）,当 m=n 时是a_mn^C=Z（[S_n]^S₂;0,2,0,2,…）.文中并给出了计数偶自补图数目的实用公式.更多还原

【Abstract】 in this paper,the enumeration problem of bipartite S.C.graphs is Solved by applying De Bruijn’s power Group Enumeration Theorem and the enumeration result of bipartite graphs.It is obtained that the number of all bipartite S.C.gra- phs of m independent point set and n independent points is a_mn^c=Z（S_m×S_n;0,2,0,2,……）when m≠n; a_mn^c=Z([S_n]^s2;0,2,0,2,……)when m=n. Finally,the authors gives the practical formulas of enumerate bipartite S.C. graphs.更多还原