Related Experiment Video
Updated: Apr 28, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
End-completely-regular and end-inverse lexicographic products of graphs
1School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang, Henan 471003, China.
Abstract:
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X) is completely regular (resp., inverse). In this paper, we will show that if X[Y] is End-completely-regular (resp., End-inverse), then both X and Y are End-completely-regular (resp., End-inverse). We give several approaches to construct new End-completely-regular graphs by means of the lexicographic products of two graphs with certain conditions. In particular, we determine the End-completely-regular and End-inverse lexicographic products of bipartite graphs.
Related Concept Videos
Indeterminate Products
Graphs of Functions
Graphs of Equations in Two Variables
Graphical Representation of Inequalities
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Graphing Antiderivatives
