Article Per Year (5 Year)
p-Index From 2021 - 2026
0.626
P-Index
This Author published in this journals
All Journal TELKOMNIKA (Telecommunication Computing Electronics and Control)
Kulandaivel Maruthamuthu Paramasivam
Mathematics Section, Department of Information Technology, University of Technology and Applied Sciences-Al Mussanah, Sultanate of Oman.
Computer Science & IT

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Radial radio number of chess board graph and king’s graph Kulandaivel Maruthamuthu Paramasivam; Kins Yenoke; Baby Smitha Kanaka Muralidharan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 1: February 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v20i1.19493

Abstract

A radial radio labeling ℸ of a connected graph G = (V, E) with radius rad(G) is a mapping from V (G) to N ∪ {0} satisfying |ℸ(u) − ℸ(w)|+ d(u, w) ≥ 1 + rad(G), ∀ u, v ∈ V (G). The span of a radial radio labeling ℸ, denoted by rr(ℸ) is the greatest number in the range of ℸ. The minimum span taken over all radial radio labelings ℸ of G is called the radial radio nmber of G and it is denoted by rr(G). In this article, we have investigated the upper bounds for rr(G) of chess board graphs and king’s graph.
Radial radio number of chess board graph and king’s graph Kulandaivel Maruthamuthu Paramasivam; Kins Yenoke; Baby Smitha Kanaka Muralidharan
TELKOMNIKA (Telecommunication Computing Electronics and Control) Vol 20, No 1: February 2022
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.12928/telkomnika.v20i1.19493

Abstract

A radial radio labeling ℸ of a connected graph G = (V, E) with radius rad(G) is a mapping from V (G) to N ∪ {0} satisfying |ℸ(u) − ℸ(w)|+ d(u, w) ≥ 1 + rad(G), ∀ u, v ∈ V (G). The span of a radial radio labeling ℸ, denoted by rr(ℸ) is the greatest number in the range of ℸ. The minimum span taken over all radial radio labelings ℸ of G is called the radial radio nmber of G and it is denoted by rr(G). In this article, we have investigated the upper bounds for rr(G) of chess board graphs and king’s graph.
Co-Authors Baby Smitha Kanaka Muralidharan Kins Yenoke