The Radio numbers of all graphs of order n and diameter n-2
<p>A radio labeling of a simple connected graph G is a function c:V(G) \to Z_+ such that for every two distinct vertices u and v of G</p><p>distance(u,v)+|c(u)-c(v)|\geq 1+ diameter(G).</p><p><br />The radio number of a graph G is the smallest integer M for which...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2013-11-01
|
| Series: | Le Matematiche |
| Subjects: | |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/1073 |