Real Number Channel Assignments for Lattices

DOI10.1137/060650982zbMath1210.05143OpenAlexW2100446026MaRDI QIDQ3394984

Xiaohua Teresa Jin, Jerrold R. Griggs

Publication date: 20 August 2009

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

Full work available at URL: https://semanticscholar.org/paper/6cff5ba4e07681ceed7bcb9e8e4cb74eb812f6f0

zbMATH Keywords

channel assignmentgeneralized graph coloringplanar lattice graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (12)

Pair \(L(2, 1)\)-labelings of infinite graphs ⋮ \(L(j, k)\)-number of direct product of path and cycle ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice ⋮ Channel assignment on Cayley graphs ⋮ Graph labellings with variable weights, a survey ⋮ Labeling the \(r\)-path with a condition at distance two ⋮ \(L(j,k)\)-labelling and maximum ordering-degrees for trees ⋮ On real number labelings and graph invertibility ⋮ On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs ⋮ \(L(1, 2)\)-edge-labelings for lattices ⋮ Deriving bounds on \(L(k_1,k_2)\) labeling of triangular lattice by exploring underlined graph structures ⋮ On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice

This page was built for publication: Real Number Channel Assignments for Lattices