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

Simple item page
dc.creatorRiskin, Adrian
dc.date2007-09-03
dc.date.accessioned2026-07-07T08:27:18Z
dc.date.available2026-07-07T08:27:18Z
dc.descriptionWe prove that $K_{n}$ is $\mathbb{Z}_{2}^{2}$-cordial if and only if $1 \leq n \leq 3$ and that $K_{m,n}$ is $\mathbb{Z}_{2}^{2}$ if and only if it is false that $m=n=2$.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/0709.0290
dc.identifierhttp://arxiv.org/abs/0709.0290
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/137229
dc.subjectCombinatorics
dc.subject05C78
dc.title$\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs
dc.typetext

Files

Collections

arXiv