[PDF] Top 20 On total domination and total equitable domination in graphs

... a total dominating set of G if N(D) = V (G) or equivalently if every vertex v ∈ V (G) is adjacent to at least one element in ...of total dominating set is called total domination number which ... See full document

... A precise notion of a dominating set, that is present in the current literature can be said to be given by Berge (1962) and Ore (1962). Since then a number of graph theorists, Allan and Laskar (1978) Allan et al., ... See full document

... 2-tuple domination problem on trapezoid ...about total domination related parameters and in [1, 13] have found some results on signed edge domination ...about total edge ... See full document

... secure total dominating set of G. If V – D contains a secure total dominating set D' of G, then D' is called an inverse secure total dominating set with respect to ...secure total ... See full document

... fuzzy graphs was proposed by Kaufmann [4], from the fuzzy relations introduced by Zadeh ...of domination in fuzzy graphs was investigated by ...independent domination, total ... See full document

... The domination in graphs is one of the concepts in graph theory which has attracted many researchers to work on ...of domination models are available in existing literature - Independent ... See full document

... Fuzzy graphs were introduced by ...introduced total domination in fuzzy graphs using effective ...of domination in fuzzy graphs has been growing very fast and has numerous ... See full document

... global domination and Roman domi- nation numbers and also prove that these results are asymptotically best ...restrained domination and total restrained domination numbers for large classes of ... See full document

... the domination number of G and is denoted by    G ...the total dominating set, if for every vertex v V  , there exists a vertex u  S , u  v such that u is adjacent to v ...The total ... See full document

... Roman domination is introduced by ...of domination and its parameters dependent, determine the graph that is the number of that parameter is ...all graphs with total domination number ... See full document

... and domination number we refer the reader to [4]. Recently the equitable dominating set and the equitability in graphs has been introduced and studied in ...is equitable adjacent to v if they ... See full document

... the domination number of a ...the domination number can be used for correctly distinguishing among the trees that represent native structures and those that are not likely candidates to represent ... See full document

... All graphs considered in this paper are simple, finite, connected, and ...of domination in graphs was introduced by Hedetniemi and Laskar 1 in 1990, then the equitable domination and ... See full document

... We begin with simple, finite, connected and undirected graph G with vertex set V (G) and edge set E(G). For any undefined terminology and notation related to the concept of domination we refer to Haynes et al. [7] ... See full document

... an equitable power dominating set, if for every vertex ∈ − there exists an adjacent vertex ∈ such that the difference between the degree of and degree of is less than or equal to 1, that is | ( ) − ( )| ≤ ...an ... See full document

... Regular total semi - µ strong (weak) edge domination number in an intuitionistic fuzzy graph is defined and established the parametric ...an equitable regular total semi - µ strong (weak) edge ... See full document

... degree equitable domination number in ...between domination and degree equitable domination and independent ...the domination number, degree equitable domination ... See full document

... total global dominating set of G. Then abE(G) . Since S is a fuzzy connected total global dominating set of G, there exists no node joined to both a and b. As S is a dominating set of G each node uV(G)  ... See full document

... Swaminathan et al [13] introduced the concept of equitable domination in graph by considering the following real world problems. In a network, nodes with nearly equal capacity may interact with each other ... See full document

... soft equitable dominating set, minimal fuzzy soft equitable dominating set, strong(weak) fuzzy soft equitable dominating set, fuzzy soft equitable independent ... See full document