On the super edge-magicness of graphs with a specific degree sequence

Abstract

A graph G is said to be super edge-magic if there exists a bijective function f:V(G) E(G)→ \1, 2, … , V( G) + E( G) \ such that f(V (G)) =\1, 2, … , V( G) \ and f(u) + f(v) + f(uv) is a constant for each uv∈ E( G) . In this paper, we study the super edge-magicness of graphs of order n with degree sequence s:4, 2, 2, …, 2. We also investigate the super edge-magic properties of certain families of graphs. This leads us to propose some open problems.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…