Bijo S. Anand

activity

20182026

most citedCharacterization of general position sets and its applications to cographs and bipartite graphs

3 citations · 3 across the 11 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

Computing the Helly Number, Radon Number and Rank in Cycle Convexity

Revathy S. Nair, Bijo S. Anand, Ullas Chandran S. V. +2

In this paper, we investigate three fundamental convexity parameters of graphs under cycle convexity, namely the Helly number, Radon number, and rank. We first study the computatio…

cs.DM2019

Boundary-type Sets of Strong Product of Directed Graphs

Prasanth G. Narasimha-Shenoi, Bijo S Anand, Mary Shalet T J

Let $D = (V, E)$ be a strongly connected digraph and let $u, v \in V (D)$ . The maximum distance $m d (u, v)$ is defined as\\ $m d (u, v)$ =max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,…