加载中…
A graph is called edge-magic if there is a bijective function from the set of vertices and edges to the set such that the sum for any in is constant. Such a function is called an edge-magic labelling of G and the constant is called the valence of . An edge-magic labelling with the extra property that $f(V(G))= {1,2,\ldots,|V(G)|}$ is called super edge-magic. In this paper, we establish a relationship between the valences of (super) edge-magic labelings of certain types of bipartite graphs and the existence of a particular type of decompositions of such graphs.

生成讲解博客的中文版本

生成AI智能校验的中文版本