Research Article
Matrix Equality: An Application of Graph Isomorphism

Khadija Riaz, Malik Sikander Hayat Khiyal and Muhammad Arshad

Information Technology Journal, 2005, 4(1), 6-10.

Abstract

In this study we discuss about an application of graph Isomorphism. If we look at two unequal matrices of undirected graphs, we cannot say either the graphs of these matrices are isomorphic or not isomorphic. It is because the two matrices may look different even the graphs are isomorphic. In this study, by using our algorithm of Graph Isomorphism it can be told about the given unequal matrices that the matrices have isomorphic graphs or not. In the case the graphs are isomorphic; the given unequal matrices are made equal by moving the vertices of a matrix according to the corresponding vertices in other graph.

ASCI-ID: 28-184

Cited References Fulltext

Similar Articles


An Algorithm to Find Equivalence Classes

Information Technology Journal, 2003, 2(3), 240-249.

Finding Hamiltonian Cycle in Polynomial Time

Information Technology Journal, 2006, 5(5), 851-859.

Analyzing the Software Quality Metrics for Object Oriented Technology

Information Technology Journal, 2006, 5(6), 1053-1057.

A Survey on Frequent Pattern Mining: Current Status and Challenging Issues

Information Technology Journal, 2010, 9(7), 1278-1293.

Privacy Preserving Data Publishing: Current Status and New Directions

Information Technology Journal, 2012, 11(1), 1-8.

An High Performance Information Hiding Scheme Based on CL multi-wavelet and Color Transfer Theory for Secret Communication

Information Technology Journal, 2013, 12(15), 3260-3266.

Finding Hamiltonian Cycle in Polynomial Time

Information Technology Journal, 2006, 5(5), 851-859.