[PDF] Top 20 On Strong Resolving Domination in the Join and Corona of Graphs

... In recent years, the concept of domination in graphs has been studied extensively and several research papers have been published on this topic. The said concept was not formally defined mathematically ... See full document

... effective domination number of ...effective domination number of ...effective domination number of ...the join, corona and composition of ...effective domination numbers, minimal ... See full document

... Important results on characterization of non-split and inverse non-split dominating sets were presented here and corresponding formulas for computing the non-split and inverse non-split [r] ... See full document

... paper, we describe the topologies induced by the complement of a graph, the join, the corona, the composition and the Cartesian product of graphs.. 2010 Mathematics Subject Classificatio[r] ... See full document

... the join, corona, lexico- graphic product and Cartesian product of graphs are found in Macapodi et ...connected graphs of orders m and n, respectively, and let α ∈ (0, ... See full document

... be graphs with disjoint vertex ...The join of G and H is the graph G + H with vertex set V (G) ∪ V (H) and edge set E(G) ∪ E(H) ∪ {uv : u ∈ V (G), v ∈ V ...The corona of G and H is the graph G ◦ H ... See full document

... two graphs G and H with disjoint vertex sets, the join of G and H is the graph G+H with V (G+H) = V (G)∪V (H) and E(G +H) = E(G)∪ E(H) ∪{uv : u ∈ V (G), v ∈ V ...The corona of G and H is the graph G ... See full document

... include corona product, cartesian product, strong product, composition, join, disjunction and symmetric difference of ...some graphs of general ... See full document

... with 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 ... See full document

... thirty domination parameters have been studied by different authors and in this paper, we have introduced the concept of strong edge domination in fuzzy ...edge domination number of complete ... See full document

... In this paper, we revisit the construction of a topological space given in [1] and describe the topologies induced by the corona, edge corona, disjunction, symmetric difference, Tensor product, and the ... See full document

... a strong total dominating set of ...all strong neighbors are fuzzy end nodes. Since K is a strong total dominating set of there exists some node in K which dominates ...the strong neighbor of ... See full document

... K and isolated vertices. Since G is a disconnected graph and    G  1 , G has at least three vertices. Assume that G has m induced sub-graphs K 2 . For solving the problem it is enough to show that m  2 . On ... See full document

... Let G be a graph. A set D ⊆ V (G ) is said to be a strong point set dominating set (spsd-set) of G. if for each set S ⊆ V − D , there exists a vertex u ∈ D such that the sub graph S U { } u induced by S U { } u ... See full document

... The strong (weak) domination number 𝛾 𝑠 (𝐺) (𝛾 𝑤 (𝐺)) of G is the minimum cardinality of a strong (weak) dominating set of G and 𝛤 𝑠 (𝐺) is the maximum cardinality of a minimal strong ... See full document

... in graphs was started by Ore and Berge [1,9]. The domination number and the independent domination number were introduced by Cockayne and Hedetniemi ...in graphs was introduced by Fink and ... See full document

... Δ(𝐺) and 𝛿(𝐺). A vertex of a degree 0 in 𝐺 is called an isolated vertex and a vertex of degree 1 is called a pendent vertex or an end vertex of 𝐺. A vertex of a graph 𝐺 is said to be a vertex of full degree if it is ... See full document

... Δ(𝐺) and 𝛿(𝐺). A vertex of a degree 0 in 𝐺 is called an isolated vertex and a vertex of degree 1 is called a pendent vertex or an end vertex of 𝐺. A vertex of a graph 𝐺 is said to be a vertex of full degree if it is ... See full document

... maximum and the minimum degrees of the vertices of 𝐺 are respectively denoted by Δ(𝐺) and 𝛿(𝐺). A vertex of a degree 0 in 𝐺 is called an isolated vertex and a vertex of degree 1 is called a pendent vertex or an end ... See full document

... many graphs arise from simpler graphs via various graph operations and one can study the properties of smaller graphs and deriving with it some information about larger ...product graphs are ... See full document