On the minimal feedback arc set of m-free Digraphs

Details On the minimal feedback arc set of m-free Digraphs On the minimal feedback arc set of m-free Digraphs

2012-04-20

arxiv.org/abs/1204.4516v1

Mathematics

Combinatorics

Scientific paper

For a simple digraph $G$, let $\beta(G)$ be the size of the smallest subset $X\subseteq E(G)$ such that $G-X$ has no directed cycles, and let $\gamma(G)$ be the number of unordered pairs of nonadjacent vertices in $G$. A digraph $G$ is called $m$-free if $G$ has no directed cycles of length at most $m$. This paper proves that $\beta(G)\leq \frac{1}{m-2}\gamma(G)$ for any $m$-free digraph $G$, which generalized some known results.

Affiliated with

Also associated with

No associations

Rating

On the minimal feedback arc set of m-free Digraphs 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 On the minimal feedback arc set of m-free Digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimal feedback arc set of m-free Digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5158