Document Type

Article

Publication Date

2009

Disciplines

Discrete Mathematics and Combinatorics | Mathematics

Abstract

A Roman dominating function of a graph G is a labeling f: V(G) →{0,1,2} such that every vertex with a label 0 has a neighbor with label 2. The Roman domination number γR(G) of G is the minimum of ∑ʋϵV(G)f(v) over such functions. Let G be a connected n-vertex graph. We prove that γR(G) ≤ 4n/5, and we characterize the graphs achieving equality. We obtain sharp upper and lower bounds for γR(G) + γR() and γR(G)γR(), improving known results for domination number. We prove that γR(G) ≤ 8n/11 when ᵟ(G) ≥ 2 and n ≥ 9, and this is sharp.

Comments

At the time of publication, Noah Prince was affiliated with the University of Illinois at Urbana-Champaign.

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.