Upcoming SlideShare
×

# Solutions1.1

1,075 views

Published on

Published in: Technology
1 Comment
0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Please upload the solution book of "Graph Theory (published 2008), J.A. Bondy, U.S.R. Murty."

Are you sure you want to  Yes  No
• Be the first to like this

Views
Total views
1,075
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
17
1
Likes
0
Embeds 0
No embeds

No notes for slide

### Solutions1.1

1. 1. 1 Chapter 1: Fundamental Concepts 1.FUNDAMENTAL CONCEPTS Section 1.1: What Is a Graph? 2 1.1.5. If every vertex of a graph G has degree 2, then G is a cycle—FALSE. Such a graph can be a disconnected graph with each component a cycle. (If inﬁnite graphs are allowed, then the graph can be an inﬁnite path.) 1.1.6. The graph below decomposes into copies of P4 . • • 1.1. WHAT IS A GRAPH? 1.1.1. Complete bipartite graphs and complete graphs. The complete bipartite graph K m,n is a complete graph if and only if m = n = 1 or {m, n} = {1, 0}. 1.1.2. Adjacency matrices and incidence matrices for a 3-vertex path. 0 1 1 1 0 0 1 0 0 1 1 1 0 0 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 1 1 1 0 0 1 0 0 0 1 0 0 1 1 1 0 0 1 1 1 1 0 1 0 0 1 1 1 0 1 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 1 0 0 0  0  1 0 0 1 0  0  0 1 1.1.3. Adjacency matrix for K m,n . m 0 n 1 0 1 0 1 0 0 0 0 1 0 1 0 0 0 0 1 0 1 1 0 0  0  1 0 n m 1 0 1 0 0 0 • • • 1.1.7. A graph with more than six vertices of odd degree cannot be decomposed into three paths. Every vertex of odd degree must be the endpoint of some path in a decomposition into paths. Three paths have only six endpoints. 1.1.8. Decompositions of a graph. The graph below decomposes into copies of K 1,3 with centers at the marked vertices. It decomposes into bold and solid copies of P4 as shown. • Adjacency matrices for a path and a cycle with six vertices.     0 1 0  0  0 0 • • • • • • • • 1.1.9. A graph and its complement. With vertices labeled as shown, two vertices are adjacent in the graph on the right if and only if they are not adjacent in the graph on the left. b• 1 f • g • 0 • e •c f • • h 1.1.4. G ∼ H if and only if G ∼ H . If f is an isomorphism from G to H , = = then f is a vertex bijection preserving adjacency and nonadjacency, and hence f preserves non-adjacency and adjacency in G and is an isomorphism from G to H . The same argument applies for the converse, since the complement of G is G . a• a• b • • c •d h • •d • e •g 1.1.10. The complement of a simple disconnected graph must be connected— TRUE. A disconnected graph G has vertices x, y that do not belong to a path. Hencex and y are adjacent in G . Furthermore, x and y have no common neighbor in G , since that would yield a path connecting them. Hence