Some results concerning the valences of (super) edge-magic graphs
Yukio Takahashi, Francesc A. Muntaner-Batle, Rikio Ichishima

TL;DR
This paper investigates the valences of edge-magic and super edge-magic labelings in graphs, introduces generalized concepts of perfect (super) edge-magic deficiency, and analyzes these properties specifically for star graphs.
Contribution
It generalizes the concepts of (super) edge-magic deficiency using perfect (super) edge-magic graphs and studies their valences, with a focus on star graphs.
Findings
Introduces generalized definitions of (super) edge-magic deficiency.
Provides general results on valences of (super) edge-magic labelings.
Analyzes perfect (super) edge-magic deficiency for star graphs.
Abstract
A graph is called edge-magic if there exists a bijective function such that is a constant (called the valence of ) for each . If , then is called a super edge-magic graph. A stronger version of edge-magic and super edge-magic graphs appeared when the concepts of perfect edge-magic and perfect super edge-magic graphs were introduced. The super edge-magic deficiency of a graph is defined to be either the smallest nonnegative integer with the property that is super edge-magic or …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
