Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
The Robber Strikes Back Read chapter Read first chapter

2014 | OriginalPaper | Chapter

An Algorithm for Constructing Graceful Tree from an Arbitrary Tree

Authors : G. Sethuraman, P. Ragukumar

Published in: Computational Intelligence, Cyber Security and Computational Models

Publisher: Springer India

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

A function f is called graceful labeling of a graph G with m edges if f is an injective function from V(G) to {0, 1, 2, …, m} such that if every edge uv is assigned the edge label |f(u) − f(v)|, then the resulting edge labels are distinct. A graph that admits graceful labeling is called a graceful graph. The popular graceful tree conjecture states that every tree is graceful. The graceful tree conjecture remains open over four decades. In this paper, we introduce a new method of constructing graceful trees from a given arbitrary tree by designing an exclusive algorithm.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter A New Reversible SMG Gate and Its Application for Designing Two’s Complement Adder/Subtractor with Overflow Detection Logic for Quantum Computer-Based Systems
next chapter Characterization of Semi-open Subcomplexes in Abstract Cellular Complex
Literature
1.
B.D. Acharya, S.B. Rao, S. Arumugam, Embedding and NP-Complete problems fro Graceful Graphs, Labelings of Discrete Structures and Applications, B.D. Acharya, S. Arumugam, Alexander Rosa, eds., (2008), 57–62, Narosa Publishing House, New Delhi.
2.
Bloom G.S, A chronology of the Ringel-Kotzig conjecture and the continuing quest to call all trees graceful, Ann. N.Y. Acad. Sci., 326, (1979), 35–51.
3.
J.A. Gallian, A Dynamic Survey of Graph Labeling, The Electronic Journal of Combinatorics, 19, (2012), #DS6.
4.
Golomb S.W, How to number a graph, Graph Theory and Computing R.C. Read, ed., Academic Press, New York, 1972, 23–37.
5.
Jeba Jesintha J and Sethuraman G, All arbitrary fixed generalized banana trees are graceful, Math. Comput. Sci, 5, (2011), 1, 51–62.
6.
Kotzig A, Decompositions of a complete graph into 4 k-gons (in Russian), Matematicky Casopis, 15, (1965), 229–233.
7.
Ringel G, Problem 25, in Theory of Graphs and its Applications, Proc. Symposium Smolenice, Prague, (1963) page-162.
8.
Rosa A, On certain valuations of the vertices of a graph, Theory of graphs, (International Symposium, Rome, July 1966), Gordon and Breach, N.Y. and Dunod Paris, (1967), 349–355.
9.
Sethuraman G. and Venkatesh S, Decomposition of complete graphs and complete bipartite graphs into α-labeled trees, Ars Combinatoria, 93, (2009), 371–385.
10.
Van Bussel F., Relaxed graceful labelings of trees, The Electronic Journal of Combinatorics, 9, (2002), #R4.
11.
West D.B., Introduction to Graph Theory, Prentice Hall of India, 2nd Edition, 2001.
Metadata
Title
An Algorithm for Constructing Graceful Tree from an Arbitrary Tree
Authors
G. Sethuraman
P. Ragukumar
Copyright Year
2014
Publisher
Springer India
Book
Computational Intelligence, Cyber Security and Computational Models

Print ISBN: 978-81-322-1679-7

Electronic ISBN: 978-81-322-1680-3

Copyright Year: 2014

DOI
https://doi.org/10.1007/978-81-322-1680-3_29

Premium Partner

    Image Credits