نتایج جستجو برای: fuzzy program graph
تعداد نتایج: 726570 فیلتر نتایج به سال:
The notion of intuitionistic fuzzy graphs is introduced. We show how to associate an intuitionistic fuzzy sub(semi)group with an intuitionistic fuzzy graph in a natural way.
Many problems of practical interest can be modeled and solved by using graph algorithms. In general, graph theory has a wide range of applications in diverse fields. In this paper, the intuitionistic fuzzy organizational and neural network models, intuitionistic fuzzy neurons in medical diagnosis, intuitionistic fuzzy digraphs in vulnerability assessment of gas pipeline networks, and intuitioni...
Sometimes information in a network model is based on multi-agent, multi-attribute, multi-object, multi-polar information or uncertainty rather than a single bit. An m-polar fuzzy model is useful for such network models which gives more and more precision, flexibility, and comparability to the system as compared to the classical, fuzzy and bipolar fuzzy models. In this research article, we intro...
The Wiener index of a graph Gis defined as W(G) =1/2[Sum(d(i,j)] over all pair of elements of V(G), where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j. In this paper, we give an algorithm by GAP program that can be compute the Wiener index for any graph also we compute the Wiener index of HAC5C7[p, q] and HAC5C6C7[p, q] nanotubes by this program.
The objective of this paper is to finds the lower and upper bounds Nordhaus-Gaddum inequalities fuzzy chromatic number for anti-fuzzy graph. This analyzes index complementary anti graphs in some cases. A theorem proved graph be k-critical. Examples are provided derive vertex coloring these graphs.
An essential feature of large scale free graphs, such as the Web, protein-to-protein interaction, brain connectivity, and social media graphs, is that they tend to form recursive communities. The latter are densely connected vertex clusters exhibiting quick local information dissemination and processing. Under the fuzzy graph model vertices are fixed while each edge exists with a given probabil...
In this paper, we studied about a detailed analysis of fuzzy ellipse. the previously studies, some methods for parabola are discussed (Ghosh and Chakraborty,2019). To define ellipse, it is necessary to modify method applied parabola. First, need get five same points with membership grade create crisp ellipse union ellipses passing through these will form Although difficult determine property, i...
In this paper, the minimum spanning tree problem is investigated on the graph with fuzzy edge weights. The notion of fuzzy α-minimum spanning tree is presented based on the credibility measure, and then the solutions of the fuzzy α-minimum spanning tree problem are discussed under different assumptions. First, we respectively assume that all the edge weights are triangular fuzzy numbers and tra...
Fuzziness is an important aspect of the uncertainties of spatial data. In this paper, the mechanism and methods of spatial modeling for fuzzy geographical objects are focused and the following two issues are resolved: (1) Modeling fuzzy geographical objects; (2) Modeling the relation between two fuzzy geographical objects. In the first issue, fuzzy geographical objects are defined by the novel ...
Fuzzy ontology mapping is an important tool to solve the problem of interoperation among heterogeneous ontologies containing fuzzy information. At present, some researches have been done to expand existing mapping methods to deal with fuzzy ontology. However, these methods can not perform well when creating mappings among multiple fuzzy ontologies in a specific domain. To this end, this paper p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید