Inverse litact domination in graphs

被引：0

作者：

Lakshmi, A.Renuka ^{[1
]}

Vani, Manda ^{[2
]}

Majeed, Abdul ^{[3
]}

机构：

[1] Mathematics, Department of Sciences and Humanities, Vasireddy Venkatadri Institute of Technology, A. P, India

[2] Department of Mathematics, A.P, Bapatla, India

[3] Basic Sciences and Humanities, Muffakham Jah college of Engineering and Technology, Telangana, Hyderabad, India

来源：

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Graphic methods

引用

页码：3552 / 3557

共 50 条

[1] Roman domination in graphs
University of Victoria, Victoria, BC, V8W 3P4, Canada
不详
不详
1600, 11-22 (March 6, 2004):
[2] Bounds for independent Roman domination in graphs
Department of Mathematics, Shahrood University of Technology, Shahrood, Iran
不详
不详
J. Comb. Math. Comb. Comp., (351-365):
[3] TOTAL DOMINATION IN INTERVAL-GRAPHS
KEIL, JM
INFORMATION PROCESSING LETTERS, 1986, 22 (04) : 171 - 174
[4] NEW CLASSIFICATION OF GRAPHS IN VIEW OF THE DOMINATION NUMBER OF CENTRAL GRAPHS
Fujita, Shinya
Kazemnejad, Farshad
Pahlavsay, Behnaz
arXiv, 2022,
[5] Domination number in neutrosophic soft graphs
Satham Hussain, S.
Jahir Hussain, R.
Smarandache, Florentin
Neutrosophic Sets and Systems, 2019, 28 (2019) : 228 - 244
[6] Graphs and their complements with equal total domination numbers
1600, Charles Babbage Research Centre (87):
[7] Algorithm for prescribed multiple domination in arbitrary graphs
Univ of Macedonia, Thessaloniki, Greece
Comput Math Appl, 1600, 8 (109-115):
[8] On a class of graphs with large total domination number
Bahadir, Selim
Gözüpek, Didem
Discrete Mathematics and Theoretical Computer Science, 2018, 20 (01):
[9] On the integer {k}-domination number of circulant graphs
Department of Mathematics, National Taiwan Normal University, Taipei
11677, Taiwan
不详
30010, Taiwan
不详
DE
19716, United States
arXiv,
[10] Disjunctive domination in graphs with minimum degree at least two
Zhuang, Wei
arXiv, 2021,