Accurate Independent [1, 2] – Domination in Graphs

Authors

  • Sathish T, Vinodh Kumar A R, Reshma S P

DOI:

https://doi.org/10.17762/msea.v71i4.1107

Abstract

A [1,2] – dominating set  of  is anindependent  [1,2] – dominating set, if the induced subgraphhas no edges.An independent [1,2] – dominating set  of graph  is an accurate independent [1,2] – dominating set, if  has no independent [1, 2] – dominating set of cardinality .  The cardinality of the minimum accurate independent [1,2] – dominating set is called the accurate independent [1,2] – domination number and is denoted by of . In this paper, we initiate a study of this new parameter and obtain some results concerning this parameter.

Downloads

Published

2022-10-17

How to Cite

Sathish T, Vinodh Kumar A R, Reshma S P. (2022). Accurate Independent [1, 2] – Domination in Graphs. Mathematical Statistician and Engineering Applications, 71(4), 5161–5171. https://doi.org/10.17762/msea.v71i4.1107

Issue

Vol. 71 No. 4 (2022)

Section

Articles