.

ISSN 2063-5346
For urgent queries please contact : +918130348310

Split Domination in Lict Subdivision Graph of a Graph

Main Article Content

Kalshetti Swati Mallinath, Shailashree
» doi: 10.48047/ecb/2023.12.si4.693

Abstract

For any graph G, the Lict subdivision dominating set D⊆V{n[S(G)]} is a Split lict subdivision dominating set, in the event that the sub graph 〈V{n[S(G)]}-D〉 is disconnected. The least cardinality of vertices in such a set denotes the Split lict sub division domination number in S(G) or Split domination in lict subdivision graph of a graph and is represented by γ_sns (G). We study the graph theoretic properties of γ_sns (G) and many bounds were obtained in terms of the various components of G and it was also discovered how it related to other domination parameters

Article Details