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

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

2010-01-24

arxiv.org/abs/1001.4213v1

Indian Journal of Mathematics, 51 (2009), no. 3, 597-609

Mathematics

Combinatorics

Scientific paper

In a digraph $D = (X, \mathcal{U})$, not necessarily finite, an arc $(x, y) \in \mathcal{U}$ is reachable from a vertex $u$ if there exists a directed walk $W$ that originates from $u$ and contains $(x, y)$. A subset $S \subseteq X$ is an arc-reaching set of $D$ if for every arc $(x, y)$ there exists a diwalk $W$ originating at a vertex $u \in S$ and containing $(x, y)$. A minimal arc-reaching set is an arc-basis. $S$ is a point-reaching set if for every vertex $v$ there exists a diwalk $W$ to $v$ originating at a vertex $u \in S$. A minimal point-reaching set is a point-basis. We extend the results of Harary, Norman, and Cartwright on point-bases in finite digraphs to point- and arc-bases in infinite digraphs.

Affiliated with

Also associated with

No associations

Rating

Point- and arc-reaching sets of vertices in a digraph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Point- and arc-reaching sets of vertices in a digraph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Point- and arc-reaching sets of vertices in a digraph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-696375