Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619): Difference between revisions
From MaRDI portal
Latest revision as of 08:18, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs |
scientific article |
Statements
Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (English)
0 references
24 May 2018
0 references
channel assignment problem
0 references
\(L(j_1, j_2, \dots, j_m)\)-labeling number
0 references
\(n\)-fold \(L(j_1, j_2, \dots, j_m)\)-labeling number
0 references
\(n\)-fold \(t\)-separated consecutive \(L(j_1, j_2, \dots, j_m)\)-labeling number
0 references
complete graph
0 references
odd cycle
0 references
triangular lattice
0 references
square lattice
0 references
0 references
