Prasanth G. Narasimha-Shenoi

activity

20242026

collaborators

7 papers

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

Smooth Graphs

BoÅ¡tjan BreÅ¡ar, Manoj Changat, Prasanth G. Narasimha-Shenoi +2

The notion of smoothness was introduced originally in the context of step systems on connected graphs. Smoothness turns out to be a very general property of metrics defined by a fi…

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

Eccentric Connectivity Index of Strongly Connected Digraphs

Vysakh Chakooth, Prasanth G. Narasimha-Shenoi, Prakash G. Narasimha-Shenoi

Let $G = (V, E)$ be a graph with non-empty set of vertices $V$ and set of edges $E$ . The \emph{eccentric connectivity index} of the graph $G$ is defined as $$\displaystyle{Î¾^C(G)…

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…

math.CO2024

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

Bijo S Anand, Arun Anil, Manoj Changat +2

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

Partitions and covers in I^ convexity

Smooth Graphs

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

Eccentric Connectivity Index of Strongly Connected Digraphs

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

Helly Number, Radon Number and Rank in I^-Convexity on Graphs

Partitions and covers in $I^$ convexity

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

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