1.

A _______ is a graph with no homomorphism to any proper subgraph.(a) poset(b) core(c) walk(d) trailThis question was posed to me in exam.My question comes from Isomorphism in Graphs topic in chapter Graphs of Discrete Mathematics

Answer» RIGHT CHOICE is (b) core

The best explanation: A core can be defined as a graph that does not retract to any proper subgraph. Every graph G is HOMOMORPHICALLY equivalent to a UNIQUE core CALLED the core of G.


Discussion

No Comment Found

Related InterviewSolutions