Hyper face-magic graphs

DOI10.20429/TAG.2026.130102MaRDI QIDQ7292865zbMATH OpenFDO

Authors Ross Belgram, Donald McGinn

Publication date 8 July 2026

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20429/TAG.2026.130102

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

Let \(G\) be a planar graph on \(n\) vertices, and let \(\mathcal{F}(G)\) be the set of all faces of \(G\) (including the exterior one) embedded in the plane, and \(V(G)\) be the set of vertices of \(G\). Let a labeling \(f: V(G)\to \{1,2,\dots,n\}\) be a bijection and \(f^\ast: \mathcal{F}(G)\to\mathbb{N}\) an induced labeling defined for every \(F\in\mathcal{F}(G)\) as the sum of labels of all vertices on the boundary of \(F\). The graph \(G\) is said to be hyper face-magic (HFM) if there exists a vertex labeling \(f\) whose induced face labeling \(f^*\) is constant.\N\NA planar graph is class-\((\alpha,\beta)\) if it has \(\alpha\) faces, each of them containing \(\beta\) vertices. It is proved that class-\((\alpha,\beta)\) graphs are HFM for all \(\alpha\geq3\) and even \(\beta\geq6\). For odd \(\beta\) it is shown that class-\((2k+1,2l+3)\) graphs are not HFM for \((k,l)\in\mathbb{N}\times\mathbb{N}\) while class-\((4,2l+3)\) graphs are HFM for \(l\in\mathbb{N}\). Finally, for class-\((\alpha,4)\) graphs, it is shown that they are not HFM for \(\alpha\in\{3,4,5\}\) but are HFM when \(\alpha\) is even and \(\alpha=2,6\), or \(\alpha\geq10\).

This page was built for publication: Hyper face-magic graphs

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