199 views
0 votes
0 votes
Suppose that the sum of the degrees of all vertices in a simple undirected graph is 16. What is the minimum number of vertices the graph can have? Explain your answer.

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
poojasharma123 asked Jul 13, 2018
247 views
consider the following directed graph,find the number of paths from A to I
1 votes
1 votes
0 answers
2
VS asked Oct 23, 2017
541 views
What type of graph is STAR?A. BipartiteB. TripartiteC. MutipartitePS : I know a star graph is bipartite but can't we say that a bipartite graph is also tripartite . I. E...
0 votes
0 votes
1 answer
3
S Ram asked Feb 2, 2017
683 views
here in this question they have asked about the number of edges but i cant find a way to solve pls help here...
0 votes
0 votes
0 answers
4
Swap asked Dec 12, 2016
187 views
Guys cut vertices and cut edges are in syllabus or not? pls reply fast...Is it necessary to read those topics to understand graph connectivity??what about Isomorphism?wha...