Font Size:
a
A
A
Keyword [Channel assignment]
Result: 1 - 14 | Page: 1 of 1
1.
The Vertex Labeling On Graphs
2.
The Edge Span Of L(d,1)-labeling On Some Graphs
3.
L(2, 1)-labeling Of 3-regular Graphs With Perfect Matching And The Optimal Labeling Of Caterpillar
4.
The Circular Labeling Of Graphs
5.
Full-colorable Graphs And Optimal Label
6.
L(2,1)-Edge-Labeling Of Graphs
7.
L(2, 1)-Labelings Of Composite Graphs
8.
Two Kinds Of Graph Coloring Problems Related To The Channel Assignment
9.
Supereulerian Graphs And Approximal Algorithm Of Channel Assignment With Constraints
10.
L(d, 1)-Labeling Of Graphs
11.
Relaxed Distance Two Labelings Of Graphs
12.
Channel Assignment Strategy For Multiple Independent AP In Complicated Environment
13.
The Application Of The Label Of The Graph In Management
14.
Some properties of L(2,1)-coloring as related to the channel assignment problem
<<First
<Prev Next>
Last>>
Jump to
