查詢結果分析
來源資料
相關文獻
- Packing and Covering Complete Graphs with 3- and 4-paths
- Packing and Covering Multicrowns with 4-cycles
- Packing 4-cycles into Complete Multigraphs
- Packing and Covering Complete Bipartite Multidigraphs with 4-Circuits
- (Pκ,Sκ)-Multidecomposition of C□,□
- 根尖充填材對人類牙齦造纖維細胞之毒性效應
- A Linear Algorithm for the Hamiltonian Problem on Distance-Hereditary Graphs
- 曳引機攜帶作業機進行整地作業路徑自動規劃系統之研製
- Isometric Path Number of the Mycielskian of a Graph
- The Number of Minimal Vertex Covers in the Product of Stars or Paths
頁籤選單縮合
題 名 | Packing and Covering Complete Graphs with 3- and 4-paths=完全圖之3路徑及4路徑充填與覆蓋 |
---|---|
作 者 | 李鴻志; 陳薇琳; | 書刊名 | 嶺東學報 |
卷 期 | 30 2011.12[民100.12] |
頁 次 | 頁227-240 |
分類號 | 319.9 |
關鍵詞 | 完全圖; 路徑; 充填; 覆蓋; 餘圖; 填補圖; Complete graph; Path; Packing; Covering; Leave; Padding; |
語 文 | 英文(English) |
中文摘要 | k路徑是長度為k之路徑。本文探討完全圖之3路徑及4路徑充填與覆蓋問題,且得到所有最大充填與最小覆蓋。 |
英文摘要 | A k-path is a path of length k. In this paper, we completely solve the problem of finding maximum packings and minimum coverings of complete graphs with k-paths for k belong to {3,4}. |
本系統中英文摘要資訊取自各篇刊載內容。