The Accurate Distance - 2 Domination (Ad-2d) in Graphs

A. Lakshmi,  P. Sudha

doi:10.17762/msea.v71i4.837

The Accurate Distance - 2 Domination (Ad-2d) in Graphs

Authors

A. Lakshmi, P. Sudha

DOI:

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

Abstract

An AD-2D collection in G is constructed as V/D has no D-2D set with . The AD-2D number is the least cardinality in all AD-2Dcollections. We received several bounds on AD-2D number. Precise values of are acquire for few named graph, also their relationship with other parameters were extended. Named result: Nordhaus - Gaddum bounds were founded for this parameter.

Downloads

Published

2022-09-17

How to Cite

P. Sudha, A. L. . (2022). The Accurate Distance - 2 Domination (Ad-2d) in Graphs. Mathematical Statistician and Engineering Applications, 71(4), 2793–2805. https://doi.org/10.17762/msea.v71i4.837