Is it possible to have a connected graph with six (6) vertices of degrees 1, 1, 2, 2, 2, and 3? If possible, why possible explain. If NOT possib

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Is it possible to have a connected graph with six (6) vertices of degrees 1, 1, 2, 2, 2, and 3? If possible, why possible explain. If NOT possible, why not
possible explain.
Transcribed Image Text:Is it possible to have a connected graph with six (6) vertices of degrees 1, 1, 2, 2, 2, and 3? If possible, why possible explain. If NOT possible, why not possible explain.
Expert Solution
Step 1

in a connected graph, the sum of degree of all the vertices is twice the number of edges.

therefore sum of degree of vertices = 2e where e is the number of edges.

therefore sum of degree of vertices should be even in a connected graph, 

 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,