Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

1 2010

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Endomorphism monoid of diamond product of two common complete bipartite graphs

Jiarasuksakun T., Rutjanisarakul T., Thongjua W.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

2010

Vol. 15

59--66

An endomorphism of a graph G = (V, E) is a mapping f : V → V such that for all x, y ∈ V if {x, y} ∈ E, then {f (x),f (y)}∈ E. Let End(G) be the class of all endomorphisms of graph G. The diamond product of graph G = (V, E) (denoted by G ◊ G) is a graph defined by the vertex set V (G ◊ G) = End(G) and the edge set E (G ◊ G) ={{f, g} ⊂ End(G)|{f(x), g(x)} ∈ E for all x ∈ V}. Let Km,n be a complete bipartite graph on m + n vertices. This research aims to study the algebraic property of V (Km,n ◊ Km,n) = End(Km,n) after we have found that Km,n ◊ Km,n is also a complete bipartite graph on mmnn + nmmn vertices. The result shows that all of its vertices (endomorphisms) form a noncommutative monoid.