GATE CSE
First time here? Checkout the FAQ!
x
+3 votes
120 views
$\begin{align*} &S = \left \{ G_i \;\; | \; G_i \in \text{ lebeled trees with 4 vertices} \right \} \\ &\text{Relation } \quad R = \left \{ {\color{red}{\left ( G_i,G_j \right )}} \; | G_i,G_j \in S \;\; \text{and} \;\; G_i,G_j \;\; \text{are} \;\; \text{isomorphic to each other} \right \} \end{align*}$

No of equivalent classes of $R$ ?
asked in Combinatory by Veteran (46.9k points)   | 120 views
How come you are comparing trees? For isomorphism, the labels must also be same, right?
Sir is isomorphism is checked only in terms of their structure? Shouldn't it be checked for adjacent colors also?
@debashish,i thought the answer is only 1 as we can get tree with nonly 3 edges
so,you are saying that first 12 are in one class of isomorphism,

whya bove 12 not isomorphic to bottom 4??

is it because there degrees are different..right??
Yes first see no. Of vertices and edges, then check for degree sequence then check for same cycle length. 2 equivalence classes. Btw good question.

Please log in or register to answer this question.



Top Users May 2017
  1. akash.dinkar12

    3154 Points

  2. pawan kumarln

    1630 Points

  3. sh!va

    1590 Points

  4. Arjun

    1350 Points

  5. Devshree Dubey

    1246 Points

  6. Angkit

    1044 Points

  7. Debashish Deka

    1022 Points

  8. Bikram

    972 Points

  9. LeenSharma

    820 Points

  10. Prashant.

    692 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. pawan kumarln

    256 Points

  2. Ahwan

    232 Points

  3. jjayantamahata

    114 Points

  4. joshi_nitish

    114 Points

  5. Arnab Bhadra

    94 Points


22,731 questions
29,061 answers
65,094 comments
27,625 users