Weak harmonic labeling of graphs and multigraphs

DOI10.1016/J.DISC.2022.112816zbMATH Open1484.05179arXiv2011.14063OpenAlexW4207001054MaRDI QIDQ2113375FDOQ2113375

Authors: Pablo Bonucci, Nicolas Ariel Capitelli 

Publication date: 14 March 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: In this article we introduce the notion of weak harmonic labeling of a graph, a generalization of the concept of harmonic labeling defined recently by Benjamini et al. that allows extension to finite graphs and graphs with leaves. We present various families of examples and provide several constructions that extend a given weak harmonic labeling to larger graphs. In particular, we use finite weak models to produce new examples of (strong) harmonic labelings. As a main result, we provide a characterization of weakly labeled graphs in terms of harmonic subsets of the integers and use it to compute every such graphs of up to ten vertices. In particular, we characterize harmonically labeled graphs as defined by Benjamini et al. We further extend the definitions and main results to the case of multigraphs and total labelings.

Full work available at URL: https://arxiv.org/abs/2011.14063

Recommendations

• Harmonic labeling of graphs
• scientific article; zbMATH DE number 6160538
• A natural generalization of harmonious labelings
• scientific article; zbMATH DE number 3997849
• Even harmonious graphs

zbMATH Keywords

graph labelingharmonic functions on graphsharmonic labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Numbered complete graphs, unusual rulers, and assorted applications
• Harmonic labeling of graphs
• Graphs and geometry

Cited In (2)

• A note on harmonic subgraphs in labelled geometric graphs
• Harmonic labeling of graphs

This page was built for publication: Weak harmonic labeling of graphs and multigraphs

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