Bijo S. Anand

collaborators

2 papers

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,…

math.CO2018

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 $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$ . The cardinality of a largest general p…