Families of Non-Even Harmonious Graphs
preprint
OA: closed
CC-BY-4.0
Abstract
A graph of size 2q is even harmonious if its vertices can be labeled distinctly from the labels 0,1,2,...,2q-2 such that the set of edge labels obtained by adding the vertex labels modulo 2q is {2k, 2k+2,..., 2k+2q-2}. Proving that a graph is not even harmonious is not an easy task. In this paper, we give some families of non-even harmonious graphs.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00
- unpaywall
- last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0