End-regular and End-orthodox generalized lexicographic products of bipartite graphs
Open Mathematics (2016)
- Volume: 14, Issue: 1, page 229-236
- ISSN: 2391-5455
Access Full Article
top
Abstract
topHow to cite
topRui Gu, and Hailong Hou. "End-regular and End-orthodox generalized lexicographic products of bipartite graphs." Open Mathematics 14.1 (2016): 229-236. <http://eudml.org/doc/276830>.
@article{RuiGu2016,
abstract = {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.},
author = {Rui Gu, Hailong Hou},
journal = {Open Mathematics},
keywords = {Endomorphism; Monoid; Generalized lexicographic product; Bipartite graph; endomorphism; monoid; generalized lexicographic product; bipartite graph},
language = {eng},
number = {1},
pages = {229-236},
title = {End-regular and End-orthodox generalized lexicographic products of bipartite graphs},
url = {http://eudml.org/doc/276830},
volume = {14},
year = {2016},
}
TY - JOUR
AU - Rui Gu
AU - Hailong Hou
TI - End-regular and End-orthodox generalized lexicographic products of bipartite graphs
JO - Open Mathematics
PY - 2016
VL - 14
IS - 1
SP - 229
EP - 236
AB - 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.
LA - eng
KW - Endomorphism; Monoid; Generalized lexicographic product; Bipartite graph; endomorphism; monoid; generalized lexicographic product; bipartite graph
UR - http://eudml.org/doc/276830
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.