\mathbb{Z}_{2}^{2}-cordiality of complete and complete bipartite graphs

MaRDI QIDQ6206672zbMATH OpenFDO

Authors Adrian Riskin

Publication date 3 September 2007

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: We prove that $K_n$ is $mathbb{Z}_2^2$-cordial if and only if $1leqnleq3$ and that $K_{m,n}$ is $mathbb{Z}_2^2$ if and only if it is false that $m=n=2$.

This page was built for publication: $\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206672)