پديدآورندگان :
Alambardar Meybodi M m.alambardar@stu.yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran; The Laboratory of Quantum Information Processing and Cryptography, Yazd University, Yazd, Iran , Hooshmandasl M. R hooshmandasl@yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran; The Laboratory of Quantum Information Processing and Cryptography, Yazd University, Yazd, Iran , Rajaati M m.rajaati@stu.yazd.ac.ir Department of Computer Science, Yazd University, Yazd, Iran; The Laboratory of Quantum Information Processing and Cryptography, Yazd University, Yazd, Iran
كليدواژه :
Roman Domination , Tree , width , SETH
چكيده فارسي :
ARomandominatingfunctiononagraphG = (V,E)isalabelingf : V (G) → {0,1,2} such that every vertex with label 0 has a neighbor with label 2. The weight f(V ) of a function f on G is the value Σv∈V f(v). The Roman domination number γr(G) is the minimum weight of a Roman domination function on G. In this paper, we show the lower bound O∗(4n) for the Roman dominationprobleminthegraphwithconstanttreewidthisprobablyoptimal under the assumption of the Strong Exponential Time Hypothesis(SETH).
