• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login
  • Register
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter
Journal of Algorithms and Computation
Articles in Press
Current Issue
Journal Archive
Volume Volume 51 (2019)
Volume Volume 50 (2018)
Volume Volume 49 (2017)
Volume Volume 48 (2016)
Volume Volume 47 (2016)
Volume Volume 46 (2015)
Volume Volume 45 (2014)
Issue Issue 1
December 2014, Page 1-20
Volume Volume 44 (2013)
Volume Volume 43 (2009)
Volume Volume 42 (2008)
Volume Volume 41 (2007)
Minion, S., Barrientos, C. (2014). Three Graceful Operations. Journal of Algorithms and Computation, 45(1), 13-24.
Sarah Minion; Christian Barrientos. "Three Graceful Operations". Journal of Algorithms and Computation, 45, 1, 2014, 13-24.
Minion, S., Barrientos, C. (2014). 'Three Graceful Operations', Journal of Algorithms and Computation, 45(1), pp. 13-24.
Minion, S., Barrientos, C. Three Graceful Operations. Journal of Algorithms and Computation, 2014; 45(1): 13-24.

Three Graceful Operations

Article 2, Volume 45, Issue 1, December 2014, Page 13-24  XML PDF (774.49 K)
Document Type: Research Paper
Authors
Sarah Minion email ; Christian Barrientos
Department of Mathematics, Clayton State University, Morrow, Georgia 30260, USA
Abstract
A graph of size n is said to be graceful when is possible toassign distinct integers from {0, 1, . . . , n} to its verticesand {|f(u)−f(v)| : uv ∈ E(G)} consists of n integers. Inthis paper we present broader families of graceful graphs; these families are obtained via three different operations: the third power of a caterpillar, the symmetric product of G and K2 , and the disjoint union of G and Pm, where G is a special type of graceful graph named - graph. Moreover, the majority of the graceful labelings obtained here correspond to the most restrictive kind, they are -labelings. These labelings are in the core of this research area due to the fact that they can be used to create other types of graph labelings, almost independently of the nature of these labelings.
Keywords
graceful labeling; -labeling; union; third power; sym-metric product
Statistics
Article View: 1,657
PDF Download: 1,287
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

This work is licensed under a Creative Commons Attribution 4.0 International License
Journal Management System. Designed by sinaweb.