20.500.12556/DKUM-66222 L(2,1)-labeling of the strong product of paths and cycles An L(2,1)-labeling of a graph G = (V, E) is a function f from the vertex set V(G) to the set of nonnegative integers such that the labels on adjacent vertices differ by at least two and the labels on vertices at distance two differ by at least one. The span of f is the difference between the largest and the smallest numbers in f(V). The ƛ-number of G, denoted by ƛ(G), is the minimum span over all L(2,1)-labelings of G. We consider the ƛ-number of Pn ☒ Cm and for n ≤ 11 the ƛ-number of Cn ☒ Cm. We determine ƛ-numbers of graphs of interest with the exception of a finite number of graphs and we improve the bounds on the ƛ-number of Cn ☒ Cm, m ≥ 24 and n ≥ 26. mathematics graph theory matematika teorija grafov označitev točk true true true Wiley Angleški jezik Slovenski jezik Znanstveno delo 2017-06-15 10:25:12 2017-06-15 10:26:01 2026-09-10 14:45:01 2021-05-15 03:34:30 2014 0 0 11 str. Letn. 2014 2014 0000-00-00 Zaloznikova Objavljeno NiDoloceno 2013-09-21 2013-10-24 2014-02-24 1537-744X 519.17 2607642 20366088 10.1155/2014/741932 1537-744X URN:SI:UM:DK:LJK4TXSD The_Scientific_World_Journal_2014_Shao,_Vesel_L(2,_1)-Labeling_of_the_Strong_Product_of_Paths_and_Cycles.pdf The_Scientific_World_Journal_2014_Shao,_Vesel_L(2,_1)-Labeling_of_the_Strong_Product_of_Paths_and_Cycles.pdf 1 680C990334B69EF5C1AFF69069A1D801 88b5881164169e883520b2542a0360437d0a26b3d7129d86fa1595ec64258f0b 3fe35008-7c0e-11eb-bb7a-00155d0001ca https://dk.um.si/Dokument.php?lang=slv&id=112589 http://www.hindawi.com/journals/tswj/2014/741932/ 1 https://dk.um.si/Dokument.php?lang=slv&id=112588 Fakulteta za naravoslovje in matematiko 0 0 0