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

dc.creatorRiskin, Adrian
dc.creatorWeidman, Georgia
dc.date2006-05-09
dc.date.accessioned2026-07-07T07:14:03Z
dc.date.available2026-07-07T07:14:03Z
dc.descriptionWe 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$
dc.identifierhttps://arxiv.org/abs/math/0605234
dc.identifierhttp://arxiv.org/abs/math/0605234
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112717
dc.subjectCombinatorics
dc.subject05C78
dc.titleOn edge graceful labelings of disjoint unions of $2r$-regular edge graceful graphs
dc.typetext

Files

Collections