   Chapter 10.2, Problem 22ES ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193

#### Solutions

Chapter
Section ### Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
ISBN: 9781337694193
Textbook Problem
12 views

# Draw a graph that has [ 0 0 0 1 2 0 0 0 1 1 0 0 0 2 1 1 1 2 0 0 2 1 1 0 0 ] as its adjacency matrix. Is this graph biparitite? Definition: Given an m × n matrix A whose ijth entry is denoted a i j , the transpose of A is the matrix A’ whose ijth entry is a i j , for each i = 1 ,   2 ,   …   ,   m and j = 1 ,   2 ,   …   ,   n . Note that the first row of A becomes the first column of A t , the second row of A becomes the second column of A t , and so forth. For instance. if A = [ 0 2 1 1 2 3 ] , then A t = [ 0 1 2 2 1 3 ] .b. Show that a graph with ii vertices is bipartite if, and only if, for some labeling of its vertices, its adjacency matrix has the form [ O A A t O ] where A is a k × ( n − k ) matrix for some integer k such that 0 < k < n , the top left O represents a k × k matrix all of whose entries are 0, A t is the transpose of A, and the bottom right O represents an ( n − k ) × ( n − k ) matrix all of whose entries are 0.

To determine

(a)

Draw a graph that has  as its adjacency matrix. Is this graph bipartite?

Explanation

Given information:

Given an m×n matrix A whose ijth entry is  denoed aij, the transpose of A is the matrix At whose ijthentry is aji, for all i=1,2,...,m and j=1,2,...,n.Note that the first row of A becomes the first column of  A', the second row of A becomes the second column of At, and so forth.

Calculation:

The adjacency matrix A=[aij] is n×n zero-one matrix with                        aij={ 1  if there s an edge from  v i  to  v j 0                                  otherwise

A bipartite graph is a simple graph whose vertices can be partitioned into two sets V1 and V2 such that there are no edges among the vertices of V1 and no edges among the vertices of V2, while there can be edges between a vertex of V1 and vertex V2.



The give adjacency matrix is a 5×5 -matrix, which implies that the corresponding graph contains 5 vertices. Let us name these vertices v1,v2,v3,v4,v5

To determine

(b)

Show that a graph with n vertices is bipartite if, and only if, for some labelling of its vertices, its adjacency matrix has the form [OA A tO].

### Still sussing out bartleby?

Check out a sample textbook solution.

See a sample solution

#### The Solution to Your Study Problems

Bartleby provides explanations to thousands of textbook problems written by our experts, many with advanced degrees!

Get Started 