Following Problem Np Complete Prove Answer K Star Node V K Outgoing Edges Decision Problem Q37187139

Is the following problem NP-complete? Prove your answer.

a k-star is a node v that has k outgoing edges. Our decisionproblem is: does G contain a k-star for a given parameter k?

Answer

Degmit problems tret com he ael NP-Set et

OR

 

OR