IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i2d10.1007_s10878-014-9790-5.html
   My bibliography  Save this article

Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis

Author

Listed:
  • Chun-Ying Chiang

    (National Central University)

  • Wei-Ting Huang

    (National Central University)

  • Hong-Gwa Yeh

    (National Central University)

Abstract

In this paper, we use the connection between dynamic monopolies and feedback vertex sets to establish explicit formulas and new bounds for decycling number $$\nabla (G)$$ ∇ ( G ) when $$G$$ G is one of the following classes of graphs: cycle permutation graphs, generalized Petersen graphs, and torus cordalis. In the first part of this paper, we show that if $$G$$ G is a cycle permutation graph or a generalized Petersen graph on $$2n$$ 2 n vertices, then $$\nabla (G)=\lceil (n+1)/2\rceil $$ ∇ ( G ) = ⌈ ( n + 1 ) / 2 ⌉ . These results extend a recent result by Zaker (Discret Math 312:1136–1143, 2012) and partially answer a question of Bau and Beineke (Australas J Comb 25:285–298, 2002). Note that our definition of a generalized Petersen graph is more general than the one used in Zaker (Discret Math 312:1136–1143, 2012). The second and major part of this paper is devoted to proving new upper bounds and exact values on the size of the minimum feedback vertex set and minimum dynamic monopoly for torus cordalis. Our results improve the previous results by Flocchini in 2004.

Suggested Citation

  • Chun-Ying Chiang & Wei-Ting Huang & Hong-Gwa Yeh, 2016. "Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 815-832, February.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9790-5
    DOI: 10.1007/s10878-014-9790-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9790-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9790-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chun-Ying Chiang & Liang-Hao Huang & Bo-Jr Li & Jiaojiao Wu & Hong-Gwa Yeh, 2013. "Some results on the target set selection problem," Journal of Combinatorial Optimization, Springer, vol. 25(4), pages 702-715, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xianliang Liu & Zishen Yang & Wei Wang, 2021. "The t-latency bounded strong target set selection problem in some kinds of special family of graphs," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 105-117, January.
    2. Boris Brimkov & Derek Mikesell & Illya V. Hicks, 2021. "Improved Computational Approaches and Heuristics for Zero Forcing," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1384-1399, October.
    3. Brimkov, Boris & Fast, Caleb C. & Hicks, Illya V., 2019. "Computational approaches for zero forcing and related problems," European Journal of Operational Research, Elsevier, vol. 273(3), pages 889-903.
    4. Haining Jiang, 2020. "Target Set Selection on generalized pancake graphs," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(2), pages 379-389, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9790-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.