Radio Mean Labeling of Digraphs

Autor: K Palani, S S Sabarina Subi
Jazyk: angličtina
Rok vydání: 2023
Předmět:
Zdroj: Ratio Mathematica, Vol 45, Iss 0 (2023)
Druh dokumentu: article
ISSN: 1592-7415
2282-8214
DOI: 10.23755/rm.v45i0.1023
Popis: Let\ D be a strong digraph and let \vec{d}(u,\ v) denote the distance between any two vertices in D. A radio mean labeling is a one-to-one mapping f from V(D) to\ N satisfying the condition \vec{d}(u,\ v) +\left\lceil\frac{f\left(u\right)+f(v)}{2}\right\rceil\geq1+\ diam(D) for every u,v\in V(D). The span of a labeling f is the maximum integer that f maps to a vertex ofD. The radio mean number of D, rmn\ (D) is the lowest span taken over all radio mean labelings of the graph D. In this paper, we analyze radio mean labeling for some newly defined digraphs.
Databáze: Directory of Open Access Journals