文章詳目資料
影像處理暨通訊期刊
加入收藏
下載文章
| 篇名 | Packing the Cartesian Product of Two Complete Graphs with Pentagons |
|---|---|
| 卷期 | 1 |
| 作者 | Huang, Ming-hway |
| 頁次 | 055-061 |
| 關鍵字 | pack 、 leave 、 Decomposition 、 k-cycle system |
| 出刊日期 | 2009 |
中文摘要
英文摘要
In this paper, we completely solve the problem of finding a maximum packing of Km£Kn,the Cartesian product of two complete graphs, with edge-disjoint 5-cycles and minimum leaves are explicitly given. Subsequently, we also find a minimum covering of Km £ Kn.
本卷期文章目次
- Tumor Feature Reserved Compression Systems for Mammograms / Lin, Chi-yuan、Lin, Tsung-hung、Yang, Sheng-Chin、Lin, Yin-Chen、Lee, Bing-yi
- Campus Tutorial Application using Interactive Video Technologies / Han-Bin Chang、Yuanpei University
- Image Quantization Using Fuzzy Inference Filter / Tseng, Tzu-yun
- CPW-Fed Folded T-Shaped Slot Antenna with Cross-Shaped Feeding Line for WLAN Application / Ku, Chia-hao、Wang, Te-shun、Fu, Tsu-hsun
- Orientation-free visual secret sharing / Chen, Shang-kuan