On the dominating set polytope of web graphs

DOI10.1016/j.endm.2009.11.021zbMath1268.05144OpenAlexW2076025094MaRDI QIDQ2840527

No author found.

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.021

zbMATH Keywords

circulant matrixpolyhedral combinatoricsweb graphdominating set polyhedronset covering polyhedrondominating set polytope

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Circuits and circulant minors ⋮ Some advances on the set covering polyhedron of circulant matrices ⋮ The minor inequalities in the description of the set covering polyhedron of circulant matrices ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• On the set covering polyhedron of circulant matrices
• On the facial structure of the set covering polytope
• Ideal 0, 1 matrices
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• On the dominating set polytope
• Arithmetic relations in the set covering polyhedron of circulant clutters

This page was built for publication: On the dominating set polytope of web graphs