Bounds on Co-Independent Liar’s Domination in Graphs
Keyword(s):
A set S ⊆ V of a graph G = V , E is called a co-independent liar’s dominating set of G if (i) for all v ∈ V , N G v ∩ S ≥ 2 , (ii) for every pair u , v ∈ V of distinct vertices, N G u ∪ N G v ∩ S ≥ 3 , and (iii) the induced subgraph of G on V − S has no edge. The minimum cardinality of vertices in such a set is called the co-independent liar’s domination number of G , and it is denoted by γ coi L R G . In this paper, we introduce the concept of co-independent liar’s domination number of the middle graph of some standard graphs such as path and cycle graphs, and we propose some bounds on this new parameter.
2011 ◽
Vol 3
(3)
◽
pp. 547-555
◽
Keyword(s):
2020 ◽
Vol 12
(05)
◽
pp. 2050065
2012 ◽
Vol 43
(4)
◽
pp. 557-562
◽
Keyword(s):
Keyword(s):
2015 ◽
Vol 23
(2)
◽
pp. 187-199
2018 ◽
Vol 7
(4.10)
◽
pp. 589
Keyword(s):
2020 ◽
Vol 12
(02)
◽
pp. 2050025
Keyword(s):
Keyword(s):