4 papers
On the monophonic convexity in complementary prisms
Neethu P. K., Ullas Chandran S. V., Julliano R. Nascimento
A set of vertices of a graph is \emph{monophonic convex} if contains all the vertices belonging to any induced path connecting two vertices of . The cardinality of a…
The general position avoidance game and hardness of general position games
Ullas Chandran S. V., Sandi Klavzar, Neethu P. K. +1
Given a graph , a set of vertices in is a general position set if no triple of vertices from lie on a common shortest path in . The general position achievement/a…
On some extremal position problems for graphs
James Tuite, Elias John Thomas, Ullas Chandran S. V.
The general position number of a graph is the size of the largest set of vertices such that no geodesic of contains more than two elements of . The monophonic positi…
On monophonic position sets in graphs
Elias John Thomas, S. V. Ullas Chandran, James Tuite +1
The general position problem in graph theory asks for the largest set of vertices of a graph such that no shortest path of contains more than two vertices of . In th…