Publication Date

1-1-2022

Document Type

Article

Publication Title

Art of Discrete and Applied Mathematics

Volume

5

Issue

2

DOI

10.26493/2590-9770.1401.a6a

Abstract

Let A be a nontrivial additive abelian group and A* = A \ {0}. A graph is A-magic if there exists an edge labeling f using elements of A∗ which induces a constant vertex labeling of the graph. Such a labeling f is called an A-magic labeling and the constant value of the induced vertex labeling is called an A-magic value. In this paper, we use the Combinatorial Nullstellensatz to construct nontrivial classes of Zp-magic graphs, prime p ≥ 3. For these graphs, some lower bounds on the number of distinct Zp-magic labelings are also established.

Funding Sponsor

Illinois Wesleyan University

Keywords

Combinatorial Nullstellensatz, integer-magic graph, integer-magic labeling

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.

Department

Mathematics and Statistics

Download

Share

COinS