Y CP的部落格

Weekly Report

I fell ill on last Tuesday and supposed that I would recover soon. However, I lay on my bed once arriving the dormitory the following days since I easily felt tired and had no vitality.

When I lay on my bed, I reviewed what I learned on graph theory course and had an intuition that there is some relationship between n-cube, perfect matching, complete bipartite, and complete k-partite (the issue about complete k-partite seems meaningless?? ) I drew numbers of graphs to try ordering my thinking but nothing special discovery. Nevertheless, I noted down a few notes bellow:

¨          Bipartite ó 2-colorable ó No cycle with odd length

¨          N-cube

The number of node is 2^n, and the number of edge is (2^n * n)/2. It’s n-regular.

¨          Complete bipartite K_n,n

The number of node is 2n, and the number of edge is n*n. It’s n-regular.

¨          Perfect matching

        There are n disjoint perfect matchings on K_n,n ,and n! perfect matchings on it.

To find number of perfect matchings on K_n,n can correspond to find the number of 1-1 function with the same size of Domain and Range.

老師說本來要叫我不用寫了，可是因為我把graph theory 寫成graphic theorem，所以還是得繼續磨練一下。

※　紫色的是代表陳小涵同學每週要學習的單字及片語