The Total Strong Split Domination Number of Graphs
Journal Title: International Journal of Mathematics and Statistics Invention - Year 2017, Vol 5, Issue 2
Abstract
A total dominating set D of graph G = (V, E) is a total strong split dominating set if the induced subgraph < V-D > is totally disconnected with atleast two vertices. The total strong split domination number γtss(G) is the minimum cardinality of a total strong split dominating set. In this paper, we characterize total strong split dominating sets and obtain the exact values of γtss(G) for some graphs. Also some inequalities of γtss(G) are established.
Authors and Affiliations
T. Nicholas, T. Sheeba Helen
Keywords
Related Articles
- EP ID EP406645
- DOI -
- Views 143
- Downloads 0
Reflexive and Dihedral (Co) Homologies of /2 -Graded Algebras
We are concerned with the dihedral (co)homology of a unital /2 -graded algebra A over a field K with a graded involution and recall definitions and properties of Hochschild and cyclic (co) homology groups for a /2 -g...
The Total Strong Split Domination Number of Graphs
A total dominating set D of graph G = (V, E) is a total strong split dominating set if the induced subgraph < V-D > is totally disconnected with atleast two vertices. The total strong split domination number γtss(G) is t...
Birth and Death Processes_ General Case
ABirth and Death Processes(BDPs) is a continuous-time Markov chain that counts the number of particles in a system over time, they are popular modeling tools in population evolution, used more particularly in biology, ge...
Birth and Death Processeswith Finished Number of States
:A realistic description of the development of a population must obviously take into account both the births and deaths of the individuals composing it, this description can be illustrated by a simple model that is obtai...
A Novel Bayes Factor for Inverse Model Selection Problem based on Inverse Reference Distribution
Statistical model selection problem can be divided into two broad categories based on Forward and Inverse problem. Compared to a wealthy of literature available for Forward model selection, there are very few methods app...