查詢結果分析
來源資料
相關文獻
- Minimum Leaves of Complete Multidigraphs by Packing Directed 4-cycles
- Packing and Covering Complete Bipartite Multidigraphs with 4-Circuits
- Packing Complete Tripartite Multidigraphs with 4-circuits
- Packing and Covering Multicrowns with 4-cycles
- Packing 4-cycles into Complete Multigraphs
- Packing and Covering Complete Graphs with 3- and 4-paths
- 根尖充填材對人類牙齦造纖維細胞之毒性效應
- 馬來膠針加熱垂直擠壓充填法
- 尿道注射膠原蛋白及其它充填劑治療應力性尿失禁
- 當代根管充填劑之研究
頁籤選單縮合
題名 | Minimum Leaves of Complete Multidigraphs by Packing Directed 4-cycles=有向4迴圈充填完全重邊有向圖之最小餘圖 |
---|---|
作者 | 姚美玉; 林正忠; 李鴻志; Yao, Mei-yu; Lin, Jenq-jong; Lee, Hung-chih; |
期刊 | 嶺東學報 |
出版日期 | 20090600 |
卷期 | 25 2009.06[民98.06] |
頁次 | 頁1-10 |
分類號 | 319.9 |
語文 | eng |
關鍵詞 | 餘圖; 充填; 完全重邊有向圖; 有向迴圈; Leave; Packing; Complete multidigraph; Directed cycle; |
中文摘要 | 設C4表有向4迴圈。完全重邊有向圖G中,C4-充填P是一個邊互斥的C4集,充填P的餘圖L是不在P中的邊子集,即L=G-P;若餘圖L的邊數最少則稱爲最小餘圖。本文得到完全重邊有向圖之C4-充填的所有最小餘圖。 |
英文摘要 | Let C4 denote a directed 4-cycle. A C4-packing P of a multidigraph G is a set of arc-disjoint C4's in G. A leave L of a C4-packing P of G is the set of arcs of G that occur in no C4 of P, that is, L=G-P. A leave L for C4-packing of G is minimum if |L| is as small as possible. In this paper the minimum leaves for packing complete multidigraphs with directed 4-cycles are completely determined. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。