An investigation on some classes of super strongly perfect graphs

Wireless sensor network comprises of dense sensor nodes which are randomly deployed. Major challenges in WSN are limited battery source and computation capacity. Considerable research has been carried out in the area of maximizing battery lifetime by reducing the energy consumption. Once such proposed technique involves hierarchical topology control. Conventionally proposed algorithm for hierarchical topology control involves computationally intensive soft computing tools. It leads to higher energy consumption in the sink node. Hence it necessitates computationally less intensive technique for cluster head selection. In this paper, an efficient cluster head selection is proposed using minimal dominating set in Super Strongly Perfect (SSP) graph.

show abstract

Applying the (1,2)-pitchfork domination and it's inverse on some special graphs

Abdlhusein

2022

bspm

View full text Add to dashboard Cite

Let G be a finite simple and undirected graph without isolated vertices. For any non-negative integers j and k, a subset D of V is called a pitchfork dominating set if every vertex in D dominates at least j and at most k vertices of V - D. A subset D -1 of V - D is an inverse pitchfork dominating set if it is a dominating set. The pitchfork domination number of G, denoted by pf (G) is a minimum cardinality over all pitchfork dominating sets in G. The inverse pitchfork domination number of G, denoted by pf-1 (G) is a minimum cardinality over all inverse pitchfork dominating sets in G. In this paper, pitchfork dominations and it's inverse are applied when j = 1 and k = 2 on some standard graphs such as: tadpole graph, lollipop graph, lollipop flower graph , daisy graph and Barbell graph.

show abstract

An investigation on some classes of super strongly perfect graphs

Cited by 3 publications

References 2 publications

Further results on bi-domination in graphs

Further results on bi-domination in graphs

Super Strongly Perfect Graphs in the Selection of Cluster Heads in Wireless Sensor Networks

Applying the (1,2)-pitchfork domination and it's inverse on some special graphs

Contact Info

Product

Resources

About