Results 41 to 50 of about 145,281 (336)
Strong Domination in Fuzzy Graphs
In this paper, the concept of strong domination number is introduced by using membership values of strong arcs in fuzzy graphs. The strong domination number γs of complete fuzzy graph and complete bipartite fuzzy graph is determined and bounds is ...
O.T. Manjusha, M.S. Sunitha
doaj +1 more source
Application of m- polar soft fuzzy bi- partite graph in residence selection process
An $m-$polar fuzzy set and soft sets are two different tools for representing uncertainty and vagueness. An $m-$polar soft fuzzy set is a mapping from parameter set to the $m-$polar fuzzy subsets of the universe.
S Ramkumar, R Sridevi
doaj +1 more source
A Cognitive Model of an Epistemic Community: Mapping the Dynamics of Shallow Lake Ecosystems [PDF]
We used fuzzy cognitive mapping (FCM) to develop a generic shallow lake ecosystem model by augmenting the individual cognitive maps drawn by 8 scientists working in the area of shallow lake ecology.
A. Chao +54 more
core +2 more sources
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
A kernel-based framework for learning graded relations from data [PDF]
Driven by a large number of potential applications in areas like bioinformatics, information retrieval and social network analysis, the problem setting of inferring relations between pairs of data objects has recently been investigated quite intensively ...
Airola, Antti +5 more
core +3 more sources
Connectivity Analysis of Cyclically Balanced Fuzzy Graphs
The concepts of connectivity and cycle connectivity play an important role in fuzzy graph theory. In this article, cyclic cutvertices, cyclic bridges and cyclically balanced fuzzy graphs are discussed.
N. Jicy, Sunil Mathew
doaj +1 more source
In this paper, neighbourly irregular fuzzy graphs, neighbourly total irregular fuzzy graphs, highly irregular fuzzy graphs and highly total irregular fuzzy graphs are introduced. A necessary and sufficient condition under which neighbourly irregular and highly irregular fuzzy graphs are equivalent is provided.
openaire +2 more sources
A similarity-based community detection method with multiple prototype representation [PDF]
Communities are of great importance for understanding graph structures in social networks. Some existing community detection algorithms use a single prototype to represent each group.
Martin, Arnaud, Pan, Quan, Zhou, Kuang
core +4 more sources
An implementation of the Dilkstra algorithm for fuzzy costs (Technical report 2018) [PDF]
This report presents an implementation the Dijkstra algorithm applied to a type V fuzz graph. This new algorithm can find the shortest path in a graph with edge costs are defined as positive triangular fuzzy ...
Alonso, Sira +3 more
core +1 more source
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination [PDF]
Recently, great efforts have been dedicated to researches on the management of large scale graph based data such as WWW, social networks, biological networks.
He, Zhengying +3 more
core +1 more source

