EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Algorithm-based radio labeling for optimal channel assignment in outerplanar graphs

Baskar Mari, Ravi Sankar Jeyaraj

Frontiers in Computer Science · 29.04.2026 · 8

DOI: 10.3389/fcomp.2026.1748038 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Frontiers in Computer Science, online erschienen am 29.04.2026. Verfasst von Baskar Mari und 1 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Introduction

Radio labeling of graphs extends the channel assignment problem by assigning non-negative integers to vertices of a connected graph G such that | h (℘)− h (𝓆)|≥diam(ℊ)+1− d (℘, 𝓆). The objective is to minimize the span, leading to the radio number rn ( G ).

Methods

We consider a class of outerplanar graphs with vertex set { u 1 , v 1 , x 1 , …, x n , y 1 , …, y n } and a structured edge set combining path and matching edges. Analytical bounds and a constructive labeling algorithm are developed.

Results

Lower and upper bounds for rn ( G ) are derived, and the proposed algorithm yields feasible radio labelings with near-optimal span.

Discussion

The results highlight that the structure of outerplanar graphs enables efficient labeling strategies and provide a basis for extending radio labeling techniques to broader graph classes.

Zitieren

APA

Mari, B., & Jeyaraj, R. S. (2026). Algorithm-based radio labeling for optimal channel assignment in outerplanar graphs. Frontiers in Computer Science, 8. https://doi.org/10.3389/fcomp.2026.1748038

Vancouver

Mari B, Jeyaraj RS. Algorithm-based radio labeling for optimal channel assignment in outerplanar graphs. Frontiers in Computer Science. 2026;8. doi:10.3389/fcomp.2026.1748038

BibTeX
@article{Mari2026,
  author = {Mari, Baskar and Jeyaraj, Ravi Sankar},
  title = {Algorithm-based radio labeling for optimal channel assignment in outerplanar graphs},
  journal = {Frontiers in Computer Science},
  year = {2026},
  volume = {8},
  doi = {10.3389/fcomp.2026.1748038}
}
Kostenlos starten →