Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
5. A graph G has 105 vertices of which there are 13 vertices of degree 3, 33 vertices of degree 5 and the rest of the vertices have degrees greater or equal than 2 and smaller or equal than 7. Based on the Handshaking lemma what are the smallest and the largest numbers of edges G can have?

5. A graph G has 105 vertices of which there are 13 vertices of degree 3, 33 vertices of degree 5 and the rest of the vertices have degrees greater or equal than 2 and smaller or equal than 7. Based on the Handshaking lemma what are the smallest and the largest numbers of edges G can have?

Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 80EQ
See similar textbooks
icon
Related questions
Question
5. A graph G has 105 vertices of which there are 13 vertices of degree 3, 33 vertices of degree 5 and the rest of the vertices have degrees greater or equal than 2 and smaller or equal than 7. Based on the Handshaking lemma what are the smallest and the largest numbers of edges G can have?
Transcribed Image Text:5. A graph G has 105 vertices of which there are 13 vertices of degree 3, 33 vertices of degree 5 and the rest of the vertices have degrees greater or equal than 2 and smaller or equal than 7. Based on the Handshaking lemma what are the smallest and the largest numbers of edges G can have?
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
SEE MORE TEXTBOOKS