3 papers
math.CO2024
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.CO2021
The general position achievement game played on graphs
Sandi Klavžar, Neethu P. K., Ullas Chandran S.
A general position set of a graph is a set of vertices in such that no three vertices from lie on a common shortest path. In this paper we introduce and study the g…
math.CO2020
On the convexity number of the complementary prism of a tree
Neethu P. K., Ullas Chandran S.
A set of vertices of a graph is a (geodesic)convex set, if contains all the vertices belonging to any shortest path connecting between two vertices of . The cardinal…