paper

A new application of the -product to -labelings

arXiv:1407.8537

Abstract

The weak tensor product was introduced by Snevily as a way to construct new graphs that admit -labelings from a pair of known -graphs. In this article, we show that this product and the application to -labelings can be generalized by considering as a second factor of the product, a family of bipartite -graphs, and fixed. The only additional restriction that we should consider is that for every , there exists and -labeling with , where are the stable sets induced by the characteristic of and they do not depend on . We also obtain analogous applications to near -labelings and bigraceful labelings.

5 pages, 8 figures