AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH

Lu Shengxun; Zhu Jiasheng

Volume 7 Issue 2

Mar. 1985

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 1985 > 7(2): 144-151

Lu Shengxun, Zhu Jiasheng. AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH[J]. Journal of Electronics & Information Technology, 1985, 7(2): 144-151.

Citation:

Lu Shengxun, Zhu Jiasheng. AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH[J]. Journal of Electronics & Information Technology, 1985, 7(2): 144-151.

Lu Shengxun, Zhu Jiasheng. AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH[J]. Journal of Electronics & Information Technology, 1985, 7(2): 144-151.

Citation:

Lu Shengxun, Zhu Jiasheng. AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH[J]. Journal of Electronics & Information Technology, 1985, 7(2): 144-151.

PDF( 1179 KB)

AN ALGORITHM TO FIND 1-FACTORS OF A COATES GRAPH

Received Date: 1983-07-11
Rev Recd Date: 1984-11-05
Publish Date: 1985-03-19

Abstract

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.

FullText(HTML)

References(1)

References

P. M. Lin and G. E. Alderson SNAP, A Computer Program for Generating Symbolic Network Function, Thesis, Purdue University, 1970.[2]陆生勋等,电子学通讯,4(1982), 198.[3]W. K. Chen, Applied Graph Theory, North-Holland, Amsterdam, 1976.

Relative Articles

Supplements(0)

Cited By

Proportional views