Open AccessDetection of Sub Community Graph in N Community Graphs using Graph Mining
Author(s) -
B. V. Rao,
Sarojananda Mishra
Publication year - 2020
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.b4530.029320
Subject(s) - indifference graph , pathwidth , cograph , split graph , block graph , computer science , line graph , maximal independent set , graph product , combinatorics , discrete mathematics , theoretical computer science , graph , mathematics
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.