Bijo S. Anand

activity

20242026

collaborators

9 papers

math.CO2026

Revisiting the outer-weakly convex domination number in graph products

Bijo S. Anand, Ullas Chandran S. V., Jonecis A. Dayap +2

Let $G = (V, E)$ be a simple undirected connected graph. A set $C \subseteq V (G)$ is weakly convex in $G$ if for every two vertices $u, v$ in $G$ , there exists a $u - v$ geodesic whos…

math.CO2026

Computing the Exchange Number in Graphs with respect to Cycle Convexity

Revathy S. Nair, Bijo S. Anand, Julliano R. Nascimento

Given a graph $G$ , a subset $S \subseteq V (G)$ is \textit{cycle convex}, if for any vertex $v \in V (G) ∖ S$ , the induced subgraph, $G [S \cup {v}]$ cannot form a cycle con…

math.CO2026

CarathÃ©odory Number in Cycle Convexity

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

Let $G$ be a graph and $S \subseteq V (G)$ . In the cycle convexity, we say that $S$ is \textit{cycle convex} if for any $u \in V (G) ∖ S$ , the induced subgraph of $S \cup {u}$ …

math.CO2026

Partitions and covers in $I^$ convexity

Bijo S. Anand, Manoj Changat, Mitre C. Dourado +2

Given a graph $G$ and a set $S \subseteq V (G)$ , we say that $S$ is $I^$ -convex if the neighborhood of every vertex not in $S$ is an independent set. A collection ${\cal V} = (V_1,…

math.CO2025

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'

Bijo S. Anand, Manoj Changat, Prasanth G. Narasimha-Shenoi +3

Suppose $D = (V, E)$ is a strongly connected digraph and $u, v \in V (D)$ . Among the many metrics in graphs, the sum metric warrants further exploration. The sum distance $sd(u, v)…

math.CO2025

Carath $A ~ c ◯$ odory Number and Exchange Number in $I^$ -convexity

Bijo S. Anand, Arun Anil, Manoj Changat +2

Given a graph $G$ , a set is $I^$ -convex if there is no vertex $u \in V (G) ∖ S$ forming a triangle with two vertices of $S$ . The $I^$ -convex hull of $S$ is the minimum $I^$ -co…

Revisiting the outer-weakly convex domination number in graph products

Computing the Exchange Number in Graphs with respect to Cycle Convexity

CarathÃ©odory Number in Cycle Convexity

Partitions and covers in I^ convexity

Boundary vertices of Strongly Connected Digraphs with respect to `Sum Metric'

CarathA~c◯odory Number and Exchange Number in I^-convexity

Partitions and covers in $I^$ convexity

Carath $A ~ c ◯$ odory Number and Exchange Number in $I^$ -convexity