On L(2,1)-labelings of oriented graphs
classification
🧮 math.CO
keywords
orientedgraphslabelingmaximumnumberconsiderdefinitiondegree
read the original abstract
We extend a result of Griggs and Yeh about the maximum possible value of the L(2,1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the problem both in the usual definition of the oriented L(2,1)-labeling number and in some variants we introduce.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.