Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
From MaRDI portal
Publication:2471056
DOI10.1007/s10878-007-9055-7zbMath1131.05081OpenAlexW2142803310MaRDI QIDQ2471056
Xiaohua Teresa Jin, Jerrold R. Griggs
Publication date: 18 February 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9055-7
Related Items
\(L(j, k)\)-number of direct product of path and cycle, \(L(j,k)\)-labeling numbers of square of paths, Group path covering and distance two labeling of graphs, Distance two edge labelings of lattices, Circular \(L(j,k)\)-labeling number of direct product of path and cycle, On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice, Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs, Graph labellings with variable weights, a survey, Multiple \(L(j,1)\)-labeling of the triangular lattice, On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs, \(L(p,q)\)-labeling and integer tension of a graph embedded on torus, On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs, \(L(j,k)\)-labeling number of Cartesian product of path and cycle, L(1, 2)-labeling numbers on square of cycles, \(L(1, 2)\)-edge-labelings for lattices, On (s,t)-relaxed L(1,1)-labelling of trees, Distance three labellings for K n ×K 2, On circular-L(2, 1)-labellings of products of graphs, On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice, THE λ-NUMBER OF THE CARTESIAN PRODUCT OF A COMPLETE GRAPH AND A CYCLE, 2-distance colorings of some direct products of paths and cycles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(L(2,1)\)-labeling of strong products of cycles
- \(T\)-colorings of graphs: recent results and open problems
- Labeling trees with a condition at distance two.
- On \(L(d,1)\)-labelings of graphs
- \(L(2,1)\)-labeling of direct product of paths and cycles
- Dynamic channel allocation in wireless ATM networks
- Optimising channel assignments for private mobile radio networks in the UHF 2 band
- Real Number Graph Labellings with Distance Conditions
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- On Regular Graphs Optimally Labeled with a Condition at Distance Two
- Radio Labeling with Preassigned Frequencies
- Graph distance‐dependent labeling related to code assignment in computer networks
- The $L(2,1)$-Labeling Problem on Graphs
- Distributed Computing - IWDC 2004
- Theoretical Computer Science
- Labeling trees with a condition at distance two
