两个图的字典序积的自同态纯整
首发时间:2008-10-29
摘要:本文讨论了具有纯整自同态幺半群的两个图的字典序积, 得到了如果X[Y ] 是End-纯整的,那么X和Y 是End-纯整的, 但其逆不成立, 并且对于X和Y 都是连通的 二部图来说, 明确给出了具有纯整自同态幺半群的两个二部图的字典序积纯整图 有哪些, 即X 和Y 是End纯整的二部图,则X[Y ]是End-纯整当且仅当(1)或(2)或(3)成 立:(1)X是K1,Y 是End-纯整的二部图(2)X[Y ] = X,其中X 6= K1 (3)K2[K2],K2[2K1]
For information in English, please click here
The lexicographic of two graphs with a n ortho-
Abstract:The lexicographic of two graphs with a n orthodox endomorphism monoid are discussed, that is ,if X[Y ] is End-orthodox ,then both X and Y are End-orthodox, but the converse of this proposition is not true .In particular, the lexicographic of two bipartite graphs with an orthodox endomorphism monoid are given,that is,X[Y ]is End- orthodox if and only if (1) or(2 )or(3) holds: (1)X is K1,Y is bipartite graphs with an orthodox endomorphism monoid (2)X[Y ] = X,X 6= K1 (3)K2[K2],K2[2K1]
Keywords: endomorphism;monoid orthodox graph lexicographic
基金:
论文图表:
引用
No.2523932579812252****
同行评议
共计0人参与
勘误表
两个图的字典序积的自同态纯整
评论
全部评论0/1000