In this paper, we introduce two new algorithm to find a Hamilton Circuit in a graph G = (V, E). One algorithm is use a multistage graph as a special NFAs to find all Hamilton Circuit in exponential time; while another is use O(|V|) variant multistage graph as a special state set NFAs to find a fuzzy data of all Hamilton Circuit in polynomial time. The fuzzy data of the data contain those data, ...

numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(fspp). the main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...

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