• 沒有找到結果。

組合學的應用(III)

N/A
N/A
Protected

Academic year: 2021

Share "組合學的應用(III)"

Copied!
6
0
0

加載中.... (立即查看全文)

全文

(1)

行政院國家科學委員會專題研究計畫 成果報告

組合學的應用(3/3)

計畫類別: 個別型計畫 計畫編號: NSC93-2115-M-009-002- 執行期間: 93 年 08 月 01 日至 94 年 07 月 31 日 執行單位: 國立交通大學應用數學系(所) 計畫主持人: 傅恆霖 報告類型: 完整報告 報告附件: 出席國際會議研究心得報告及發表論文 處理方式: 本計畫可公開查詢

中 華 民 國 94 年 10 月 6 日

(2)

成果報告

這是一個三年期的計劃,到今年(2005)的七月底告一段落。計劃

的主題是組合學的應用;整體而言,雖然我們仍然以組合設計與圖論

的基礎研究為主,但是,在應用方面,也有不錯的成果。

從報告所附的參考目錄可以看出來,在這三年之間我們完成的研

究工作 – 論文四十多篇,其中的半數均已被接受或刊出於國際期

刊,可以說進展相當順利;美中不足的地方是因為受

SARS 的影響,

未能按原訂計劃,前往日本與兩位學者

M. Jimbo 與 R. Fuji-Hara 共同

研究及著手“組合學應用”專書的撰寫,希望能在不久的將來完成這個

預期工作。

由於基礎研究是持續進行的工作,在此不多做說明,以下就應用

方面的工作,作一簡述:

(一) 在群式理論方面,我們利用圖分割的概念,完成了幾個工作,[4],

[31], [32], [41]。

(二) 在網路方面,我們利用著色理論及圖連通的概念,完成了[8], [14],

[22], [42], [47], [48]。

(三) 在資訊工程方面,以下的論文有直接的應用:[19], [23], [24], [33],

[34], [46]。

我們將繼續努力,以期獲得更具影響力的研究成果。

著作目錄:

1. 1. Cyclically decomposing complete graph into cycles (with S. L. Wu), Discrete Math., 282(2004), 267-273. (*)

2. Decomposing into triangles (with C. M. Fu and C. A. Rodger), Discrete Math. 284(2004), 131-136. (*)

P Kn

3. Embeddings of maximum packings of triple systems (with R. W. Su and H. Shen), Discrete Math. 284(2004), 235-245. (*)

4. A resolvable r×c grid-block packing and its application to DNA library screening (with Y. Mutoh and M. Jimbo), Taiwanese J. of Math., Vol. 8, No. 4, 713-737 (2004). (*)

(3)

5. The edge-coloring of graphs with small genus (with Hui-Lan Fan), Ars Combinatoria, 73(2004), 219-224. (*)

6. Packing the Cartesian product of two complete graphs with hexagons (with M. H. Huang), Utilitas Mathematica, 67(2005), 129-140. (*)

7. Balanced bipartite 4-cycle designs, Australasian J. of Combin., 32(2005), 3-26. 8. On 3-stage Clos network with different nonblocking requirements on two types

of calls (with Frank K. Hwang), J. Combin. Optimization, Vol. 9, no. 3, May 2005, 263-266. (*)

9. All 2-regular leaves of partial 6-cycle system (with D. Ashe and C. A. Rodger), Ars Combinatoria, 76(2005), 129-150. (*)

10. Packing λ-fold complete multipartite graphs with 4-cycles (with E. J. Billington and C. A. Rodger), Graphs and Combin., 21(2005), 169-185. (*)

11. Embeddings of maximum packings in triple systems with λ>1 (with R. W. Su and H. Shen), Discrete Math., to appear. (*)

12. Four cycle systems with leave which has maximum degree three (with C. M. Fu and C. A. Rodger), Discrete Math., to appear. (*)

13. Partition integral set into subsets with prescribed sums (with Fu-Long Chen, Yiju Wang and Jinquin Zhou), Taiwanese J. of Math., to appear. (*)

14. Maximal sets of hamiltonian cycles in K2pF(with S. L. Logan and C. A.

Rodger), Discrete Math., to appear. (*)

15. New results on harmonious trees (with Hui-Chuan Lu), Utilitas Math., to appear. (*)

16. Cyclic m-cycle systems of the complete graph (with S. L. Wu), JCD, to appear. (*)

17. Some results on 4-cycle packings, Ars Combinatoria, to appear. (*)

18. Linear 3-arboricity of the balanced complete multipartite graph (with C. H. Yen), J. Combin. Math. and Combin. Computing, to appear.

