Real Number Graph Labellings with Distance Conditions

DOI10.1137/S0895480105446708zbMath1116.05072OpenAlexW2133847092MaRDI QIDQ3440258

Xiaohua Teresa Jin, Jerrold R. Griggs

Publication date: 22 May 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480105446708

zbMATH Keywords

channel assignmentgeneralized coloring

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (13)

The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs ⋮ On a distance-constrained graph labeling to model cooperation ⋮ Recent progress in mathematics and engineering on optimal graph labellings with distance conditions ⋮ Radio $k$-labeling of paths ⋮ Graph labellings with variable weights, a survey ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ Optimal radio labellings of complete \(m\)-ary trees ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ On real number labelings and graph invertibility ⋮ \(L(p,q)\)-labeling and integer tension of a graph embedded on torus ⋮ DISTANCE TWO LABELING ON THE SQUARE OF A CYCLE ⋮ The \(L(d,1)\)-number of powers of paths ⋮ Optimal \(L(3, 2, 1)\)-labeling of triangular lattice

This page was built for publication: Real Number Graph Labellings with Distance Conditions