Abstract | ||
---|---|---|
' In this paper, we present certain algorithms for clustering the vertices of fuzzy graphs(FGs) and intuitionistic fuzzy graphs(IFGs). These algorithms are based on the edge density of the given graph. We apply the algorithms to practical problems to derive the most prominent cluster among them. We also introduce parameters for intuitionistic fuzzy graphs. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1142/S0218488517500155 | INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS |
Keywords | Field | DocType |
Intuitionistic fuzzy graph, density, balanced, slicing, parameters, clustering algorithm | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Correlation clustering,Slicing,Fuzzy graph,Edge density,Cluster analysis,Mathematics | Journal |
Volume | Issue | ISSN |
25 | 3 | 0218-4885 |
Citations | PageRank | References |
3 | 0.38 | 6 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
M. G. Karunambigai | 1 | 24 | 3.62 |
Muhammad Akram | 2 | 63 | 15.02 |
S. Sivasankar | 3 | 3 | 0.38 |
K. Palanivel | 4 | 3 | 0.38 |