Balanced C{sub}4-Sixfoil Decomposition Algorithm of Complete Multi-Graphs

摘要

In graph theory, the decomposition problem of graphs is a very important topic. Various types of decompositions of many graphs can be seen in the literature of graph theory. This paper gives a balanced C{sub}4-sixfoil decomposition algorithm of the complete multi-graph λK{sub}n.