Awesome q2a theme
0 votes
13 views
I was working from the famous book of Deo. Then i found this problem very hard and interesting. Any ideas to give me?

 

- β€œLet us define a new term called edge isomorphism as follows: Two graphs G1 and G2 are edge isomorphic if there is a one-to-one correspondence between the edges of G1 and G2 such that two edges are incident (at a common vertex) in G1 if and only if the corresponding edges are also incident in G2. Discuss the properties of edge isomorphism. Construct an example to prove that edge-isomorphic graphs may not be isomorphic.”
in Graph Theory by (7 points) | 13 views

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Jul 2020
  1. Shaik Masthan

    39 Points

  2. hiteshpujari

    9 Points

  3. Venkatesh Akhouri

    6 Points

  4. Meghana518

    6 Points

  5. bittujash

    6 Points

  6. Pawan_k

    6 Points

  7. rits78671

    6 Points

  8. srestha

    6 Points

  9. RavGopal

    4 Points

  10. Sumaiyas

    4 Points

7,545 questions
1,783 answers
10,867 comments
90,483 users