On Vizing's conjecture

Bostjan Bresar. "On Vizing's conjecture." Discussiones Mathematicae Graph Theory 21.1 (2001): 5-11. <http://eudml.org/doc/270337>.

@article{BostjanBresar2001,
abstract = {A dominating set D for a graph G is a subset of V(G) such that any vertex in V(G)-D has a neighbor in D, and a domination number γ(G) is the size of a minimum dominating set for G. For the Cartesian product G ⃞ H Vizing's conjecture [10] states that γ(G ⃞ H) ≥ γ(G)γ(H) for every pair of graphs G,H. In this paper we introduce a new concept which extends the ordinary domination of graphs, and prove that the conjecture holds when γ(G) = γ(H) = 3.},
author = {Bostjan Bresar},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {graph; Cartesian product; domination number},
language = {eng},
number = {1},
pages = {5-11},
title = {On Vizing's conjecture},
url = {http://eudml.org/doc/270337},
volume = {21},
year = {2001},
}

TY - JOUR
AU - Bostjan Bresar
TI - On Vizing's conjecture
JO - Discussiones Mathematicae Graph Theory
PY - 2001
VL - 21
IS - 1
SP - 5
EP - 11
AB - A dominating set D for a graph G is a subset of V(G) such that any vertex in V(G)-D has a neighbor in D, and a domination number γ(G) is the size of a minimum dominating set for G. For the Cartesian product G ⃞ H Vizing's conjecture [10] states that γ(G ⃞ H) ≥ γ(G)γ(H) for every pair of graphs G,H. In this paper we introduce a new concept which extends the ordinary domination of graphs, and prove that the conjecture holds when γ(G) = γ(H) = 3.
LA - eng
KW - graph; Cartesian product; domination number
UR - http://eudml.org/doc/270337
ER -