Exploring the Interplay between Radio Number, Clique Number, and Chromatic Number
Abstract
Let G(Γ,Ε) be a simple, connected and undirected graph. A radio labeling of G, ψ:Γ→{1,2,3,…} is a function satisfying the condition for any two distinct vertices u and v, d(u,v)+|ψ(u)-ψ(v)|≥1+diam(G), where d(u,v) denotes the distance between the vertices u and v and diam(G) is the diameter of the graph G. The span of a radio labeling is the maximum integer that assigns to a vertex and radio number, rn(G) is the minimum span taken overall radio labelings of G. This paper presents relationships between the radio number clique number and chromatic number of a simple connected graph.
Fields of Study & Subjects
Graph Labeling and Dimension Problems
Advanced Graph Theory Research
Graph theory and applications
Publication details
- Journal / source
- Technix International Journal for Engineering Research
- Volume
- 13
- Issue
- 2
- Publication date
- 1 January 2026
- Language
- EN