Answer:
It isn't possible.
Step-by-step explanation:
Let G be a graph with n vertices. There are n possible degrees: 0,1,...,n-1.
Observe that a graph can not contain a vertice with degree n-1 and a vertice with degree 0 because if one of the vertices has degree n-1 means that this vertice is adjacent to all others vertices, then the other vertices has at least degree 1.
Then there are n vertices and n-1 possible degrees. By the pigeon principle there are two vertices that have the same degree.
Answer:
(4,1)
Step-by-step explanation:
let J(6,6) be x1, y1
let K(2,-4) be x2, y2
midpoint = (x1+x2)/2 , (y1+y2)/2
=(6+2)/2 ,(6-4)/2
= 8/2 ,2/2
=4, 1
Answer: 56
Explanation: 28 pounds = 448 ounces
448/8=56
