Abstract
The 2-bond is a generalization of the 2-join where the subsets of nodes that are connected on each shore of the partition are not necessarily disjoint. If all the subsets are cliques we say that the 2-bond is a 2-clique-bond.The 2-clique-bond composition builds a graph G admitting a 2-clique-bond starting from two graphs G1 and G2. We prove that a linear description of the stable set polytope of G is obtained by properly composing the linear inequalities describing the stable set polytopes of G1, G2 and two other related graphs.We explain how to apply iteratively the 2-clique-bond composition to provide the complete linear description of the stable set polytope of new classes of graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
