in Graph Theory edited by
401 views
0 votes
0 votes
A simple graph is one in which there are no self loops and each pair of distinct vertices is connected by at most one edge. Let G be a simple graph on 8 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6 and a vertex of degree 7. Which of the following can be the degree of the last vertex ____ ?
in Graph Theory edited by
401 views

4 Comments

1
1

 show how u done by havel hakimi

0
0
Typical hit and try.

Take 6 as degree then take 5 then 4 .. and so on..

Ull satify havel hakimi on 4.
0
0

Please log in or register to answer this question.

Related questions