Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
On generalized Petersen graphs labeled with a condition at distance two
Discrete Mathematics
On Regular Graphs Optimally Labeled with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The Computer Journal
| Hi-index | 0.04 |
In this paper we deal with upper bounds on the @l-number of graphs of the form G@?K"2, where @? is one of the standard graph products-the direct, Cartesian, strong, and the lexicographic product. L(2,1)-labelling of products of graphs has been investigated by a number of authors, especially in connection with the well-known conjecture @l(G)@?(@D(G))^2, where @D(G) is the maximum degree of a graph G. Up to some degenerate cases, this conjecture was verified for the Cartesian and the lexicographic product by Shao and Yeh (2005) [13], and for the direct and the strong product by Klavzar and Spacapan (2006) [10] and by Shao et al. (2008) [12]. If one of the factors of the Cartesian or the direct product has maximum degree one, only higher upper bounds than the one following from the conjecture are currently known. We derive alternative upper bounds on the @l-number of graphs G@?K"2 for the standard products mentioned above, with the role of the maximum degree taken over by the @l-number of the graph G. Methods include lifts along graph covering projections and labellings of M-sums constructed by Georges and Mauro (2002) [2]. In most cases, our upper bounds are tighter than those currently known.