Representation of competitions by generalized fuzzy graphs
Sovan Samanta, Biswajit Sarkar
International Journal of Computational Intelligence Systems · 2018
doi:10.2991/ijcis.11.1.76 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Generalized fuzzy graphs are perfect to represent any system like networks, images, scheduling, etc. compared to fuzzy graphs. This study introduces the concept of a generalized fuzzy neighbourhood of a vertex and generalized fuzzy graphs. Also, an associated graph, called minimal graphs of competition graphs are defined. These graphs will represent some practical competitions existing in the world. Some important results regarding the stated graphs are proved. Some area of applications in real life system is focused.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.