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. * The line graph $L(G)$ is $K_3$ (the three edges of the star are pairwise adjacent in the line graph), and the vertex-connectivity $\kappa(L(G))=\kappa(K_3)=2$. So $\kappa'(G)=1$ while $\kappa(L(G))=2$; the claimed equality fails. Explanation / intuition. Removing edges
___ _______ ________ _______ __________ _________.
_____ _____ _______ _____ _______ _________ ______ _______.
____ _______ ___ __________ ______ ____ ______.
__________ __________ _______ _______ _____ _________ ____ ___ ___ ___ ____ ____.
____ ___ ________ _______ ______ _____ ________ ________ ______ ________ _______.
__________ _________ _________ _________ _________.
_____ __________ _______ _______ __________ _______ ______ ________ _________ ____ __________.
_____ ________ ______ _________ ____ ____ _______ _______ _________ ______.
______ _______ _______ _____ _____.
____ ______ ___ _______ _______ _____ _________ __________ ____ ____ _____ ___.
________ ______ ____ _________ __________ ___ _______.
________ _________ ________ ____ _________ _____ ________ ____ ____ ________ ________ ______.
____ __________ ______ ________ _________ ________ _______ ____.
________ _________ ____.
IGNOU ACADEMY
Your IGNOU journey, made easier.
  • Solved Assignments
  • Study Notes
  • Guess Papers
  • Question Papers
Skip in 10
Top
📞
Call Support Instant phone assistance IGNOU MMTE 1 2025 - (c) For every graph True or false? Justify. | IGNOU Academy
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→