1 votes 1 votes Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following: 1. There is a vertex of degree smaller than $8$ in $G.$ 2. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is TRUE: 1 only 2 only Both 1 and 2 Neither 1 nor 2 Graph Theory discrete-mathematics graph-theory virtual-gate-test-series + – pps121 asked Jan 8, 2019 • edited Apr 5, 2019 by Lakshman Bhaiya pps121 678 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Navneet Kalra commented Jan 9, 2019 reply Follow Share I think only 1 is true.. 1 votes 1 votes OneZero commented Jan 9, 2019 reply Follow Share Is it option a? 1 votes 1 votes pps121 commented Jan 9, 2019 reply Follow Share Yes. Please explain. Unable to understand the given 2nd statement. 0 votes 0 votes pps121 commented Jan 10, 2019 reply Follow Share please elaborate its solution.. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes For 1 use sum of vertex degree = twice the number of edges Pankajmjx answered Jan 28, 2020 Pankajmjx comment Share Follow See all 0 reply Please log in or register to add a comment.