Upper Bounds of Radio Number for Triangular Snake and Double Triangular Snake Graphs
A radio labeling of a simple connected graph G=V,E is a function h :V⟶N such that hx−hy≥diamG+1−dx,y, where diam G is the diameter of graph and d(x, y) is the distance between the two vertices. The radio number of G, denoted by rnG, is the minimum span of a radio labeling for G. In this study, the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/3635499 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!