On L(2,1)-Labelings of Oriented Graphs

被引：0

作者：

Colucci, Lucas ^{[1
]}

Gyori, Ervin

机构：

[1] Hungarian Acad Sci, Alfred Renyi Inst Math, Realtanoda U 13-15, H-1053 Budapest, Hungary

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2022年 / 42卷 / 01期

基金：

巴西圣保罗研究基金会;

关键词：

L(2; 1)-labeling; directed graphs; LABELING GRAPHS; NUMBER;

D O I：

10.7151/dmgt.2240

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：39 / 46

页数：8

共 11 条

[1] L(2,1)-labeling of oriented planar graphs
Calamoneri, T.
Sinaimeri, B.
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (12) : 1719 - 1725
[2] Calamoneri T, 2014, L H K LABELLING PROB
[3] The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography
Calamoneri, Tiziana
[J]. COMPUTER JOURNAL, 2011, 54 (08) : 1344 - 1371
[4] Chang GJ, 2003, ARS COMBINATORIA, V66, P23
[5] On the geodetic number of a graph
Chartrand, G
Harary, F
Zhang, P
[J]. NETWORKS, 2002, 39 (01) : 1 - 6
[6] LABELING GRAPHS WITH A CONDITION AT DISTANCE-2
GRIGGS, JR
YEH, RK
[J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1992, 5 (04) : 586 - 595
[7] FREQUENCY ASSIGNMENT - THEORY AND APPLICATIONS
HALE, WK
[J]. PROCEEDINGS OF THE IEEE, 1980, 68 (12) : 1497 - 1514
[8] Havet F, 2008, PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P621
[9] Path covering number and L(2,1)-labeling number of graphs
Lu, Changhong
Zhou, Qing
[J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2062 - 2074
[10] Yeh K.-C., 1990, THESIS U S CAROLINA

← 1 2 →