Arun Anil

activity

20232026

collaborators

6 papers

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…

math.CO2025

On the stress transit function

Arun Anil, Manoj Changat, Tanja Dravec +5

The stress interval $S (u, v)$ between $u, v \in V (G)$ is the set of all vertices in a graph $G$ that lie on every shortest $u, v$ -path. A set $U \subseteq V (G)$ is stress convex if $S(…

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

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

Directed Transit Functions

Arun Anil, Manoj Changat, Lekshmi Kamal K-Sheela +5

Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures suc…

math.CO2023

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs

Arun Anil, Manoj Changat

Cover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P = (V, \leq)$ with vertex set $V$ , and the edge-set is t…