Real Number Channel Assignments for Lattices
From MaRDI portal
Recommendations
Cited in
(19)- Radio channel assignment on 2-dimensional lattices
- Pair \(L(2, 1)\)-labelings of infinite graphs
- Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs
- 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
- \(L(j, k)\)-number of direct product of path and cycle
- On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
- L(1, 2)-edge-labelings for lattices
- Channel assignment on Cayley graphs
- Real Number Graph Labellings with Distance Conditions
- Real Number Labelings for Paths and Cycles
- Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
- Graph labeling and radio channel assignment
- The Channel Assignment Problem with Variable Weights
- On real number labelings and graph invertibility
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of 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
This page was built for publication: Real Number Channel Assignments for Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394984)
