학술논문

Roman Domination in Complementary Prism Graphs.
Document Type
Article
Source
International Journal of Mathematical Combinatorics. 2012, Vol. 2, p24-31. 8p.
Subject
*DOMINATING set
*MATHEMATICAL functions
*GRAPH labelings
*NUMERICAL solutions to equations
*MATCHING theory
*PARAMETER estimation
*MATHEMATICAL analysis
Language
ISSN
1937-1055
Abstract
A Roman domination function on a complementary prism graph GGc is a function f : V ∪ Vc * {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number γR(GGc) of a graph G = (V,E) is the minimum of Due to image rights restrictions, multiple line equation(s) cannot be graphically displayed. f(x) over such functions, where the complementary prism GGc of G is graph obtained from disjoint union of G and its complement Gc by adding edges of a perfect matching between corresponding vertices of G and Gc. In this paper, we have investigated few properties of γR(GGc) and its relation with other parameters are obtained. [ABSTRACT FROM AUTHOR]