Corrigendum to "Face-magic Labelings of Polygonal Graphs"
In this note, we correct a misstatement of a theorem.1 Corrected Statement of Theorem 3.2In [1], the following theorem is stated: Theorem 3.2.Let n 2 and K be a (2n + 1)-gonal graph, where all its borders are not adjacent.Then, K is C 2n+1 -face-magic.However, it is misstated.Here is the correct statement of the theorem.Theorem 3.2.(Corrected).Let n 2 and K be a (2n + 1)-gonal graph consisting of an odd number of (2n + 1)-gons, where all its borders are not adjacent.Then, K is C 2n+1 -face-magic.proof in the original paper [1] establishes this corrected statement of Theorem 3.2.
Authors
- Richard M. Low (ORCID: https://orcid.org/0000-0003-2320-8296)
- Wai Chee Shiu (ORCID: https://orcid.org/0000-0002-2819-8480)
- Andy Liu (ORCID: https://orcid.org/0000-0003-3096-1788)
Institutions
- Hong Kong Baptist University (HK)
- San Jose State University (US)
Publication Details
- Journal
- Theory and Applications of Graphs
- Published
- 2025-01-01
- DOI
- https://doi.org/10.20429/tag.2025.120202
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00