Signed Total Roman Dominating Functions of Corona Product of a Path with a Complete Graph

Abstract

Graph theory is a fascinating subject in mathematics. Its Applications in many fields like Physical Sciences, Engineering communications, coding theory, Linguistics, Logical Algebra and Computer networking. Let G be a simple graph with vertex set V and edge set E and the function : [0,1] fV  is called a dominating function (DF) of G, if for each vV  , the sum of the function values over v and the elements incident to v is greater than or equal to one. It is a minimal dominating function (MDF), if for all gf  , g is not DF. In this paper, we study the minimal total dominating functions, minimal total roman dominating functions, minimal signed total roman dominating functions of corona product graph of a path with a complete graph and obtain total domination number () t G  , total roman domination number () tR G  and signed total roman domination number () stR G  of these graphs.