[PDF] Top 20 La eficacia del Instituto Nacional de Criminología

... a fuzzy graph and u, v be two nodes of G(𝜎, ...is strong. A subset D of V is called a strong vertex dominating set of G (𝜎, 𝜇) if for every 𝑣 ∈ 𝑉 − 𝐷, there exists 𝑢 ∈ 𝐷 such that u dominates ...A ... See full document

... The origin of graph theory started with Konigsberg bridge problem in 1735. This problem led to the concept of Eulerian graph. Euler studied the Konigsberg problem and constructed a structure that solves the problem that ... See full document

... Fuzzy graphs were introduced by Rosenfeld ...the fuzzy analogue of several graph theoretic concepts like paths, cycles, trees and connectedness and established some of their properties ...of ... See full document

... of fuzzy graphs was proposed by Kafmann [3] from the fuzzy relations introduced by Zadeh ...including fuzzy vertex and fuzzy edges. The concept of domination in fuzzy ... See full document

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

... The edge domination was introduced by Arumugam and Velammal ...The edge domination problem has many applications in resource allocation, network routing and encoding theory problems [1, ...of ... See full document

... By a graph, it is meant that a finite, undirected graph without loops and multiple edges. Let G be a graph with vertex V and edge set E. Let p = |V (G)| and q = |E (G)|. The minimum and maximum degrees of ... See full document

... split domination and non – split domination in Bipolar Fuzzy Graphs ...connected domination, split domination, Strong Split domination and non – split ... 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

... Total Edge Domination and Some Secure and Inverse Secure Fuzzy Domination Parameters‖, ...J. Fuzzy Mathematical Archive ...―Total domination in graphs‖, Networks, 10 1980, ... See full document

... Throughout this paper, we consider finite, undirected, simple graphs. Let G = (V,E) be a graph. The degree of any vertex u in G is the number of edges incident with u and is denoted by deg u. The minimum and ... See full document

... Case 1: Let , lies in some fixed geodesic P between the pair of points of . With removal of the edge , P can be splitted into two unique fixed geodesics and , where = u − x geodesic and = y – v geodesic. Now the ... See full document

... Abstract. Fuzzy soft set are introduced by author Molodtsov, which is solve imprecise problems in the field of engineering, social science, economic, medical secience and ...of domination in fuzzy ... See full document

... In fuzzy graphs, monotone decreasing property and monotone increasing property are ...decreasing fuzzy graph property for vertex ...on fuzzy graphs with the vertex domination ... See full document

... The fuzzy definition of fuzzy graphs was proposed by Kaufmann [4], from the fuzzy relations introduced by Zadeh ...including fuzzy vertex and fuzzy edges. Several fuzzy ... See full document

... of fuzzy graphs was proposed by Kafmann, from the fuzzy relations introduced by ...including fuzzy vertex and fuzzy edges, and several fuzzy analogs of graph theoretic concepts ... See full document

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

... of fuzzy topology. Ore [7] introduced the concept of domination in theory of ...fundamental domination on graphs and they worked more concepts on domination on ...pythagorean ... See full document

... a strong Lict dominating set if every vertex in [ ( )] − is strongly dominated by at least one vertex in .... Strong Lict domination number ( ) of is the minimum cardinality of strong Lict ... See full document

... of strong non-split domination number of a graph ...multiple arcs(but pairs of arcs are allowed) and G=(V,E) is a undirected graph with neither loops nor multiple ...on graphs and ... See full document