In this paper, we describe the canonical partial order on the idempotent set of the strong endomorphism monoid of a graph, and using this we further characterize primitive idem potenes from the viewpoint of combinator...In this paper, we describe the canonical partial order on the idempotent set of the strong endomorphism monoid of a graph, and using this we further characterize primitive idem potenes from the viewpoint of combinatorics. The number of them is also given.展开更多
文摘In this paper, we describe the canonical partial order on the idempotent set of the strong endomorphism monoid of a graph, and using this we further characterize primitive idem potenes from the viewpoint of combinatorics. The number of them is also given.
