270 0

Full metadata record

DC FieldValueLanguage
dc.contributor.authorSarkar, Biswajit-
dc.date.accessioned2019-01-02T07:03:41Z-
dc.date.available2019-01-02T07:03:41Z-
dc.date.issued2018-05-
dc.identifier.citationINTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, v. 11, No. 1, Page. 1005 - 1015en_US
dc.identifier.issn1875-6883-
dc.identifier.issn1875-6891-
dc.identifier.urihttps://www.atlantis-press.com/journals/ijcis/25895956-
dc.identifier.urihttps://repository.hanyang.ac.kr/handle/20.500.11754/81040-
dc.description.abstractGeneralized 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.en_US
dc.language.isoen_USen_US
dc.publisherATLANTIS PRESSen_US
dc.subjectGeneralized fuzzy graphsen_US
dc.subjectneighbourhooden_US
dc.subjectcompetitionen_US
dc.subjectminimal graphsen_US
dc.titleRepresentation of competitions by generalized fuzzy graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.2991/ijcis.11.1.76-
dc.relation.page1-20-
dc.relation.journalINTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS-
dc.contributor.googleauthorSamanta, Sovan-
dc.contributor.googleauthorSarkar, Biswajit-
dc.relation.code2018011350-
dc.sector.campusE-
dc.sector.daehakCOLLEGE OF ENGINEERING SCIENCES[E]-
dc.sector.departmentDEPARTMENT OF INDUSTRIAL AND MANAGEMENT ENGINEERING-
dc.identifier.pidbsarkar-
Appears in Collections:
COLLEGE OF ENGINEERING SCIENCES[E](공학대학) > INDUSTRIAL AND MANAGEMENT ENGINEERING(산업경영공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE