Solutions Manual of Introduction To Graph Theory by Meng & Fengming - 1st Edition
Uploaded by
jackricher359Solutions Manual of Introduction To Graph Theory by Meng & Fengming - 1st Edition
Uploaded by
jackricher359https://buklibry.
com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Solutions Manual of Introduction to Graph Theory by Meng & Fengming | 1st edition
Koh Khee Meng
Dong Fengming
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Tay Eng Guan
Introduction to
Graph Theory
Solutions Manual
World Scientific
Download full file from buklibry.com
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Solutions Manual of Introduction to Graph Theory by Meng & Fengming | 1st edition
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Introduction to
Graph Theory
Solutions Manual
Download full file from buklibry.com
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Solutions Manual of Introduction to Graph Theory by Meng & Fengming | 1st edition
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
This page intentionally left blank
Download full file from buklibry.com
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Solutions Manual of Introduction to Graph Theory by Meng & Fengming | 1st edition
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Introduction to
Graph Theory
Solutions Manual
Koh Khee Meng
National University of Singapore Singapore
,
Dong Fengming
Tay Eng Guan
Nanyang Technological University, Singapore
World Scientific
.
Download full file from buklibry.com
NEW JERSEY • LONDON SINGAPORE • BEIJING SHANGHAI • HONG KONG • TAIPEI • CHENNAI
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Solutions Manual of IntroductionExercise
to Graph
3.2 Theory by Meng & Fengming
89 | 1st edition
Problem 6. A connected graph is said to be unicyclic if it contains one
and only one cycle as a subgraph.
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
(i) Is every cycle unicyclic?
(ii) Construct two unicyclic graphs of order 8 which are not C8 .
(iii) How many edges are there in each of your graphs in (ii)?
Solution. (i) Yes, every cycle is unicyclic.
(ii) Two such graphs are shown below:
(iii) Each graph is of size 8 (same as the order).
Problem 7. Let G be a unicyclic graph.
(i) What is the relation between e(G) and v(G)? Justify your answer.
(ii) Show that there exist at least three edges e in G such that G − e is a
tree.
Solution. Let G be a unicyclic graph.
(i) Then e(G) = v(G).
Let f be any edge contained in the only cycle in G. Observe that G − f
is still connected (see Problem 16(iii) in Exercise 2.3) and it contains no
cycle. Thus, G − f is a tree, and by Theorem 3.4, e(G − f ) = v(G − f) − 1.
It follows that e(G) = e(G − f) + 1 = v(G − f ) = v(G), as asserted.
(ii) Let Ck be the cycle in G. As shown in (i), the deletion of any edge
in Ck results in a tree. The result now follows as k ≥ 3.
Problem 8. (+) Let G be a unicyclic graph and let n 1 denote the number
of end-vertices in G. Find an expression for n1 similar to that in Theorem
3.5.
Solution. Let G be a unicyclic graph of order n and let n i denote the
number of vertices of degree i in G, i = 1, 2, · · · , k(= ∆(G)). Then, by
Download full file from buklibry.com
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
Solutions Manual of Introduction to Graph
Exercise 4.3 Theory by Meng & Fengming
109 | 1st edition
Problem 8. Let G be a graph. Determine whether each of the following
statements is true.
https://buklibry.com/download/solutions-manual-of-introduction-to-graph-theory-by-meng-fengming-1st-edition/
(i) If G admits a 3-colouring, then G is 3-colourable.
(ii) If G is 3-colourable, then G is 5-colourable.
(iii) If G is 3-colourable, then χ(G) ≥ 3.
(iv) If G is 3-colourable, then χ(G) ≤ 3.
(v) If G is 3-colourable, then G contains an odd cycle.
(vi) If G contains an odd cycle, then G is 3-colourable.
(vii) If G admits no 3-colourings, then χ(G) ≥ 3.
(viii) If G admits no 3-colourings, then χ(G) = 2.
(ix) If G admits no 3-colourings, then χ(G) ≤ 2.
(x) If χ(G) = 3, then G contains a triangle.
(xi) If χ(G) = 3, then G contains an odd cycle.
(xii) If G is a tree with at least two vertices, then χ(G) = 2.
(xiii) If χ(G) ≥ r, then G contains a Kr as a subgraph.
Solution. (i) True.
(ii) True.
(iii) False.
(iv) True
(v) False
(vi) False.
(vii) True. (Indeed, χ(G) ≥ 4.)
(viii) False.
(ix) False.
(x) False.
(xi) True.
(xii) True.
(xiii) False.
