On Accurate Strong Non-Split Domination in Graphs

Authors

  • A. Mohamed Ismayil
  • H. Sabitha Begum

Keywords:

Accurate non-split dominating set, Accurate strong non-split dominating set, Accurate non-split domination number, Accurate strong non-split domination number

Abstract

Accurate strong non-split dominating set in a graph with the relevant illustration is described in this manuscript. Minimal accurate strong non-split dominating set and accurate strong non-split domination numbers are specified for graphs. For some popular graphs, bounds on accurate strong non-split domination numbers are determined. Strong non-split domination number connections with other well-known domi-nating parameters are discovered. A few theorem relating to accurate strong non-split domination numbers are presented and obtained.

Downloads

Published

2025-10-23

How to Cite

A. Mohamed Ismayil, & H. Sabitha Begum. (2025). On Accurate Strong Non-Split Domination in Graphs. Utilitas Mathematica, 122(2), 2105–2111. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/2951

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.