Harmonic labeling of graphs

Research output: Contribution to journalArticlepeer-review

Abstract

Which graphs admit an integer valued harmonic function which is injective and surjective onto Zd Such a function, which we call harmonic labeling, is constructed when the graph is the lattice Zd. It is shown that for any finite graph G containing at least one edge, there is no harmonic labeling of G×Z. Further discussion and open problems are presented.

Original languageEnglish
Pages (from-to)1726-1745
Number of pages20
JournalDiscrete Mathematics
Volume313
Issue number17
DOIs
StatePublished - 2013

Keywords

  • Graph
  • Harmonic
  • Labeling

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Harmonic labeling of graphs'. Together they form a unique fingerprint.

Cite this