[SOLVED] CPTS553- Graph Theory: Assignment 8

25.00 $

Programming resource
Digital learning resource
Category:
βœ“ Practical programming resource
βœ“ Suitable for guided study and reference
βœ“ Tutor guidance available when needed

Description

Rate this product

There’s only one question, with four parts.

Let 𝐺 be a graph having Laplacian matrix

 

3

Β βˆ’1

Β βˆ’1

 

βˆ’1

𝐿 = 0

0

0

0

0

[ 0

 

βˆ’1

3

0

βˆ’1

βˆ’1

0

0

0

0

0

βˆ’1

0

2

0

0

0

0

βˆ’1

0

0

βˆ’1

βˆ’1

0

4

βˆ’1

βˆ’1

0

0

0

0

0

βˆ’1 0

βˆ’1

3

0

βˆ’1

0

0

0

0

0

0

βˆ’1

0

4

0

βˆ’1

βˆ’1

βˆ’1

0

0

0

0

βˆ’1

0

2

0

0

βˆ’1

0

0

βˆ’1

0

0

βˆ’1

0

3

βˆ’1

0

0

0

0

0

0

βˆ’1 0

βˆ’1 3

βˆ’1

0

0 0

 

0

0

βˆ’1 βˆ’1

0

βˆ’1

3 ]

Recall that the eigenvalues of 𝐿 will take the form

 

We will associate with each eigenvalue πœ†π‘– its corresponding eigenvector 𝐯𝑖.Β  For instance,

1

1

1

 

1

𝐯1 = Β 11Β  ;Β  πœ†1 = 0.

1

1

1

[1]

 

  1. Use a matrix calculator to find πœ†2 and πœ†3 together with eigenvectors 𝐯2 and 𝐯3. You’re on the right track if your values of πœ†2 and πœ†3 are about 875 and 1, respectively.Β  Also, check that the entries of 𝐯2 and 𝐯3 sum to 0 (this

is a consequence of the eigenvectors corresponding to different eigenvalues of 𝐿 being orthogonal.)

 

  1. Let

1

𝐱                            and 𝐲 = 𝐯 ;

these vectors 𝐱 and 𝐲 are unit vectors.

Letting π‘₯𝑖 and 𝑦𝑖 be the π‘–π‘‘β„Ž coordinates of 𝐱 and 𝐲, respectively, plot the points

(π‘₯1,𝑦1),(π‘₯2,𝑦2),…,(π‘₯10,𝑦10)

in ℝ2 and for each edge 𝑖𝑗 of 𝐺, draw the segment joining (π‘₯𝑖,𝑦𝑖) to

(π‘₯𝑗,𝑦𝑗).

The result should be a β€œnice” drawing of 𝐺 in the sense that adjacent vertices are drawn close together.

  1. Do the same process in part A to find πœ†9 and πœ†10 along with corresponding eigenvectors 𝐯9 and 𝐯10. You should expect πœ†9 and πœ†10 to be about 5 and 5.76, respectively.

 

  1. Repeat the process in part B where

 

1Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β Β  1

𝐱 = 𝐯 and 𝐲 = 𝐯 .

This time, the resulting drawing should have adjacent vertices drawn far apart and so vertices that are drawn close together could be assigned the same color in a graph coloring.  This should give you an indication of the chromatic number of 𝐺.  What is this number?

Resource details

Understand the Task Before You Use the Resource

Review the requirements, identify the programming concepts involved, study the implementation and test your understanding with your own examples and modifications.