查詢結果分析
來源資料
相關文獻
- Packing and Covering Multicrowns with 4-cycles
- Packing and Covering Complete Bipartite Multidigraphs with 4-Circuits
- Packing and Covering Complete Graphs with 3- and 4-paths
- Packing 4-cycles into Complete Multigraphs
- Packing Complete Tripartite Multidigraphs with 4-circuits
- Minimum Leaves of Complete Multidigraphs by Packing Directed 4-cycles
- 根尖充填材對人類牙齦造纖維細胞之毒性效應
- (Pκ,Sκ)-Multidecomposition of C□,□
- Covering λ-fold Complete Symmetric Digraphs with 4-circuits
- 光色對植物生長的效應
頁籤選單縮合
題 名 | Packing and Covering Multicrowns with 4-cycles=多重邊皇冠圖之4迴圈充填與覆蓋 |
---|---|
作 者 | 李鴻志; 姚美玉; | 書刊名 | 嶺東學報 |
卷 期 | 32 2012.12[民101.12] |
頁 次 | 頁1-17 |
分類號 | 319.9 |
關鍵詞 | 多重邊皇冠圖; 迴圈; 充填; 覆蓋; 餘圖; 填補圖; Multicrown; Cycle; Packing; Covering; Leave; Padding; |
語 文 | 英文(English) |
中文摘要 | 多重邊皇冠圖λCn,n-1是點集為{a0, a1, ..., an-1, b0, b1,...,bn-1},而邊集為{aibj (λ重邊) : i = 0,1,...,n-1, j≡i +1, i+2,...,i+n-1 (mod n)}之重邊二部圖。k迴圈是長度為k之迴圈。本文探討多重邊皇冠圖之4迴圈充填與覆蓋問題,且得到所有最大充填與最小覆蓋。 |
英文摘要 | A k-cycle is a cycle of length k. The multicrown λCn,n-1 is the multigraph with vertex set {a0, a1, ..., an-1, b0, b1, ..., bn-1} and edge set {aibj with multiplicity λ: i = 0,1,...,n-1, j≡i + 1,i + 2,...,n -1 (mod n)}. In this paper, we completely solve the problem of finding maximum packings and minimum coverings of multicrowns with 4-cycles. |
本系統中英文摘要資訊取自各篇刊載內容。