Radio Labelings of Distance Graphs
R. \v{C}ada, J. Ekstein, P. Holub, O. Togni

TL;DR
This paper investigates radio labelings of distance graphs, focusing on assigning non-negative integers to vertices such that the label differences meet specific distance-dependent constraints, with implications for graph labeling theory.
Contribution
The paper introduces new results on radio labelings of distance graphs with integer vertices and adjacency defined by a set D, expanding understanding of graph labeling constraints.
Findings
Derived bounds for radio labelings of distance graphs.
Characterized optimal labelings for specific distance sets.
Extended previous results to broader classes of distance graphs.
Abstract
A radio -labeling of a connected graph is an assignment of non negative integers to the vertices of such that for any two vertices and , , where is the distance between and in . In this paper, we study radio labelings of distance graphs, i.e., graphs with the set of integers as vertex set and in which two distinct vertices are adjacent if and only if .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research
