關(guān)于Coates圖的1-因子的算法
AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH
-
摘要: 本文是作者1982年一文的繼續(xù),根據(jù)該文使用星積產(chǎn)生1-因子的定理,我們先討論了一類(lèi)特殊圖,闡明星積和求排列的關(guān)系,然后推廣到一般情況。最后,給出求Coates圖的1-因子的算法。
-
關(guān)鍵詞:
Abstract: This paper continues the study in autherls former paper (1982). According to the theorem for generating 1-factors by star product described in former paper, we consider a class of special graphs at first, for which the relations between star product and permutation are established and then the relations are extened to the general case. Finally, we give an algorithm to find the 1-factors of a Coates graph. -
P. M. Lin and G. E. Alderson SNAP, A Computer Program for Generating Symbolic Network Function, Thesis, Purdue University, 1970.[2]陸生勛等,電子學(xué)通訊,4(1982), 198.[3]W. K. Chen, Applied Graph Theory, North-Holland, Amsterdam, 1976. -
計(jì)量
- 文章訪問(wèn)數(shù): 1820
- HTML全文瀏覽量: 161
- PDF下載量: 478
- 被引次數(shù): 0
下載:
