On edge graceful labelings of disjoint unions of 2r-regular edge graceful graphs

Abstract

We prove that if G is a 2r-regular edge graceful (p,q) graph with (r,kp)=1 then kG is edge graceful for odd k. We also prove that for certain specific classes of 2r-regular edge graceful graphs it is possible to drop the requirement that (r,kp)=1

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…