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

Showing cs.DMShow all

5 papers · 1 filter

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,…

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…