(Di)graph products, labelings and related results
Rights accessOpen Access
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs products we can establish strong relations among some of them. Moreover, due to the freedom of one of the factors, we can also obtain enumerative results that provide lower bounds on the number of nonisomorphic labelings of a particular type. In this paper, we will focus in three of the (di)graphs products that have been used in these duties: the ¿h-product of digraphs, the weak tensor product of graphs and the weak ¿h-product of graphs.
CitationLópez, S.C. (Di)graph products, labelings and related results. "Electronic notes in discrete mathematics", Juliol 2017, vol. 60, p. 55-60.