Skip to main content
Top

2016 | OriginalPaper | Chapter

Zumkeller Cordial Labeling of Graphs

Authors : B. J. Murali, K. Thirusangu, R. Madura Meenakshi

Published in: Computational Intelligence, Cyber Security and Computational Models

Publisher: Springer Singapore

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

search-config
loading …

Abstract

In this paper we introduce a new graph labeling called Zumkeller cordial labeling of a graph G = (V, E). It can be defined as an injective function f: V → N such that the induced function f* : E → {0, 1} defined by f*(xy) = f(x) f(y) is 1 if f(x) f(y) is a Zumkeller number and 0 otherwise with the condition \( \left| {{\text{e}}_{\text{f}}^{*} ( 0 )- {\text{e}}_{\text{f}}^{*} ( 1 )} \right| \le 1. \) We make use of a technique of generating Zumkeller numbers and the concept of cordiality in the labeling of 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 Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Strongly multiplicative Zumkeller labeling of graphs. In: International Conference on Information and Mathematical Sciences, Elsevier, pp. 349–354 (2013) Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Strongly multiplicative Zumkeller labeling of graphs. In: International Conference on Information and Mathematical Sciences, Elsevier, pp. 349–354 (2013)
2.
go back to reference Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Strongly multiplicative Zumkeller labeling for acyclic graphs. In: Proceedings of International Conference on Emerging Trends in Science, Engineering, Business and Disaster Management (ICBDM—2014), to appear in IEEE Digital Library Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Strongly multiplicative Zumkeller labeling for acyclic graphs. In: Proceedings of International Conference on Emerging Trends in Science, Engineering, Business and Disaster Management (ICBDM—2014), to appear in IEEE Digital Library
3.
go back to reference Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Zumkeller labeling of some cycle related graphs. In: Proceedings of International Conferenc on Mathematical Sciences (ICMS—2014), Elsevier, pp. 549–553 (2014) Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Zumkeller labeling of some cycle related graphs. In: Proceedings of International Conferenc on Mathematical Sciences (ICMS—2014), Elsevier, pp. 549–553 (2014)
4.
go back to reference Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Zumkeller labeling algorithms for complete bipartite graphs and wheel graphs. Adv. Intell. Syst. Comput. Springer 324, 405–413 (2015) Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Zumkeller labeling algorithms for complete bipartite graphs and wheel graphs. Adv. Intell. Syst. Comput. Springer 324, 405–413 (2015)
5.
go back to reference Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Algorithms for Zumkeller labeling of full binary trees and square grids. Adv. Intell. Syst. Comput. Springer 325, 183–192 (2015)CrossRef Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Algorithms for Zumkeller labeling of full binary trees and square grids. Adv. Intell. Syst. Comput. Springer 325, 183–192 (2015)CrossRef
6.
go back to reference Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: k-Zumkeller labeling for twig graphs. Electron. Notes Discrete Math. 48, 119–126 (2015)CrossRef Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: k-Zumkeller labeling for twig graphs. Electron. Notes Discrete Math. 48, 119–126 (2015)CrossRef
7.
go back to reference Cahit, I.: On cordial and 3-equitable labelling of graph. Utilitas Math. 370, 189–198 (1990)MathSciNet Cahit, I.: On cordial and 3-equitable labelling of graph. Utilitas Math. 370, 189–198 (1990)MathSciNet
9.
go back to reference Gallian, J.A.: A dynamic survey of graph labeling. Electronic Journal of Combinatorics. 17 (DS6) (2014) Gallian, J.A.: A dynamic survey of graph labeling. Electronic Journal of Combinatorics. 17 (DS6) (2014)
10.
go back to reference Harary, F.: Graph theory. Addison-Wesley, Reading Mass (1972) Harary, F.: Graph theory. Addison-Wesley, Reading Mass (1972)
12.
go back to reference Rosa, A.: On certain valuations of the vertices of a graph. In: Gordan, N.B., Dunad (eds.) Theory of graphs. International Symposium, Paris, pp. 349–359 (1966) Rosa, A.: On certain valuations of the vertices of a graph. In: Gordan, N.B., Dunad (eds.) Theory of graphs. International Symposium, Paris, pp. 349–359 (1966)
Metadata
Title
Zumkeller Cordial Labeling of Graphs
Authors
B. J. Murali
K. Thirusangu
R. Madura Meenakshi
Copyright Year
2016
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-0251-9_49

Premium Partner