Harmonic Labeling of Graphs
Itai Benjamini, Van Cyr, Eviatar B. Procaccia, Ran J. Tessler

TL;DR
This paper investigates which graphs can be labeled with integers via harmonic functions that are both injective and surjective, establishing existence results for grid graphs and non-existence for certain product graphs.
Contribution
It introduces the concept of harmonic labeling of graphs, constructs such labelings for the ^2 grid, and proves non-existence for product graphs like G Z.
Findings
Harmonic labeling exists for the ^2 grid.
No harmonic labeling exists for G Z when G has at least one edge.
Provides criteria for the existence of harmonic labelings on product graphs.
Abstract
Which graphs admit an integer value harmonic function which is injective and surjective onto ? Such a function, which we call harmonic labeling, is constructed when the graph is the square grid. It is shown that for any finite graph containing at least one edge, there is no harmonic labeling of .
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 · Digital Image Processing Techniques · graph theory and CDMA systems
