نتایج جستجو برای: intuitionistic graph
تعداد نتایج: 204018 فیلتر نتایج به سال:
Abstract: In this paper we analyzed the spreading rate of virus between incoming and outgoing links to a website. We have taken the website http://www.pantechsolutions.net/. This website is modeled as an intuitionistic fuzzy graph G = (V,E, μ, γ) by considering the navigation of the customers. In this intuitionistic fuzzy graph, the links are considered as vertices and the path of the links is ...
Given an intuitionistic proof net of linear logic, we abstract an order between its atomic formulas. From this order, we represent intuitionistic multiplicative proof nets in the more compact form of models of directed acyclic graph descriptions. If we restrict the logical framework to the implicative fragment of intuitionistic linear logic, we show that proof nets reduce to models of tree desc...
A novel partial order is defined on the space of digraphs or hypergraphs, based on assessing the cost of producing a graph via a sequence of elementary transformations. Leveraging work by Knuth and Skilling on the foundations of inference, and the structure of Heyting algebras on graph space, this partial order is used to construct an intuitionistic probability measure that applies to either di...
In this paper d2 degree of a vertex and total d2 -degree of a vertex in an intuitionistic fuzzy graphs are defined. Also (2, (c1, c2))-regularity and totally (2, (c1, c2))-regularity of an intuitionistic fuzzy graphs are defined. A relation between (2, (c1, c2))-regularity and totally (2, (c1, c2))-regularity on intuitionistic fuzzy graph is studied. (2, (c1, c2))regularity on a path on four ve...
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic that gives an account of layering. As in bunched systems, the logic includes the usual intuitionistic connectives, together with a non-commutative, non-associative con...
This work defines the concepts of strong efficient dominating set and intuitionistic fuzzy graph. We also introduce an graph a number graphs. The dominant in graphs has some limitations that are studied, derived..
in this paper we define intuitionistic fuzzy metric and normedspaces. we first consider finite dimensional intuitionistic fuzzy normed spacesand prove several theorems about completeness, compactness and weak convergencein these spaces. in section 3 we define the intuitionistic fuzzy quotientnorm and study completeness and review some fundamental theorems. finally,we consider some properties of...
In this paper we introduce the Max-Min intuitionistic fuzzy matrix M (G) of an intuitionistic fuzzy graph. And the extreme energy of M (G) is defined. And also we give the explicit expression for the coefficients of the characteristic polynomial of M (G) . These concepts are illustrated with real time example. AMS Subject Classification: 03E72, 05C50
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید