若干图联图的边联结数

THE EDGE-BINDING NUMBER OF JOIN GRAPHS OF SOME GRAPHS

本文研究了路、圈、完全图相互间经过联运算以后所得图的边联结数,得到了Lm(?)Ln,Cm(?)Cn,Lm(?)Cn,Lm(?)Kn和Cm(?)Kn的边联结数的计算公式,这里Lx,Cx,Kx分别表示有x个点的路、圈、完全图。

This paper discusses the edge-binding number of graph derived through the joint calculations betwee path, cycle and complete graph and the calculating equations of edge-binding numbers for LmLn, Cmn, LmCn, LmKn and CmKn are obtained, were Lx, Cx, Kx respectively denote the path, cycle and complete graph with x points.