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

2006/05/09 by Adrian Riskin, Riskin, Adrian, Georgia Weidman +1 · 1 citation
Computer Science · Materials Science · Mathematics · #Graph Labeling and Dimension Problems #Photochromic and Fluorescence Chemistry #math.CO #msc:05C78

paper · pdf · doi:10.48550/arxiv.math/0605234

arxiv created 2006/05/09 · arxiv updated 2009/12/01

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

Cited by

• A Dynamic Survey of Graph Labeling

Related

• Edge-graceful usual fan graphs
• Further Results On k-Super Graceful Graphs
• On k-Super Graceful Labeling of Graphs
• An Analysis of Graceful Coloring in a Specific r-Regular Graphs
• Graceful Labeling For bipartite graceful Graphs and related Graphs