The research of (2,1)-total labelling of trees basen on Frequency Channel Assignment problem
Let T be a tree, Let DΔ(T) denote the set of integers k for which there exist two distinct vertices of maximum degree of distance at k in T. The (2,1)-total labelling number of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that n...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2015-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | http://dx.doi.org/10.1051/matecconf/20153117006 |