A Sufficient and Necessary Premise of a Complete Tripartite Graph being a H_2-cordial Graph
DU Gen-min · Journal of Inner Mongolia University · 2009
The problems arising from the H2-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-cordial graph are obtained.