Home /
Expert Answers /
Advanced Math /
draw-a-connected-graphgwith-at-least-8-vertices-such-that-3-different-graphs-8-1-g-is-e-pa734
(Solved): DRaw a connected graphGwith at least 8 vertices such that ( 3 different graphs!) (8.1) \( G \) is E ...
DRaw a connected graphGwith at least 8 vertices such that ( 3 different graphs!) (8.1) \( G \) is Eulerian graph and not Hamiltonian (3.2) G is not Euterian but HamiLtonian 8.3. G has both properties.
Expert Answer
(8) We have to draw the connected graph G with at least 8 vertices such that (1)G is Eulerian and not Hamiltonian (2)G is not Eulerian But Hamiltonian