Detection of Sub-Community Graph in N-Community Graphs using Graph Mining

Autor:	Sarojananda Mishra, Bapuji Rao
Přispěvatelé:	Blue Eyes Intelligence Engineering & Sciences Publication (BEIESP)
Jazyk:	angličtina
Rok vydání:	2020
Předmět:	Combinatorics community graph community adjacency matrix sub-community adjacency matrix sub-community graph Environmental Engineering Computer science General Engineering 2249-8958 B4530129219 /2020©BEIESP Graph Computer Science Applications MathematicsofComputing_DISCRETEMATHEMATICS
Popis:	Detection of sub-graphs in community graphs is an important task and useful for characterizing community graphs. This characterization leads to classification as well as clusterings of community graphs. It also leads to finding differences among a set of community graphs as well as buildings of indices of community graphs. Finally, this characterization leads discovery of knowledge from sub-graphs. This proposed approach of detection of a sub-community graph from a group of community graphs using simple graph theory techniques. So, that knowledge could be discovered from the sub-community graph detected in a set of community graphs. The proposed algorithm has been implemented with two examples including one benchmark network and observed satisfactory results.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68a9dfaada62dcdfad65a058e92de1dd https://zenodo.org/record/5577120 Zobrazit plný text záznamu