Let G = (V, E) be a graph with vertex-set V = {1,2,3,4} and edge-set = {(1,2), (3, 2), (4, 3), (1,4), (2,4)}. (a) Draw the graph. Find (b) maximal degree, i.e. A(G), (c) minimal degree, i.e. 8(G), (d) the size of biggest clique, i.e. w(G), (e) the size of biggest independent set, i.e. a(G), ter (f) the minimal number of colours needed to color the graph, i.e. x(G).
Let G = (V, E) be a graph with vertex-set V = {1,2,3,4} and edge-set = {(1,2), (3, 2), (4, 3), (1,4), (2,4)}. (a) Draw the graph. Find (b) maximal degree, i.e. A(G), (c) minimal degree, i.e. 8(G), (d) the size of biggest clique, i.e. w(G), (e) the size of biggest independent set, i.e. a(G), ter (f) the minimal number of colours needed to color the graph, i.e. x(G).
Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter3: Functions And Graphs
Section3.3: Lines
Problem 7E
Related questions
Question
Transcribed Image Text:5. Let G = (V, E) be a graph with vertex-set V = {1,2,3,4} and edge-set
E = {(1, 2), (3, 2), (4, 3), (1, 4), (2,4)}.
(a) Draw the graph.
Find
(b) maximal degree, i.e. A(G),
(c) minimal degree, i.e. 8(G),
(d) the size of biggest clique, i.e. w(G),
(e) the size of biggest independent set, i.e. a(G), ter
(f) the minimal number of colours needed to color the graph, i.e. x(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 4 steps with 53 images
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage