B. Acharya

most citedPoint- and arc-reaching sets of vertices in a digraph

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2014

Interference in Graphs

B. D. Acharya, Germina K. A., Rency Kurian +2

Given a graph $I = (V, E),$ $\emptyset \neq = D \subseteq V,$ and an arbitrary nonempty set $X,$ an injective function $f : V \to 2^{X} ∖ {\emptyset}$ is an interference of $D$ wi…

math.CO2010★ 1 cited

Point- and arc-reaching sets of vertices in a digraph

B. D. Acharya, K. A. Germina, Kumar Abhishek +2

In a digraph $D = (X, U)$ , not necessarily finite, an arc $(x, y) \in U$ is reachable from a vertex $u$ if there exists a directed walk $W$ that originates from…