.png){kind=icon}
Return
Fuzzy graphs: algebraic structure and syntactic recognition
.png){kind=icon}
OA
AI
DOI：10.1007/s10462-013-9412-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Directed fuzzy hypergraphs are introduced as a generalization of both crisp directed hypergraphs and directed fuzzy graphs. It is proved that the set of all directed fuzzy hypergraphs can be structured into a magmoid with operations graph composition and disjoint union. In this framework a notion of syntactic recognition inside magmoids is defined. The corresponding class is proved to be closed under boolean operations and inverse morphisms of magmoids. Moreover, the language of all strongly connected fuzzy graphs and the language that consists of all fuzzy graphs that have at least one directed path from the begin node to the end node through edges with membership grade 1 are recognizable. Additionally, a useful characterization of recognizability through left derivatives is also achieved.
Keywords:
Fuzzy graphs
Hypergraphs
Recognizability
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
ShareSaveExpression cloning of a cDNA encoding a retinoblastoma-binding protein with E2F-like properties.png)
Cell
CellIF0
PREAI
ShareSaveShareSaveShareSaveAssociation of indoor solid fuel use and long-term exposure to ambient PM2.5 with sarcopenia in China: A nationwide cohort studyChemosphere
ChemosphereIF0
PREAI
ShareSaveShareSave
View more