Open AccessGranular computing on basic digraphs
Author(s) -
Giampiero Chiaselotti,
Tommaso Gentile,
Federico Infusino
Publication year - 2022
Publication title -
applicable analysis and discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.69
H-Index - 26
eISSN - 2406-100X
pISSN - 1452-8630
DOI - 10.2298/aadm180615001c
Subject(s) - mathematics , rough set , dependency (uml) , bipartite graph , function (biology) , directed graph , discrete mathematics , combinatorics , granular computing , perspective (graphical) , set (abstract data type) , graph , computer science , artificial intelligence , geometry , evolutionary biology , biology , programming language
In the present paper we investigate (p,q)-directed complete bipartite graphs ?K p,q, n-directed paths ?Pn and n-directed cycles ?C n from the perspective of Granular Computing. For each model, we establish the general form of all possible indiscernibility relations, analyze the classical rough approximation functions of rough set theory and provide a close formula for the global accuracy average. Finally, we completely determine the attribute dependency function and the global dependency average for both ?C n and ?Kp,q.