Star extremal of circulant graphs
碩士 === 國立中山大學 === 應用數學系研究所 === 92 === A graph is called star extremal if its fractional chromatic number is equal to its circular chromatic number. Given integers n,k,k'' such that 1<=k<=k''<=n/2,the circulant graph G(n,S_k,k'') has vertex set [n]={0,1,2,...,n-...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/55848476597136511381 |