Bounds on Co-Independent Liar’s Domination in Graphs

K. Suriya Prabha, S. Amutha, N. Anbazhagan, Ismail Naci Cangul and Ghulam Shabbir

Journal of Mathematics, 2021, vol. 2021, 1-6

Abstract: 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, NGv∩S≥2, (ii) for every pair u,v∈V of distinct vertices, NGu∪NGv∩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 γcoiLRG. 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2021/5544559.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2021/5544559.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:5544559

DOI: 10.1155/2021/5544559

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().