Related Experiment Video
Updated: Sep 14, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
Published on: March 18, 2019
Monophonic position sets of Cartesian and lexicographic products of graphs
Ullas Chandran S V1,2, Sandi Klavžar3,4,5, P K Neethu1
1Department of Mathematics, Mahatma Gandhi College, University of Kerala, Thiruvananthapuram, India.
Abstract:
The general position problem in graph theory asks for the number of vertices in a largest set S of vertices of a graph G such that no shortest path of G contains more than two vertices of S. The analogous monophonic position problem is obtained from the general position problem by replacing "shortest path" by "induced path." In this paper the monophonic position number is studied on Cartesian and lexicographic products of graphs. It is proved that in Cartesian products, a monophonic position set can only be in one of three canonical forms, named layered, varied, and cliquey. The monophonic position number of an arbitrary Cartesian product is bounded from below and above. The two bounds coincide if neither of the factors has simplicial vertices. A formula for the monophonic position number of a lexicographic product is given which only contains the clique number and the structure of monophonic sets of the second factor.
Related Concept Videos
Cartesian Vector Notation
Graphs of Equations in Two Variables
Graphs of Two-Variable Functions
Graphs of Functions
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...
Graphical Representation of Inequalities
