Abstract
Given a connected undirected graph \(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))\) is connected, where \(\delta (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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alzoubi KM, Wan PJ, Frieder O (2003) Weakly connected dominating sets and spanners in wireless Ad Hoc networks. In: Proceedings of the 23rd international conference on distributed computing systems
Bendali F, Mailfert J, Mameri D (2015) On minimum weakly-connected independent sets for wireless sensor networks: properties and enumeration algorithm. RAIRO Oper Res 49:313–334
Bendali F, Mailfert J, Mameri D (2016) The minimum weakly-connected independent set problem: polyhedral results and Branch-and-Cut. Discrete Optim 22:87–110
Chvàtal V (1975) On certain polytopes associated to some graphs. J Comb Theory Series B 18:138–154
Farber M (1983) Characterizations of strongly chordal graphs. Discrete Math 43:173–189
Farber M (1984) Domination, independent domination, and duality in strongly chordal graphs. Discrete Appl Math 7:115–130
Fonlupt J, Hadjar A (2002) The stable set polytope and some operations on graphs. Discrete Math 252:123–140
Frucht R, Harary F (1970) On the corona of two graphs. Aequ Math 4:322–325
Go CE, Canoy SR Jr (2011) Domination in the corona and join of graphs. Int Math Forum 6(16):763–771
Haynes TW, Hedetniemi ST, Slater PJ (1998) Fundamentals of domination in graphs: advanced topics. Marcel Dekker Inc, New York
Leonida RE (2013) Weakly connected independent domination in the join of graphs. Int Math Forum 8(36):1767–1771
Leonida RE, Canoy SR Jr (2013) Weakly convex and weakly connected independent dominations in corona of graphs. Int Math Forum 8(31):1515–1522
Mahjoub AR, Mailfert J (2005) On the independent dominating set polytope. Eur J Comb 27:601–616
Mameri D (2014) L’indépendant faiblement connexe : études algorithmiques et polyèdrales. Thesis, Blaise Pascal university, Clermont-Ferrand, France
Santos AC, Bendali F, Mailfert J, Duhamel C, Hou KM (2009) Heuristics for designing energy-efficient wireless sensor network topologies. J Netw 4(6):436–444
Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency. Springer, Berlin Heidelberg
Yero IG, Kuziak D, Aguilar AR (2013) Coloring, location and domination of corona graphs. Aequ Math 86:1–21
Acknowledgements
The authors would like to thank the anonymous referees for their comments that permitted to considerably improve the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bendali, F., Mailfert, J. The weakly connected independent set polytope in corona and join of graphs. J Comb Optim 36, 1007–1023 (2018). https://doi.org/10.1007/s10878-018-0275-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-018-0275-9