THE MINIMUM NONSPLIT PENDANT DOMINATION ENERGY OF A GRAPH

Authors

  • Swaroopa Rani N.C
  • B. Shanmukha

Keywords:

Nonsplit domination, Nonsplit pendant domination number, Energy of graph

Abstract

For a graph????, a subset ???? of ????(????) is called a nonsplit pendant dominating set if the induced graph

Downloads

Published

2025-06-16

How to Cite

Swaroopa Rani N.C, & B. Shanmukha. (2025). THE MINIMUM NONSPLIT PENDANT DOMINATION ENERGY OF A GRAPH. Utilitas Mathematica, 122(1), 1022–1031. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/2272

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.