Path Kuat Terkuat Dan Jarak Kuat Terkuat Dalam Graf Fuzzy

Fuzzy graph is a graph consists pair of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each node and edge. A graph fuzzy is connected if the strength of connectedness between nodes u and v larger than zero for each . This paper will be explained about ss-path and ss-distance. Strongest stong path (ss-path) between two nodes in connected fuzzy graph if path is a strongest path as well as strong path. If G is a connected fuzzy graph then for each there exists a strongest strong path for u to v . While ss-distane between two nodes u and v in connected fuzzy graph as the reciprocal of the strength of connectedness between nodes u and v. Using metric can be known that every connected fuzzy graph is ss-selfcentere

Sifat-sifat Isomorfisma Graf Fuzzy Pada Graf Fuzzy Kuat

Fuzzy graph is a graph consists pairs of vertex and edge that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. A fuzzy graph is said to be a strong fuzzy graph if degree of membership edge with the same minimum degree of membership vertex and degree of membership vertex for each edge with . In this paper describes the properties of fuzzy graphs isomorphism include weak isomorphism, co-weak isomorphism, and isomorphism on strong fuzzy graph

Produk Graf Fuzzy Intuitionistic

An intuitionistic fuzzy graph G:V,E consist of a couples of node sets V and set of edges E which the sum of degree membership and degree non membership each of nodes and each of edges in closed interval [0,1], the degree membership each of edges is less than or equal with the minimum of degree membership each nodes of incident, and degree non membership each of edges is less than or equal with the maximum degree non membership each nodes of incident. Product fuzzy graph was defined by Dr. V. Ramaswamy and Poornima B. Product fuzzy graph is fuzzy graph, where the degree membership each of edges is less than or equal with product of the between degree of membership each nodes of incident. In this paper we study the definitions of product intuitionistic fuzzy graph, product intuitionistic fuzzy graph complete, further discussion about the complement of product intuitionistic fuzzy graph, join of product intuitionistic fuzzy graph and multiplication of product intuitionistic fuzzy graph and their characteristics

Graf Fuzzy Reguler Dan Hubungannya Dengan Graf Fuzzy Reguler Total

Fuzzy graph is a graph consists pairs of vertex set and edge set that have degree of membership containing closed interval of real number [0,1] on each edge and vertex. Regular fuzzy graph and totally regular fuzzy graph were defined by A.Nagoor Ghani and K.Radha. This paper studied the definitions of regular fuzzy graph and totally regular fuzzy graph. Next, showed that a necessary and sufficient condition under which regular fuzzy graph and totally regular fuzzy graph were equivalen