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

DOI10.1007/s10878-018-0275-9zbMath1410.05104OpenAlexW2789570183MaRDI QIDQ1631656

Jean Mailfert, Fatiha Bendali

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0275-9

zbMATH Keywords

coronajoincomposition of polytopesweakly connected independent set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Coloring, location and domination of corona graphs
• Domination, independent domination, and duality in strongly chordal graphs
• Characterizations of strongly chordal graphs
• On certain polytopes associated with graphs
• The stable set polytope and some operations on graphs
• The minimum weakly connected independent set problem: polyhedral results and branch-and-cut
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On the independent dominating set polytope
• On the corona of two graphs
• Weakly convex and weakly connected independent dominations in the corona of graphs
• Weakly connected independent domination in the join of graphs
• On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS

This page was built for publication: The weakly connected independent set polytope in corona and join of graphs