STRONG SPLIT DOMINATION POLYNOMIAL OF PATHS

Main Article Content

E. Selvi, R. Kala

Abstract

Let  be a simple graph. A dominating set  is a strong split dominating set if the induced subgraph  is totally disconnected with at least two vertices. Let  be the family of strong split dominating sets of  of cardinality  and .  We define the strong split domination polynomial of a graph  of order  as the polynomial . In this paper, we determine the strong split domination polynomial of paths and obtain some of its properties.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
E. Selvi, R. Kala. (2023). STRONG SPLIT DOMINATION POLYNOMIAL OF PATHS. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 11(2), 1193–1198. https://doi.org/10.17762/turcomat.v11i2.13820
Section
Research Articles