0 votes 0 votes Let G be a simple graph with 11 vertices . if degree of each vertex is atleast 3 and atmost 5 , then the number of edges in G should lie between I got 16 and 28 Graph Theory discrete-mathematics + – Magma asked Jan 8, 2019 Magma 1.1k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Shubhgupta commented Jan 8, 2019 reply Follow Share @pawan kumarln, in your diagram e<= 55/2(27.5), so how it can be 28? should be 27 right? 0 votes 0 votes pawan kumarln commented Jan 8, 2019 reply Follow Share Sorry....Yes emax is 27 in my view 0 votes 0 votes AD Purbia commented Jan 9, 2019 i edited by AD Purbia Jan 11, 2019 reply Follow Share 33/2<=e<=55/2 =16.5<=e<=27.5 from this e must be greater than or equal to 16.5 but e must be an integer so atleast no. of edges =17. similiarly,e must be less than or equal to 27.5 so here atmost no. of edges =27. 0 votes 0 votes Please log in or register to add a comment.