Optimal L(h,k)-Labeling of Regular Grids
The L(h, k)-labeling is an assignment of non negative integer labels to the nodes of a graph such that 'close' nodes have labels which differ by at least k, and 'very close' nodes have labels which differ by at least h. The span of an L(h,k)-labeling is the difference between...
Main Author: | Tiziana Calamoneri |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2006-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/506 |
Similar Items
-
On the number of regular edge labelings
by: Kevin Buchin, et al.
Published: (2014-10-01) -
On the domination number of $t$-constrained de Bruijn graphs
by: Tiziana Calamoneri, et al.
Published: (2022-08-01) -
A Realistic Model to Support Rescue Operations After an Earthquake via UAVs
by: Tiziana Calamoneri, et al.
Published: (2022-01-01) -
Antimagic Labeling for Product of Regular Graphs
by: Vinothkumar Latchoumanane, et al.
Published: (2022-06-01) -
Handicap Labelings of 4-Regular Graphs
by: Petr Kovar, et al.
Published: (2017-01-01)