Pdf corona product of two fuzzy graphs which is analogous to the concept corona product operation in crisp graph theory is defined. The elements of v are thought of as vertices of the graph and the elements of r are thought of as the edges similarly, any fuzzy relation. The operations of union, join, cartesian product and composition on two fuzzy graphs were defined by moderson. We have illustrated that these operations are not commutative and studied. In addition, sahoo and pal 20 discussed the concept of the intuitionistic fuzzy competition graph. Fuzzy graphs introduced by rosenfeld in 197512,9,10.
Product fuzzy graphs ijcsns international journal of computer. Different types of products on intuitionistic fuzzy graphs core. Pdf domination in product fuzzy graphs mahioub shubatah. On complement of intuitionstic product fuzzy graphs. Abstract in this paper, the strong product of two fuzzy graphs is defined. Pdf on strong product of two fuzzy graphs ijsrp journal academia. Pdf on jan 1, 2016, talal alhawary and others published on product fuzzy graphs find, read and cite all the research you need on researchgate.
Every product fuzzy graph is a fuzzy graph, but the converse need not be true. Recently, bipolar fuzzy graph is a vastly growing research area as it is the generalization of the fuzzy graphs. A graph is a pair v, r, where v is a set and r is a relation on v. Revised revised 30 january 2016 accepted 2 march 2016 abstract. Pdf different types of product of fuzzy graphs researchgate.
Shovandogra 11 introduced different types of products of fuzzy graphs. Certain types of product bipolar fuzzy graphs springerlink. In this paper, we study about the degree of a vertex in fuzzy graphs which are obtained from two given fuzzy graphs using the operations. Pdf new fuzzy graphs can be obtained from two given fuzzy graphs using different types of fuzzy graph product. In this paper, we have introduced the concept of lexicographic products of two fuzzy graphs namely, lexicographic minproduct and lexicographic maxproduct which are analogous to the concept lexicographic product in crisp graph theory. It is proved that when two fuzzy graphs are effective then their strong product is always effective and it is proved that the strong product of two complete fuzzy graphs is complete. On product fuzzy graphs talal alhawary, bayan horani received 16 january 2016. Alhawary 32 introduced the concept of balanced fuzzy graphs. The notion of product fuzzy graph has generalized for intuitionistic product fuzzy graph and definition of complement and ring sum of two intuitionistic. Also we defined the strong product of two fuzzy graphs and studied its properties 8.
Different types of product of fuzzy graphs international journal of. In this paper, we provide three new products on product fuzzy graphs, we give su cient conditions for each one of them to be strong and we show that if any of these products is complete, then at least one factor is strong. First let us recall some preliminary definitions that can be found in 19. Several authors introduced and studied what they called product fuzzy graphs, see for example 41. Pdf in this paper, beta product and gamma product of two fuzzy graphs are introduced and we proved that the beta product of two regular fuzzy graphs. On intuitionistic product fuzzy graphs article pdf available in italian journal of pure and applied mathematics 3838. In this paper, the strong product of two fuzzy graphs is defined. On product fuzzy graphs annals of fuzzy mathematics and. In this paper, at first the concepts of regular and totally regular product bipolar fuzzy graphs is introduced. Index terms fuzzy graph, direct sum, strong product, effective fuzzy graph, connectedness, upper and lower truncations. Then necessary and sufficient conditions are established under which regular and totally regular product bipolar fuzzy graph becomes equivalent.
1401 10 1310 336 925 278 82 1445 1411 235 1160 1209 1055 1219 1479 651 845 686 942 911 1361 762 92 292 1399 416 1299 234 480 87 241 746 1253 66 57 49 1306 336 1316 1334 216 1112 135 722 491