Math Problem Statement

Which of the following is impossible a.

A graph with four vertices of degree 2, 1, 2, 3

b.

A graph with five vertices of degree 2, 3, 2, 3, 4

c.

A graph with four vertices of degree 2, 1, 3, 4

d.

A graph with five vertices of degree 2, 2, 2, 3, 4

Solution

Ask a new question for Free

By Image

Drop file here or Click Here to upload

Math Problem Analysis

Mathematical Concepts

Graph Theory
Degree of Vertices
Handshaking Lemma

Formulas

-

Theorems

Handshaking Lemma

Suitable Grade Level

Advanced High School