An Improvement on Vizing's Conjecture

Abstract

Let γ(G) denote the domination number of a graph G. A Roman domination function of a graph G is a function f: V\0,1,2\ such that every vertex with 0 has a neighbor with 2. The Roman domination number γR(G) is the minimum of f(V(G))=v∈ Vf(v) over all such functions. Let G H denote the Cartesian product of graphs G and H. We prove that γ(G)γ(H) ≤ γR(G H) for all simple graphs G and H, which is an improvement of γ(G)γ(H) ≤ 2γ(G H) given by Clark and Suen CS, since γ(G H)≤ γR(G H)≤ 2γ(G H).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…