1 votes 1 votes In an undirected graph, if we add the degrees of all vertices, it is: odd even cannot be determined always $n+1,$ where $n$ is number of nodes Graph Theory nielit-sta-2020 graph-theory easy degree-of-graph + – gatecse asked Dec 9, 2020 • recategorized Jul 5, 2022 by Lakshman Bhaiya gatecse 412 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes Option B is correct. Summation of all degree of vertices is equal to twice the number of edges(even). Handshaking Lemma GATE2013 NIELIT 2017 July Scientist B (IT) TIFR2012 Hira Thakur answered Dec 11, 2020 • selected Mar 7, 2021 by gatecse Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.