IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v51y2020i2d10.1007_s13226-020-0406-8.html
   My bibliography  Save this article

Target Set Selection on generalized pancake graphs

Author

Listed:
  • Haining Jiang

    (Heze University
    Xiamen University)

Abstract

Target Set Selection (TSS) was initially proposed to study the problem of the spread of information, ideas or influence through a social network and had formulated many problems arising in various practical applications. We consider a particular type of graphs, namely n-dimensional m-sided pancake graph mPn, which is one class of Cayley graphs and is widely used in the symmetric interconnection networks. We establish a bound of TSS on mPn by the minimum feedback vertex set.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:indpam:v:51:y:2020:i:2:d:10.1007_s13226-020-0406-8
    DOI: 10.1007/s13226-020-0406-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-020-0406-8
    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/s13226-020-0406-8?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. 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.
    3. 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.
    4. 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.

    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:indpam:v:51:y:2020:i:2:d:10.1007_s13226-020-0406-8. 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.