End-regular and End-orthodox generalized lexicographic products of bipartite graphs

End-regular and End-orthodox generalized lexicographic products of bipartite graphs

A graph is said to be End-regular (End-orthodox) if its endomorphism monoid ) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Open mathematics (Warsaw, Poland) Poland), 2016-01, Vol.14 (1), p.229-236
Hauptverfasser: Gu, Rui, Hou, Hailong
Format: Artikel
Sprache:eng
Schlagworte:
05C25
Bipartite graph
Endomorphism
Generalized lexicographic product
Monoid
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A graph is said to be End-regular (End-orthodox) if its endomorphism monoid ) is a regular (orthodox) semigroup. In this paper, we determine the End-regular and the End-orthodox generalized lexicographic products of bipartite graphs.
ISSN:2391-5455
2391-5455
DOI:10.1515/math-2016-0021