15 search results - page 1 / 3 » A counterexample to the dominating set conjecture |
OL
2007
14 years 9 months ago
2007
Abstract The metric polytope metn is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities xij − xik − xjk ≤ 0 and xij + xik + x...
APPML
2010
14 years 10 months ago
2010
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
ORL
2008
14 years 10 months ago
2008
We present a new graph composition that produces a graph G from a given graph H and a fixed graph B called gear and we study its polyhedral properties. This composition yields cou...
74
Voted
COMBINATORICS
2000
14 years 10 months ago
2000
Let (G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that (G)(H) 2(G H) for all simple graphs G and H. 2000 Math...
DM
2002
14 years 10 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...