3 citations · 17 across the 23 of their papers we have counts for
5 papers · 2 filters
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)…
Global Least Common Ancestor (LCA) Networks
Anna Lindeberg, Bruno J. Schmidt, Manoj Changat +3
Directed acyclic graphs (DAGs) are fundamental structures used across many scientific fields. A key concept in DAGs is the least common ancestor (LCA), which plays a crucial role i…
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(…
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…
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…