Question

please explain

discrete math thanks

((A + B)^( C D)) + ((AD) → (BAC)) A.)Tautology or not? If yes proof if not also disprove B.) Find radius, center, vertex connectivity, chromatic number, and what edge need to be delete in order the graph have euler cycle?

Answer 1

HA+B)ACCAD)) 9 (CAD) CBAC))=RE Η Η 4 HECH Ε Ε A_BED ADS CAD AND BAC A+B) ACCD) (AND (BAC) R tttttI IT TT I F E IF TT FT + T T F T ITT I F T I F E TFT T F TTT IT FTF F F F I E T F FT E I T T F + F F F F T F T F ETTIT TETT | Еттє т р с т р E T F T T T f [ + IF T F f + T F f I | F E т р т т с т т IF FTFE + F F T F | F E т т т т т 1 F F F F T I F T T T since there is a false is 3eed doce for the ů not Tautology HHUHHHHHHHHHHHHH Ε Ε Ε 4 | 서 도는 너 HHH Η + H HUH 내 + + H T) BYGLARE Radius = 2 Vertex Connectivity - Cand Ge CAl semoval center -B of these veutices make the graph disconnected) Chromatic Number : on the braph, the minimum number of colors viequired to paint the veutices is 3 lie G. ® , So, chuomatic number is 3.

: لها وعلما ء رحم Heue deg (A)=2 deg (8) = 5 degiche degiela 3 deg (f) = 3 degra (G) = 4 degrly)= 3 A gram hau Eule cucle up and only as every verber is even door EF, BC and CH pa we have to memove edges EE, BC Las a А Now deg cata2 deg (BJc4_degfelé 2 de calita dege Ele2 deg (f) = 2 dog (6 l = 4 deg (4122 Eulere cycle ús ABGCDH GE BEA. -