Some Unicyclic Graphs, Bistar Graph and their Super Domination Number

Silpa S, Silpa Sreekumar, Anjana T S, Manjusha P

doi:10.17762/msea.v71i3.462

Some Unicyclic Graphs, Bistar Graph and their Super Domination Number

Authors

Silpa S, Silpa Sreekumar, Anjana T S, Manjusha P

DOI:

https://doi.org/10.17762/msea.v71i3.462

Abstract

Consider simple connected undirected graph having as the vertex set and as the edge set. A set is called the super dominating set of if , where . The least cardinality of the super dominating sets in G is the super domination number, . Some graphs were selected and analysed to obtain the super domination number.

Downloads

Published

2022-08-19

How to Cite

Silpa S, Silpa Sreekumar, Anjana T S, Manjusha P. (2022). Some Unicyclic Graphs, Bistar Graph and their Super Domination Number. Mathematical Statistician and Engineering Applications, 71(3), 1225–1230. https://doi.org/10.17762/msea.v71i3.462