Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

Abstract : For a set D ⊂ Zn, the distance graph Pn(D) has Zn as its vertex set and the edges are between vertices i and j with |i − j| ∈ D. The circulant graph Cn(D) is defined analogously by considering operations modulo n. The minimum feedback vertex set problem consists in finding the smallest number of vertices to be removed in order to cut all cycles in the graph. This paper studies the minimum feedback vertex set problem for some families of distance graphs and circulant graphs depending on the value of D.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00972307
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, April 3, 2014 - 4:07:45 PM
Last modification on : Monday, July 1, 2019 - 4:02:36 PM
Long-term archiving on : Thursday, July 3, 2014 - 4:30:42 PM

File

494-3180-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00972307, version 1

Citation

Hamamache Kheddouci, Olivier Togni. Bounds for minimum feedback vertex sets in distance graphs and circulant graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (1), pp.57--70. ⟨hal-00972307⟩

Share

Metrics

Record views

587

Files downloads

700