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 math.COShow all

9 papers · 1 filter

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.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

Partitions and covers in $Δ$ 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 $Δ$ -convex if the neighborhood of every vertex not in $S$ is an independent set. A collection ${\cal V} = (V_1, V…

math.CO2025

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.CO2025

Carath $e ˊ$ odory Number and Exchange Number in $Δ$ -convexity

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

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

math.CO2024

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 $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.CO2024

Helly Number, Radon Number and Rank in $Δ$ -Convexity on Graphs

Bijo S Anand, Arun Anil, Manoj Changat +2

This article discusses $Δ$ -convexity on simple connected graphs. We establish general bounds for the Helly number, Radon number, and rank with respect to $Δ$ -convexity on graphs. A…

math.CO2018★ 3 cited

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…

Computing the Exchange Number in Graphs with respect to Cycle Convexity

Carathéodory Number in Cycle Convexity

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

Partitions and covers in Δ convexity

Revisiting the outer-weakly convex domination number in graph products

Caratheˊodory Number and Exchange Number in Δ-convexity

Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products

Helly Number, Radon Number and Rank in Δ-Convexity on Graphs

Characterization of general position sets and its applications to cographs and bipartite graphs

Partitions and covers in $Δ$ convexity

Carath $e ˊ$ odory Number and Exchange Number in $Δ$ -convexity

Helly Number, Radon Number and Rank in $Δ$ -Convexity on Graphs