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),
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),
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter9: Systems Of Equations And Inequalities
Section9.3: Systems Of Inequalities
Problem 30E
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
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Elementary Geometry For College Students, 7e
Geometry
ISBN:
9781337614085
Author:
Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:
Cengage,