References

Amuthavalli, K., 2010. Graph labeling and its applications-some generalization of odd mean labelling. Ph.D. Thesis, Mother Teresa Womens University, Kodaikanal, India.

Babai, L. and L. Kucera, 1979. Canonical labelling of graphs in linear average time. Proceedings of the 20th Annual Symposium on Foundations of Computer Science, October 29-31, 1979, IEEE, New York, USA., pp: 39-46.

Binucci, C., W. Didimo, G. Liotta and M. Nonato, 2005. Orthogonal drawings of graphs with vertex and edge labels. Comput. Geometry, 32: 71-114.
CrossRef  |  Direct Link  |  

Bringmann, B. and S. Nijssen, 2008. What is Frequent in a Single Graph?. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining, T. Washio., E. Suzuki, K.M. Ting and A. Inokuchi (Eds.). Springer, Berlin, Germany, ISBN:978-3-540-68125-0, pp: 858-863.

Chartrand, G. and P. Zhang, 2006. Introduction to Graph Theory. McGraw-Hill, New York, USA., ISBN: 978-0-07-061608-0, Pages: 447.

Cook, D.J. and L.B. Holder, 2006. Mining Graph Data. John Wiley & Sons, Hoboken, New Jersey, ISBN:978-0-471-73190-0, Pages: 469.

Cordella, L.P., P. Foggia, C. Sansone and M. Vento, 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE. Trans. Pattern Anal. Mach. Intell., 26: 1367-1372.
CrossRef  |  Direct Link  |  

Deshpande, M., M. Kuramochi, N. Wale and G. Karypis, 2005. Frequent substructure-based approaches for classifying chemical compounds. IEEE Trans. Knowl. Data Eng., 17: 1036-1050.
CrossRef  |  

Flake, G.W., R.E. Tarjan and K. Tsioutsiouliklis, 2004. Graph clustering and minimum cut trees. Internet Math., 1: 385-408.
Direct Link  |  

Foggia, P., C. Sansone and M. Vento, 2001. A performance comparison of five algorithms for graph isomorphism. Proceedings of the 3rd IAPR-TC15 Workshop Graph-Based Representations in Pattern Recognition, May, 2001, Italy, pp: 188-199.

Frick, A., A. Ludwig and H. Mehldau, 1994. A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration). In: Graph Drawing, Tamassia, R. and I.G. Tollis (Eds.). Springer, Berlin, Germany, ISBN:978-3-540-49155-2, pp: 388-403.

Garey, M. and D. Johnson, 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. 11th Edn., W.H. Freeman and Company, New York, ISBN-10: 0716710455.

Gross, J. and J. Yellen, 2004. Handbook of Graph Theory. CRC Press, Florida, USA.,.

Gyssens, M., J. Paredaens, V.D.J. Bussche and V.D. Gucht, 1994. A graph-oriented object database model. IEEE. Trans. Knowl. Data Eng., 6: 572-586.
CrossRef  |  Direct Link  |  

Huan, J., W. Wang and J. Prins, 2003. Efficient mining of frequent subgraph in the presence of isomorphism. Proceedings of the 3rd IEEE International Conference on Data Mining, Nov. 19-22, Melbourne, FL., pp: 549-552.

Inokuchi, A., T. Washio and H. Motoda, 2003. Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn., 50: 321-354.
CrossRef  |  Direct Link  |  

Jin, R., C. Wang, D. Polshakov, S. Parthasarathy and G. Agrawal, 2005. Discovering frequent topological structures from graph datasets. Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Databases, Aug. 21-24, Chicago, IL., pp: 606-611.

Koyuturk, M., A. Grama and W. Szpankowski, 2004. An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinf., 20: 200-207.
Direct Link  |  

Kumar, R., P. Raghavan, S. Rajagopalan, D. Sivakumar and A. Tompkins et al., 2000. The web as a graph. Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, May 15-18, 2000, ACM, Dallas, Texas, USA, ISBN:1-58113-214-X, pp: 1-10.

Kuramochi, M. and G. Karypis, 2004. An efficient algorithm for discovering frequent subgraphs. IEEE. Trans. Knowl. Data Eng., 16: 1038-1051.
CrossRef  |  Direct Link  |  

Maio, D. and D. Maltoni, 1996. A structural approach to fingerprint classification. Proceedings of the 13th International Conference on Pattern Recognition, August 25-29, 1996, IEEE, New York, USA., ISBN:0-8186-7282-X, pp: 578-585.

McKay, B.D. and A. Piperno, 2014. Practical graph isomorphism, II. J. Symbolic Comput., 60: 94-112.
Direct Link  |  

Sander, G., 1999. Graph layout for applications in compiler construction. Theor. Comput. Sci., 217: 175-184.
CrossRef  |  Direct Link  |  

Santo, M.D., P. Foggia, C. Sansone and M. Vento, 2003. A large database of graphs and its use for benchmarking graph isomorphism algorithms. Pattern Recognit. Lett., 24: 1067-1079.
Direct Link  |  

Ullmann, J.R., 1976. An algorithm for subgraph isomorphism. J. ACM., 23: 31-42.
CrossRef  |  Direct Link  |  

Wale, N.G. and I.A.W. Karypis, 2007. Method for effective virtual screening and scaffold-hopping in chemical compounds. Comput. Syst. Bioinf. Conf., 6: 403-414.

Washio, T. and H. Motoda, 2003. State of the art of graph-based data mining. ACM SIGKDD Explorat. Newslett., 5: 59-68.
Direct Link  |  

Yan, X. and J. Han, 2002. gSpan: Graph-based substructure pattern mining. Proceedings of the 2002 IEEE International Conference on Data Mining, December 9-12, 2002, Maebashi, Japan, pp: 721-724.

Yan, X., P. Yu and J. Han, 2004. Graph indexing: A frequent structure based approach. Proceedings of the Special Interest Group on Management of Data, June 13-18, 2004, Paris, France, pp: 335-346.

Zhou, B. and J. Pei, 2008. Preserving privacy in social networks against neighborhood attacks. Proceedings of the 24th IEEE International Conference on Data Engineering, April 7-12, 2008, Cancun, pp: 506-515.