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

The weakly connected independent set polytope in corona and join of graphs

Author

Listed:
  • F. Bendali

    (Université Clermont Auvergne)

  • J. Mailfert

    (Université Clermont Auvergne)

Abstract

Given a connected undirected graph $$G=(V, E)$$ G = ( V , E ) , a subset W of nodes of G is a weakly connected independent set if W is an independent set and the partial graph $$(V, \delta (W))$$ ( V , δ ( W ) ) is connected, where $$\delta (W)$$ δ ( W ) is the set of edges with only one endnode in W. This article proposes several distinct results about the weakly connected independent sets of a graph obtained by corona or join operations: the complete description of the wcis polytope for a corona or a join of two graphs of which we know the wcis polytopes or the maximal independent set polytopes, and the consequences of these graph operations on the minimum weight weakly connected independent set problem (MWWCISP). A class of graphs is also inductively defined from the connected bipartite graphs, the cycles and the strongly chordal graphs, for which the MWWCISP is polynomially solvable. This work is a direct continuation of the article (Bendali et al. in Discrete Optim 22:87–110, 2016) where a similar theorem about complete description of the wcis polytope has been given for 1-sum operation.

Suggested Citation

  • F. Bendali & J. Mailfert, 2018. "The weakly connected independent set polytope in corona and join of graphs," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 1007-1023, October.
    • Handle: RePEc:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-018-0275-9
    DOI: 10.1007/s10878-018-0275-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-0275-9
    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-0275-9?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:36:y:2018:i:3:d:10.1007_s10878-018-0275-9. 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.