图(K_2∨(k_n|￣))·(K_2∨(k_m|￣))的协调性  

The coordination of graph (K_2 V k_n) · (K_2 V k_m)

作　　者：路线[1] 李秀芬[1] 

机构地区：[1]吉林工程技术师范学院,吉林长春130052

出　　处：《吉林工程技术师范学院学报》2003年第6期9-11,共3页Journal of Jilin Engineering Normal University

摘　　要：对于正整数m,n∈N+(N+为正整数集合),设Kn表示n个顶点的完全图。本文给出一类图(K2Vkn)·(K2 V km),同时,论证了当m=n-1(n≥2)时,该图是协调图。In this paper,for natural numbers m, n∈ N+. Let Kn is a n - verex complete graph, kn is complementary graph of graph k'n, (K2 V kn) is join graph of K2 and kn .This paper has given one kind of graph(K2 V kn) · (K2 V km) ,proves that the one kinds graph is harmonious graph when m = n -1(n≥2).

关 键 词：图 简单图 协调图 

分 类 号：O157.5[理学—数学]