3 papers
math.CO2026
General position and mutual-visibility in shadow graphs
Haritha S., Ullas Chandran S.
The \emph{general position problem} in graphs asks for a largest set of vertices in which no three lie on a common shortest path. The \emph{mutual-visibility problem} seeks a large…
math.CO2025
Monophonic position sets of Cartesian and lexicographic products of graphs
Ullas Chandran S. V., Sandi Klavžar, Neethu P. K. +1
The general position problem in graph theory asks for the number of vertices in a largest set of vertices of a graph such that no shortest path of contains more than tw…
math.CO2024
Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
Bijo S. Anand, Ullas Chandran S. V., Julliano R. Nascimento +1
Let be a graph and . In the cycle convexity, we say that is \textit{cycle convex} if for any , the induced subgraph of …