On the dominating set polytope of web graphs
From MaRDI portal
Publication:2840527
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
circulant matrixpolyhedral combinatoricsweb graphdominating set polyhedronset covering polyhedrondominating set polytope
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
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