Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree

DOI10.1142/S1793830924500101arXiv2304.10094MaRDI QIDQ6509734FDOQ6509734

Authors: Payal Vasoya, D. D. Bantva 

Abstract: A radio labeling of a graph $G$ is a function $f:V(G)ightarrow0,1,2,ldots$ such that $|f(u)-f(v)|geqdiam(G)+1-d(u,v)$ for every pair of distinct vertices $u,v$ of $G$. The radio number of $G$, denoted by $rn(G)$, is the smallest number $k$ such that $G$ has radio labeling $f$ with max$f(v):vinV(G)=k$. In this paper, we give a lower bound for the radio number for the Cartesian product of the generalized Petersen graph and tree. We present two necessary and sufficient conditions, and three other sufficient conditions to achieve the lower bound. Using these results, we determine the radio number for the Cartesian product of the Peterson graph and stars.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: Optimal radio labelings of the Cartesian product of the generalized Peterson graph and tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6509734)