نتایج جستجو برای: fuzzy g

تعداد نتایج: 529954  

Journal: :Journal of Mathematical Analysis and Applications 1985

In this article we will use the redefined definition of a fuzzy subgroup as in [1], and will mainly prove that if G, G are two groups and f: G G' is an epirnorphism, then there is a bijection between the set of all fuzzy subgroups of G/Ker f and that of G .

2017
A.Nagoor Gani

Let D be the minimum dominating set of intuitionistic fuzzy graph G. The minimum intuitionistic fuzzy cardinality of all edge dominating set of intuitionistic fuzzy graph G is known as edge domination number and it is denoted by γe(G). In this Paper, we initiate some definitions onedge dominating set concerning intuitionistic fuzzy sets. Further, we investigate some results onedge domination nu...

2014
K. Radha N. Kumaravel

A fuzzy graph can be obtained from two given fuzzy graphs using union and join. In this paper, we find the degree of an edge in fuzzy graphs formed by these operations in terms of the degree of edges in the given fuzzy graphs in some particular cases. 1. Introduction Fuzzy graph theory was introduced by Azriel Rosenfeld in 1975 [4]. Though it is very young, it has been growing fast and has nume...

2016
Shaik Mohiddin Shaw

In this research paper, it was studied about degree of vertices of a semitotal blocks in fuzzy graphs. In process we obtain some interesting results regarding the degree of the vertices in semitotal blocks in fuzzy graphs. We observed that when ‘B’ is a block of a given fuzzy graph G:(V, σ, μ), then degree of the vertex B in semi total block fuzzy graph TSTBF(G) is equal to the sum of the membe...

2014
J. S. Sathya S. Vimala

Let be a simple undirected fuzzy graph. A subset S of V is called a dominating set in G if every vertex in V-S is effectively adjacent to at least one vertex in S. A dominating set S of V is said to be a Independent dominating set if no two vertex in S is adjacent. The independent domination number of a fuzzy graph is denoted by (G) which is the smallest cardinality of a independent dominating ...

2015
A. Nagoor Gani K. Prasanna Devi Muhammad Akram A. N. Gani K. P. Devi M. Akram A. Somasundram

In this paper, bondage and non-bondage set of a fuzzy graph are discussed. The bondage number b(G) and non-bondage number bn(G) of a fuzzy graph G are defined. The upper bound for both b(G) and bn(G) are given. Also some results on b(G) and bn(G) are discussed. The exact values of b(G) and bn(G) are determined for several classes of fuzzy graphs. AMS Subject Classification: 03E72, 05C40, 05C72

In this paper, the concept of fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) of an ordered group (resp. lattice-ordered group) is introduced and some properties, characterizations and related results are given. Also, the fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) generated by a fuzzy subgroup (resp. fuzzy subsemigroup) is characterized. Furthermore,...

2013
Anjaly Kishore

Abstract. Coloring of fuzzy graphs plays a vital role in theory and practical applications. The concept of chromatic number of fuzzy graphs was introduced by Munoz[6] et.al. Later Eslahchi and Onagh [7]defined fuzzy coloring of fuzzy graphs and defined fuzzy chromatic number χ (G). Incorporating the features of these two definitions, the definition of chromatic number of a fuzzy graph χ(G), is ...

In this paper, we deal with Molaei’s generalized groups. We definethe notion of a fuzzy generalized subgroup with respect to a t-norm (orT-fuzzy generalized subgroup) and give some related properties. Especially,we state and prove the Representation Theorem for these fuzzy generalizedsubgroups. Next, using the concept of continuity of t-norms we obtain a correspondencebetween TF(G), the set of ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید