In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

Fuzzy incidence graphs can be used as models for nondeterministic interconnection networks having extra node-edgerelationships. For example, ramps in a highway system may be modeled as a fuzzy incidence graph so that unexpectedflow between cities and highways can be effectively studied and controlled. Like node and edge connectivity in graphs,node connectivity and arc connectivity in fuzzy inci...

Graph theory has an important role in the area of applications of networks and clustering‎. ‎In the case of dealing with uncertain data‎, ‎we must utilize ambiguous data such as fuzzy value‎, ‎fuzzy interval value or values of fuzzy number‎. ‎In this study‎, ‎values of fuzzy number were used‎. ‎Initially‎, ‎we utilized the fuzzy number value fuzzy relation and then proposed fuzzy number-value f...

Fuzzy graphs are the backbone of many real systems like networks, image, scheduling, etc. But, due to some restriction on edges, fuzzy graphs are limited to represent for some systems. Generalized fuzzy graphs are appropriate to avoid such restrictions. In this study generalized fuzzy graphs are introduced. In this study, matrix representation of generalized fuzzy graphs is described. Completen...

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

In this paper, the order, size and degree of the nodes of the isomorphic fuzzy graphs are discussed. Isomorphism between fuzzy graphs is proved to be an equivalence relation. Some properties of self complementary and self weak complementary fuzzy graphs are discussed. Keywords—complementary fuzzy graphs, co-weak isomorphism, equivalence relation, fuzzy relation, weak isomorphism.

a concept related to the spectrum of a graph is that of energy. the energy e(g) of a graph g is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of g . the laplacian energy of a graph g is equal to the sum of distances of the laplacian eigenvalues of g and the average degree d(g) of g. in this paper we introduce the concept of laplacian energy of fuzzy graphs. ...

Neutrosophic theory has many applications in graph theory, interval valued neutrosophic graph (IVNG) is the generalization of fuzzy graph, intuitionistic fuzzy graph and single valued neutrosophic graph. In this paper, we introduced some types of IVNGs, which are subdivision IVNGs, middle IVNGs, total IVNGs and interval valued neutrosophic line graphs (IVNLGs), also discussed the isomorphism, c...

In this article, we introduce some connectivity concepts in bipolar fuzzy graphs. Analogous to fuzzy cutvertices and fuzzy bridges in fuzzy graphs, bipolar fuzzy cutvertices and bipolar fuzzy bridges are introduced and characterized. We also propose the concepts of gain and loss for paths and pairs of vertices. Connectivity in complete bipolar fuzzy graphs is also discussed.

This paper presents a flexible querying system of fuzzy RDF annotations which consists in translating fuzzy RDF annotations into fuzzy conceptual graphs and using an “approximate”-projection operation in order to compare fuzzy query graphs with fuzzy annotation graphs. The fuzzy sets in the query graphs having a semantic of preferences are compared with the fuzzy sets in the annotation graphs h...