Skip to main content
SpringerLink
Log in

Zumkeller Labeling Algorithms for Complete Bipartite Graphs and Wheel Graphs

  • Conference paper
  • First Online:
Artificial Intelligence and Evolutionary Algorithms in Engineering Systems

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

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) that admits a Zumkeller labeling is called a Zumkeller graph. In this paper, we provide polynomial time algorithms for Zumkeller labeling of complete bipartite graphs and wheel 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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. A.K. Srinivasan, Practical numbers. Curr. Sci. 17, 179–180 (1948)

    Google Scholar 

  2. Y. Peng, B. Rao, K.P.S. Rao, On Zumkeller numbers. J. Number Theor. 133(4):1135–1155

    Google Scholar 

  3. G.S. Bloom, S.W. Golomb, Applications of numbered undirected graphs. IEEE 165(4), 526–570 (1977)

    Google Scholar 

  4. Rosa, A., On certain valuations of the vertices of a graph, in ed. by N.B. Gordan, Dunad, Theory of Graphs. International Symposium. (1966) pp. 349–359

    Google Scholar 

  5. J.A. Gallian, A dynamic survey of graph labeling. Electron J Comb. 16(DS6) (2013)

    Google Scholar 

  6. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1972)

    Google Scholar 

  7. Balamurugan, B.J., Thirusangu, K., Thomas, D.G.: Strongly multiplicative Zumkeller labeling of graphs, in International Conference on Information and Mathematical Sciences (Elsevier, 2013), pp. 349–354

    Google Scholar 

  8. R. Johnsonbaugh, Discrete Mathematics. Pearson Education. Asia (2001)

    Google Scholar 

  9. Frank Buss.: Zumkeller numbers and partitions

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Agni College of Technology Thalambur, Chennai, 600130, India

    B. J. Balamurugan

  2. Department of Mathematics, SIVET College Gowrivakkam, Chennai, 600073, India

    K. Thirusangu

  3. Department of Mathematics, Madras Christian College Tambaram, Chennai, 600059, India

    D. G. Thomas

Authors
  1. B. J. Balamurugan
    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. D. G. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to B. J. Balamurugan .

Editor information

Editors and Affiliations

  1. Electrical & Electronics Engineering, Noorul Islam Centre for Higher Education, Kumaracoil, Tamil Nadu, India

    L. Padma Suresh

  2. Electrical and Electronics Engineering, SRM Engineering College, Kattankulathur, Tamil Nadu, India

    Subhransu Sekhar Dash

  3. Electrical Engineering, IIT Delhi, New Delhi, Delhi, India

    Bijaya Ketan Panigrahi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Balamurugan, B.J., Thirusangu, K., Thomas, D.G. (2015). Zumkeller Labeling Algorithms for Complete Bipartite Graphs and Wheel Graphs. In: Suresh, L., Dash, S., Panigrahi, B. (eds) Artificial Intelligence and Evolutionary Algorithms in Engineering Systems. Advances in Intelligent Systems and Computing, vol 324. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2126-5_45

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2126-5_45

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2125-8

  • Online ISBN: 978-81-322-2126-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation