Prasanth G. Narasimha-Shenoi

activity

20132026

most citedTopological Representation of the Transit Sets of k-Point Crossover Operators

3 citations · 5 across the 13 of their papers we have counts for

collaborators

14 papers

math.CO2026

Eccentric Connectivity Index of Cartesian product and Strong product of Strongly Connected Digraphs

Vysakh Chakooth, Prasanth G. Narasimha-Shenoi

Let $G = (V, E)$ be a graph. The \emph{eccentric connectivity index} of $G$ is defined as $ξ^{C} (G) = u \in V (G) \sum d_{u} ecc (u)$ where $d_{u}$ and $ecc (u)$ are the degree and eccentricity…

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

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

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…

cs.DM2020★ 1 cited

The Interval function, Ptolemaic, distance hereditary, bridged graphs and axiomatic characterizations

Manoj Changat, Lekshmi Kamal K. Sheela, Prasanth G. Narasimha-Shenoi

In this paper we consider certain types of betweenness axioms on the interval function $I_{G}$ of a connected graph $G$ . We characterize the class of graphs for which $I_{G}$ satisfy t…

cs.DM2019

Boundary-type Sets of Strong Product of Directed Graphs

Prasanth G. Narasimha-Shenoi, Bijo S Anand, Mary Shalet T J

Let $D = (V, E)$ be a strongly connected digraph and let $u, v \in V (D)$ . The maximum distance $m d (u, v)$ is defined as\\ $m d (u, v)$ =max\{$\overrightarrow{d}(u,v), \overrightarrow{d}(v,…

math.CO2017★ 3 cited

Topological Representation of the Transit Sets of k-Point Crossover Operators

Manoj Changat, Prasanth G. Narasimha-Shenoi, Ferdoos Hossein Nezhad +4

$k$ -point crossover operators and their recombination sets are studied from different perspectives. We show that transit functions of $k$ -point crossover generate, for all $k > 1$ , t…

cs.DM2016

Directed graphs and its Boundary Vertices

Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shallet T. J +1

Suppose that $D = (V, E)$ is a strongly connected digraph. Let $u, v \in V (D)$ . The maximum distance $m d (u, v)$ is defined as $m d (u, v)$ =max\{$\overrightarrow{d}(u,v), \overrightarrow{d}…

cs.DM2013★ 1 cited

On The Center Sets and Center Numbers of Some Graph Classes

Ram Kumar. R, Kannan Balakrishnan, Manoj Changat +2

For a set $S$ of vertices and the vertex $v$ in a connected graph $G$ , $x \in S max d (x, v)$ is called the $S$ -eccentricity of $v$ in $G$ . The set of vertices with mi…

cs.DM2013

Fair Sets of Some Class of Graphs

R. Ram Kumar, Kannan Balakrishnan, Prasanth G. Narasimha-Shenoi

Given a non empty set $S$ of vertices of a graph, the partiality of a vertex with respect to $S$ is the difference between maximum and minimum of the distances of the vertex to the…

Eccentric Connectivity Index of Cartesian product and Strong product of Strongly Connected Digraphs

Smooth Graphs

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

Eccentric Connectivity Index of Strongly Connected Digraphs

Partitions and covers in Δ convexity

Caratheˊodory Number and Exchange Number in Δ-convexity

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

Directed Transit Functions

The Interval function, Ptolemaic, distance hereditary, bridged graphs and axiomatic characterizations

Boundary-type Sets of Strong Product of Directed Graphs

Topological Representation of the Transit Sets of k-Point Crossover Operators

Directed graphs and its Boundary Vertices

On The Center Sets and Center Numbers of Some Graph Classes

Fair Sets of Some Class of 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