• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.49-60
• /
• 2016

In this paper, two different approaches to chromatic number of a bipolar fuzzy graph are introduced. The first approach is based on the α-cuts of a bipolar fuzzy graph and the second approach is based on the definition of Eslahchi and Onagh for chromatic number of a fuzzy graph. Finally, the bipolar fuzzy vertex chromatic number and the edge chromatic number of a complete bipolar fuzzy graph, characterized.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.625-634
• /
• 2024

The thrust of this paper is to extend the notion of Plithogenic vertex domination to the basic operations in Plithogenic product fuzzy graphs (PPFGs). When the graph is a complete PPFG, Plithogenic vertex domination numbers (PVDNs) of its Plithogenic complement and perfect Plithogenic complement are the same, since the connectivities are the same in both the graphs. Since extra edges are added to the graph in the case of perfect Plithogenic complement, the PVDN of perfect Plithogenic complement is always less than or equal to that of Plithogenic complement, when the graph under consideration is an incomplete PPFG. The maximum and minimum values of the PVDN of the intersection or the union of PPFGs depend upon the attribute values given to P-vertices, the number of attribute values and the connectivities in the corresponding PPFGs. The novelty in this study is the investigation of the variations and the relations between PVDNs in the operations of Plithogenic complement, perfect Plithogenic complement, union and intersection of PPFGs.

• East Asian mathematical journal
• /
• v.36 no.5
• /
• pp.561-570
• /
• 2020

We compute the extended four operations of the 2-dimensional quadratic fuzzy numbers. Then we calculate the intersection between a plane perpendicular to the x-axis, which passes through each vertex, and the resulting 2-dimensional quadratic fuzzy number. We confirm that the equations of the two intersections acquired in this way and the graphs are actually identical, respectively.

• East Asian mathematical journal
• /
• v.22 no.2
• /
• pp.163-170
• /
• 2006

In networking, it is essential to analyse the nodes along with their neighbours. The properties of fuzzy finite graphs are very much useful in obtaining solutions to many problems like traffic congestion problem. In this paper, free nodes and busy nodes are defined and the properties of nodes are examined at various levels of their degrees.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.314-318
• /
• 2001

Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.6
• /
• pp.528-531
• /
• 2001

Finding a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges fuzzy weights can be used instead of crisp weights. and Type-2 fuzzy weight will be more suitable of this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type 2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.759-764
• /
• 2005

In this paper we describe a face recognition using EBGM(Elastic Bunch Graph Matching) method. Usally, the PCA and LDA based face recognition method with the low-dimensional subspace representation use holistic image of faces, but this study uses local features such as a set of convolution coefficients for Gabor kernels of different orientations and frequencies at fiducial points including the eyes, nose and mouth. At pre-recognition step, all images are represented with same size face graphs and they are used to recognize a face comparing with each similarity for all images. The proposed algorithm has less computation time due to simplified face graph than conventional EBGM method and the fuzzy matching method for calculating the similarity of face graphs renders more face recognition results.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.10 no.3
• /
• pp.170-177
• /
• 2010

Poker is a game of imperfect information where competing players must deal with multiple risk factors stemming from unknown information while making the best decision to win, and this makes it an interesting test-bed for artificial intelligence research. This paper introduces a new learning AI algorithm with embedded opponent modeling that can be used for these types of situations and we use this AI and apply it to a poker program. The new AI will be based on several graphs with each of its nodes representing inputs, and the algorithm will learn the optimal decision to make by updating the weight of the edges connecting these nodes and returning a probability for each action the graphs represent.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.430-432
• /
• 1993

In this paper, an algorithm for the fault diagnosis using simple FCM(Fuzzy Cognitive Map) is proposed FCMs which store uncertain causal knowledges are fuzzy signed graphs with feedback. The algorithm allows searching the origin of fault and the ways of propagating the abnormality throughout the process simply and has following characteristics. First, it can distinguish the cause of soft failure which can degenerate the process as well as hard failure. Second, it is proper for the processes which have difficulties to establish the exact quantative model. Finally, it has short amputation time in comparison with the fault tree or the other AI methods. The applicability of the proposed algorithm for the fault diagonosis to a tank or pipeline system is demonstrated

• Advances in nano research
• /
• v.13 no.2
• /
• pp.121-134
• /
• 2022

Emerge of nanotechnology impacts all aspects of humans' life. One of important aspects of the nanotechnology and nanoparticles (NPs) is in the food production industry. The safety of such foods is not well recognized and producing safe foods using nanoparticles involves delicate experiments. In this study, we aim to incorporate intelligent computer simulation in predicting safety degree of nanofoods. In this regard, the safety concerns on the nano-foods are addressed considering cytotoxicity levels in metal oxides nanoparticles using adaptive neuro-fuzzy inference system (ANFIS) and response surface method (RSM). Three descriptors including chemical bond length, lattice energy and enthalpy of formation gaseous cation of 15 selected NPs are examined to find their influence on the cytotoxicity of NPs. The most effective descriptor is selected using RSM method and dependency of the toxicity of these NPs on the descriptors are presented in 2D and 3D graphs obtained using ANFIS technique. A comprehensive parameters study is conducted to observe effects of different descriptors on cytotoxicity of NPs. The results indicated that combinations of descriptors have the most effects on the cytotoxicity.