[PDF] Top 20 (1, 2) Double Domination in Graphs

... ( 1, 2 ) – double dominating ...atmost 2 from any other ...( 1, 2 ) – double dominating is n - 2 ...– 2 edges from a complete graph, then in the resulting ... See full document

... of domination in fuzzy graphs are introduced by ...(1, 2) domination in fuzzy graphs are introduced by ...(1, 2) domination in fuzzy ... See full document

... Figure 1, L(1)=1, L(2)=1, L(3)=2, L(4)=3, L(5)=4, L(6)=4, L(7)=6, L(8)=6, L(9)=6 and R(1)=2, R(2)=3, R(3)=4, R(4)=6, R(5)=6, R(6)=8, R(7)=9, R(8)=9, ... See full document

...   elements. Clearly  Sn (G)   Snsb (G) . Further, we consider a tree which is neither a star nor a path. Assume  (T)  3 , in n (T) each block is complete and every cutvertex of n (G) lies on exactly two blocks ... See full document

... Let G=(V,E) be a graph and let g be a function that assigns to each edge a set of colors chosen from the power set of {1,2} i.e., g:E(G)→ {1,2}. If for each edge E(G) such that g( we have ⋃ = {1,2},then g is called ... See full document

... V 2 f , V 3 f ) be the ordered partition of V ( G ) induced by f such that V i f = { x : f ( x ) = i } for i = 0, 2, ...a 1-1 correspondence between the function f and the partition ( V 0 f , ... See full document

... Let 𝑉 and 𝐸 represent vertex set and edge set respectively for graph 𝐺. Consider a vertex 𝑣 belongs to 𝑉, the number of edges incident on a vertex 𝑣 is called the degree of it and is denoted by 𝑑𝑒𝑔(𝑣) with minimum and ... See full document

... In this section p is a prime number and B(1, n) = {k < n : gcd(k, n) = 1}. Lemma 2.1. Let G be a group and H be a proper subgroup of G such that [G : H ] = t. If S = G \ H , then Cay(G : S) is a complete ... See full document

... independent domination numbers. The work of Allan and Laskar [2] is generalized by Topp and Volkmann [17] as well as by Acharya and Gupta ...new graphs whose domination number equals their ... See full document

... 6 1, where d(u) denotes the degree of vertex u and d(v) denotes the degree of vertex ...equitable domination number of G which is denoted by γ e ...equitable domination number of G is the minimum ... See full document

... of domination in graphs introduced by Claude Berge in 1958 and Oystein Ore in 1962 [6] is currently receiving much ...the domination in graphs became an area of study by many ...of ... See full document

... Definition 2.1. Let G be a connected bipartite graph with bipartition ( X, Y ) , with | X | = m and | Y | = n. The relative complement of G in K m,n denoted by G is the graph obtained by deleting all edges of G from K b ... See full document

... Fuzzy graphs proposed [4] from the fuzzy relations introduced [20] and [9] introduced another elaborated definition, including fuzzy vertex and fuzzy ...of domination in fuzzy graphs was investigate ... See full document

... discussed domination in fuzzy graphs. They defined domination using effective edges in fuzzy ...discussed domination in fuzzy graph using strong ...discussed domination, independent ... See full document

... In 1962, ore used the name “dominating set” and “domination number” for the same concept. In 1977, Cockayne and Hedetniemi made an interesting and extensive survey of the results known at that time about ... See full document

... independent domination number of a graph is the minimum cardinality of an independent dominating set (Haynes et ...split domination number of graph is the minimum cardinality of a strong split dominating ... See full document

... Chang [3] introduced the concept of the notion of fuzzy topology. Ore [7] introduced the concept of domination in theory of graphs. Heynes et al. [5] published the book in the concept of fundamental ... See full document

... regular graphs were investigated by many authors ...the domination and independent domination numbers of cubic graphs was investigated in [5, 13, 14, ... See full document

... Proof; From the definition of corona product the graph 𝐺 has 2𝑝 vertices 𝑝 pendant edges and 𝑝 suportaing vertices and the degree of any supporting vertices are at least three, that means in 𝐺 there are 𝑝 equitable ... See full document

... strong domination number. The relation between strong domination and maximum degree of the graph as well as weak domination and minimum degree of the graph were revealed by Swaminathan and Thangaraju ... See full document