IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v37y2019i2d10.1007_s10878-018-0316-4.html
   My bibliography  Save this article

On the weighted safe set problem on paths and cycles

Author

Listed:
  • Shinya Fujita

    (Yokohama City University)

  • Tommy Jensen

    (Aarhus Universitet)

  • Boram Park

    (Ajou University)

  • Tadashi Sakuma

    (Yamagata University)

Abstract

Let G be a graph, and let w be a positive real-valued weight function on V(G). For every subset X of V(G), let $$w(X)=\sum _{v \in X} w(v)$$ w ( X ) = ∑ v ∈ X w ( v ) . A non-empty subset $$S \subset V(G)$$ S ⊂ V ( G ) is a weighted safe set of (G, w) if, for every component C of the subgraph induced by S and every component D of $$G-S$$ G - S , we have $$w(C) \ge w(D)$$ w ( C ) ≥ w ( D ) whenever there is an edge between C and D. If the subgraph of G induced by a weighted safe set S is connected, then the set S is called a connected weighted safe set of (G, w). The weighted safe number $$\mathrm{s}(G,w)$$ s ( G , w ) and connected weighted safe number $$\mathrm{cs}(G,w)$$ cs ( G , w ) of (G, w) are the minimum weights w(S) among all weighted safe sets and all connected weighted safe sets of (G, w), respectively. It is easy to see that for any pair (G, w), $$\mathrm{s}(G,w) \le \mathrm{cs}(G,w)$$ s ( G , w ) ≤ cs ( G , w ) by their definitions. In this paper, we discuss the possible equality when G is a path or a cycle. We also give an answer to a problem due to Tittmann et al. (Eur J Combin 32:954–974, 2011) concerning subgraph component polynomials for cycles and complete graphs.

Suggested Citation

  • Shinya Fujita & Tommy Jensen & Boram Park & Tadashi Sakuma, 2019. "On the weighted safe set problem on paths and cycles," Journal of Combinatorial Optimization, Springer, vol. 37(2), pages 685-701, February.
    • Handle: RePEc:spr:jcomop:v:37:y:2019:i:2:d:10.1007_s10878-018-0316-4
    DOI: 10.1007/s10878-018-0316-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0316-4
    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-018-0316-4?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.

    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:37:y:2019:i:2:d:10.1007_s10878-018-0316-4. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.