Analysis of Radio Contraharmonic Mean Numbers in Wheel-Based Graph Structures and Their Role in Communication Networks.

Saved in:

Bibliographic Details
Title:	Analysis of Radio Contraharmonic Mean Numbers in Wheel-Based Graph Structures and Their Role in Communication Networks.
Authors:	Paul, Rachel¹ rachel@carmelcollegemala.ac.in, Ramachandran, Pramada² pramada@stpauls.ac.in
Source:	IAENG International Journal of Applied Mathematics. Feb2026, Vol. 56 Issue 2, p676-686. 11p.
Subjects:	Routing systems, Wheels, Fault tolerance (Engineering), Computer networks, Graph connectivity, Computer network management, Graph theory
Abstract:	For a simple connected graph G, a radio contraharmonic mean labeling is a one-to-one map t from the vertex set V (G) to the set of natural numbers such that for two different vertices u, v V (G), d(u, v) + lt (u)2 + t (v)2 t (u) + t (v) m = 1+diam(G). The greatest integer that can be allocated to any v V (G) under this mapping t is the radio contraharmonic mean number of t or rchmn(t). Moreover, rchmn(G), the radio contraharmonic mean number of G, is the smallest value of rchmn(t) over all radio mean labelings t of G. This article covered the radio contraharmonic mean number of wheels as well as a few graphs associated with wheels. Wheel and related graphs can be used in a variety of network architectures because of their effectiveness in routing, resilience in fault tolerance, and ease of management. [ABSTRACT FROM AUTHOR]
	Copyright of IAENG International Journal of Applied Mathematics is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	For a simple connected graph G, a radio contraharmonic mean labeling is a one-to-one map t from the vertex set V (G) to the set of natural numbers such that for two different vertices u, v V (G), d(u, v) + lt (u)2 + t (v)2 t (u) + t (v) m = 1+diam(G). The greatest integer that can be allocated to any v V (G) under this mapping t is the radio contraharmonic mean number of t or rchmn(t). Moreover, rchmn(G), the radio contraharmonic mean number of G, is the smallest value of rchmn(t) over all radio mean labelings t of G. This article covered the radio contraharmonic mean number of wheels as well as a few graphs associated with wheels. Wheel and related graphs can be used in a variety of network architectures because of their effectiveness in routing, resilience in fault tolerance, and ease of management. [ABSTRACT FROM AUTHOR]
ISSN:	19929978