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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Corrigendum to "Face-magic Labelings of Polygonal Graphs"

Richard M. Low, Wai Chee Shiu, Andy Liu
Theory and Applications of Graphs
Graph Labeling and Dimension Problems
article

Corrigendum to "Face-magic Labelings of Polygonal Graphs"

Richard M. Low, Wai Chee Shiu, Andy Liu
article en

Abstract

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.

Theory and Applications of GraphsVol. 12(2)
Hong Kong Baptist University (HK), San Jose State University (US)
Openalex Percentile: Top 75%
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.