查詢結果分析
來源資料
相關文獻
- Packing Complete Tripartite Multidigraphs with 4-circuits
- Packing and Covering Complete Bipartite Multidigraphs with 4-Circuits
- Minimum Leaves of Complete Multidigraphs by Packing Directed 4-cycles
- Packing and Covering Multicrowns with 4-cycles
- Packing 4-cycles into Complete Multigraphs
- Packing and Covering Complete Graphs with 3- and 4-paths
- 根尖充填材對人類牙齦造纖維細胞之毒性效應
- 馬來膠針加熱垂直擠壓充填法
- 尿道注射膠原蛋白及其它充填劑治療應力性尿失禁
- 當代根管充填劑之研究
頁籤選單縮合
題名 | Packing Complete Tripartite Multidigraphs with 4-circuits=完全三部重邊有向圖之4迴圈充填之研究 |
---|---|
作者姓名(中文) | 李鴻志; 林正忠; 黃崇倫; | 書刊名 | 環球科技人文學刊 |
卷期 | 9 2009.05[民98.05] |
頁次 | 頁61-68 |
分類號 | 319.9 |
關鍵詞 | 充填; 完全三部重邊有向圖; 有向迴圈; 餘圖; 充填數; Packing; Complete tripartite multidigraph; Circuit; Leave; Packing number; |
語文 | 英文(English) |
中文摘要 | 設C(下標 k)表長度爲k之有向迴圈。重邊有向圖G中,C(下標 k)-充填是一個邊互斥的子圖集,而每個子圖皆同構於C(下標 k)。若該充填具有最多元素(C(下標 k)),則稱其爲最大C(下標 k)-充填。本文解決了完全三部重邊有向圖之最大C(下標 k)-充填問題。 |
英文摘要 | A k-circuit C(subscript k) is a directed cycle of length k. For a multidigraph G, a C(subscript k)-packing is a set of arc-disjoint subdigraphs of G each of which is isomorphic to C(subscript k) A C (subscript k)-packing is maximum if it has the maximum number of members among all packings. In this paper the problem for finding a maximum C(subscript k) -packing of complete tripartite multidigraph is solved. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。