查詢結果分析
來源資料
相關文獻
- (Pκ,Sκ)-Multidecomposition of C□,□
- 曳引機攜帶作業機進行整地作業路徑自動規劃系統之研製
- Balanced Path Decompositions of Crowns and Directed Crowns
- The Number of Minimal Vertex Covers in the Product of Stars or Paths
- BEX-VCS訊務管理之設計
- 網際網路群播路由技術
- Short Proofs on the Connectivity of Graph
- CAM多軸加工路徑規劃
- Evaluation for Computer-Simulated Problem Solving
- Does Small-Scale Meander Travel Eastwards and Trigger Large-Scale Meander of the Kuroshio﹖
頁籤選單縮合
題名 | (Pκ,Sκ)-Multidecomposition of C□,□=C□,□之(Pκ,Sκ)-多重分解 |
---|---|
作者姓名(中文) | 李鴻志; 侯鈞甯; | 書刊名 | 嶺東學報 |
卷期 | 28 2010.12[民99.12] |
頁次 | 頁93-104 |
分類號 | 312.1 |
關鍵詞 | 皇冠圖; 路徑; 星形; 多重分解; 多重充填; 多重覆蓋; Crown; Path; Star; Multidecomposition; Multipacking; Multicovering; |
語文 | 英文(English) |
中文摘要 | 本文主要探討皇冠圖C(下標 n, n-1)多重分解成k-路徑及k-星形之問題,得到多重分解存在之充分條件。此外,亦探討C(下標 n, n-1)之3-路徑及3-星形之多重充填與多重覆蓋問題,並得到所有最大多重充填與最小多重覆蓋。 |
英文摘要 | In this paper, we investigate the multidecomposition problem of the crown C(subscript n, n-1) into k-paths and k-stars. Some sufficient conditions for the existence of the multidecomposition are given. Moreover, we consider the multipacking and multicovering of C(subscript n, n-1) with 3-paths and 3-stars, and give the maximum multipacking and minimum multicovering explicitly. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。