| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649534 | Discrete Mathematics | 2008 | 9 Pages |
Abstract
In this paper, we give several approaches to construct new End-regular (-orthodox) graphs by means of the join and the lexicographic product of two graphs with certain conditions. In particular, the join of two connected bipartite graphs with a regular (orthodox) endomorphism monoid is explicitly described.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hailong Hou, Yanfeng Luo,