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

F. Bendali () and J. Mailfert ()
Additional contact information
F. Bendali: Université Clermont Auvergne
J. Mailfert: Université Clermont Auvergne

Journal of Combinatorial Optimization, 2018, vol. 36, issue 3, No 16, 1007-1023

Abstract: 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.

Keywords: Weakly connected independent set; Corona; Join; Composition of polytopes (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0275-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:36:y:2018:i:3:d:10.1007_s10878-018-0275-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0275-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().