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 math.COShow all

9 papers · 1 filter

math.CO2026

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

Vysakh Chakooth, Prasanth G. Narasimha-Shenoi

Let be a graph. The \emph{eccentric connectivity index} of is defined as where and 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 is a strongly connected digraph and . 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 be a graph with non-empty set of vertices and set of edges . The \emph{eccentric connectivity index} of the graph 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 and a set , we say that is -convex if the neighborhood of every vertex not in is an independent set. A collection ${\cal V} = (V_1, V…

math.CO2025

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 -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.CO2017★ 3 cited

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

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

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