Bibliographic Details
| Title: |
Monophonic position sets of Cartesian and lexicographic products of graphs |
| Authors: |
V., Ullas Chandran S., Klavžar, Sandi, K., Neethu P., Tuite, James |
| Publication Year: |
2024 |
| Collection: |
Mathematics |
| Subject Terms: |
Mathematics - Combinatorics |
| More Details: |
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." This paper studies monophonic position sets in the Cartesian and lexicographic products of graphs. Sharp lower and upper bounds for the monophonic position number of Cartesian products are established, along with several exact values. For the lexicographic product, the monophonic position number is determined for arbitrary graphs. |
| Document Type: |
Working Paper |
| Access URL: |
http://arxiv.org/abs/2412.09837 |
| Accession Number: |
edsarx.2412.09837 |
| Database: |
arXiv |
