search
Log In
0 votes
222 views
This a random question came into my mind…

Are the below statements true:

1] If a graph is Homomorphic to our graph then it is also Isomorphic to that graph.

2]If a graph is Isomorphic to our graph then it is also Homomorphic graph.
in Set Theory & Algebra 222 views
0

@MiNiPanda any Idea mate?

2
statement 2 is true and statement 1 is false.
0
Thank you :)
2

jump to 2:02 you will get your answer. 

Please log in or register to answer this question.

Related questions

0 votes
2 answers
1
2 votes
1 answer
2
992 views
Assume that ‘e’ is the number of edges and n is the number of vertices. The number of non-isomorphic graphs possible with n-vertices such that graph is 3-regular graph and e = 2n – 3 are ______. ----------------------------------- ... to find no of Non Isomorphic graphs possible ? , this is real question ! Is there any algorithm for this ? From Made Easy FLT 6-Practice Test 14
asked Dec 1, 2015 in Graph Theory Akash Kanase 992 views
0 votes
0 answers
3
934 views
Are the following topics necessary/ apt to study for gate.(Bold items are explicitly mentioned in gate syllabus document) Connectivity Matching Coloring Cuts Covering Independent Sets Planar Graphs Isomorphism Walks, Trails, Paths, Cycles and Circuits in Graph Graph measurements: length ... all of these is taking a lot of time. Can anyone please recommend a reliable and simple resource to go with.
asked Dec 29, 2018 in Graph Theory Krishna Sai Vootla 934 views
0 votes
1 answer
4
512 views
The Number of Non-Isomorphic simple graphs upto 5 Nodes is _______
asked Dec 1, 2016 in Graph Theory SKP 512 views
...