19. Multicolored parallelisms of isomorphic spanning trees (with S. Akbari, A. Alipour and Y. H. Lo), SIAM J. Discrete Math. , to appear.

20. Packing of

V

DP and DVP

with Mendelsohn triples (with Liqun Pu and H. Shen), Ars Combinatoria, to appear.

21. A note on cyclic m-cycle systems of (with Shung-Liang Wu), Graphs and Combinatorics, to appear.

( )

r m

K

22. Edge number of 3-connected diameter 3 graph (with M. C. Tsai), in preprints. 23. On Optimal pebbling of hypercubes (with K. C. Huang and Chin-Lin Shiue), in

(4)

preprints.

24. A study of total relative displacement of permutations (with K. C. Cheng, N. P. Chiang and C. K. Tzeng), in preprints.

25. Packing balanced complete multipartite graphs with pentagons (with Chin-Mei Fu and M. H. Huang), in preprints.

26. Existence of 1-rotational cycle systems of 2Kv (with S. L. Wu), in preprints. 27. Packing the Cartesian product of two complete graphs with pentagons (with M.

H. Huang), in preprints.

28. A prime labeling of the amalgamation of wheels (with Jyh-Mim Kuo), in preprints.

29. Linear 3-arboricity of and (with K. C. Huang and C. H. Yen), in preprints.

n n

K , Kn

30. Covering graphs with three odd subgraphs (with C. F. Chan), in preprints. 31. A new construction of 3 -separable matrices (with F. K. Hwang), in preprints. 32. A novel use of t-packings in constructing d-disjunct matrices (with F. K. Hwang),

in preprints.

33. Near automorphisms of cycles (with C. F. Chang and B. L. Chen), in preprints. 34. Near automorphisms of trees with small displacements (with C. F. Chang), in

preprints.

35. α-labelling number of trees (with C. L. Shiue), in preprints. 36. Existence of small prime trees (with J. M. Kuo), in preprints.

37. Maximum Cyclic 4-cycle packings of the complete multipartite graph (with S. L. Wu), in preprints.

38. Graphs with isomorphic neighbor-subgraphs (with D. A. Hoffman and Chao-Fang Li), in preprints.

39. Near relative prime number in a sequence of positive integers (with Jyh-Min Kuo), in preprints.

40. Directed -decompositions of

3

C

Dv-P and

v

DP(with Liqun Pu and H. Shen), in preprints.

41. The minimum number of e-vertex-covers among hypergraphs with e edges of given ranks (with F. H. Chang, F. K. Hwang and B. C. Lin), in preprints.

42. Wide diameters of deBruijn Graphs (with J. M. Kuo), in preprints. 43. Directed -decompositions of

4

c

Dv-P and

v

DP (with Liqun Pu and H. Shen), in preprints.

(5)

in preprints.

45. The complete solution of determining (with C. H. Yen), in preprints.

2 n)

n

(

la K

46. On the existence of multicolored isomorphic spanning trees (with Y. H. Lo), in preprints.

47. Maximal sets of Hamitonian cycles in D (with Liqun Pu and Hao Shen), in preprints.

48. Minimizing SONET ADMs in indirectional WDM rings with grooming ratio 7 (with Hui-Chuan Lu), in preprints.

(6)

Report

This is a 3-year term project which we mainly work on the

applications of Combinatorial Theory. In general, we have done a

decent job in both the theoretical part and application object. More than

40 papers are written in this period of research. Unfortunately due to the

SARS effect, we are not able to start the draft of a lecture note on Applied

Combinatorics, we’ll keep working on it in the near future.

The main results we have obtained in past three years are related to

(1) Combinatorial designs (2) Group Testings (3) Networks and (4)

Information sciences. A complete list is attached following the report.

參考文獻

相關文件

• A cell array is a data type with indexed data containers called cells, and each cell can contain any type of data. • Cell arrays commonly contain either lists of text

● Permission for files is easy to understand: read permission for read, write permission for modification, and execute permission for execute (if the file is executable). ●

• Learn strategies to answer different types of questions.. • Manage the use of time

Explore different e-learning resources and strategies that can be used to successfully develop the language skills of students with special educational needs in the..

Reading Task 6: Genre Structure and Language Features. • Now let’s look at how language features (e.g. sentence patterns) are connected to the structure

mathematical statistics, statistical methods, regression, survival data analysis, categorical data analysis, multivariate statistical methods, experimental design.

The answer has profound implications in science, philosophy and even theology... An Ultimate Question

In Paper I, we presented a comprehensive analysis that took into account the extended source surface brightness distribution, interacting galaxy lenses, and the presence of dust