Let G = V, E be a simple graph. A subset D of V G is called a total strong dominating set of G, if for every u V G , there exists a v D such that u and v are adjacent and deg v = deg u . The minimum cardinality of a total strong dominating set of G is called total strong domination number of G and is denoted by s t G . Corresponding to total strong dominating set of G, total strong dominating function can be defined. The minimum weight of a total strong dominating function is called the fractional total strong domination number of G and is denoted by t sf G . A study of total strong dominating functions is carried out in this paper
by Dr. M. Kavitha ""Basic Maximal Total Strong Dominating Functions""
Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-4 , June 2020,
URL: https://www.ijtsrd.com/papers/ijtsrd30715.pdf
Paper Url :https://www.ijtsrd.com/mathemetics/other/30715/basic-maximal-total-strong-dominating-functions/dr-m-kavitha
internationaljournalsofcomputerscience, callforpapercomputerscience, ugcapprovedjournalsforcomputerscience
No comments:
Post a Comment