End-regular and End-orthodox generalized lexicographic products of bipartite graphs
Rui Gu ; Hailong Hou
Open Mathematics, Tome 14 (2016), p. 229-236 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

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

Publié le : 2016-01-01
EUDML-ID : urn:eudml:doc:276830 
@article{bwmeta1.element.doi-10_1515_math-2016-0021,
     author = {Rui Gu and Hailong Hou},
     title = {End-regular and End-orthodox generalized lexicographic products of bipartite graphs},
     journal = {Open Mathematics},
     volume = {14},
     year = {2016},
     pages = {229-236},
     zbl = {1346.05110},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_math-2016-0021}
}

Rui Gu; Hailong Hou. End-regular and End-orthodox generalized lexicographic products of bipartite graphs. Open Mathematics, Tome 14 (2016) pp. 229-236. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_math-2016-0021/