关于3×n格子图的弱罗马控制Weak Rome control on 3 x n Lattice graphs.pdfVIP

河南大学 硕士学位论文 关于3×n格子图的弱罗马控制 姓名：王秀敏 申请学位级别：硕士 专业：运筹学与控制论 指导教师：宋晓新 2011-05 Á ‡  G = ( V, E ) ´˜‡ ã, f : V → {0, 1, 2} ´˜‡½Â3 ã G º:8 V þ¼ ê, é f 5`˜‡ f (u) = 0 º: u ¡™“”:, XJ§Ø†?ۑ º:ƒ . ¼ê f ¡fÛꛛ¼ê ({¡ WRDF), XJéz˜‡ f (u) = 0 º: u, Ñk ˜‡ f (v) ≥ 1 º: v ƒ, ¿…¼ê f : V → {0, 1, 2} ¦ f (u) = 1, f (v) = f (v) − 1 … f (x) = f (x), é?¿ x ∈ V − {u, v}, vk™“”:. ¼ê f ·‚P w (f ) … w (f ) = f (v). ã G fÛꛛ¼ê¡fÛꛛê, P γ (G). 3 v ∈V r ©¥, ·‚‰Ñ 3 × n ‚ ãfÛꛛê, 9[y ²L§. …cµ fÛꛛ¼ê, fÛꛛê, 3 × n ‚fã. I ABSTRACT Let G = ( V, E ) be a graph and let f : V → {0, 1, 2}. A vertex u with f (u)=0 is said to be undefended with respect to f if it is not adjacent to a vertex with positive weight. The function f is a weak Roman dominating function (WRDF) if each vertex u with f (u)=0 is a adjacent to a vertex v with f (v) ≥ 1, such that no vertex is undefended with respect to f , where the function f : V → {0, 1, 2}. is defined by f (u)=1, f (v) = f (v) − 1 and f (x) = f (x) if x ∈ V − {u, v}. The weight of f is w (f ) = v ∈V f (v). The weak Roman domination number of G, denoted by γr (G), is the minimun weight of a weak Roman dominating function in G[4]. In this paper, we will determine the weak Roman domination number of a 3 × n grid graph. KEYWORDS: Weak Roman domination function, Wea