Barnsley (2006) introduced the notion of a fractal top, which is an addressing function for the set attractor of an Iterated Function System (IFS). A fractal top is analogous to a set attractor as it is the fixed point of a contractive transformation. However, the definition of IFS is extended so that it works on the colour component as well as the spatial part of a picture. They can be used to...

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 .

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...

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...

The study of fixed points on the maps fulfilling certain contraction requirements has several applications and been focus numerous research endeavors. On other hand, as an extension idea best approximation, proximity point (ƁƤƤ) emerges. approximation theorem ensures existence approximate solution; is considered for addressing problem in order to arrive at optimum solution. This paper introduce...

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...

Generation of a quasi-contractive semigroup by generalized Ornstein-Uhlenbeck operators ℒ = −∆ + ∇Φ · ∇ − G V c|x|−2 in the weighted space L2(RN, e−Φ(x)dx) is proven, where Φ ∈ C2(RN, R), C1(RN, RN), 0 ≤ C1(RN) and c > 0. The proofs are carried out an application L2-weighted Hardy inequality bilinear form techniques.

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 ...