Skip to main content
Top

2015 | OriginalPaper | Chapter

Algorithms for Zumkeller Labeling of Full Binary Trees and Square Grids

Authors : B. J. Balamurugan, K. Thirusangu, D. G. Thomas

Published in: Artificial Intelligence and Evolutionary Algorithms in Engineering Systems

Publisher: Springer India

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

search-config
loading …

Abstract

Let G = (V, E) be a graph. An injective function f: V → N is said to be a Zumkeller labeling of the graph G, if the induced function f *: E → N defined as f *(xy) = f(x) f(y) is a Zumkeller number for all xy ∈ E, x, y ∈ V. A graph G = (V, E) which admits a Zumkeller labeling is called a Zumkeller graph. In this paper, we provide algorithms for Zumkeller labeling of full binary trees and grid graphs.

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!

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!

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!

Literature
1.
go back to reference B.J. Balamurugan, K. Thirusangu, D.G. Thomas, Strongly multiplicative Zumkeller labeling of graphs. Int. Conf. Inf. Math. Sci. 349–354 (2013) B.J. Balamurugan, K. Thirusangu, D.G. Thomas, Strongly multiplicative Zumkeller labeling of graphs. Int. Conf. Inf. Math. Sci. 349–354 (2013)
2.
go back to reference G.S. Bloom, S.W. Golomb, Applications of numbered undirected graphs. IEEE 165(4), 526–570 (1977) G.S. Bloom, S.W. Golomb, Applications of numbered undirected graphs. IEEE 165(4), 526–570 (1977)
4.
go back to reference J.A. Gallian, A dynamic survey of graph labeling. Electron. J. Comb. 16 (2013) J.A. Gallian, A dynamic survey of graph labeling. Electron. J. Comb. 16 (2013)
5.
go back to reference F. Harary, Graph theory (Addison-Wesley, Reading Mass, 1972) F. Harary, Graph theory (Addison-Wesley, Reading Mass, 1972)
6.
go back to reference R. Johnsonbaugh, Discrete mathematics (Pearson Education, Asia, 2001) R. Johnsonbaugh, Discrete mathematics (Pearson Education, Asia, 2001)
8.
go back to reference A. Rosa, On certain valuations of the vertices of a graph, in Theory of Graphs. International Symposium (1966), pp. 349–359 A. Rosa, On certain valuations of the vertices of a graph, in Theory of Graphs. International Symposium (1966), pp. 349–359
9.
go back to reference A.K. Srinivasan, Practical numbers. Curr. Sci. 17, 179–180 (1948) A.K. Srinivasan, Practical numbers. Curr. Sci. 17, 179–180 (1948)
Metadata
Title
Algorithms for Zumkeller Labeling of Full Binary Trees and Square Grids
Authors
B. J. Balamurugan
K. Thirusangu
D. G. Thomas
Copyright Year
2015
Publisher
Springer India
DOI
https://doi.org/10.1007/978-81-322-2135-7_21

Premium Partner