- All Journals
- Al-Qadisiyah University
- Basrah University
- Kirkuk University
- Mosul University
- The Iraqi Borad for Medical Specialization
- University of Anbar
- University of Technology
- Al Mustafa University
- Al-Zahraa University for Women
- Alnoor University
- Kunooz University
- Misan University
- Ninevah University
- Tikrit University
- University of Al-Hamdaniya
- University of Kerbala
THE PERMUTATIONS ALGORITHM TO SOLVE THE GRAPH ISOMORPHISM | ||
| AL-TAQANI | ||
| Article 1, Volume 23, Issue 1, 2010, Pages 56-62 | ||
| Author | ||
| Abstract | ||
| This research study the isomorphism problem of two simple planar graphs which they have the same number of vertices and edges, we used the permutations algorithm which generates a permutation from known permutation. In this paper a program in (Mat Lab) has been constructed to compare two graphs by generating all permutations of the vertices of the first graph and finding the adjacency matrix of it in each permutation then compare it with the adjacency matrix of the second graph . Finally the result discuses whether the two graphs are isomorphic or not | ||
|
Statistics Article View: 78 PDF Download: 21 |
||