Triple effect domination in graphs
Zinah H. Abdulhasan, Mohammed A. Abdlhusein
Abstract
In this paper, a new model of domination in graphs called triple effect domination is introduced depending on the number of dominated vertices. Let G=(V,E) be a finite, simple and undirected graph without isolated vertex, a subset D of V is a triple effect dominating set if every vertex v ∈ D dominates three vertices from V -D. The triple effect domination number, denotes γte(G) is the minimum cardinality over all triple effect dominating sets in G. More bounds and properties are studied and proved for this type of domination. Also, it is applied on several graphs.
Topics & Concepts
CombinatoricsVertex (graph theory)MathematicsDominating setUndirected graphDomination analysisGraphCardinality (data modeling)Discrete mathematicsComputer scienceData miningAdvanced Graph Theory ResearchGraph Labeling and Dimension ProblemsComplexity and Algorithms in Graphs