|
|
 |
| |
|
|
|
Application of Radio Mean Labelling in Communication Networks and Fault-Tolerant Facility Graphs |
|
|
|
PP: 371-379 |
|
|
doi:10.18576/amis/200206
|
|
|
|
Author(s) |
|
|
|
Asokan Vasudevan,
Harichandra Khalingarajah,
A. Anto Cathrin Aanisha,
R. Manoharan,
S. Vijayalekshmi,
N. Raja,
|
|
|
|
Abstract |
|
|
| In a connected graph Ω, a bijective function h from vertex set W(Ω) to natural numbers N is defined as a radio mean labelling; for any distinct nodes z and w in Ω, the inequality—where the distance between nodes added to the ceiling of their height averages is greater than or equal to one plus the diameter of Ω—holds. This study investigates radio mean labelling within a theta graph, including variations formed by vertex fusion in cycle Ta and central vertex substitution, supported by examples. The present study examines its application in designing fault-tolerant systems using facility graphs. This concept aids in understanding radio mean labelling’s application in fault-tolerant systems with facility graphs, enhancing reliability and resource utilization. By analysing communication networks and facility graphs, it can be demonstrated how radio mean labelling improves system reliability and resource usage. |
|
|
|
|
|
|
|
