STRONG SPLIT DOMINATION POLYNOMIAL OF PATHS
Main Article Content
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
Metrics
Article Details
Licensing
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
