Results 301 to 310 of about 137,292 (318)
Some of the next articles are maybe not open access.
New Mathematics and Natural Computation, 2018
Edges of a fuzzy graph are mainly classified into [Formula: see text], [Formula: see text] and [Formula: see text]. In this paper, we study certain saturation counts with respect to the classification of edges. Characterizations for fuzzy cycles, fuzzy trees, blocks in fuzzy graphs and complete fuzzy graphs are also obtained using saturation counts.
Hai Long Yang +2 more
openaire +2 more sources
Edges of a fuzzy graph are mainly classified into [Formula: see text], [Formula: see text] and [Formula: see text]. In this paper, we study certain saturation counts with respect to the classification of edges. Characterizations for fuzzy cycles, fuzzy trees, blocks in fuzzy graphs and complete fuzzy graphs are also obtained using saturation counts.
Hai Long Yang +2 more
openaire +2 more sources
New Mathematics and Natural Computation, 2020
It is much more practical to use the [Formula: see text]-norm than the minimum in defining the fuzzy graph. Hence, the concept of [Formula: see text]-fuzzy graph was introduced by Mordeson et al. in [J. N. Mordeson and S. Mathew, [Formula: see text]-norm Fuzzy Graphs, New Mathematics and Natural Computation 14(1) (2018) 129–143].
M. Mohseni Takallo +2 more
openaire +2 more sources
It is much more practical to use the [Formula: see text]-norm than the minimum in defining the fuzzy graph. Hence, the concept of [Formula: see text]-fuzzy graph was introduced by Mordeson et al. in [J. N. Mordeson and S. Mathew, [Formula: see text]-norm Fuzzy Graphs, New Mathematics and Natural Computation 14(1) (2018) 129–143].
M. Mohseni Takallo +2 more
openaire +2 more sources
2020
Graph coloring is a very important problem in graph theory. It has many applications to solve real life problem, viz. scheduling, registrar allocation, traffic light signaling, city planning, frequency assignment, and many more. This chapter gives new concepts on coloring of fuzzy graph (FG).
Madhumangal Pal +2 more
openaire +2 more sources
Graph coloring is a very important problem in graph theory. It has many applications to solve real life problem, viz. scheduling, registrar allocation, traffic light signaling, city planning, frequency assignment, and many more. This chapter gives new concepts on coloring of fuzzy graph (FG).
Madhumangal Pal +2 more
openaire +2 more sources
1993
For representation of imprecise knowledge, conceptual graphs (CGs) are extended by introduction of fuzzy set theory into the components concepts and conceptual relations. The fuzzy operator , operations such as join, maximal join, projection are defined and basic inference rules established.
Mario Manzano, Vilas Wuwongse
openaire +2 more sources
For representation of imprecise knowledge, conceptual graphs (CGs) are extended by introduction of fuzzy set theory into the components concepts and conceptual relations. The fuzzy operator , operations such as join, maximal join, projection are defined and basic inference rules established.
Mario Manzano, Vilas Wuwongse
openaire +2 more sources
Cliques and fuzzy cliques in fuzzy graphs
Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569), 2002The authors define the concept of a fuzzy clique. In the case of a fuzzy graph, the concept of a cycle and a fuzzy cycle has been studied. The aim of the paper is to present the concept of a clique and a fuzzy clique in fuzzy graphs, consistent with the definition of cycles and fuzzy cycles in fuzzy graphs.
P.S. Nair, S.-C. Cheng
openaire +2 more sources
2017
In 1994, Zhang (Proceedings of FUZZ-IEEE, 1998) [195], (Proceedings of IEEE conference, 1994) [71] introduced the concept of bipolar fuzzy sets as a generalization of the notion of Zadeh’s fuzzy sets. A bipolar fuzzy subset of a set is a pair of functions one from the set into the interval [0, 1] and the other into the interval \([-1,0].\) In a bipolar
Sunil Mathew +2 more
openaire +2 more sources
In 1994, Zhang (Proceedings of FUZZ-IEEE, 1998) [195], (Proceedings of IEEE conference, 1994) [71] introduced the concept of bipolar fuzzy sets as a generalization of the notion of Zadeh’s fuzzy sets. A bipolar fuzzy subset of a set is a pair of functions one from the set into the interval [0, 1] and the other into the interval \([-1,0].\) In a bipolar
Sunil Mathew +2 more
openaire +2 more sources
2020
In 1973, Chvatal and Hammer [2] introduced threshold graphs and applied them in set packing problems. This particular class of graphs has many applications in several applied areas such as computer science, scheduling theory, psychology, etc. These graphs are also used in control theory, particularly to control the flow of information between ...
Madhumangal Pal +2 more
openaire +2 more sources
In 1973, Chvatal and Hammer [2] introduced threshold graphs and applied them in set packing problems. This particular class of graphs has many applications in several applied areas such as computer science, scheduling theory, psychology, etc. These graphs are also used in control theory, particularly to control the flow of information between ...
Madhumangal Pal +2 more
openaire +2 more sources
Fuzzy closed graph fuzzy multifunctions
Fuzzy Sets and Systems, 2000We study certain properties of fuzzy closed valued, fuzzy compact valued and fuzzy closed graph fuzzy multifunctions defined on a fuzzy topological space. Fuzzy closed graph theorem for fuzzy multifunctions is also obtained and an application to fixed point is shown.
openaire +2 more sources
2018
We introduce the notion of the degree of incidence of a vertex and an edge in a fuzzy graph in fuzzy graph theory. We concentrate on incidence, where the edge is adjacent to the vertex. We determine results concerning bridges, cutvertices, cutpairs, fuzzy incidence paths, fuzzy incidence tree for fuzzy incidence graphs. In (Dinesh, Ph.D. thesis, Kannur
John N. Mordeson +2 more
openaire +2 more sources
We introduce the notion of the degree of incidence of a vertex and an edge in a fuzzy graph in fuzzy graph theory. We concentrate on incidence, where the edge is adjacent to the vertex. We determine results concerning bridges, cutvertices, cutpairs, fuzzy incidence paths, fuzzy incidence tree for fuzzy incidence graphs. In (Dinesh, Ph.D. thesis, Kannur
John N. Mordeson +2 more
openaire +2 more sources
International Journal of Scientific Research, 2012