An Integer Linear Programming Model for Solving Radio Mean Labeling Problem
A Radio mean labeling of a connected graph G is an injective function h from the vertex set, V (G), to the set of natural numbers N such that for any two distinct vertices x and y of G, ⌈h(x)+h(y)/2⌉ ≥diam+1-d(x, y). The radio mean number of h, rmn(h), is the maximum...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9186600/ |