in Graph Theory edited by
991 views
1 vote
1 vote
$<2, 2, 2, 1, 1>$ degree sequence is NOT graphic for simple graphs$?$
in Graph Theory edited by
991 views

2 Comments

yes, there will be a graph possible with the given degree sequence
0
0
We can also apply Havel Hakimi's theorems, and get the answer.
0
0

1 Answer

1 vote
1 vote
Best answer

For , clarify your doubt I draw this...But in xam you follow Havel Hakimi procedure to know whether simple Graph is possible of not with the given degree sequence.

selected by
by
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true