Zumkeller Labeling Algorithms for Complete Bipartite Graphs and Wheel Graphs

Balamurugan, B. J.; Thirusangu, K.; Thomas, D. G.

doi:10.1007/978-81-322-2126-5_45

Cited by 6 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…introduced the concept of Zumkeller labeling in in the year 2013 [2]. The idea of Zumkeller labeling of some simple graphs has been previously reported [3,4,5,6,11].…”

Section: Introductionmentioning

confidence: 99%

Zumkeller labeling of some path related graphs

Wilson¹,

Bebincy²

2021

Malaya J. Mat.

View full text Add to dashboard Cite

A positive integer n is said to be Zumkeller number if its positive factors can be partitioned into 2 disjoint parts with the equal sum, that is each part with sum σ (n)/2. Let G = (V (G), E(G)) be a graph. An one to one function f defined on V (G) to a subset of natural numbers is termed as Zumkeller labeling of G if the induced function) admits Zumkeller labeling is called a Zumkeller graph. In this manuscript, we investigate Zumkeller labeling for several classes of path graph.

show abstract

“…introduced the concept of Zumkeller labeling in in the year 2013 [2]. The idea of Zumkeller labeling of some simple graphs has been previously reported [3,4,5,6,11].…”

Section: Introductionmentioning

confidence: 99%

Zumkeller labeling of some path related graphs

Wilson¹,

Bebincy²

2021

Malaya J. Mat.

View full text Add to dashboard Cite

show abstract

“…The Zumkeller graphs were introduced by Balamurugan et al in [3] in the year 2014. Also in the literature [1][2][3][4][5][6],the Zumkeller graphs, Strongly multiplicative Zumkeller graphs and k-Zumkeller graphs have been introduced and investigated by Balamurugan et al In this paper, we investigate the existence of Zumkeller complete graphs and Zumkeller fan graphs.…”

Section: Introductionmentioning

confidence: 99%

Zumkeller Labeling of Complete Graphs

Balamurugan¹,

Meenakshi²

2019

IJEAT

View full text Add to dashboard Cite

Let G (V, E) be a graph with vertex set V and edge set E. The process of assigning natural numbers to the vertices of G such that the product of the numbers of adjacent vertices of G is a Zumkeller number on the edges of G is known as Zumkeller labeling of G. This can be achieved by defining an appropriate vertex function of G. In this article, we show the existence of this labeling to complete graph and fan graph.

show abstract

“…The graphs labeled with Zumkeller numbers [13], a recent development in graph labeling, are potential area of research. In [1,2,3,4,9], we have investigated two different graph labeling viz., (i) Zumkeller labeling and (ii) Strongly multiplicative Zumkeller labeling. In [5], we introduced the k-Zumkeller graphs and proved that the twig graphs are 4-Zumkeller graphs.…”

Section: Introductionmentioning

confidence: 99%