Abstract: Graphs are one of the popular models for effective representation of complex structured huge data and the similarity search for graphs has become a fundamental research problem in Graph Mining. In this paper initially, the preliminary graph related basic theorems are brushed and showcased on with various research sub domains such as Graph Classification, Graph Searching, Graph Indexing, and Graph Clustering. These are discussed with few of the most dominant algorithms in their respective sub domains. Finally a model is proposed along with various algorithms with their future projection.

K. Vivekanandan, A. Pankaj Moses Monickaraj and D. Ramya Chithra, “Graph Mining Sub Domains and a Framework for Indexing – A Graphical Approach ” International Journal of Advanced Computer Science and Applications(IJACSA), 4(4), 2013. http://dx.doi.org/10.14569/IJACSA.2013.040425

@article{Vivekanandan2013,
title = {Graph Mining Sub Domains and a Framework for Indexing – A Graphical Approach },
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2013.040425},
url = {http://dx.doi.org/10.14569/IJACSA.2013.040425},
year = {2013},
publisher = {The Science and Information Organization},
volume = {4},
number = {4},
author = {K. Vivekanandan and A. Pankaj Moses Monickaraj and D. Ramya Chithra}
}