伪超图开关类的若干性质

Properties of Switching Classes of Pseudo Hypergraphs

本文首先给出了伪超图开关运算的定义,导出了 F(n)的等价开关类划分,然后研究了开关类的性质,主要有:两伪超图属于同一开关类的充要条件;任一开关类含有 K—致伪超图的必要条件;任一开关类含有 K—正则伪超图的充要条件;Aut(H)与 Aut(S(H))的群性质;两开关类的同构性;两同构开关类的对偶类的同构性;两同构开关类的补类的同构性等。

This paper presents the definition of the pseudo hypergraph Switching operation,derives the dassification of the equivalent Switching classes of F(n),and researches the properties of switching classes,which included:the necessary sufficient conditions for two hypergraphs be- ing in the same switching class;the necessary sufficient conditions for any Swithing class con- taining a K-regular pseudo hypergraph:the necessary conditions for any Switching class containing a K-consistent pseudo hypergraph;group property of Aut(H)and Aut(S(H));i- somorphism of two Switching classes;isomorphism of dual classes of two isomorphic Switch- ing clsses;isomorphism of complement classes of two isomorphic Switching classes.