三部完全图为H_2-cordial图的充要条件  

A Sufficient and Necessary Premise of a Complete Tripartite Graph being a H_2-cordial Graph

作　　者：堵根民[1] 

机构地区：[1]呼和浩特职业学院,呼和浩特010051

出　　处：《内蒙古大学学报（自然科学版）》2009年第2期121-124,共4页Journal of Inner Mongolia University：Natural Science Edition

基　　金：内蒙古自然科学基金资助项目(200508010108)

摘　　要：完全图、轮和二部完全图的H2-cordial问题已得到解决.借助于二部完全图边标号的矩阵表示法,构造出三部完全图边标号矩阵表示法,给出了三部完全图为H2-cordial图的充分必要条件.The problems arising from the Hw-cordiality of complete graphs,wheels and complete bipartite graphs have been solved. With the help of edge-labeling matrix representations used in complete bipartite graphs, a similar matrix representation for complete tripartite graph is constructed. Both sufficient and necessary premises of a complete tripartite graph being H2-eordial graph are obtained.

关 键 词：三部完全图 矩阵表示法 H2-cordial 

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