3 citations · 3 across the 5 of their papers we have counts for
6 papers
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…
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 …
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…
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…
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…
Characterization of general position sets and its applications to cographs and bipartite graphs
Bijo S. Anand, Ullas Chandran S. V., Manoj Changat +2
A vertex subset of a graph is a general position set of if no vertex of lies on a geodesic between two other vertices of . The cardinality of a largest general p…