Journal article Open Access

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

Bapuji Rao; Sarojananda Mishra

Sponsor(s)
Blue Eyes Intelligence Engineering & Sciences Publication (BEIESP)

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.

Files (1.1 MB)
Name Size
B4530129219.pdf
md5:7668e11caf27074604e28a9c5eb0799e
1.1 MB Download
17
9
views
downloads
Views 17
Downloads 9
Data volume 9.5 MB
Unique views 17
Unique downloads 9

Share

Cite as