Skip to content
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Home
About CP
Overview
Editorial Office
News & Announcements
Journals
Ars Combinatoria
Utilitas Mathematica
Journal of Combinatorial Mathematics and Combinatorial Computing
Congressus Numerantium
Online Journal of Analytic Combinatorics
Information
Guide for Authors
Guide for Reviewers
Guide for Editors
Editorial Workflow
Publication Ethics
Open Access Policy
Copyright Policy
Order Article Reprints
Guide for Subscribers
Guide for Conference Organizers
Special Issue Guidelines
Authors Services
CP Books
Contact Us
Search
Contents
Abstract
References
Ars Combinatoria
Volume 087
Pages: 127-138
Research article
On Variations of Graceful Labelings
M.A. Seoud
1
,
E.A.El Sakhawi
1
1
Faculty of Science, Ain Shams University Abbassia, Cairo, Egypt
Published: 30/04/2008
Download PDF
Cite
Copyright Link
License
Abstract
In this paper, we show that some families of graphs are arbitrarily graceful or almost graceful.
Citation
M.A. Seoud, E.A.El Sakhawi. On Variations of Graceful Labelings[J],
Ars Combinatoria
, Volume 087. 127-138. .