Let G = (V, E) be a graph with vertex-set V = {1, 2, 3, 4, 5} and edge-set E = {(1, 2),(3, 2),(4, 3),(1, 4),(2, 4),(1, 3)}. (a) Draw the graph. Find   (b) maximal degree, i.e. ∆(G), (c) minimal degree, i.e. δ(G), (d) the size of biggest clique, i.e. ω(G),

Holt Mcdougal Larson Pre-algebra: Student Edition 2012
1st Edition
ISBN:9780547587776
Author:HOLT MCDOUGAL
Publisher:HOLT MCDOUGAL
Chapter12: Angle Relationships And Transformations
Section12.5: Reflections And Symmetry
Problem 20E
icon
Related questions
Question

Let G = (V, E) be a graph with vertex-set V = {1, 2, 3, 4, 5} and edge-set
E = {(1, 2),(3, 2),(4, 3),(1, 4),(2, 4),(1, 3)}.
(a) Draw the graph.
Find  
(b) maximal degree, i.e. ∆(G),
(c) minimal degree, i.e. δ(G),
(d) the size of biggest clique, i.e. ω(G),
(e) the size of biggest independent set, i.e. α(G), ter
(f) the minimal number of colours needed to color the graph, i.e. χ(G).

Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Holt Mcdougal Larson Pre-algebra: Student Edition…
Holt Mcdougal Larson Pre-algebra: Student Edition…
Algebra
ISBN:
9780547587776
Author:
HOLT MCDOUGAL
Publisher:
HOLT MCDOUGAL
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elementary Geometry For College Students, 7e
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
College Algebra
College Algebra
Algebra
ISBN:
9781337282291
Author:
Ron Larson
Publisher:
Cengage Learning