[PDF] Top 20 Museos virtuales y aprendizaje. Una experiencia singular con alumnos universitarios

... Let G = (V, E) be a simple connected graph. Two edges are adjacent if they are incident with a common vertex. Two vertices u and v are adjacent if there is an edge e incident with both u and v. For every vertex v ... See full document

... an edge dominating set if every edge e in E − F is adjacent to at least one edge in F ...The edge domination number γ 0 (G) of G is the minimum cardinality of an edge dominating ... See full document

... of edge domination in the field of graph theory was studied by many eminent researchers and still the work is continuing on the domination like Claude Berge in the early 1960’s introduced Perfect ... See full document

... fuzzy edge dominating set if for every edge in E – F is adjacent to at least one effective edge in ...fuzzy edge dominating set of G is called the fuzzy edge domination number of ... See full document

... An edge domination number, ( )of is the minimum cardinality of an edge dominating sets of , , , , , ...An edge dominating set of is called a total edge dominating set of if 〈 〉has no ... See full document

... this paper, some bounds for  e '  S G    were obtained and exact values of  e '  S G    for some standard graphs were also obtained. Further its relationships with other different domination parameters ... See full document

... Edge domination problems have been the focus of considerable attention, in the last few ...perfect edge domination and efficient edge ...each edge outside the dominating set is ... See full document

... The edge dominating set of a graph G = (V, E) is the subset F E such that each edge in E is either in F or is adjacent to an edge in ...an edge in G is defined as  (G ) and diameter of a ... See full document

... theory, domination of graphs is the most powerful area of research for, it has several applications in other areas of ...vertex domination on S− valued ...of edge domination on S− valued ... See full document

... The domination number γ(G) of G is the minimum cardinality of a dominating set of ...many domination parameters are given in the books by Kulli in [2, 3, ...an edge dominating set if every ... See full document

... the edge domination number when an edge is added to the hypergraph or an edge is removed from the hypergraph has been studied ...the edge domination number may increase, decrease ... 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 ...The edge domination number of ... See full document

... each edge a set of colors chosen from the power set of {1,2} ...each edge E(G) such that g( we have ⋃ = {1,2},then g is called 2-Rainbow edge domination function(2REDF) and the weight w(g) of ... See full document

... A subset S ⊆ V is a total vertex-edge dominating set (in simply, total ve-dominating set) of G, if S is a ve-dominating set and every vertex of S has a neighbor in S [1]. The total ve-domination number of a ... See full document

... an edge Roman star dominating function f on a graph G , is called an edge Roman star domination number of G and is denoted by γ RS ′ (G ) ...the edge Roman star domination number of ... 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 domination, ... See full document

... connected edge dominating set and a triple connected edge domination number of ...connected edge domination number and also exact values for some standard ...Keywords: Edge ... See full document

... Zadeh [13] introduced the concept of Fuzzy sets in the year 1965. In 1975, Fuzzy graph was introduced by Rosenfeld [7]. Rosenfeld has obtained the fuzzy analogues of several basic graph-theoretic concepts like bridges, ... See full document

... new domination parameter called hop domination number of a graph and charac- terized the family of trees and unicyclic graphs with equal hop domination number and total domination ... See full document

... of domination in graph was initiated by Berge ...The domination in vertices and edges of an S-valued graph has been studied in (Jeyalakshmi et ...mixed domination on S- valued graphs in (5) and ... See full document