Manoj Changat

activity

20162024

most citedThe Toll Walk Transit Function of a Graph: Axiomatic Characterizations and First-Order Non-definability

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2024

Weakly modular graphs with diamond condition, the interval function and axiomatic characterizations

Lekshmi Kamal Kamalolbhavan-Sheela, Jeny Jacob, Manoj Changat

Weakly modular graphs are defined as the class of graphs that satisfy the \emph{triangle condition ( $T C$ )} and the \emph{quadrangle condition ( $QC$ )}. We study an interesting subcl…

math.CO2023★ 1 cited

The Toll Walk Transit Function of a Graph: Axiomatic Characterizations and First-Order Non-definability

Manoj Changat, Jeny Jacob, Lekshmi Kamal K. Sheela +1

A walk $W = w_{1} w_{2} \dots w_{k}$ , $k \geq 2$ , is called a toll walk if $w_{1} \neq = w_{k}$ and $w_{2}$ and $w_{k - 1}$ are the only neighbors of $w_{1}$ and $w_{k}$ , respectively, on $W$ in a graph $G$ …

cs.DM2023

Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs

Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth +1

We investigate the connections between clusters and least common ancestors (LCAs) in directed acyclic graphs (DAGs). We focus on the class of DAGs having unique least common ancest…

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