The Gateway to Computer Science Excellence
0 votes
If adjacency matrix of 2 graphs are same, then can we say that those 2 graphs are isomorphic?
in GATE Application by (53 points) | 22 views


First Make Adjacency matrix for both graphs.

These matrices would be square and symmetrical. (If No multiple or directed edges)

The main diagonal would be all zeroes (if no loops)

if the number of 1s and 0s are not the same in both matrices then it's not isomorphic surely. If they are the same then it may be isomorphic.



How do we prove that it may be or may not be isomorphic. Can you give some reason?

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,654 questions
56,166 answers
94,262 users