Question

(c) For every graph equationTrue or false? Justify.

29 Apr 2025
Answer :
Word Count : 192
False. Counterexample: take the star $G=K_{1,3}$ (one centre $v$ and three leaves). * The edge-connectivity $\kappa'(G)$ (minimum number of edges whose removal disconnects $G$) is $1$ — remove any one pendant edge and the corresponding leaf becomes isolated. ______ ______ _____ _________ ______ ___ _____ _______.
______ ____ __________ ________ ____ ______ _____ _______ _____ _______ ____.
_________ _____ ____ ____ _______ ___ ____ ____ _____ ____.
________ _______ _________ __________ ___ __________ ___ ___ _________.
___ ________ ___ ______ __________.
_____ ______ ___ _______ ________ ______.
____ _________ __________ _________ _____ ______ ____ ____ ____.
______ _________ ___ _______ ____.
____ ______ ______ ______ ______.
___ __________ _________ ___ ______ _______ ____ ____ ____ __________ ________.
__________ ____ ___ ____ ______ ________.
____ ____ _____ _______ __________.
_______ _______ _______ _____ __________ ______.
______ _____ ________ ________ __________ _______ _________ _____ ____ ____.
________ _________ ____ ________ ________ _________ ___ _______ ____ ________ ____.
__________ _________ _________ ________ _______ __________ ______ _________ ____ ____ _______.
_________ ___ ___ ____ ________ _________ __________ ___.
_________ _____ _____ _______ _____ ____ ________ _________ _________.
__________ _____ ____ ________ _______ ________ ____ ________ ____.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance (c) For every graph True or false? Justify.
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→