Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Relating path coverings to vertex labellings with a condition at distance two
Discrete Mathematics
Discrete Applied Mathematics
On the Structure of Graphs with Non-Surjective L(2,1)-Labelings
SIAM Journal on Discrete Mathematics
A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Full Color Theorems for L(2,1)-Colorings
SIAM Journal on Discrete Mathematics
Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
SIAM Journal on Discrete Mathematics
The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography
The Computer Journal
Extremal problems on consecutive L(2,1)-labelling
Discrete Applied Mathematics
An extremal problem on non-full colorable graphs
Discrete Applied Mathematics
Note: On the hole index of L(2,1)-labelings of r-regular graphs
Discrete Applied Mathematics
Path covering number and L(2,1)-labeling number of graphs
Discrete Applied Mathematics
Hi-index | 0.04 |
An L(2,1)-labeling of a graph G is a function f from the vertex set of G to the set of nonnegative integers such that |f(x)-f(y)|=2 if d(x,y)=1, and |f(x)-f(y)|=1 if d(x,y)=2, where d(x,y) denotes the distance between the pair of vertices x,y. The lambda number of G, denoted @l(G), is the minimum range of labels used over all L(2,1)-labelings of G. An L(2,1)-labeling of G which achieves the range @l(G) is referred to as a @l-labeling. A hole of an L(2,1)-labeling is an unused integer within the range of integers used. The hole index of G, denoted @r(G), is the minimum number of holes taken over all its @l-labelings. An island of a given @l-labeling of G with @r(G) holes is a maximal set of consecutive integers used by the labeling. Georges and Mauro [J.P. Georges, D.W. Mauro, On the structure of graphs with non-surjective L(2,1)-labelings, SIAM J. Discrete Math. 19 (2005) 208-223] inquired about the existence of a connected graph G with @r(G)=1 possessing two @l-labelings with different ordered sequences of island cardinalities. This paper provides an infinite family of such graphs together with their lambda numbers and hole indices. Key to our discussion is the determination of the path covering number of certain 2-sparse graphs, that is, graphs containing no pair of adjacent vertices of degree greater than 2.