Results 241 to 250 of about 90,485 (281)
Some of the next articles are maybe not open access.
Information Sciences, 1994
Different operations with graphs \(G_ 1\) and \(G_ 2\) yield \(G = g(G_ 1, G_ 2)\). Under a certain hypothesis, necessary and sufficient conditions are derived for ensuring that the application of \(g\), on two fuzzy subgraphs (fsg) of \(G_ 1\) and \(G_ 2\), provides a fsg of \(G\).
John N. Mordeson, Chang-Shyh Peng
openaire +1 more source
Different operations with graphs \(G_ 1\) and \(G_ 2\) yield \(G = g(G_ 1, G_ 2)\). Under a certain hypothesis, necessary and sufficient conditions are derived for ensuring that the application of \(g\), on two fuzzy subgraphs (fsg) of \(G_ 1\) and \(G_ 2\), provides a fsg of \(G\).
John N. Mordeson, Chang-Shyh Peng
openaire +1 more source
Fuzzy Sets and Systems, 1992
The extension of a well-known class of Mason graphs (linear flow graphs) deals with their generalization through fuzzy variables. The \(k\)th node of the graph is described in the form, \(\widetilde\Sigma_ j X_ j\otimes T_{jk}= X_ k\), \(k=12,\dots,N\).
openaire +2 more sources
The extension of a well-known class of Mason graphs (linear flow graphs) deals with their generalization through fuzzy variables. The \(k\)th node of the graph is described in the form, \(\widetilde\Sigma_ j X_ j\otimes T_{jk}= X_ k\), \(k=12,\dots,N\).
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.
Vilas Wuwongse, Mario Manzano 0002
openaire +1 more source
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.
Vilas Wuwongse, Mario Manzano 0002
openaire +1 more source
Inverse Fuzzy Graphs with Applications
New Mathematics and Natural Computation, 2020Rosenfeld [A. Rosenfeld, Fuzzy Graphs, Fuzzy Sets and Their Applications, eds. L. A. Zadeh, K. S. Fu and M. Shimura (Academic Press, New York, 1975), pp. 77–95.] defined the fuzzy relations on the fuzzy sets and developed the structure of fuzzy graph, as a graph with a membership degree (between zero and one) for the vertices and edges such that the ...
Rajab Ali Borzooei +3 more
openaire +1 more source
Trends on dominations of fuzzy graphs and anti fuzzy graphs
AIP Conference Proceedings, 2021After introducing and developing fuzzy graph theory, a lot of studies have been done in this field. The object of this paper is to demonstrate various Dominations such as Edge domination, Total domination, Strong (weak) domination, Regular domination, connected domination, Split (non-split) domination in fuzzy graphs with their importance and ...
Nageswara Rao T. +4 more
openaire +1 more source
Pattern Recognition Letters, 1993
The author defines and studies the concept of a fuzzy line graph of a fuzzy graph. The necessary and sufficient conditions for a fuzzy graph to be isomorphic to its corresponding fuzzy line graph are given. Also established is a necessary and sufficient condition for a fuzzy graph to be a fuzzy line graph of a fuzzy graph.
openaire +2 more sources
The author defines and studies the concept of a fuzzy line graph of a fuzzy graph. The necessary and sufficient conditions for a fuzzy graph to be isomorphic to its corresponding fuzzy line graph are given. Also established is a necessary and sufficient condition for a fuzzy graph to be a fuzzy line graph of a fuzzy graph.
openaire +2 more sources
Fuzzy end nodes in fuzzy graphs
Information Sciences, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kiran R. Bhutani, Azriel Rosenfeld
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].
Rajab Ali Borzooei +2 more
openaire +1 more source
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].
Rajab Ali Borzooei +2 more
openaire +1 more source
FUZZY GRAPH STRUCTURE OF FLOWER GRAPHS
Far East Journal of Applied Mathematics, 2017Summary: In this paper, we consider a flower graph \(fl_n\) and define the membership function for vertices and edges for \(fl_n\) to make it a fuzzy flower graph \(f\widetilde{l}_n\). Then the fuzzy graph structure for \(f\widetilde{l}_n\) is developed. The vertex and edge cohesive number of \(f\widetilde{l}_n\) are computed.
Harinath, Purnima, Lavanya, S.
openaire +1 more source
Generalized fuzzy Euler graphs and generalized fuzzy Hamiltonian graphs
Journal of Intelligent & Fuzzy Systems, 2018Graph theory includes two unavoidable graphs, namely Euler graphs and Hamiltonian graphs. In this study, generalized fuzzy Euler graphs (GFEGs) and generalized fuzzy Hamiltonian graphs (GFHGs) are defined to express uncertain system like routes, networks. Here, even degrees of all vertices of graphs do not assure that the graphs are GFEG.
Sovan Samanta, Biswajit Sarkar
openaire +1 more source