4 papers
Carathodory Number and Exchange Number in -convexity
Bijo S. Anand, Arun Anil, Manoj Changat +2
Given a graph , a set is -convex if there is no vertex forming a triangle with two vertices of . The -convex hull of is the minimum -co…
On the stress transit function
Arun Anil, Manoj Changat, Tanja Dravec +5
The stress interval between is the set of all vertices in a graph that lie on every shortest -path. A set is stress convex if $S(…
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.…
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 with vertex set , and the edge-set is t…