Skip to main content
SpringerLink
Log in

Zumkeller Cordial Labeling of Graphs

  • Conference paper
  • First Online:
Computational Intelligence, Cyber Security and Computational Models

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 412))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

    Google Scholar 

  2. 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

    Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Article  Google Scholar 

  6. Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: k-Zumkeller labeling for twig graphs. Electron. Notes Discrete Math. 48, 119–126 (2015)

    Article  Google Scholar 

  7. Cahit, I.: On cordial and 3-equitable labelling of graph. Utilitas Math. 370, 189–198 (1990)

    MathSciNet  Google Scholar 

  8. Frank Buss: Zumkeller numbers and partitions. http://groups.google.de/group/de.sci.mathematik/msg/e3fc5afcec2ae540

  9. Gallian, J.A.: A dynamic survey of graph labeling. Electronic Journal of Combinatorics. 17 (DS6) (2014)

    Google Scholar 

  10. Harary, F.: Graph theory. Addison-Wesley, Reading Mass (1972)

    Google Scholar 

  11. Peng, Y., Bhaskara Rao, K.P.S.: On Zumkeller numbers. J. Number Theory. 133(4), 1135–1155 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research and Development Centre, Bharathiar University, Coimbatore, 641 046, Tamil Nadu, India

    B. J. Murali

  2. Department of Mathematics, SIVET College, Gowrivakkam, Chennai, 600 073, Tamil Nadu, India

    K. Thirusangu & R. Madura Meenakshi

Authors
  1. B. J. Murali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Thirusangu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Madura Meenakshi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. J. Murali .

Editor information

Editors and Affiliations

  1. Applied Mathematics and Computational Sc, PSG College of Technology, Coimbatore, Tamil Nadu, India

    Muthukrishnan Senthilkumar

  2. Applied Mathematics and Computational Sc, PSG College of Technology, Coimbatore, Tamil Nadu, India

    Vijayalakshmi Ramasamy

  3. Applied Mathematics and Computational Sc, PSG College of Technology, Coimbatore, Tamil Nadu, India

    Shina Sheen

  4. Applied Mathematics and Computational Sc, PSG College of Technology, Coimbatore, Tamil Nadu, India

    C. Veeramani

  5. Department of Mathematics, Ryerson University, TORONTO, Ontario, Canada

    Anthony Bonato

  6. Fac. Science&Technology, Deakin University, Burwood, Australia

    Lynn Batten

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media Singapore

About this paper

Cite this paper

Murali, B.J., Thirusangu, K., Madura Meenakshi, R. (2016). Zumkeller Cordial Labeling of Graphs. In: Senthilkumar, M., Ramasamy, V., Sheen, S., Veeramani, C., Bonato, A., Batten, L. (eds) Computational Intelligence, Cyber Security and Computational Models. Advances in Intelligent Systems and Computing, vol 412. Springer, Singapore. https://doi.org/10.1007/978-981-10-0251-9_49

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0251-9_49

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0250-2

  • Online ISBN: 978-981-10-0251-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation