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

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

2007-09-03

arxiv.org/abs/0709.0290v1

Mathematics

Combinatorics

4 pages

Scientific paper

We 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$.

Affiliated with

Also associated with

No associations

Rating

$\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with $\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and $\mathbb{Z}_{2}^{2}$-cordiality of complete and complete bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-468787