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

A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...

Fuzzy total chromatic number is the least value of k such that k-fuzzy coloring exist. In this paper, we discussed concept graphs to bistar graph and helm graph. Here define fuzzy Bistar Helm

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

A subset S of V is called a dominating set in G if every vertex in V-S is adjacent to at least one vertex in S. A Dominating set is said to be Fuzzy Double Dominating set if every vertex in V-S is adjacent to at least two vertices in S. The minimum cardinality taken over all, the minimal double dominating set is called Fuzzy Double Domination Number and is denoted by γ fdd (G). The minimum numb...

Let G be a fuzzy graph. A subset D of V is said to be Fuzzy dominating set if every vertex u ∈ V (G) there exists a vertex v ∈ V −D such that uv ∈ E(G) and μ(uv) 6 σ(u) ∧ σ(v). The minimum Cardinality of fuzzy dominating set is denoted by γf . A graph G is said to be fuzzy excellent if every vertex of G belongs to γf -sets of G. In this paper, we give a construction to imbedded non-excellent fu...

The objective of this paper is to finds the lower and upper bounds Nordhaus-Gaddum inequalities fuzzy chromatic number for anti-fuzzy graph. This analyzes index complementary anti graphs in some cases. A theorem proved graph be k-critical. Examples are provided derive vertex coloring these graphs.

This paper describes a new robust method for extracting visual labial information based on chromatic information. Using chromatic temporal information for a speaker and a special fuzzy based thresholding algorithm a stable technique of extracting a speaker’s lips is proposed that overcomes many of the problems associated with previous adaptive threshold techniques. Experiments performed thus fa...