A Dynamic Survey of Graph Labeling

Joseph A. Gallian
Submitted: Sep 18, 1996; Accepted: Nov 14, 1997; Published: Feb 11, 1998
Twenty-sixth edition, December 1, 2023

Abstract
A graph labeling is an assignment of integers to the vertices or edges, or both,
subject to certain conditions. Graph labelings were first introduced in the mid-
1960s. In the intervening years over 350 graph labelings techniques have been stud-
ied in over 3600 papers. Finding out what has been done for any particular kind
of labeling and keeping up with new discoveries is difficult because of the sheer
number of papers and because many of the papers have appeared in journals that
are not widely available. In this survey, I have collected everything I could find on
graph labeling. For the convenience of the reader, the survey includes a detailed
table of contents and index. This edition has 55 additional pages and 308 new ref-
erences that are identified with the reference number and the word “new” in the
right margin.
Mathematics Subject Classifications: 05C78

Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, Minnesota

55812, U.S.A. ([email protected]).

the electronic journal of combinatorics (2023), #DS6 https://doi.org/10.37236/27

Contents
1 Introduction 5

2 Graceful and Harmonious Labelings 9

2.1 Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 Cycle-Related Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
2.3 Product Related Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
2.4 Complete Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.5 Disconnected Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
2.6 Joins of Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
2.7 Miscellaneous Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.8 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
Table 1: Summary of Graceful Results . . . . . . . . . . . . . . . . . . . . 42
Table 2: Summary of Harmonious Results . . . . . . . . . . . . . . . . . . 46

3 Variations of Graceful Labelings 50

3.1 α-labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
Table 3: Summary of Results on α-labelings . . . . . . . . . . . . . . . . . 64
3.2 γ-Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
3.3 Graceful-like Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 66
Table 4: Summary of Results on Graceful-like labelings . . . . . . . . . . . 77
3.4 k-graceful Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
3.5 Skolem-Graceful Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
3.6 Odd-Graceful Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
3.7 Cordial Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
3.8 The Friendly Index–Balance Index . . . . . . . . . . . . . . . . . . . . . . 106
3.9 k-equitable Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 111
3.10 Hamming-graceful Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . 115

4 Variations of Harmonious Labelings 116

4.1 Sequential and Strongly c-harmonious Labelings . . . . . . . . . . . . . . . 116
4.2 (k, d)-arithmetic Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
4.3 (k, d)-indexable Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
4.4 Elegant Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
4.5 Felicitous Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
4.6 Odd Harmonious and Even Harmonious Labelings . . . . . . . . . . . . . . 130

5 Magic-type Labelings 139

5.1 Magic Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
Table 5: Summary of Magic Labelings . . . . . . . . . . . . . . . . . . . . 149
5.2 Edge-magic Total and Super Edge-magic Total Labelings . . . . . . . . . . 150
Table 6: Summary of Edge-magic Total Labelings . . . . . . . . . . . . . . 173
Table 7: Summary of Super Edge-magic Labelings . . . . . . . . . . . . . . 175

the electronic journal of combinatorics (2023), #DS6 2

 5.3 Vertex-magic Total Labelings . . . . . . . . . . . . . . . . . . . . . . . . . 178
Table 8: Summary of Vertex-magic Total Labelings . . . . . . . . . . . . . 186
Table 9: Summary of Super Vertex-magic Total Labelings . . . . . . . . . 188
Table 10: Summary of Totally Magic Labelings . . . . . . . . . . . . . . . 188
5.4 H-Magic Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
5.5 Magic Labelings of Type (a, b, c) . . . . . . . . . . . . . . . . . . . . . . . . 193
Table 11: Summary of Magic Labelings of Type (a, b, c) . . . . . . . . . . . 196
5.6 Sigma Labelings/1-vertex magic labelings/Distance Magic . . . . . . . . . 197
5.7 Other Types of Magic Labelings . . . . . . . . . . . . . . . . . . . . . . . . 202

6 Antimagic-type Labelings 215

6.1 Antimagic Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 215
Table 12: Summary of Antimagic Labelings . . . . . . . . . . . . . . . . . 227
6.2 (a, d)-Antimagic Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
Table 13: Summary of (a, d)-Antimagic Labelings . . . . . . . . . . . . . . 236
6.3 (a, d)-Antimagic Total Labelings . . . . . . . . . . . . . . . . . . . . . . . . 237
Table 14: Summary of (a, d)-Vertex-Antimagic Total and Super (a, d)-
Vertex-Antimagic Total Labelings . . . . . . . . . . . . . . . . . . . 249
Table 15: Summary of (a, d)-Edge-Antimagic Total Labelings . . . . . . . . 250
Table 16: Summary of (a, d)-Edge-Antimagic Vertex Labelings . . . . . . . 251
Table 17: Summary of (a, d)-Super-Edge-Antimagic Total Labelings . . . . 252
6.4 Face Antimagic Labelings and d-antimagic Labeling of Type (1,1,1) . . . . 253
Table 18: Summary of Face Antimagic Labelings . . . . . . . . . . . . . . . 257
Table 19: Summary of d-antimagic Labelings of Type (1,1,1) . . . . . . . . 257
6.5 Product Antimagic Labelings . . . . . . . . . . . . . . . . . . . . . . . . . 258

7 Miscellaneous Labelings 260

7.1 Sum Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 260
Table 20: Summary of Sum Graph Labelings . . . . . . . . . . . . . . . . . 270
7.2 Prime and Vertex Prime Labelings . . . . . . . . . . . . . . . . . . . . . . 271
Table 21: Summary of Prime Labelings . . . . . . . . . . . . . . . . . . . . 284
Table 22: Summary of Vertex Prime Labelings . . . . . . . . . . . . . . . . 285
7.3 Edge-graceful Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
Table 23: Summary of Edge-graceful Labelings . . . . . . . . . . . . . . . . 295
7.4 Radio Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
7.5 Representations of Graphs modulo n . . . . . . . . . . . . . . . . . . . . . 302
7.6 Product and Divisor Cordial Labelings . . . . . . . . . . . . . . . . . . . . 303
7.7 Edge Product Cordial Labelings . . . . . . . . . . . . . . . . . . . . . . . . 317
7.8 Difference Cordial Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . 319
7.9 Prime Cordial Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
7.10 Other Cordial Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 328
7.11 Mean Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330
7.12 Pair Sum and Pair Mean Graphs . . . . . . . . . . . . . . . . . . . . . . . 357

the electronic journal of combinatorics (2023), #DS6 3

 7.13 Irregular Total Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 360
7.14 Geometric Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 375
7.15 Strongly Multiplicative Graphs . . . . . . . . . . . . . . . . . . . . . . . . 376
7.16 Line-graceful Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377
7.17 k-sequential Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 378
7.18 IC-colorings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 379
7.19 Minimal k-rankings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 379
7.20 Set Graceful and Set Sequential Graphs . . . . . . . . . . . . . . . . . . . . 381
7.21 Vertex Equitable Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383
7.22 Sequentially Additive Graphs . . . . . . . . . . . . . . . . . . . . . . . . . 386
7.23 Difference Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 387
7.24 Square Sum Labelings and Square Difference Labelings . . . . . . . . . . . 387
7.25 Permutation and Combination Graphs . . . . . . . . . . . . . . . . . . . . 391
7.26 Strongly *-graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 393
7.27 Triangular Sum Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 394
7.28 Divisor Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 395
7.29 Other Kinds of Labelings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 397

References 405

Index 624

the electronic journal of combinatorics (2023), #DS6 4

1 Introduction
Most graph labeling methods trace their origin to one introduced by Rosa [2648] in 1967,
or one given by Graham and Sloane [1147] in 1980. Rosa [2648] called a function f a
β-valuation of a graph G with q edges if f is an injection from the vertices of G to the set
{0, 1, . . . , q} such that, when each edge xy is assigned the label |f (x) − f (y)|, the resulting
edge labels are distinct. Golomb [1115] subsequently called such labelings graceful and
this is now the popular term. Alternatively, Buratti, Rinaldi, and Traetta [631] define
a graph G with q edges to be graceful if there is an injection f from the vertices of G
to the set {0, 1, . . . , q} such that every possible difference of the vertex labels of all the
edges is the set {1, 2, . . . , q}. Rosa introduced β-valuations as well as a number of other
labelings as tools for decomposing the complete graph into isomorphic subgraphs. In
particular, β-valuations originated as a means of attacking the conjecture of Ringel [2625]
that K2n+1 can be decomposed into 2n+1 subgraphs that are all isomorphic to a given tree
with n edges. Independently, Keevash and Staden [1688] in April 2020 and Montgomery,
Pokrovskiy, and Sudakov [2188] in January in 2021 proved Ringel’s 1963 conjecture that
any tree with n edges packs 2n + 1 times into the complete graph K2n+1 for large n.
Keevash and Staden used an embedding algorithm in which the various subroutines are
analyzed by a wide range of methods, some of which are adaptations of existing methods
whereas, Montgomery et al. used probabilistic methods. Although an unpublished result
of Erdős says that most graphs are not graceful (see [1147]), most graphs that have some
sort of regularity of structure are graceful. Sheppard [2882] has shown that there are
exactly q! gracefully labeled graphs with q edges. Rosa [2648] has identified essentially
three reasons why a graph fails to be graceful: (1) G has “too many vertices” and “not
enough edges,” (2) G “has too many edges,” and (3) G “has the wrong parity.” The
disjoint union of trees is a case where there are too many vertices for the number of edges.
An infinite class of graphs that are not graceful for the second reason is given in [562].
As an example of the third condition Rosa [2648] has shown that if every vertex has even
degree and the number of edges is congruent to 1 or 2 (mod 4) then the graph is not
graceful. In particular, the cycles C4n+1 and C4n+2 are not graceful. Knuth [1707] has
observed the more general condition that in any graceful labeling of a graph with the
number of edges congruent to 1 or 2 (mod 4), the number of vertices with an odd degree
and an odd label is always odd. Knuth [1707] proved by way a computer search that all
cubic graphs on 4, 6, 8, 10, 12, or 14 vertices, except 2K4 and 3K4 , which was proved by
Kotzig, are graceful. He conjectures that that every connected cubic graph is graceful.
It has been known since 1975 [548] that rooted symmetric trees are graceful. However,
the proofs that have been presented for this fact are either indirect inductive proofs or
algorithmic descriptive proofs showing the many separate steps involved in labelling the
vertices. In 2021 Rofa [2639] provided a graceful labeling for any given rooted symmetric
tree in the form of a direct algebraic function that algebraically maps each vertex to a
unique label. The function is a generalization of the way a path is canonically gracefully
labeled as algorithmically described by Rosa in his 1967 classic paper [2648]. Rofa uses
his function to show that a class of rooted symmetric trees that contains the class of

the electronic journal of combinatorics (2023), #DS6 5

binomial trees has weakly α-labeling (see Section 3.1) and it can provide a concise prac-
tical, computational way of producing graceful labelings of large rooted symmetric trees
in relatively minimal time.
Acharya [27] proved that every graph can be embedded as an induced subgraph of
a graceful graph and a connected graph can be embedded as an induced subgraph of a
graceful connected graph. Acharya, Rao, and Arumugam [47] proved: every triangle-
free graph can be embedded as an induced subgraph of a triangle-free graceful graph;
every planar graph can be embedded as an induced subgraph of a planar graceful graph;
and every tree can be embedded as an induced subgraph of a graceful tree. Sethuraman,
Ragukumar, and Slater [2829] show that every tree can be embedded in a graceful tree (see
also [2828]) and pose a related open problem toward settling the Graceful Tree Conjecture.
Rao and Sahoo [2593] proved that every connected graph can be embedded as an induced
subgraph of an Eulerian graceful graph thereby answering a question originally posed by
Rao and mentioned by Acharya and Arumugum in [33]. As a consequence they deduce
that the problems on deciding whether the chromatic of a graph number is less than or
equal to k, for k > 3, and deciding whether the clique number of a graph is greater than
or equal to k, for k > 3 are NP-complete even for Eulerian graceful graphs.
Sethuraman and Ragukumar [2827] provided an algorithm that generates a graceful
tree from a given arbitrary tree by adding a sequence of new pendent edges to the given
arbitrary tree thereby proving that every tree is a subtree of a graceful tree. They ask
the question: If G is a graceful tree and v is any vertex of G of degree 1, is it true that
G − v is graceful? If the answer is affirmative, then those additional edges of the input
arbitrary tree T introduced for constructing the graceful tree T by their algorithm could
be deleted in some order so that the given arbitrary tree T becomes graceful. This would
imply that the Graceful Tree Conjecture is true. These results demonstrate that there is
no forbidden subgraph characterization of these particular kinds of graceful graphs.
Harmonious graphs naturally arose in the study by Graham and Sloane [1147] of
modular versions of additive bases problems stemming from error-correcting codes. They
defined a graph G with q edges to be harmonious if there is an injection f from the
vertices of G to the group of integers modulo q such that when each edge xy is assigned
the label f (x) + f (y) (mod q), the resulting edge labels are distinct. When G is a tree,
exactly one label may be used on two vertices. They proved that almost all graphs are not
harmonious. Analogous to the “parity” necessity condition for graceful graphs, Graham
and Sloane proved that if a harmonious graph has an even number of edges q and the
degree of every vertex is divisible by 2k then q is divisible by 2k+1 . Thus, for example, a
book with seven pages (i.e., the cartesian product of the complete bipartite graph K1,7
and a path of length 1) is not harmonious. Liu and Zhang [1964] have generalized this
condition as follows: if a harmonious graph with q edges has degree sequence d1 , d2 , . . . , dp
then gcd(d1 , d2 , . . . dp , q) divides q(q − 1)/2. They have also proved that every graph is
a subgraph of a harmonious graph. More generally, Sethuraman and Elumalai [2812]
have shown that any given set of graphs G1 , G2 , . . . , Gt can be embedded in a graceful or
harmonious graph. Determining whether a graph has a harmonious labeling was shown
to be NP-complete by Auparajita, Dulawat, and Rathore in 2001 (see [1758]).

the electronic journal of combinatorics (2023), #DS6 6

 In the early 1980s Bloom and Hsu [577], [578],[551], [579], [649] extended graceful
labelings to directed graphs by defining a graceful labeling on a directed graph D(V, E)
as a one-to-one map θ from V to {0, 1, 2, . . . , |E|} such that θ(y) − θ(x) mod (|E| + 1)
is distinct for every edge xy in E. Graceful labelings of directed graphs also arose in the
characterization of finite neofields by Hsu and Keedwell [1264], [1265]. Graceful labelings
of directed graphs was the subject of Marr’s 2007 Ph.D. dissertation [2093]. In [2093]
and [2094] Marr presents results of graceful labelings of directed paths, stars, wheels, and
umbrellas. Hegde and Kumudakshi [1221] we use complete mappings to construct graceful [1221] new
labelings of two directed cycles. Siqinbate and Feng [2988] proved that the disjoint union
of three copies of a directed cycle of fixed even length is graceful.
Over the past five decades in excess of 3,000 papers have spawned a bewildering
array of graph labeling methods. Despite the unabated procession of papers, there are
few general results on graph labelings. Indeed, the papers focus on particular classes
of graphs and methods, and feature ad hoc arguments. In part because many of the
papers have appeared in journals not widely available, frequently the same classes of
graphs have been done by several authors and in some cases the same terminology is used
for different concepts. In this article, we survey what is known about numerous graph
labeling methods. The author requests that he be sent preprints and reprints as well as
corrections for inclusion in the updated versions of the survey.
Earlier surveys, restricted to one or two labeling methods, include [544], [573], [1717],
[1002], and [1004]. In [2938] Shivarajkumar, Sriraj, and Hegde provided a 2021 survey ar-
ticle graceful labeling of digraphs. The book edited by Acharya, Arumugam, and Rosa [32]
includes a variety of labeling methods that we do not discuss in this survey. In 2002 Eshghi
[902] wrote a 65 page paper providing an introduction to graceful graphs. The relationship
between graceful digraphs and a variety of algebraic structures including cyclic difference
sets, sequenceable groups, generalized complete mappings, near-complete mappings, and
neofields is discussed in [577] and [578]. The connection between graceful labelings and
perfect systems of difference sets is given in [547]. The computational complexity of the
gracefulness of a graph is not known, but the complexity of finding a harmonious labeling
of a graph is in the NP-class [176]. Labeled graphs serve as useful models for a broad range
of applications such as: coding theory, x-ray crystallography, radar, astronomy, circuit de-
sign, communication network addressing, data base management, secret sharing schemes,
cryptology, models for constraint programming over finite domains, [574], [575], [3165],
[2529], [3007], [3008], [222], [221], [288], [2995], [2131], and network passwords–see [3424],
[3132], [3423], [3425], [2723], [3207], [3583], [802] and [1101] for details. Applications of
graph labelings to encryption and decryption schemes are given in [196], [197], [121], and [196] new
[196]. According to Wang, B. Yao, and M. Yao [3427], graph labelings are used for in- [197] new
corporating redundancy in disks, designing drilling machines, creating layouts for circuit
boards, and configuring resistor networks. In [1262] Hsieh, Chen, Jiang, Liaw, and Shin [121] new
use graph labelings in algorithms for image processing schemes for monitoring air quality. [196] new
Zhang, Ye, Zhang, and Yao [3582] investigated the use of graph colorings and graph la-
belings for designing topological passwords that resist attacks. Sivakumar, Vidyanandini,
Sreedevi, Nayak, and Bhoi [2991] demonstrated how the notion of total edge irregularity

the electronic journal of combinatorics (2023), #DS6 7

strength of complete tripartite graphs can be used in anti-theft networks. Nithya and
Anitha [2281] investigated how graph labelings can be applied to the study of computer
networks.
Terms and notation not defined below follow that used in [684] and [1002].

the electronic journal of combinatorics (2023), #DS6 8

2 Graceful and Harmonious Labelings
2.1 Trees
The Ringel-Kotzig conjecture (GTC) that all trees are graceful has been the focus of many
papers. Kotzig [1268] has called the effort to prove it a “disease.” Among the trees known
to be graceful are: caterpillars [2648] (a caterpillar is a tree with the property that the
removal of its endpoints leaves a path); trees with at most 4 end-vertices [1268], [3590]
and [1546]; trees with diameter at most 5 [3590] and [1259]; symmetrical trees (i.e., a
rooted tree in which every level contains vertices of the same degree) [548], [2401], [2705];
rooted trees where the roots have odd degree and the lengths of the paths from the root
to the leaves differ by at most one and all the internal vertices have the same parity [648];
rooted trees with diameter D where every vertex has even degree except for one root and
the leaves in level bD/2c [411]; rooted trees with diameter D where every vertex has even
degree except for one root and the leaves, which are in level bD/2c [411]; rooted trees
with diameter D where every vertex has even degree except for one root, the vertices in
level bD/2c − 1, and the leaves which are in level bD/2c [411]; the graph obtained by
identifying the endpoints any number of paths of a fixed length except for the case that
the length has the form 4r + 1, r > 1 and the number of paths is of the form 4m with
m > r [2736]; regular bamboo trees [2736] (a rooted tree consisting of branches of equal
length the endpoints of which are identified with end points of stars of equal size); and
olive trees [2355], [13] (a rooted tree consisting of k branches, where the ith branch is
a path of length i); Bahls, Lake, and Wertheim [393] proved that spiders for which the
lengths of every path from the center to a leaf differ by at most one are graceful. (A
spider is a tree that has at most one vertex (called the center) of degree greater than 2.)
Jampachon, Nakprasit, and Poomsa-ard [1353] provide graceful labelings for some classes
of spiders. Panpa and Poomsa-ard [2335] showed that all spider graphs with at most four
legs of lengths greater than one admit graceful labeling. In [2163], [2164], [2328], [2165],
and [2160] Panda and Mishra and Panda, Mishra, and Dash give graceful labelings for
some new classes of trees with diameter six. Pradhan and Kumar [2482] proved that all
combs Pn K1 with perfect matching are graceful. In [3339] Varadhan and Guruswamy
give a method for combining caterpillars in a specific way such that the resulting tree is
graceful. Venkatesh1 and Balasubramanian [3374] also create graceful trees by recursively
merging caterpillars. In 2006 Wilf and Yoshimura [3476] defined an ordering on the set
of all rooted trees of a fixed number of vertices that leads to fast ranking and unranking
algorithms. As an application to the graceful tree conjecture, they showed how their
method can eliminate repeated isomorphism testing. They investigated graphs with at
most 10 vertices. In 2022 Brankovic and Reynolds [609] published a survey of various
computer search algorithms for finding graceful labeling of trees.
In 2018 Montgomery, Pokrovskiy, and Sudakov [2187] proved that every tree is almost-
harmonious. That is, every n-vertex tree has an injective Γ-harmonious labeling for any
Abelian group Γ of order n + o(n). In 2022 Gnang [1105] posted a paper with a proof on
arXiv of the Graceful Tree Conjecture. See [1106] for a newer proof by Gnang. In 2022 [1106] new
Gnang and Williams [1107] posted a proof on arXiv of the long standing Graham-Sloane

the electronic journal of combinatorics (2023), #DS6 9

conjecture that every tree admits a harmonious labeling.
Motivated by Horton’s work [1257], in 2010 Fang [914] used a deterministic back-
tracking algorithm to prove that all trees with at most 35 vertices are graceful. In 2011
Fang [915] used a hybrid algorithm that involved probabilistic backtracking, tabu search-
ing, and constraint programming satisfaction to verify that every tree with at most 31
vertices is harmonious. In [2067] Mahmoudzadeh and Eshghi treat graceful labelings of
graphs as an optimization problem and apply an algorithm based on ant colony opti-
mization metaheuristic to different classes of graphs and compare the results with those
produced by other methods. In [3144] Suparta and Agus Ariawan provide two methods
for expanding graceful trees from certain graceful trees.
Aldred, Širáň and Širáň [148] have proved that the number of graceful labelings of
Pn grows at least as fast as (5/3)n . They mention that this fact has an application to
topological graph theory. One such application was provided by Goddyn, Richter, and
and Širáň [1109] who used graceful labelings of paths on 2s + 1 vertices (s > 2) to obtain
22s cyclic oriented triangular embeddings of the complete graph on 12s + 7 vertices. The
Aldred, Širáň and Širáň bound was improved by Adamaszek [55] to (2.37)n with the aid
of a computer. Cattell [662] has shown that when finding a graceful labeling of a path
one has almost complete freedom to choose a particular label i for any given vertex v. In
particular, he shows that the only cases of Pn when this cannot be done are when n ≡ 3
(mod 4) or n ≡ 1 (mod 12), v is in the smaller of the two partite sets of vertices, and
i = (n − 1)/2. In [3413] Wang enumerated the nonequivalent graceful trees and obtained
a closed formula for the number.
Using an algorithm to run through all n! graceful graphs on n + 1 vertices Anick
[213] proves that the average number of graceful labelings grows superexponentially. He
provides a simple criterion to predict which trees have an exceptionally large number of
graceful labelings and gives evidence that trees with an exceptionally small number of
graceful labelings fall into two already known families of caterpillar graphs. Over the full
set of graceful labelings for a given n, Anick shows that the distribution of vertex degrees
associated with each label is very close to Poisson, with the exception of labels 0 and n.
A graph is said to be k-ubiquitously graceful (also called “k-rotatable”) if for every vertex
there is a graceful labeling which assigns that vertex the label k. He also gives two new
families of trees that are not k-ubiquitously graceful and includes questions suggested by
his results. Pegg [2378] proved that a p graceful graph with edges 0 to m can always be
constructed with the nearest integer to 3m + 9/4 + E vertices, where the excess E is a
0 or 1 value. For m < 51, E = 0. https://oeis.org/A326499
In [903] and [904] Eshghi and Azimi discuss a programming model for finding graceful
labelings of large graphs. The computational results show that the models can easily
solve the graceful labeling problems for large graphs. They used this method to verify
that all trees with 30, 35, or 40 vertices are graceful. Stanton and Zarnke [3051] and Koh,
Rogers, and Tan [1718], [1719], [1722] gave methods for combining graceful trees to yield
larger graceful trees. In [3447] Wang, Yang, Hsu, and Cheng generalized the constructions
of Stanton and Zarnke and Koh, Rogers, and Tan for building graceful trees from two
smaller given graceful trees. Rogers in [2642] and Koh, Tan, and Rogers in [1721] provide

the electronic journal of combinatorics (2023), #DS6 10

recursive constructions to create graceful trees. Burzio and Ferrarese [633] have shown
that the graph obtained from any graceful tree by subdividing every edge is also graceful.
and trees obtained from a graceful tree by replacing each edge with a path of fixed length
is graceful.
The binomial tree B0 consists of a single vertex. The binomial tree Bk consists of
two binomial trees Bk−1 that are linked together: the root of one is the leftmost child of
the root of the other. Ragukumara and Sethuraman [2539] proved that all binomial trees
are graceful. Sethuraman and Murugan [2824] introduced a new method of combining
graceful trees called the recursive attachment method and showed that the recursively
attached tree Ti = Ti−1 ⊕ T Ai−1 is graceful for i > 1, where the base tree T0 is a caterpillar
and the attachment tree T Ai−1 is any caterpillar. Here Ti−1 ⊕ T Ai−1 represents a tree
obtained by attaching a copy of T Ai−1 at each vertex of degree at least two in Ti−1 , for
i > 1. Sethuraman and Murugan [2826] proved that any acyclic graph can be embedded
in an unicyclic graceful graph.
It 1999 Broersma and Hoede [615] proved that an equivalent conjecture for the grace-
ful tree conjecture is that all trees containing a perfect matching are strongly graceful
(graceful with an extra condition also called an α-labeling–see Section 3.1). Wang, Yang,
Hsu, and Cheng [3447] showed that there exist infinitely many equivalent versions of the
graceful tree conjecture (GTC). They verify these equivalent conjectures of the graceful
tree conjecture are true for trees of diameter at most 7.
In 1979 Bermond [544] conjectured that lobsters are graceful (a lobster is a tree with
the property that the removal of the endpoints leaves a caterpillar). Morgan [2189] has
shown that all lobsters with perfect matchings are graceful. Krop [1761] proved that a
lobster that has a perfect matching that covers all but one vertex (i.e., that has an almost
perfect matching) is graceful. Ghosh [1096] used adjacency matrices to prove that three
classes of lobsters are graceful. Broersma and Hoede [615] proved that if T is a tree with
a perfect matching M of T such that the tree obtained from T by contracting the edges
in M is caterpillar, then T is graceful. Superdock [3147] used this result to prove that
all lobsters with a perfect matching are graceful. Mishra, Panda, and Dash [2160] gave a [2160] new
class of graceful lobsters with an even number of branches incident on the central path.
They also provided graceful labelings for a family of lobsters in which one end vertex of
the central path is attached to an even number of branches and the remaining vertices
are attached to the combinations of branches. Mishra and Panda [2158] and [2162], [2158] new
Mishra and Bhattacharjee [2157], and Mishra, Rout, and Nayak [2161] gave graceful [2157] new
labeling for a general classes of lobsters by applying component moving transformations
on graceful caterpillars. More result results on graceful labeling of lobsters are in [2159]. [2161] new
Sathiamoorthy, Natarajan, Ayyaswamy, and Janakiraman [2722] proved that the splitting [2159] new
graph of a caterpillar is graceful.
A Skolem sequence of order n is a sequence s1 , s2 , . . . , s2n of 2n terms such that, for each
k ∈ {1, 2, . . . , n}, there exist exactly two subscripts i(k) and j(k) with si(k) = sj(k) = k
and |i(k) − j(k)| = k. A Skolem sequence of order n exists if and only if n ≡ 0 or 1
(mod 4). Morgan [2190] has used Skolem sequences to construct classes of graceful trees.
Morgan and Rees [2191] used Skolem and Hooked-Skolem sequences to generate classes

the electronic journal of combinatorics (2023), #DS6 11

of graceful lobsters.
Mishra and Panigrahi [2166] and [2333] found classes of graceful lobsters of diameter
at least five. They show other classes of lobsters are graceful in [2167] and [2168]. In
[2815] Sethuraman and Jesintha [2815] explores how one can generate graceful lobsters
from a graceful caterpillar while in [2819] and [2820] (see also [1379]) they show how to
generate graceful trees from a graceful star. More special cases of Bermond’s conjecture
have been done by Ng [2283], by Wang, Jin, Lu, and Zhang [3414], Abhyanker [12], and
by Mishra and Panigrahi [2167]. Renuka, Balaganesan, Selvaraju [2614] proved spider
trees with n legs of even length t and odd n > 3 and lobsters for which each vertex of the
spine is adjacent to a path of length two are harmonious.
A tree in which all internal vertices have degrees r +1 except one, is called an full r-ary
tree. A uniform full r-ary tree is a full r-ary tree in which all of its leaves are at the same
level. A tree that is obtained from copies of a full r-ary tree by identifying each vertex
of a fixed path with each vertex of the tree of degree r is called a uniform-distant tree.
Suparta and Ariawan [3145] gave methods for constructing graceful classes of caterpillars,
lobsters, and uniform trees that generalize results in [2205] and [3236].
Barrientos [441] defines a y-tree as a graph obtained from a path by appending an
edge to a vertex of a path adjacent to an end point. He proves that graphs obtained from
a y-tree T by replacing every edge ei of T by a copy of K2,ni in such a way that the ends
of ei are merged with the two independent vertices of K2,ni after removing the edge ei
from T are graceful.
Sethuraman and Jesintha [2816], [2817], and [2818] (see also [1379]) proved that rooted
trees obtained by identifying one of the end vertices adjacent to either of the penultimate
vertices of any number of caterpillars having equal diameter at least 3 with the property
that all the degrees of internal vertices of all such caterpillars have the same parity are
graceful. They also proved that rooted trees obtained by identifying either of the penul-
timate vertices of any number of caterpillars having equal diameter at least 3 with the
property that all the degrees of internal vertices of all such caterpillars have the same
parity are graceful. In [2816], [2817], and [2818] (see also [1379] and [1410]) Sethuraman
and Jesintha prove that all rooted trees in which every level contains pendent vertices and
the degrees of the internal vertices in the same level are equal are graceful. Kanetkar and
Sane [1628] show that trees formed by identifying one end vertex of each of six or fewer
paths whose lengths determine an arithmetic progression are graceful.
Chen, Lü, and Yeh [692] define a firecracker as a graph obtained from the concatenation
of stars by linking one leaf from each. They also define a banana tree as a graph obtained
by connecting a vertex v to one leaf of each of any number of stars (v is not in any of the
stars). They proved that firecrackers are graceful and conjecture that banana trees are
graceful. Before Sethuraman and Jesintha [2822] and [2821] (see also [1379]) proved that
all banana trees and extended banana trees (graphs obtained by joining a vertex to one
leaf of each of any number of stars by a path of length of at least two) are graceful, various
kinds of bananas trees had been shown to be graceful by Bhat-Nayak and Deshmukh [557],
by Murugan and Arumugam [2223], [2221] and by Vilfred [3386].
Consider a set of caterpillars, having equal diameter, in which one of the penultimate

the electronic journal of combinatorics (2023), #DS6 12

vertices has arbitrary degree and all the other internal vertices including the other penul-
timate vertex is of fixed even degree. Jesintha and Sethuraman [1412] call the rooted tree
obtained by merging an end-vertex adjacent to the penultimate vertex of fixed even degree
of each caterpillar a arbitrarily fixed generalized banana tree. They prove that such trees
are graceful. From this it follows that all banana trees are graceful and all generalized
banana trees are graceful.
Jeba Jesintha and Subashini proved the following graphs are graceful: the cycle of
vertex switching of even cycles [1394]; the path union of vertex switching of odd cycles
[1397]; the path union of vertex switching of even cycles in increasing order [1398]; the
path union of vertex switching of odd cycles [1396] the path union of vertex switching of
even cycles [1401]; the path union of Pm θSn [1403]; and the cycle of Pm θSn [1403]. In
[1400] they prove the cycle of caterpillar trees is graceful and as a corollary the cycle of
comb graphs, cycle of paths, and the cycle of coconut trees are graceful. In [1402] Jeba
Jasintha and Subashini proved the two quadrilateral snake graphs connected by a path,
two alternate quadrilateral snake graphs connected by a path, two double quadrilateral
snake graphs connected by a path, and two alternate double quadrilateral snake graphs
connected by a path, In [1409] Jeba Jesintha, Subashini, and Rashmi Beula proved that
the series of isomorphic copies of a star graph connected between two ladder graphs is
graceful. In [1406] Jeba Jesintha, Subashini, and Sabu proved that two complete bipartite
graphs connected by an arbitrary path of length n is graceful. In [1407] Jeba Jesintha and
Subashini, and Sabu proved that the twig diamond graph with pendant edges is graceful.
In [1408] Jeba Jesintha, Subashini, and Siddiqa proved that the path union of vertex
switching of odd and even cycle graphs alternately is graceful.
Zhenbin [3593] has shown that graphs obtained by starting with any number of identi-
cal stars, appending an edge to exactly one edge from each star, then joining the vertices
at which the appended edges were attached to a new vertex are graceful. He also shows
that graphs obtained by starting with any two stars, appending an edge to exactly one
edge from each star, then joining the vertices at which the appended edges were attached
to a new vertex are graceful. In [1411] Jesintha and Sethuraman use a method of Hrnciar
and Havier [1259] to generate graceful trees from a graceful star with n edges.
Aldred and McKay [147] used a computer to show that all trees with at most 26
vertices are harmonious. That caterpillars are harmonious was by Graham and Sloane
[1147]. Ramya and Meenakshi [2590] gave graceful labelings, harmonious labelings, and [2590] new
Zumkeller labelings for ladders, banana trees, and firecrackers.
Vietri [3379] utilized a counting technique that generalizes Rosa’s graceful parity con-
dition and provides constraints on possible graceful labelings of certain classes of trees.
He expresses doubts about the validity of the graceful tree conjecture. In [3362] Vietri
introduced a family of homogeneous polynomials (mod 2), one for every degree, having as
many variables as the number of vertices, for any fixed graph; a so-called “graceful poly-
nomial” that vanishes (mod 2) that may be useful for proving that the related graph is
non-graceful (the degree 1 case dates back to Rosa’s work). He also classified graphs whose
graceful polynomials vanish for degrees 2 to 4, thereby obtaining some new non-graceful
graphs.

the electronic journal of combinatorics (2023), #DS6 13

 Using a variant of the Matrix Tree Theorem, Whitty [3468] specifies an n × n matrix
of indeterminates whose determinant is a multivariate polynomial that enumerates the
gracefully labeled (n + 1)-vertex trees. Whitty also gives a bijection between gracefully
labelled graphs and rook placements on a chessboard on the Möbius strip. In [631] Buratti,
Rinaldi, and Traetta use graceful labelings of paths to obtain a result on Hamiltonian cycle
systems.
In [611] Brankovic and Wanless describe applications of graceful and graceful-like
labelings of trees to several well known combinatorial problems including complete graph
decompositions, the Oberwolfach problem, which asks for a decomposition of Kv into
copies of a given 2-regular graph F , and coloring. They also discuss the connection
between α-labeling of paths and near transversals in Latin squares and show how spectral
graph theory might be used to further the progress on the graceful tree conjecture.
In [632] Burgess, Danziger, and Traetta show that Oberwolfach problem has a solution
whenever F has a sufficiently large cycle which meets a given lower bound and, in addition,
has a single-flip automorphism, which is an involutory automorphism acting as a reflection
on exactly one of the cycles of F . Furthermore, they prove analogous results for the
minimum covering version and the maximum packing version of the problem. They also
show a similar result when the edges of Kv have multiplicity 2, but in this case they do not
require that F be single-flip. Their approach allows them to explicitly construct solutions
to the Oberwolfach Problem with well-behaved automorphisms. Their constructions use
graceful labelings of 2-regular graphs with a vertex removed. They show that this class
of graphs is graceful as long as the length of the path-component is sufficiently large. A
much better lower bound on the length of the path is given for an α-labeling of such
graphs to exist.
Arkut, Arkut, and Basak [221] and Basak [288] proposed an efficient method for
managing Internet Protocol (IP) networks by using graceful labelings of the nodes of the
spanning caterpillars of the autonomous sub-networks to assign labels to the links in the
sub-networks. Graceful labelings of trees also have been used in multi protocol label
switching (MPLS) routing platforms in IP networks [222], [2992], and [3207].
Despite the efforts of many, the graceful tree conjecture remains open even for trees
with maximum degree 3. More specialized results about trees are contained in [544], [573],
[1717], [2040], [642], [1545], and [2649]. In [865] Edwards and Howard provide a lengthy
survey paper on graceful trees. Robeva [2637] provides an extensive survey of graceful la-
belings of trees in her 2011 undergraduate honors thesis at Stanford University. Alfalayleh,
Brankovic, Giggins, and Islam [149] survey results related to the graceful tree conjecture
as of 2004 and conclude with five open problems. Alfalayleh et al.: say “The faith in
the [graceful tree] conjecture is so strong that if a tree without a graceful labeling were
indeed found, then it probably would not be considered a tree.” In his Princeton Univer-
sity senior thesis Superdock [3147] provided an extensive survey of results and techniques
about graceful trees. He also obtained some specialized results about the gracefulness of
spiders and trees with diameter 6. Arumugam and Bagga [240] discuss computational
efforts aimed at verifying the graceful tree conjecture and we survey recent results on
generating all graceful labelings of certain families of unicyclic graphs. Sethuraman and

the electronic journal of combinatorics (2023), #DS6 14

Murugan [2825] construct a graceful unicyclic graph G from every graceful tree T with
V (G) = V (T ) such that the graceful labeling of G is derived from the graceful labeling of
T.

2.2 Cycle-Related Graphs

Cycle-related graphs have been a major focus of attention. Rosa [2648] showed that the
n-cycle Cn is graceful if and only if n ≡ 0 or 3 (mod 4) and Graham and Sloane [1147]
proved that Cn is harmonious if and only if n is odd. Wheels Wn = Cn + K1 are both
graceful and harmonious – [984], [1255], and [1147]. As a consequence we have that a
subgraph of a graceful (harmonious) graph need not be graceful (harmonious). The n-
cone (also called the n-point suspension; the 1-cone is the wheel; the 2-cone is also called
a double cone of Cm ) Cm + Kn has been shown to be graceful when m ≡ 0 or 3 (mod 12)
by Bhat-Nayak and Selvam [563]. When n is even and m is 2, 6 or 10 (mod 12) Cm + Kn
violates the parity condition for a graceful graph. Bhat-Nayak and Selvam [563] also prove
that the following cones are graceful: C4 + Kn , C5 + K2 , C7 + Kn , C9 + K2 , C11 + Kn and
C19 + Kn . The helm Hn is the graph obtained from a wheel by attaching a pendent edge
at each vertex of the n-cycle. Helms have been shown to be graceful [266] and harmonious
[1104], [1976], [1977] (see also [1964], [2802], [1962], [793], and [2555]). Koh, Rogers, Teo,
and Yap, [1720] define a web graph as one obtained by joining the pendent points of a
helm to form a cycle and then adding a single pendent edge to each vertex of this outer
cycle. They asked whether such graphs are graceful. This was proved by Kang, Liang,
Gao, and Yang [1633]. Yang has extended the notion of a web by iterating the process
of adding pendent points and joining them to form a cycle and then adding pendent
points to the new cycle. In his notation, W (2, n) is the web graph whereas W (t, n) is the
generalized web with t n-cycles. Yang has shown that W (3, n) and W (4, n) are graceful
(see [1633]), Abhyanker and Bhat-Nayak [14] have done W (5, n) and Abhyanker [12] has
done W (t, 5) for 5 6 t 6 13. Gnanajothi [1104] has shown that webs with odd cycles are
harmonious. Seoud and Youssef [2802] define a closed helm as the graph obtained from a
helm by joining each pendent vertex to form a cycle and a flower as the graph obtained
from a helm by joining each pendent vertex to the central vertex of the helm. They prove
that closed helms and flowers are harmonious when the cycles are odd. A gear graph is
obtained from the wheel Wn by adding a vertex between every pair of adjacent vertices of
the n-cycle. In 1984 Ma and Feng [2043] proved all gears are graceful while in a Master’s
thesis in 2006 Chen [693] proved all gears are harmonious. Liu [1976] has shown that
if two or more vertices are inserted between every pair of vertices of the n-cycle of the
wheel Wn , the resulting graph is graceful. Sethuraman and Sankar [2832] showed that the
subdivisions of wheels are graceful for even values of n > 4. Liu [1974] has also proved
that the graph obtained from a gear graph by attaching one or more pendent edges to
each vertex between the vertices of the n-cycle is graceful. Pradhan and Kumar [2482]
proved that graphs obtained by adding a pendent edge to each pendent vertex of hairy
cycle Cn K1 are graceful if n ≡ 0 (mod 4m). They further provide a rule for determining
the missing numbers in the graceful labeling of Cn K1 and of the graph obtained by
adding pendent edges to each pendent vertex of Cn K1 .

the electronic journal of combinatorics (2023), #DS6 15

 Kumar, Mishra, Kumar, and Kumar [1774] proved the following: Cn K1 , n ≡ 0
(mod 4) possesses an alpha labeling with the missing number 3n/2; the one-point union
of C4n and a path possesses an alpha labeling with an identifiable missing number; and
the graphs obtained by joining two isomorphic copies of the one-ponit union of C4n and
a path posses an alpha labeling with identifiable missing numbers.
Abhyanker [12] has investigated various unicyclic (that is, graphs with exactly one
cycle) graphs. He proved that the unicyclic graphs obtained by identifying one vertex of
C4 with the root of the olive tree with 2n branches and identifying an adjacent vertex on
C4 with the end point of the path P2n−2 are graceful. He showed that if one attaches any
number of pendent edges to these unicyclic graphs at the vertex of C4 that is adjacent
to the root of the olive tree but not adjacent to the end vertex of the attached path, the
resulting graphs are graceful. Likewise, Abhyanker proved that the graph obtained by
deleting the branch of length 1 from an olive tree with 2n branches and identifying the
root of the edge deleted tree with a vertex of a cycle of the form C2n+3 is graceful. He
also has a number of results similar to these. In [391] Bagga, Fotso, Max, and Arumugam
investigate the gracefulness of unicyclic graphs with pendent caterpillars at two adjacent
vertices of the cycle, and pendent edges at some other vertices of the cycle. In [392] Bagga
and Heinz give some properties of graceful graphs obtained by adding pendent edges at
each vertex of a cycle.
Delorme, Maheo, Thuillier, Koh, and Teo [798] and Ma and Feng [2042] showed that
any cycle with a chord is graceful. This was first conjectured by Bodendiek, Schumacher,
and Wegner [583], who proved various special cases. In 1985 Koh and Yap [1723] gener-
alized this by defining a cycle with a Pk -chord to be a cycle with the path Pk joining two
nonconsecutive vertices of the cycle. They proved that these graphs are graceful when
k = 3 and conjectured that all cycles with a Pk -chord are graceful. This was proved for
k > 4 by Punnim and Pabhapote in 1987 [2531]. Chen [698] obtained the same result
except for three cases which were then handled by Gao [1165]. In 2005, Sethuraman and
Elumalai [2811] defined a cycle with parallel Pk -chords as a graph obtained from a cycle
Cn (n > 6) with consecutive vertices v0 , v1 , . . . , vn−1 by adding disjoint paths Pk , (k > 3),
between each pair of nonadjacent vertices v1 , vn−1 , v2 , vn−2 , . . . , vi , vn−i , . . . , vα , vβ where
α = bn/2c − 1 and β = bn/2c + 2 if n is odd or β = bn/2c + 1 if n is even. They
proved that every cycle Cn (n > 6) with parallel Pk -chords is graceful for k = 3, 4, 6, 8,
and 10 and they conjecture that the cycle Cn with parallel Pk -chords is graceful for all
even k. Xu [3500] proved that all cycles with a chord are harmonious except for C6 in the
case where the distance in C6 between the endpoints of the chord is 2. The gracefulness
of cycles with consecutive chords has also been investigated. For 3 6 p 6 n − r, let
Cn (p, r) denote the n-cycle with consecutive vertices v1 , v2 , . . . , vn to which the r chords
v1 vp , v1 vp+1 , . . . , v1 vp+r−1 have been added. Koh and Punnin [1712] and Koh, Rogers, Teo,
and Yap [1720] have handled the cases r = 2, 3 and n − 3 where n is the length of the
cycle. Goh and Lim [1114] then proved that all remaining cases are graceful. Moreover,
Ma [2045] has shown that Cn (p, n − p) is graceful when p ≡ 0, 3 (mod 4) and Ma, Liu, and
Liu [2046] have proved other special cases of these graphs are graceful. Ma also proved
that if one adds to the graph Cn (3, n − 3) any number ki of paths of length 2 from the

the electronic journal of combinatorics (2023), #DS6 16

vertex v1 to the vertex vi for i = 2, . . . , n, the resulting graph is graceful. Chen [698] has
shown that apart from four exceptional cases, a graph consisting of three independent
paths joining two vertices of a cycle is graceful. This generalizes the result that a cycle
plus a chord is graceful. Liu [1973] has shown that the n-cycle with consecutive vertices
v1 , v2 , . . . , vn to which the chords v1 vk and v1 vk+2 (2 6 k 6 n−3) are adjoined is graceful.
For the cycle Cn : v1 v2 v3 · · · vn v1 and a cycle with a Ck − chord Venkatesh and Sivagu-
runathan [3376] let Cn,k denote the graph obtained from Cn by adding a cycle Ck of
length k between the non-adjacent vertices v2 and vn . They define a cycle with a par-
allel Ck chord as the graph obtained from a cycle Cn by adding a cycle Ck of length k
between every pair of non-adjacent vertices (v2 , vn ), (v3 , vn−1 ), . . . , (va , vb ) where a = b n2 c,
b = b n2 c + 2, if n is even and a = b n2 c, b = b n2 c + 3, if n is odd. They proved that Cn,4 and
+ +
Cn,4 are graceful for n ≡ 0 (mod 4) and that Cn,6 is graceful for all odd values of n > 5.
In [794] Deb and Limaye use the notation C(n, k) to denote the cycle Cn with k cords
sharing a common endpoint called the apex. For certain choices of n and k there is a
unique C(n, k) graph and for other choices there is more than one graph possible. They
call these shell-type graphs and they call the unique graph C(n, n − 3) a shell. Notice
that the shell C(n, n − 3) is the same as the fan Fn−1 = Pn−1 + K1 . Kuppusamy and
Guruswamy [1781] show that the subdivision graph of K2,n is graceful for n > 1 and the
subdivision graph of the shell graph C(n, n − 3) is graceful for n > 4. Deb and Limaye
define a multiple shell to be a collection of edge disjoint shells that have their apex in
common. A multiple shell is said to be balanced with width w if every shell has order w or
every shell has order w or w + 1. Deb and Limaye [794] have conjectured that all multiple
shells are harmonious, and have shown that the conjecture is true for the balanced double
shells and balanced triple shells. Yang, Xu, Xi, and Qiao [3527] proved the conjecture is
true for balanced quadruple shells. Liang [1938] proved the conjecture is true when each
shell has the same order and the number of copies is odd.
Jeba Jesintha and Hilda [1383] define a shell-butterfly graph as a one-point union of
two shells of any order with two pendent edges at the apex. They prove that certain
shell-butterfly graphs are harmonious. Jeba Jesintha and Ezhilarasi Hilda [1381] proved
butterfly graphs with one shell of order m and the other shell of order 2m + 1 are graceful
and double shells in which each shell has the same order are graceful. Jeba Jesintha and
Hilda [1387] define a bow graph as a double shell in which each shell has arbitrary order.
A bow graph in which each shell has the same order is called a uniform bow graph. They
prove that all uniform bow graphs are graceful. Jeba Jesintha and Ezhilarasi Hilda [1389]
proved that shell-butterfly graphs are graceful. In [1382] Jeba Jesintha and Hilda prove [1382] new
k copies of C(4, 1) ∪ K2 , and shellflowers (a double shell with shells of order m and 2m)
are graceful.
In [1196] Haviar and Kurtulı́k defined a k-enriched fan graph kFn , for integers k, n > 2,
as the graph of size (k + 1)n − 1 obtained by connecting n copies of the star Sk of order
k to the fan Fn such that one vertex of each copy of the star Sk is identified with one
vertex of the main path Pn of Fn . They proved that k-enriched fan graphs are graceful
and and provided characterizations of the k-enriched fan graphs among all simple graphs
via Sheppard’s labeling sequences [2882] introduced in the 1970s, as well as via labeling

the electronic journal of combinatorics (2023), #DS6 17

relations and graph chessboards.
Sethuraman and Dhavamani [2808] use H(n, t) to denote the graph obtained from the
cycle Cn by adding t consecutive chords incident with a common vertex. If the common
vertex is u and v is adjacent to u, then for k > 1, n > 4, and 1 6 t 6 n − 3, Sethuraman
and Dhavamani denote by G(n, t, k) the graph obtained by taking the union of k copies
of H(n, k) with the edge uv identified. They conjecture that every graph G(n, t, k) is
graceful. They prove the conjecture for the case that t = n − 3.
For i = 1, 2, . . . , n let vi,1 , vi,2 , . . . , vi,2m be the successive vertices of n copies of C2m .
Sekar [2736] defines a chain of cycles C2m,n as the graph obtained by identifying vi,m and
vi+1,m for i = 1, 2, . . . , n − 1. He proves that C6,2k and C8,n are graceful for all k and all
n. Barrientos [444] proved that all C8,n , C12,n , and C6,2k are graceful.
Truszczyński [3229] studied unicyclic graphs and proved several classes of such graphs
are graceful. Among these are what he calls dragons. A dragon is formed by joining
the end point of a path to a cycle (Koh, et al. [1720] call these tadpoles; Kim and Park
[1699] call them kites). This work led Truszczyński to conjecture that all unicyclic graphs
except Cn , where n ≡ 1 or 2 (mod 4), are graceful. Guo [1164] has shown that dragons
are graceful when the length of the cycle is congruent to 1 or 2 (mod 4). Lu [2039] uses
+(m,t)
Cn to denote the graph obtained by identifying one vertex of Cn with one endpoint of
+(1,t)
m paths each of length t. He proves that Cn (a tadpole) is not harmonious when a + t
+(2m,t)
is odd and Cn is harmonious when n = 3 and when n = 2k + 1 and t = k − 1, k + 1
or 2k − 1. In his Master’s thesis, Doma [843] investigates the gracefulness of various
unicyclic graphs where the cycle has up to 9 vertices. Guruswamy and Varadhan [1166]
proved that any acyclic graph can be embedded in a unicyclic graceful graph. Because
of the immense diversity of unicyclic graphs, a proof of Truszczyński’s conjecture seems
out of reach in the near future. In [569] Biatch, Baggab, and Arumugam gave a survey
of results related to Truszczynski’s conjecture on the gracefulness ofunicyclic graphs and
provided a new class of graceful unicyclic graphs.
Cycles that share a common edge or a vertex have received some attention. Murugan
and Arumugan [2222] have shown that books with n pentagonal pages (i.e., n copies of
C5 with an edge in common) are graceful when n is even and not graceful when n is odd.
Lu [2039] uses Θ(Cm )n to denote the graph made from n copies of Cm that share an edge
(an n page book with m-polygonal pages). He proves Θ(C2m+1 )2n+1 is harmonious for all
m and n; Θ(C4m+2 )4n+1 and Θ(C4m )4n+3 are not harmonious for all m and n. Xu [3500]
proved that Θ(Cm )2 is harmonious except when m = 3. (Θ(Cm )2 is isomorphic to C2(m−1)
with a chord “in the middle.”) Nurvazly and Sugeng [2315] proved that Θ(C3 )n graphs
(n copies of C3 that share an edge) have graceful labelings.
A kayak paddle KP (k, m, l) is the graph obtained by joining Ck and Cm by a path of
length l. Litersky [1960] proves that kayak paddles have graceful labelings in the following
cases: k ≡ 0 mod 4, m ≡ 0 or 3 (mod 4); k ≡ m ≡ 2 (mod 4) for k > 3; and k ≡ 1 (mod
4), m ≡ 3 (mod 4). She conjectures that KP (4k + 4, 4m + 2, l) with 2k < m is graceful
when l 6 2m if l is even and when l 6 2m + 1 if l is odd; and KP (10, 10, l) is graceful
when l > 12. The cases are open: KP (4k, 4m + 1, l); KP (4k, 4m + 2, l); KP (4k + 1, 4m +
1, l); KP (4k + 1, 4m + 2, l); KP (4k + 2, 4m + 3, l); KP (4k + 3, 4m + 3, l).

the electronic journal of combinatorics (2023), #DS6 18

 (t)
Let Cn denote the one-point union of t cycles of length n. Bermond, Brouwer, and
(t)
Germa [545] and Bermond, Kotzig, and Turgeon [547]) proved that C3 (that is, the
friendship graph or Dutch t-windmill) is graceful if and only if t ≡ 0 or 1 (mod 4) while
(t)
Graham and Sloane [1147] proved C3 is harmonious if and only if t 6≡ 2 (mod 4). Koh,
(t)
Rogers, Lee, and Toh [1713] conjecture that Cn is graceful if and only if nt ≡ 0 or 3
(mod 4). Yang and Lin [3519] have proved the conjecture for the case n = 5 and Yang,
Xu, Xi, Li, and Haque [3525] did the case n = 7. Xu, Yang, Li and Xi [3504] did the
case n = 11. Xu, Yang, Han and Li [3505] did the case n = 13. Qian [2537] verifies this
conjecture for the case that t = 2 and n is even and Yang, Xu, Xi, and Li [3526] did the
case n = 9. Figueroa-Centeno, Ichishima, and Muntaner-Batle [935] have shown that if
m ≡ 0 (mod 4) then the one-point union of 2, 3, or 4 copies of Cm admits a special kind
of graceful labeling called an α-labeling (see Section 3.1) and if m ≡ 2 (mod 4), then the
one-point union of 2 or 4 copies of Cm admits an α-labeling. Bodendiek, Schumacher,
and Wegner [589] proved that the one-point union of any two cycles is graceful when the
number of edges is congruent to 0 or 3 modulo 4. (The other cases violate the necessary
(t)
parity condition.) Shee [2874] has proved that C4 is graceful for all t. Seoud and Youssef
[2800] have shown that the one-point union of a triangle and Cn is harmonious if and
only if n ≡ 1 (mod 4) and that if the one-point union of two cycles is harmonious then
the number of edges is divisible by 4. The question of whether this latter condition is
sufficient is open. Figueroa-Centeno, Ichishima, and Muntaner-Batle [935] have shown
that if G is harmonious then the one-point union of an odd number of copies of G using
the vertex labeled 0 as the shared point is harmonious. Sethuraman and Selvaraju [2838]
have shown that for a variety of choices of points, the one-point union of any number of
non-isomorphic complete bipartite graphs is graceful. They raise the question of whether
this is true for all choices of the common point.
Another class of cycle-related graphs is that of triangular cacti. The block-cutpoint
graph of a graph G is a bipartite graph in which one partite set consists of the cut vertices
of G, and the other has a vertex bi for each block Bi of G. A block of a graph is a maximal
connected subgraph that has no cut-vertex. A triangular cactus is a connected graph all of
whose blocks are triangles. A triangular snake is a triangular cactus whose block-cutpoint-
graph is a path (a triangular snake is obtained from a path v1 , v2 , . . . , vn by joining vi and
vi+1 to a new vertex wi for i = 1, 2, . . . , n − 1). Rosa [2650] conjectured that all triangular
cacti with t ≡ 0 or 1 (mod 4) blocks are graceful. (The cases where t ≡ 2 or 3 (mod 4)
fail to be graceful because of the parity condition.) Moulton [2200] proved the conjecture
for all triangular snakes. A proof of the general case (i.e., all triangular cacti) seems
hopelessly difficult. Liu and Zhang [1964] gave an incorrect proof that triangular snakes
with an odd number of triangles are harmonious whereas triangular snakes with n ≡ 2
(mod 4) triangles are not harmonious. Xu [3501] subsequently proved that triangular
snakes are harmonious if and only if the number of triangles is not congruent to 2 (mod
4).
A double triangular snake consists of two triangular snakes that have a common path.
That is, a double triangular snake is obtained from a path v1 , v2 , . . . , vn by joining vi and
vi+1 to a new vertex wi for i = 1, 2, . . . , n − 1 and to a new vertex ui for i = 1, 2, . . . , n − 1.

the electronic journal of combinatorics (2023), #DS6 19

Xi, Yang, and Wang [3496] proved that all double triangular snakes are harmonious.
A hexagonal snake is obtained from a path p1 , p2 , p3 , . . . , pn by joining pi , pi+1 to
new vertices xi and yi respectively and adding edges xi yi for i = 1, 2, . . . , n − 1 and
replacing every edge with a 6-cycle; an alternate hexagonal snake is obtained from a path
p1 , p2 , p3 , . . . , pn by joining pi , pi+1 to new vertices xi and yi (alternatively) and adding
edges xi yi , where 1 6 i 6 n − 1 for even n and 1 6 i 6 n − 2 for odd n and replacing each
alternate edge with a 6-cycle; a double hexagonal snake is obtained from two hexagonal
snakes that share the n-path; a double alternate hexagonal snake is obtained from two
alternative hexagonal snakes that share the n-path. Pattabiraman, Loganathan, and
Rao [2373] provided graceful labelings for double hexagonal snakes, alternate hexagonal
snakes, odd alternate hexagonal snakes, and double alternate hexagonal snakes.
For any graph G defining G-snake analogous to triangular snakes, Sekar [2736] has
shown that Cn -snakes are graceful when n ≡ 0 (mod 4) (n > 8) and when n ≡ 2 (mod
4) and the number of Cn is even. Gnanajothi [1104, pp. 31-34] had earlier shown that
quadrilateral snakes are graceful. Grace [1145] has proved that K4 -snakes are harmonious.
Rosa [2650] has also considered analogously defined quadrilateral and pentagonal cacti
and examined small cases. Yu, Lee, and Chin [3562] showed that Q2 -snakes and Q3 -snakes
are graceful and, when the number of blocks is greater than 1, Q2 -snakes, Q3 -snakes and
Q4 -snakes are harmonious.
Barrientos [435] calls a graph a kCn -snake if it is a connected graph with k blocks whose
block-cutpoint graph is a path and each of the k blocks is isomorphic to Cn . (When n > 3
and k > 3 there is more than one kCn -snake.) If a kCn -snake where the path of minimum
length that contains all the cut-vertices of the graph has the property that the distance
between any two consecutive cut-vertices is bn/2c it is called linear. Barrientos proves
that kC4 -snakes are graceful and that the linear kC6 -snakes are graceful when k is even.
He further proves that kC8 -snakes and kC12 -snakes are graceful in the cases where the
distances between consecutive vertices of the path of minimum length that contains all
the cut-vertices of the graph are all even and that certain cases of kC4n -snakes and kC5n -
snakes are graceful (depending on the distances between consecutive vertices of the path
of minimum length that contains all the cut-vertices of the graph).
Badr [270] defines a linear cyclic snake (m, k)Cn as the graph consisting of k copies of
Cn with two non-adjecent vertices in common where every copy has m copies of Cn and
the block-cutpoint graph is not a path. He proves that the linear cyclic snakes (m, k)C4 -
snake and (m, k)C8 -snake are graceful and conjectures that all the linear cyclic snakes
(m, k)Cn -snakes are graceful for n ≡ 0 (mod 4 ) or n ≡ 3 (mod 4).
Several people have studied cycles with pendent edges attached. Frucht [984] proved
that any cycle with a pendent edge attached at each vertex (i.e., a crown) is graceful (see
also [1266]). If G has order n, the corona of G with H, G H is the graph obtained by
taking one copy of G and n copies of H and joining the ith vertex of G with an edge to
every vertex in the ith copy of H. Barrientos [440] also proved: if G is a graceful graph
of order m and size m − 1, then G nK1 and G + nK1 are graceful; if G is a graceful
graph of order p and size q with q > p, then (G ∪ (q + 1 − p)K1 ) nK1 is graceful; and
all unicyclic graphs, other than a cycle, for which the deletion of any edge from the cycle

the electronic journal of combinatorics (2023), #DS6 20

results in a caterpillar are graceful.
For a given cycle Cn with n ≡ 0 or 3 (mod 4) and a family of trees T = {T1 , T2 , . . . , Tn },
let ui and vi , 1 6 i 6 n, be fixed vertices of Cn and Ti , respectively. Figueroa-Centeno,
Ichishima, Muntaner-Batle, and Oshima [940] provide two construction methods that gen-
erate a graceful labeling of the unicyclic graphs obtained from Cn and T by amalgamating
them at each ui and vi . Their results encompass all previously known results for unicyclic
graphs whose cycle length is 0 or 3 (mod 4) and considerably extend the known classes
of graceful unicyclic graphs. Khairunnisa and Sugeng [1683] let A(m,n) denote the graph
obtained from Cm by connecting each two adjacent vertices with Pn+1 . They prove that
the graphs A(3,1) Kr are graceful.
In [437] Barrientos proved that helms (graphs obtained from a wheel by attaching one
pendent edge to each vertex) are graceful. Grace [1144] showed that an odd cycle with one
or more pendent edges at each vertex is harmonious and conjectured that C2n K1 , an
even cycle with one pendent edge attached at each vertex, is harmonious. This conjecture
has been proved by Liu and Zhang [1963], Liu [1976] and [1977], Hegde [1212], Huang
[1269], and Bu [618]. Sekar [2736] has shown that the graph Cm Pn obtained by attaching
the path Pn to each vertex of Cm is graceful. For any n > 3 and any t with 1 6 t 6 n,
let Cn+t denote the class of graphs formed by adding a single pendent edge to t vertices
of a cycle of length n. Ropp [2647] proved that for every n and t the class Cn+t contains
a graceful graph. Gallian and Ropp [1002] conjectured that for all n and t, all members
of Cn+t are graceful. This was proved by Qian [2537] and by Kang, Liang, Gao, and Yang
[1633]. Of course, such graphs are just a special case of the aforementioned conjecture
of Truszczyński that all unicyclic graphs except Cn for n ≡ 1 or 2 (mod 4) are graceful.
Sekar [2736] proved that the graph obtained by identifying an endpoint of a star with a
vertex of a cycle is graceful. Lu [2039] shows that the graph obtained by identifying each
vertex of an odd cycle with a vertex disjoint copy of C2m+1 is harmonious if and only if
m is odd. Sudha [3069] proved that the graphs obtained by starting with two or more
copies of C4 and identifying a vertex of the ith copy with a vertex of the i + 1th copy and
the graphs obtained by starting with two or more cycles (not necessarily of the same size)
and identifying an edge from the ith copy with an edge of the i + 1th copy are graceful.
Sudha and Kanniga [3076] proved that the graphs obtained by identifying any vertex of
Cm with any vertex of degree 1 of Sn where n = d(m − 1)/2e are graceful.
For a given cycle Cn with n ≡ 0 or 3 (mod 4) and a family of trees T = {T1 , T2 , . . . , Tn },
let ui and vi , 1 6 i 6 n, be fixed vertices of Cn and Ti , respectively. Figueroa-Centeno,
Ichishima, Muntaner-Batle, and Oshima [940] provide two construction methods that gen-
erate a graceful labeling of the unicyclic graphs obtained from Cn and T by amalgamating
them at each ui and vi . Their results encompass all previously known results for unicyclic
graphs whose cycle length is 0 or 3 (mod 4) and considerably extend the known classes
of graceful unicyclic graphs.
Solairaju and Chithra [3017] defined three classes of graphs obtained by connecting
copies of C4 in various ways. Denote the four consecutive vertices of ith copy of C4
by vi,1 , vi,2 , vi,3 , vi4 . They show that the graphs obtained by identifying vi,4 with vi+1,2
for i = 1, 2, . . . , n − 1 is graceful; the graphs obtained by joining vi,4 with vi+1,2 for

the electronic journal of combinatorics (2023), #DS6 21

i = 1, 2, . . . , n − 1 by an edge is graceful; and the graphs obtained by joining vi,4 with
vi+1,2 for i = 1, 2, . . . , n − 1 with a path of length 2 is graceful.
Venkatesh [3370] showed that for positive integers m and n divisible by 4 the graphs
obtained by appending a copy of Cn to each vertex of Cm by identifying one vertex of Cn
with each vertex of Cm is graceful.

2.3 Product Related Graphs

Graphs that are cartesian products and related graphs have been the subject of many
papers. That planar grids, Pm × Pn (m, n > 2), (many authors use G  H to denote
the Cartesian product of G and H) are graceful was proved by Acharya and Gill [41] in
1978. In 1980, Maheo [2053] clarified the complicated-appearing construction of Acharya
and Gill for Pm × P2 that readily extends to all grids. Liu, T. Zou, Y. Lu [1971] proved
Pm × Pn × P2 is graceful. In 1980 Graham and Sloane [1147] proved ladders, Pm × P2 ,
are harmonious when m > 2 and in 1992 Jungreis and Reid [1561] showed that the grids
Pm × Pn are harmonious when (m, n) 6= (2, 2). A few people have looked at graphs
obtained from planar grids in various ways. Kathiresan [1662] has shown that graphs
obtained from ladders by subdividing each step exactly once are graceful and that graphs
obtained by appending an edge to each vertex of a ladder are graceful [1664]. Barrientos
and Minion [469] showed that a graceful graph is obtained when every step of a ladder is
subdivided an even number of times. In addition, they proved that when each edge of a
ladder is subdivided exactly once, the resulting graph is graceful.
Acharya [30] has shown that certain subgraphs of grid graphs are graceful. Lee [1836]
defines a Mongolian tent as a graph obtained from Pm × Pn , n odd, by adding one extra
vertex above the grid and joining every other vertex of the top row of Pm × Pn to the
new vertex. A Mongolian village is a graph formed by successively amalgamating copies
of Mongolian tents with the same number of rows so that adjacent tents share a column.
Lee proves that Mongolian tents and villages are graceful. A Young tableau is a subgraph
of Pm × Pn obtained by retaining the first two rows of Pm × Pn and deleting vertices from
the right hand end of other rows in such a way that the lengths of the successive rows
form a nonincreasing sequence. Lee and Ng [1860] have proved that all Young tableaus
are graceful. Lee [1836] has also defined a variation of Mongolian tents by adding an extra
vertex above the top row of a Young tableau and joining every other vertex of that row
to the extra vertex. He proves these graphs are graceful. In [3016] and [3015] Solairaju
and Arockiasamy prove that various families of subgraphs of grids Pm × Pn are graceful.
Sudha [3069] proved that certain subgraphs of the grid Pn × P2 are graceful. Knuth [1707]
proved that Kn × P3 is graceful if and only if n 6 6.
Prisms are graphs of the form Cm × Pn . These can be viewed as grids on cylinders.
In 1977 Bodendiek, Schumacher, and Wegner [583] proved that Cm × P2 is graceful when
m ≡ 0 (mod 4). According to the survey by Bermond [544], Gangopadhyay and Rao
Hebbare did the case that m is even about the same time. In a 1979 paper, Frucht [984]
stated without proof that he had done all Cm × P2 . A complete proof of all cases and
some related results were given by Frucht and Gallian [987] in 1988.

the electronic journal of combinatorics (2023), #DS6 22

 In 1992 Jungreis and Reid [1561] proved that all Cm × Pn are graceful when m and
n are even or when m ≡ 0 (mod 4). They also investigated the existence of a stronger
form of graceful labeling called an α-labeling (see Section 3.1) for graphs of the form
Pm × Pn , Cm × Pn , and Cm × Cn (see also [1004]).
Yang and Wang have shown that the prisms C4n+2 × P4m+3 [3524], Cn × P2 [3522], and
C6 × Pm (m > 2) (see [3524]) are graceful. Singh [2970] proved that C3 × Pn is graceful for
all n. In their 1980 paper Graham and Sloane [1147] proved that Cm × Pn is harmonious
when n is odd and they used a computer to show C4 × P2 , the cube, is not harmonious. In
1992 Gallian, Prout, and Winters [1007] proved that Cm × P2 is harmonious when m 6= 4.
In 1992, Jungreis and Reid [1561] showed that C4 × Pn is harmonious when n > 3. Huang
and Skiena [1271] have shown that Cm × Pn is graceful for all n when m is even and for
all n with 3 6 n 6 12 when m is odd. Abhyanker [12] proved that the graphs obtained
from C2m+1 × P5 by adding a pendent edge to each vertex of an outer cycle is graceful.
Torus grids are graphs of the form Cm × Cn (m > 2, n > 2). Very little success has
been achieved with these graphs. The graceful parity condition is violated for Cm × Cn
when m and n are odd and the harmonious parity condition [1147, Theorem 11] is violated
for Cm × Cn when m ≡ 1, 2, 3 (mod 4) and n is odd. In 1992 Jungreis and Reid [1561]
showed that Cm × Cn is graceful when m ≡ 0 (mod 4) and n is even. A complete solution
to both the graceful and harmonious torus grid problems will most likely involve a large
number of cases.
There has been some work done on prism-related graphs. Gallian, Prout, and Winters
[1007] proved that all prisms Cm × P2 with a single vertex deleted or single edge deleted
are graceful and harmonious. The Möbius ladder Mn is the graph obtained from the
ladder Pn × P2 by joining the opposite end points of the two copies of Pn . In 1989 Gallian
[1001] showed that all Möbius ladders are graceful and all but M3 are harmonious. Ropp
[2647] has examined two classes of prisms with pendent edges attached. He proved that
all Cm × P2 with a single pendent edge at each vertex are graceful and all Cm × P2 with a
single pendent edge at each vertex of one of the cycles are graceful. Ramachandran and
Sekar [2572] proved that the graph obtained from the ladder Ln (Pn × P2 ) by identifying
one vertex of Ln with any vertex of the star Sm other than the center of Sm is graceful.
Another class of cartesian products that has been studied is that of books and
“stacked” books. The book Bm is the graph Sm × P2 where Sm is the star with m edges.
In 1980 Maheo [2053] proved that the books of the form B2m are graceful and conjectured
that the books B4m+1 were also graceful. (The books B4m+3 do not satisfy the graceful
parity condition.) This conjecture was verified by Delorme [797] in 1980. Maheo [2053]
also proved that Ln × P2 and B2m × P2 are graceful. Both Grace [1143] and Reid (see
[1006]) have given harmonious labelings for B2m . The books B4m+3 do not satisfy the
harmonious parity condition [1147, Theorem 11]. Gallian and Jungreis [1006] conjectured
that the books B4m+1 are harmonious. Gnanajothi [1104] has verified this conjecture by
showing B4m+1 has an even stronger form of labeling – see Section 4.1. Liang [1934] also
proved the conjecture. In 1988 Gallian and Jungreis [1006] defined a stacked book as a
graph of the form Sm × Pn . They proved that the stacked books of the form S2m × Pn are
graceful and posed the case S2m+1 ×Pn as an open question. The n-cube K2 ×K2 ×· · ·×K2

the electronic journal of combinatorics (2023), #DS6 23

(n copies) was shown to be graceful by Kotzig [1741]—see also [2053]. Although Graham
and Sloane [1147] used a computer in 1980 to show that the 3-cube is not harmonious
(see also [2334]), Ichishima and Oshima [1310] proved that the n-cube Qn has a stronger
form of harmonious labeling called an α-labeling (see Section 3.1) for n > 4.
In 1986 Reid [2611] found a harmonious labeling for K4 ×Pn . In 2003 Petrie and Smith
[2387] investigated graceful labelings of graphs as an exercise in constraint programming
satisfaction. They determined that Kn × P2 is graceful for n = 3, 4 and 5; K4 × P3 is
graceful; K4 × C3 is graceful; (Cn ∪ Cn ) + K1 (double wheel) is graceful for n = 4 and 5;
and (C3 ∪ C3 ) + K1 is not graceful. That K3 × K3 is not graceful follows from the parity
condition given in the introduction. Using significantly better methods in 2010, Smith and
Puget obtained the results about graceful labelings for Km × K1 , Km × Pn , and Km × Cn
given in Table 1. Their labeling for K5 × P2 and K6 × P3 are the unique graceful labelings
for those graphs. Redl [2610] proved that K4 × Pn is graceful for n = 1, 2, 3, 4, and 5
using a constraint programming approach and asked if all graphs of the form K4 × Pn are
graceful
Vaidya, Kaneria, Srivastav, and Dani [3281] proved that Pn ∪ Pt ∪ (Pr × Ps ) where
t < min{r, s} and Pn ∪ Pt ∪ Kr,s where t 6 min{r, s} and r, s > 3 are graceful. Kaneria,
Vaidya, Ghodasara, and Srivastav [1624] proved Kmn ∪ (Pr × Ps ) where m, n, r, s > 1;
(Pr × Ps ) ∪ Pt where r, s > 1 and t 6= 2; and Kmn ∪ (Pr × Ps ) ∪ Pt where m, n, r, s > 1
and t 6= 2 are graceful. Xie, Zhao, and Yao [3498] proved that graphs of the form Cn T [3498] new
where T is a graceful tree are graceful.
The composition G1 [G2 ] is the graph having vertex set V (G1 ) × V (G2 ) and edge set
{(x1 , y1 ), (x2 , y2 )| x1 x2 ∈ E(G1 ) or x1 = x2 and y1 y2 ∈ E(G2 )}. The symmetric product
G1 ⊕ G2 of graphs G1 and G2 is the graph with vertex set V (G1 ) × V (G2 ) and edge
set {(x1 , y1 ), (x2 , y2 )| x1 x2 ∈ E(G1 ) or y1 y2 ∈ E(G2 ) but not both}. Seoud and Youssef
[2801] have proved that Pn ⊕ K2 is graceful when n > 1 and Pn [P2 ] is harmonious for all
n. They also observe that the graphs Cm ⊕ Cn and Cm [Cn ] violate the parity conditions
for graceful and harmonious graphs when m and n are odd.

2.4 Complete Graphs

The questions of the gracefulness and harmoniousness of the complete graphs Kn have
been answered. In each case the answer is positive if and only if n 6 4 ([1115], [2964],
[1147], [551]). Both Rosa [2648] and Golomb [1115] proved that the complete bipartite
graphs Km,n are graceful while Graham and Sloane [1147] showed they are harmonious if
and only if m or n = 1. Aravamudhan and Murugan [220] have shown that the complete
tripartite graph K1,m,n is both graceful and harmonious while Gnanajothi [1104, pp.
25–31] has shown that K1,1,m,n is both graceful and harmonious and K2,m,n is graceful.
Some of the same results have been obtained by Seoud and Youssef [2796] who also
observed that when m, n, and p are congruent to 2 (mod 4), Km,n,p violates the parity
conditions for harmonious graphs. Beutner and Harborth [551] give graceful labelings
for K1,m,n , K2,m,n , K1,1,m,n and conjecture that these and Km,n are the only complete
multipartite graphs that are graceful. They have verified this conjecture for graphs with
up to 23 vertices via computer.

the electronic journal of combinatorics (2023), #DS6 24

 Beutner and Harborth [551] also show that Kn −e (Kn with an edge deleted) is graceful
only if n 6 5; any Kn − 2e (Kn with two edges deleted) is graceful only if n 6 6; and any
Kn − 3e is graceful only if n 6 6. They also determine all graceful graphs of the form
Kn − G where G is K1,a with a 6 n − 2 and where G is a matching Ma with 2a 6 n.
(m)
The windmill graph Kn (n > 3) consists of m copies of Kn with a vertex in common.
(m)
A necessary condition for Kn to be graceful is that n 6 5 – see [1720]. Bermond [544]
(m) (m)
has conjectured that K4 is graceful for all m > 4. The gracefulness of K4 is equivalent
to the existence of a (12m + 1, 4, 1)-perfect difference family, which are known to exist
for m 6 1000 (see [1271], [7], [3454], and [1065]). Bermond, Kotzig, and Turgeon [547]
(m)
proved that Kn is not graceful when n = 4 and m = 2 or 3, and when m = 2 and
(3) (4)
n = 5. Stones [3055] proved that K5 and K5 are graceful. In 1982 Hsu [1263] proved
(m) (2)
that K4 is harmonious for all m. Graham and Sloane [1147] conjectured that Kn is
harmonious if and only if n = 4. They verified this conjecture for the cases that n is odd
(2)
or n = 6. Liu [1962] has shown that Kn is not harmonious if n = 2a pa11 · · · pas s where
a, a1 , . . . , as are positive integers and p1 , . . . , ps are distinct odd primes and there is a j
(3)
for which pj ≡ 3 (mod 4) and aj is odd. He also shows that Kn is not harmonious
when n ≡ 0 (mod 4) and 3n = 4e (8k + 7) or n ≡ 5 (mod 8). Koh, Rogers, Lee, and Toh
(t)
[1713] and Rajasingh and Pushpam [2556] have shown that Km,n , the one-point union
of t copies of Km,n , is graceful. Sethuraman and Selvaraju [2834] have proved that the
one-point union of graphs of the form K2,mi for i = 1, 2, . . . , n, where the union is taken
at a vertex from the partite set with exactly 2 vertices is graceful if at most two of the
mi are equal. They conjecture that the restriction that at most two of the mi are equal
is not necessary. Sudha [3070] proved that two or more complete bipartite graphs having
one bipartite vertex set in common are graceful. Mitra and Bhoumik [2170] proved that
K2n,2n K2 is graceful.
Koh, Rogers, Lee, and Toh [1720] introduced the notation B(n, r, m) for the graph
consisting of m copies of Kn with a Kr in common (n > r). (We note that Guo [1165] has
used the notation B(n, r, m) to denote the graph obtained by joining opposite endpoints
of three disjoint paths of lengths n, r and m.) Bermond [544] raised the question: “For
(m)
which m, n, and r is B(n, r, m) graceful?” Of course, the case r = 1 is the same as Kn .
For r > 1, B(n, r, m) is graceful in the following cases: n = 3, r = 2, m > 1 [1714];
n = 4, r = 2, m > 1 [797]; n = 4, r = 3, m > 1 (see [544]), [1714]. Seoud and Youssef
[2796] have proved B(3, 2, m) and B(4, 3, m) are harmonious. Liu [1961] has shown that
if there is a prime p such that p ≡ 3 (mod 4) and p divides both n and n − 2 and
the highest power of p that divides n and n − 2 is odd, then B(n, 2, 2) is not graceful.
Smith and Puget [3008] has shown that up to symmetry, B(5, 2, 2) has a unique graceful
labeling; B(n, 3, 2) is not graceful for n = 6, 7, 8, 9, and 10; B(6, 3, 3) and B(7, 3, 3) are
not graceful; and B(5, 3, 3) is graceful. Combining results of Bermond and Farhi [546]
and Smith and Puget [3008] show that B(n, 2, 2) is not graceful for n > 5. Lu [2039]
obtained the following results: B(m, 2, 3) and B(m, 3, 3) are not harmonious when m ≡ 1
(mod 8); B(m, 4, 2) and B(m, 5, 2) are not harmonious when m satisfies certain special
conditions; B(m, 1, n) is not harmonious when m ≡ 5 (mod 8) and n ≡ 1, 2, 3 (mod 4);

the electronic journal of combinatorics (2023), #DS6 25

B(2m + 1, 2m, 2n + 1) ∼ = K2m + K2n+1 is not harmonious when m ≡ 2 (mod 4).
More generally, Bermond and Farhi [546] have investigated the class of graphs con-
sisting of m copies of Kn having exactly k copies of Kr in common. They proved such
graphs are not graceful for n sufficiently large compared to r. Barrientos [441] proved that
the graph obtained by performing the one-point union of any collection of the complete
bipartite graphs Km1 ,n1 , Km2 ,n2 , . . . , Kmt ,nt , where each Kmi ,ni appears at most twice and
gcd(n1 , n2 , . . . , nt ) = 1, is graceful.
Sethuraman and Elumalai [2810] have shown that K1,m,n with a pendent edge attached
to each vertex is graceful and Jirimutu [1551] has shown that the graph obtained by
attaching a pendent edge to every vertex of Km,n is graceful (see also [179]). In [2823]
Sethuraman and Kishore determine the graceful graphs that are the union of n copies of
K4 with i edges deleted for 1 6 i 6 5 and with one edge in common. The only cases that
are not graceful are those graphs where the members of the union are C4 for n ≡ 3 (mod
4) and where the members of the union are P2 . They conjecture that these two cases are
the only instances of edge induced subgraphs of the union of n copies of K4 with one edge
in common that are not graceful.
Renuka, Balaganesan, Selvaraju [2614] proved the graphs obtained by joining a vertex
of K1,m to a vertex of K1,n by a path are harmonious. Sethuraman and Selvaraju [2840]
have shown that union of any number of copies of K4 with an edge deleted and one edge
in common is harmonious.
Clemens, Coulibaly, Garvens, Gonnering, Lucas, and Winters [749] investigated the
gracefulness of the one-point and two-point unions of graphs. They show the following
graphs are graceful: the one-point union of an end vertex of Pn and K4 ; the graph obtained
by taking the one-point union of K4 with one end vertex of Pn and the one-point union of
the other end vertex of Pn with the central vertex of K1,r ; the graph obtained by taking
the one-point union of K4 with one end vertex of Pn and the one-point union of the other
end of Pn with a vertex from the partite set of order 2 of K2,r ; the graph obtained from
the graph just described by appending any number of edges to the other vertex of the
partite set of order 2; the two-point union of the two vertices of the partite set of order 2
in K2,r and two vertices from K4 ; and the graph obtained from the graph just described
by appending any number of edges to one of the vertices from the partite set of order 2.
A Golomb ruler is a marked straightedge such that the distances between different
pairs of marks on the straightedge are distinct. If the set of distances between marks is
every positive integer up to and including the length of the ruler, then ruler is a called
a perfect Golomb ruler. Golomb [1115] proved that perfect Golomb rulers exist only for
rulers with at most 4 marks. Beavers [522] examines the relationship between Golomb
rulers and graceful graphs through a correspondence between rulers and complete graphs.
He proves that Kn is graceful if and only if there is a perfect Golomb ruler with n marks
and Golomb rulers are equivalent to complete subgraphs of graceful graphs.

2.5 Disconnected Graphs

There have been many papers dealing with graphs that are not connected. For any graph
G the graph mG denotes the disjoint union of m copies of G. In 1975 Kotzig [1740]

the electronic journal of combinatorics (2023), #DS6 26

investigated the gracefulness of the graphs rCs . When rs ≡ 1 or 2 (mod 4), these graphs
violate the gracefulness parity condition. Kotzig proved that when r = 3 and 4k > 4, then
rC4k has a stronger form of graceful labeling called α-labeling (see §3.1) whereas when
r > 2 and s = 3 or 5, rCs is not graceful. In 1984 Kotzig [1742] once again investigated
the gracefulness of rCs as well as graphs that are the disjoint union of odd cycles. For
graphs of the latter kind he gives several necessary conditions. His paper concludes with
an elaborate table that summarizes what was then known about the gracefulness of rCs .
M. He [1198] has shown that graphs of the form 2C2m and graphs obtained by connecting
two copies of C2m with an edge are graceful. Cahit [645] has shown that rCs is harmonious
when r and s are odd and Seoud, Abdel Maqsoud, and Sheehan [2762] noted that when r
or s is even, rCs is not harmonious. Seoud, Abdel Maqsoud, and Sheehan [2762] proved
that Cn ∪ Cn+1 is harmonious if and only if n > 4. They conjecture that C3 ∪ C2n is
harmonious when n > 3. This conjecture was proved when Yang, Lu, and Zeng [3520]
showed that all graphs of the form C2j+1 ∪ C2n are harmonious except for (n, j) = (2, 1).
As a consequence of their results about super edge-magic labelings (see §5.2) Figueroa-
Centeno, Ichishima, Muntaner-Batle, and Oshima [939] have that Cn ∪ C3 is harmonious
if and only if n > 6 and n is even. Renuka, Balaganesan, Selvaraju [2614] proved that for
odd n Cn ∪P3 (see also [2284]) and Cn Km ∪P3 are harmonious. Ng, Alwie, Marjadi, and
Sugeng [2284] proved: Cm ∪P1 is harmonious if and only if m 6= 2 mod 4, Cm ∪P2 (m > 3),
and they conjectured that Cm ∪ P3 is harmonious for all m > 3. Youssef [3543] has shown
that if G is harmonious then mG is harmonious for all odd m.
In 1978 Kotzig and Turgeon [1745] proved that mKn is graceful if and only if m = 1
and n 6 4. Liu and Zhang [1964] have shown that mKn is not harmonious for n odd and
m ≡ 2 (mod 4) and is harmonious for n = 3 and m odd. They conjecture that mK3 is
not harmonious when m ≡ 0 (mod 4). Bu and Cao [619] give some sufficient conditions
for the gracefulness of graphs of the form Km,n ∪ G and they prove that Km,n ∪ Pt and
the disjoint union of complete bipartite graphs are graceful under some conditions.
Recall a Skolem sequence of order n is a sequence s1 , s2 , . . . , s2n of 2n terms such
that, for each k ∈ {1, 2, . . . , n}, there exist exactly two subscripts i(k) and j(k) with
si(k) = sj(k) = k and |i(k) − j(k)| = k. (A Skolem sequence of order n exists if and only if
n ≡ 0 or 1 (mod 4)). Abrham [19] has proved that any graceful 2-regular graph of order
n ≡ 0 (mod 4) in which all the component cycles are even or of order n ≡ 3 (mod 4),
with exactly one component an odd cycle, can be used to construct a Skolem sequence
of order n + 1. Also, he showed that certain special Skolem sequences of order n can be
used to generate graceful labelings on certain 2-regular graphs.
The graph Hn obtained from the cycle with consecutive vertices u1 , u2 , . . . , un (n > 6)
by adding the chords u2 un , u3 un−1 , . . . , uα uβ , where α = (n − 1)/2 for all n and β =
(n − 1)/2 + 3 if n is odd or β = n/2 + 2 if n is even is called the cycle with parallel
chords. In Elumalai and Sethuraman [880] prove the following: for odd n > 5, Hn ∪ Kp,q
is graceful; for even n > 6 and m = (n − 2)/2 or m = n/2 Hn ∪ K1,m is graceful; for
n > 6, Hn ∪ Pm is graceful, where m = n or n − 2 depending on n ≡ 1 or 3 (mod 4) or
m ≡ n−1 or n−3 depending on n ≡ 0 or 2 (mod 4). Elumali and Sethuraman [882] proved
that every n-cycle (n > 6) with parallel chords is graceful and every n-cycle with parallel

the electronic journal of combinatorics (2023), #DS6 27

Pk -chords of increasing lengths is graceful for n = 2 (mod 4) with 1 6 k 6 (bn/2c − 1).
In 1985 Frucht and Salinas [988] conjectured that Cs ∪ Pn is graceful if and only
if s + n > 6 and proved the conjecture for the case that s = 4. The conjecture was
proved by Traetta [3222] in 2012 who used his result to get a complete solution to the
well known two-table Oberwolfach problem; that is, given odd number of people and two
round tables when is it possible to arrange series of seatings so that each person sits next
to each other person exactly once during the series. The t-table Oberwolfach P problem
OP(n1 , n2 , . . . , nt ) asks to arrange a series of meals for an odd number n = ni of people
around t tables of sizes n1 , n2 , . . . , nt so that each person sits next to each other exactly
once. A solution to OP(n1 , n2 , . . . , nt ) is a 2–factorization of Kn whose factors consists of t
cycles of lengths n1 , n2 , . . . , nt . The λ–fold Oberwolfach problem OPλ (n1 , n2 , . . . , nt ) refers
to the case where Kn is replaced by λKn . Traetta used his proof of the Frucht and Salinas
conjecture to provide a complete solutions to both OP (2r + 1, 2s) and OP (2r + 1, s, s),
except possibly for OP (3, s, s). He also gave a complete solution of the general λ–fold
Oberwolfach problem OPλ (r, s).
Seoud and Youssef [2803] have shown that K5 ∪ Km,n , Km,n ∪ Kp,q (m, n, p, q >
2), Km,n ∪ Kp,q ∪ Kr,s (m, n, p, q, r, s > 2, (p, q) 6= (2, 2)), and pKm,n (m, n > 2, (m, n) 6=
(2, 2)) are graceful. They also prove that C4 ∪ K1,n (n 6= 2) is not graceful whereas
Choudum and Kishore [721], [1704] have proved that Cs ∪ K1,n is graceful for s > 7 and
n > 1. Lee, Quach, and Wang [1876] established the gracefulness of Ps ∪ K1,n . Seoud and
Wilson [2795] have shown that C3 ∪K4 , C3 ∪C3 ∪K4 , and certain graphs of the form C3 ∪Pn
and C3 ∪ C3 ∪ Pn are not graceful. Abrham and Kotzig [24] proved that Cp ∪ Cq is graceful
if and only if p + q ≡ 0 or 3 (mod 4). Zhou [3597] proved that Km ∪ Kn (n > 1, m > 1) is
graceful if and only if {m, n} = {4, 2} or {5, 2}. Knuth [1707] used a computer to show
that K5 ∪K2 has a unique graceful labeling up to a complement. (C. Barrientos has called
to my attention that K1 ∪ Kn is graceful if and only if n = 3 or 4.) Shee [2873] has shown
that graphs of the form P2 ∪ C2k+1 (k > 1), P3 ∪ C2k+1 , Pn ∪ C3 , and Sn ∪ C2k+1 all satisfy
a condition that is a bit weaker than harmonious. Bhat-Nayak and Deshmukh [558] have
shown that C4t ∪ K1,4t−1 and C4t+3 ∪ K1,4t+2 are graceful. Section 3.1 includes numerous
families of disconnected graphs that have a stronger form of graceful labelings.
For m = 2p + 3 or 2p + 4, Wang, Liu, and Li [3440] proved the following graphs are
graceful: Wm ∪ Kn,p and Wm,2m+1 ∪ Kn,p ; for n > m, Wm,2m+1 ∪ K1,n ; for m = 2n + 5,
Wm,2m+1 ∪ (C3 + Kn ). If Gp is a graceful graph with p edges, they proved W2p+3 ∪ Gp is
graceful.
In considering graceful labelings of the disjoint unions of two or three stars Se with
e edges Yang and Wang [3523] permitted the vertex labels to range from 0 to e + 1 and
0 to e + 2, respectively. With these definitions of graceful, they proved that Sm ∪ Sn is
graceful if and only if m or n is even and that Sm ∪ Sn ∪ Sk is graceful if and only if at
least one of m, n, or k is even (m > 1, n > 1, k > 1).
Seoud and Youssef [2799] investigated the gracefulness of specific families of the form
G ∪ Km,n . They obtained the following results: C3 ∪ Km,n is graceful if and only if m > 2
and n > 2; C4 ∪ Km,n is graceful if and only if (m, n) 6= (1, 1); C7 ∪ Km,n and C8 ∪ Km,n
are graceful for all m and n; mK3 ∪ nK1,r is not graceful for all m, n and r; Ki ∪ Km,n

the electronic journal of combinatorics (2023), #DS6 28

is graceful for i 6 4 and m > 2, n > 2 except for i = 2 and (m, n) = (2, 2); K5 ∪ K1,n
is graceful for all n; K6 ∪ K1,n is graceful if and only if n is not 1 or 3. Youssef [3545]
completed the characterization of the graceful graphs of the form Cn ∪ Kp,q where n ≡ 0
or 3 (mod 4) by showing that for n > 8 and n ≡ 0 or 3 (mod 4), Cn ∪ Kp,q is graceful for
all p and q (see also [439]). Note that when n ≡ 1 or 2 (mod 4) certain cases of Cn ∪ Kp,q
violate the parity condition for gracefulness.
For i = 1, 2, . . . , m let vi,1 , vi,2 , vi,3 , vi,4 be a 4-cycle. Yang and Pan [3518] define Fk,4
to be the graph obtained by identifying vi,3 and vi+1,1 for i = 1, 2, . . . , k − 1. They prove
that Fm1 ,4 ∪ Fm2 ,4 ∪ · · · ∪ Fmn ,4 is graceful for all n. Pan and Lu [2327] have shown that
(P2 + Kn ) ∪ K1,m and (P2 + Kn ) ∪ Tn are graceful. St
Barrientos [439] has shown the following graphs are graceful: C 6 ∪ K 1,2n+1 ; i=1 Kmi ,ni
for 2 6 mi < ni ; and Cm ∪ ti=1 Kmi ,ni for 2 6 mi < ni , m ≡ 0 or 3 (mod 4), m > 11.
S
S3In
[1608] Kaneria, Makadia, and Viradia proved that the union of three grid graphs, l=1
(Pml × Pnl ), is graceful, the union of finitely many copies of Pm × Pn is graceful, and
provided two new graceful labeling for Pm × Pn .
Wang and Li [3438] use St(n) to denote the star Kn,1 , Fn to denote the fan Pn K1 ,
and Fm,n to denote the graph obtained by identifying the vertex of Fm with degree m
and the vertex of Fn with degree n. They showed: for all positive integers n and p and
m > 2p + 2, Fm ∪ Kn,p and Fm,2m ∪ Kn,p are graceful; Fm ∪ St(n) is graceful; and
Fm,2m ∪ St(n) and Fm,2m ∪ Gr are graceful. In [3444] Wang, Wang, and Li gave a sufficient
condition for the gracefulness of graphs of the form (P3 + Km ) ∪ G and (C3 + Km ) ∪ G.
Wei, Wang, and Sun [3461] provided graceful labelings for the unions of some families of
wheels related graphs and complete bipartite graphs. They also gave graceful labelings for
some graphs of the form G∪(C3 +Km )∪Sn where G is wheel related. In [3563] Yu, Wang,
and Song proved the following graphs are graceful: Kn,m ∪ (K2 + Kn ), Kn,m ∪ (P3 + Kn ),
Kn,m ∪ (P1 + P2n+2 ), and Kn,m ∪ K1,2n . They proved the gracefulness of such graphs for
a variety of cases when G involves stars and paths. More technical results like these are
given in [3446], [3445], and [651].

2.6 Joins of Graphs

A number of classes of graphs that are the join of graphs have been shown to be graceful
or harmonious. Koh, Rogers, and Lim [1714] proved G + H is graceful if G is a graceful
tree and H is one of Kn , Pn ∪ K1 , or a star. Koh, Phoon, and Soh [1710] point out that
some versions of this survey prior to 2017 incorrectly stated that Acharya [27] proved that
if G is a connected graceful graph, then G + Kn is graceful. Redl [2610] showed that the
double cone Cn + K2 is graceful for n = 3, 4, 5, 7, 8, 9, 11. That Cn + K2 is not graceful for
n ≡ 2 (mod 4) follows that Rosa’s parity condition. Redl asks what other double cones
are graceful. Bras, Gomes, and Selman [612] showed that double wheels (Cn ∪ Cn ) + K1
are graceful. Koh, Phoon, and Soh [1710] prove that K3 + Kn is graceful. Reid [2611]
proved that Pn + Kt is harmonious. Sethuraman and Selvaraju [2839] and [2744] have
shown that Pn + K2 is harmonious. They ask whether Sn + Pn or Pm + Pn is harmonious.
As stated in an earlier section, wheels are of the form Cn + K1 and are graceful and
harmonious. In 2006 Chen [693] proved that multiple wheels nCm + K1 are harmonious

the electronic journal of combinatorics (2023), #DS6 29

for all n 6≡ 0 mod 4. She believes that the n 6≡ 0 (mod 4) case is also harmonious. Chen
also proved that if H has at least one edge, H + K1 is harmonious, and if n is odd, then
nH + K is harmonious.
For n > t + 2 and t > 1, Koh, Phoon, and Soh [1711] use P (n, t) to denote the graph
of order n consisting of a path of length t and n − (t + 1) isolated vertices. For n > 2t + 1
and t > 1, they use I(n, t) to denote the disjoint union of tK2 and Kn−2t . They proved:
Kp + P (n, t) is graceful for all p > 1, n > t + 2 and t > 1; Kp + I(n, t) is graceful for all
p > 1, n > 2t + 1 and t > 1; and for s, t ∈ {1, 2}, P (m, s) + P (n, t) is graceful for all
m > s + 2 and n > t + 2. In [1711] Koh, Phoon, and Soh ask “What can be said about
the gracefulness of Cm + P (n, t) where n > t + 2” and is “Is P (m, s) + P (n, t) always
graceful for all m > s + 2, n > t + 2, where s > 3 or t > 3?” In [1710] they state as
problems about graceful graphs: Cm + Pn (m > 3, n > 3); Cm + Cn (m > 3, n > 3) and
K1,p + P (n, t) and prove that C3 + P (n, t) is graceful for all n > t + 2, where 1 6 t 6 3
and C5 + P (n, 1) is graceful for all n > 3.
Shee [2873] has proved Km,n + K1 is harmonious and observed that various cases of
Km,n + Kt violate the harmonious parity condition in [1147]. Liu and Zhang [1964] have
proved that K2 + K2 + · · · + K2 is harmonious. Youssef [3543] has shown that if G is
harmonious then Gm is harmonious for all odd m. He asks the question of whether G is
harmonious implies Gm is harmonious when m ≡ 0 (mod 4). Yuan and Zhu [3565] proved
that Km,n + K2 is graceful and harmonious. Gnanajothi [1104, pp. 80–127] obtained the
following: Cn +K2 is harmonious when n is odd and not harmonious when n ≡ 2, 4, 6 (mod
8); Sn +Kt is harmonious; and Pn +Kt is harmonious. Balakrishnan and Kumar [413] have
proved that the join of K n and two disjoint copies of K2 is harmonious if and only if n is
even. Ramı́rez-Alfonsı́n [2577] has proved that if G is graceful and |V (G)| = |E(G)| = e
and either 1 or e is not a vertex label then G + Kt is graceful for all t. Sudha and Kanniga
[3073] proved that the graph Pm + Kn is graceful.
Seoud and Youssef [2801] have proved: the join of any two stars is graceful and har-
monious; the join of any path and any star is graceful; and Cn + Kt is harmonious for
every t when n is odd. They also prove that if any edge is added to Km,n the resulting
graph is harmonious if m or n is at least 2. Deng [800] has shown certain cases of Cn + Kt
are harmonious. Seoud and Youssef [2798] proved: the graph obtained by appending any
number of edges from the two vertices of degree n > 2 in K2,n is not harmonious; dragons
Dm,n (i.e., an endpoint of Pm is appended to Cn ) are not harmonious when m + n is odd;
and the disjoint union of any dragon and any number of cycles is not harmonious when
the resulting graph has odd order. Youssef [3542] has shown that if G is a graceful graph
with p vertices and q edges with p = q + 1, then G + Sn is graceful.
Sethuraman and Elumalai [2814] have proved that for every graph G with p vertices
and q edges the graph G+K1 +Km is graceful when m > 2p −p−1−q. As a corollary they
deduce that every graph is a vertex induced subgraph of a graceful graph. Balakrishnan
and Sampathkumar [414] ask for which m > 3 is the graph mK2 + Kn graceful for all n.
Bhat-Nayak and Gokhale [562] have proved that 2K2 + Kn is not graceful. Youssef [3542]
has shown that mK2 + Kn is graceful if m ≡ 0 or 1 (mod 4) and that mK2 + Kn is not
graceful if n is odd and m ≡ 2 or 3 (mod 4). Ma [2044] proved that if G is a graceful tree

the electronic journal of combinatorics (2023), #DS6 30

then, G + K1,n is graceful. Amutha and Kathiresan [179] proved that the graph obtained
by attaching a pendent edge to each vertex of 2K2 + Kn is graceful.
Wu [3487] proves that if G is a graceful graph with n edges and n + 1 vertices then
the join of G and Km and the join of G and any star are graceful. Wei and Zhang [3460]
proved that for n > 3 the disjoint union of P1 +Pn and a star, the disjoint union of P1 +Pn
and P1 + P2n , and the disjoint union of P2 + Kn and a graceful graph with n edges are
graceful. More technical results on disjoint unions and joins are given in [3459], [3460],
[3462], [3458], and [651].

2.7 Miscellaneous Results

It is easy to see that Pn2 is harmonious [1144] while a proof that Pn2 is graceful has been
given by Kang, Liang, Gao, and Yang [1633]. (Pnk , the kth power of Pn , is the graph
obtained from Pn by adding edges that join all vertices u and v with d(u, v) = k.) This
latter result proved a conjecture of Grace [1144]. Seoud, Abdel Maqsoud, and Sheehan
[2762] proved that Pn3 is harmonious and conjecture that Pnk is not harmonious when
k > 3. The same conjecture was made by Fu and Wu [991]. However, Youssef [3552] has
proved that P84 is harmonious and Pnk is harmonious when k is odd. Yuan and Zhu [3565]
proved that Pn2k is harmonious when 1 6 k 6 (n − 1)/2. Selvaraju [2739] has shown that
Pn3 and the graphs obtained by joining the centers of any two stars with the end vertices
of the path of length n in Pn3 are harmonious.
Cahit [645] proves that the graphs obtained by joining p disjoint paths of a fixed
length k to single vertex are harmonious when p is odd and when k = 2 and p is even.
Gnanajothi [1104, p. 50] has shown that the graph that consists of n copies of C6 that
have exactly P4 in common is graceful if and only if n is even. For a fixed n, let vi1 , vi2 , vi3
and vi4 (1 6 i 6 n) be consecutive vertices of n 4-cycles. Gnanajothi [1104, p. 35] also
proves that the graph obtained by joining each vi1 to vi+1,3 is graceful for all n and the
generalized Petersen graph P (n, k) is harmonious in all cases (see also [1881]). Recall
P (n, k), where n > 5 and 1 6 k 6 n, has vertex set {a0 , a1 , . . . , an−1 , b0 , b1 , . . . , bn−1 }
and edge set {ai ai+1 | i = 0, 1, . . . , n − 1} ∪ {ai bi | i = 0, 1, . . . , n − 1} ∪ {bi bi+k | i =
0, 1, . . . , n − 1} where all subscripts are taken modulo n [3457]. The standard Petersen
graph is P (5, 2).) Redl [2610] has used a constraint programming approach to show that
P (n, k) is graceful for n = 5, 6, 7, 8, 9, and 10. In [3361] and [3377] Vietri proved that
P (8t, 3) and P (8t + 4, 3) are graceful for all t. He conjectures that the graphs P (8t, 3)
have a stronger form a graceful labeling called an α-labeling (see §3.1). The gracefulness
of the generalized Petersen graphs is an open problem. Shao, Deng, Li, and Vese [2866]
provide an backtracking algorithm that finds graceful labelings for all generalized Petersen
graphs P (n, k) with n 6 75 within several seconds. The algorithm strongly outperforms
the standard backtracking algorithm.
Rao and Sahoo [2593] prove that every connected graph can be embedded as an induced
subgraph in an Eulerian graceful graph. They also show that for an integer k > 3, the
problems of deciding whether the chromatic number is less than or equal to k and whether
the clique number is greater than or equal to k are NP-complete even for Eulerian graceful
graphs. Sethuraman, Ragukumar, and Slater [2830] proved that any tree with m edges

the electronic journal of combinatorics (2023), #DS6 31

can be embedded in a graceful tree with less than 4m edges and in a graceful planar
graph. A conjecture in the graph theory book by Chartrand and Lesniak [684, p. 266]
that graceful graphs with arbitrarily large chromatic numbers do not exist was shown to
be false by Acharya, Rao, and Arumugam [47] (see also Mahmoody [2065]).
In [447] Barrientos calculates the number of non-isomorphic harmoniously labeled
graphs with n edges and at most n vertices. He provides harmonious labelings for certain
unicyclic graphs obtained via the corona product and triangular grids obtained via edge
amalgamation of copies of C3 in such a way that each copy of a cycle shares at most
two edges with other copies. Moreover, he uses the edge-switching technique on C4t to
generate unicyclic graphs with strongly felicitous labelings (see §4.4).
Bača and Youssef [390] investigated the existence of harmonious labelings for the
corona graphs of a cycle and a graph G. They proved that if G+K1 is strongly harmonious
(that is, a harmonious labeling f for which the edge labels induced by f (x)+f (y) for each
edge xy are 1, . . . , q. with the 0 label on the vertex of K1 , then Cn G is harmonious for
all odd n > 3. By combining this with existing results they have as corollaries that the
following graphs are harmonious: Cn Cm for odd n > 3 and m 6≡ 2 (mod 3); Cn Ks,t
for odd n > 3; and Cn K1,s,t for odd n > 3.
Sethuraman and Selvaraju [2833] define a graph H to be a supersubdivision of a graph
G, if every edge uv of G is replaced by K2,m (m may vary for each edge) by identifying
u and v with the two vertices in K2,m that form the partite set with exactly two mem-
bers. Sethuraman and Selvaraju prove that every supersubdivision of a path is graceful
and every cycle has some supersubdivision that is graceful. They conjecture that every
supersubdivision of a star is graceful and that paths and stars are the only graphs for
which every supersubdivision is graceful. Barrientos [441] disproved this latter conjecture
by proving that every supersubdivision of a y-trees is graceful (recall a y-tree is obtained
from a path by appending an edge to a vertex of a path adjacent to an end point). Bar-
rientos asks if paths and y-trees are the only graphs for which every supersubdivision is
graceful. This seems unlikely to be the case. The conjecture that every supersubdivision
of a star is graceful was proved by Kathiresan and Amutha [1666]. In [2837] Sethuraman
and Selvaraju prove that every connected graph has some supersubdivision that is grace-
ful. They pose the question as to whether this result is valid for disconnected graphs.
Barrientos and Barrientos [451] answered this question by proving that any disconnected
graph has a supersubdivision that admits an α-labeling (see §3.1). They also proved that
every supersubdivision of a connected graph admits an α-labeling. Sekar and Ramachan-
dren proved that an arbitrary supersubdivision of disconnected graph is graceful [2737]
and supersubdivisions of ladders are graceful [2574]. Sethuraman and Selvaraju also asked
if there is any graph other than K2,m that can be used to replace an edge of a connected
graph to obtain a supersubdivision that is graceful.
Sethuraman and Selvaraju [2833] call superdivision graphs of G where every edge uv
of G is replaced by K2,m and m is fixed an arbitrary supersubdivision of G. Barrientos
and Barrientos [451] answered the question of Sethuraman and Selvaraju by proving that
any graph obtained from K2,m by attaching k pendent edges and n pendent edges to the
vertices of its 2-element stable set can be used instead of K2,m to produce an arbitrary

the electronic journal of combinatorics (2023), #DS6 32

supersubdivision that admits an α-labeling (a stable set S consists of a set of vertices such
that there is not an edge vi vj for all pairs vi , vj in S).
Kathiresan and Sumathi [1676] affirmatively answer the question posed by Sethuraman
and Selvaraju in [2833] of whether there are graphs different from paths whose arbitrary
supersubdivisions are graceful.
For a graph G Ambili and Singh [175] call the graph G∗ a strong supersubdivision of
G if G∗ is obtained from G by replacing every edge ei of G by a complete bipartite graph
Kri ,si . A strong supersubdivision G∗ of G is said to be an arbitrary strong supersubdivision
if G∗ is obtained from G by replacing every edge ei of G by a complete bipartite graph
Kr,si (r is fixed and si may vary). They proved that arbitrary strong supersubdivisions
of paths, cycles, and stars are graceful. They conjecture that every arbitrary strong
supersubdivision of a tree is graceful and ask if it is true that for any non-trivial connected
graph G, an arbitrary strong supersubdivision of G is graceful?
In [2836] Sethuraman and Selvaraju present an algorithm that permits one to start
with any non-trivial connected graph and successively form supersubdivisions that have
a strong form of graceful labeling called an α-labeling (see §3.1 for the definition).
Kathiresan [1663] uses the notation Pa,b to denote the graph obtained by identifying
the end points of b internally disjoint paths each of length a. He conjectures that Pa,b is
graceful except when a is odd and b ≡ 2 (mod 4) and proves the conjecture for the case
that a is even and b is odd. Liang and Zuo [1944] proved that the graph Pa,b is graceful
when both a and b are even. Daili, Wang and Xie [789] provided an algorithm for finding
a graceful labeling of P2r,2 and showed that a P2r,2(2k+1) is graceful for all positives r and
k. Sekar [2736] has shown that Pa,b is graceful when a 6= 4r + 1, r > 1, b = 4m, and
m > r. Yang (see [3521]) proved that Pa,b is graceful when a = 3, 5, 7, and 9 and b is odd
and when a = 2, 4, 6, and 8 and b is even (see [3521]). Yang, Rong, and Xu [3521] proved
that Pa,b is graceful when a = 10, 12, and 14 and b is even. Yan [3510] proved P2r,2m is
graceful when r is odd. Yang showed that P2r+1,2m+1 and P2r,2m (r 6 7, and r = 9) are
graceful (see [2646]). Rong and Xiong [2646] showed that P2r,b is graceful for all positive
integers r and b. Kathiresan also shows that the graph obtained by identifying a vertex
of Kn with any noncenter vertex of the star with 2n−1 − n(n − 1)/2 edges is graceful.
For a family of graphs G1 (u1 , u2 ), G2 (u2 , u3 ), . . . , Gm (um , um+1 ) where ui and ui+1 are
vertices in Gi Cheng, Yao, Chen, and Zhang [702] define a graph-block chain Hm as the
graph obtained by identifying ui+1 of Gi with ui+1 of Gi+1 for i = 1, 2, . . . , m. They
denote this graph by Hm = G1 (u1 , u2 ) ⊕ G2 (u2 , u3 ) ⊕ · · · ⊕ Gm (um , um+1 ). The case where
each Gi has the form Pai ,bi they call a path-block chain. The vertex u1 is called the initial
∗
vertex of Hm . They define a generalized spider Sm as a graph obtained by starting with
an initial vertex u0 and m path-block graphs and join u0 with each initial vertex of each
of the path-block graphs. Similarly, they define a generalized caterpillar Tm∗ as a graph
obtained by starting with m path-block chains H1 , H2 , . . . , Hm and a caterpillar T with
m isolated vertices v1 , v2 , . . . , vm and join each vi with the initial vertex of each Hi . They
prove several classes of path-block chains, generalized spiders, and generalized caterpillars
are graceful.
The graph Tn with 3n vertices and 6n − 3 edges is defined as follows. Start with a

the electronic journal of combinatorics (2023), #DS6 33

triangle T1 with vertices v1,1 , v1,2 and v1,3 . Then Ti+1 consists of Ti together with three
new vertices vi+1,1 , vi+1,2 , vi+1,3 and edges vi+1,1 vi,2 , vi+1,1 vi,3 , vi+1,2 vi,1 , vi+1,2 vi,3 , vi+1,3 vi,1 ,
vi+1,3 vi,2 . Gnanajothi [1104] proved that Tn is graceful if and only if n is odd. Sekar [2736]
proved Tn is graceful when n is odd and Tn with a pendent edge attached to the starting
triangle is graceful when n is even.
In [526] and [2851] Begam, Palanivelrajan, Gunasekaran, and Hameed give graceful
labelings for graphs constructed by combining theta graphs (that is, a collection of edge
disjoint paths that have common endpoints) with paths and stars. Khatun and Abu
Nayeem [1685] prove that the zero divisor graph of the commutative ring of integers
modulo n is graceful if n = pq, 4p or 9p, where p and q are prime numbers.
The torch graph On is defined by V (On ) = {vi | 1 6 i 6 n + 4}, E(On ) =
{vi vn+1 | 2 6 i 6 n − 2} ∪ {vi vn+3 | 2 6 i 6 n − 2} ∪ {v1 vi | 2 6 i 6 n + 4} ∪
{vn−1 vn , vn vn+2 , vn vn+4 , vn+1 vn+3 }. Manulang and Sugeng [2077] showed that the torch
graph is graceful.
For a graph G, the splitting graph of G, S 0 (G), is obtained from G by adding for each
0 0
vertex v of G a new vertex v so that v is adjacent to every vertex that is adjacent to v.
Sekar [2736] has shown that S 0 (Pn ) is graceful for all n and S 0 (Cn ) is graceful for n ≡ 0, 1
(mod 4). Vaidya and Shah [3304] proved that the square graph of a bistar, the splitting
graph of a bistar, and the splitting graph of a star are graceful graphs.
In [3074] Sudha and Kanniga proved that fans and the splitting graph of a star are
graceful. Sudha and Kanniga [3075] proved that the following graphs are graceful: arbi-
trary supersubdivisions of wheels; combs (Pn K1 ); double fans (Pn K2 ); (Pm ∪Pn ) K1 ;
and graphs obtained by starting with two star graphs Sm and Sn and identifying some
of the pendent vertices of each. Sudha and Kanniga [3076] proved that the graphs ob-
tained from Pn K1 by identifying the center of a Sn with the endpoint of a pendent
edge attached to the endpoint of Pn are graceful; and the graphs obtained from a fan
Pn K1 by deleting a pendent edge attached to an endpoint of Pn are graceful. Sunda
[3069] provided some results on graphs obtained by connecting copies of Km,n in certain
ways. Sudha and Kanniga [3072] proved that the graphs obtained by joining the vertices
of a path to any number isolated points are graceful. They also proved that the arbitrary
supersubdivision of all the edges of helms, combs (Pn K1 ) and ladders (Pn × P2 ) with
pendent edges at the vertices of degree 2 by a complete bipartite graphs K2,m are graceful.
The duplication of an edge e = uv of a graph G is the graph G0 obtained from G by
adding an edge e0 = u0 v 0 such that N (u) = N (u0 ) and N (v) = N (v 0 ). The duplication of
a vertex of a graph G is the graph G0 obtained from G by adding a new vertex v 0 to G
such that N (v 0 ) = N (v). Kaneria, Vaidya, Ghodasara, and Srivastav [1624] proved the
duplication of a vertex of a cycle, the duplication of an edge of an even cycle, and the
graph obtained by joining two copies of a fixed cycle by an edge are graceful.
For a graph G and a vertex v of G, a vertex switching Gv is the graph obtained from G
by removing all edges incident to v and adding edges joining v to every vertex not adjacent
to v in G. Boxwala and Vashishta [606] show that the graph obtained by switching an
arbitrary vertex of Cn (n > 3), the duplication of an arbitrary vertex on the rim of a
wheel with an even number of vertices, and the mirror graph of a path are graceful. Jeba

the electronic journal of combinatorics (2023), #DS6 34

Jesintha and Subashini [1413] proved that the path union of vertex switching of even
cycles in increasing order is graceful.
The join sum of complete bipartite graphs < Km1 ,n1 , . . . , Kmt ,nt > is the graph ob-
tained by starting with Km1 ,n1 , . . . , Kmt ,nt and joining a vertex of each pair Kmi ,ni and
Kmi+1 ,ni+1 to a new vertex vi where 1 6 i 6 k − 1. The path union of a graph G is the
graph obtained by adding an edge from n copies G1 , G2 , . . . , Gn of G from Gi to Gi+1 for
i = 1, . . . , n − 1. We denote this graph by P (n · G). Kaneria, Makadia, and Meghpara
[1604] proved the following graphs are graceful: the graph obtained by joining C4m and
C4n by a path of arbitrary length; the path union of finite many copies of C4n ; and C4n
with twin chords. Kaneria, Makadia, Jariya, and Meghpara [1603] proved that the join
sum of complete bipartite graphs, the star of complete bipartite graphs, and the path
union of a complete bipartite graphs are graceful.
Given connected graphs G1 , G2 , . . . , Gn , Kaneria, Makadia, and Jariya [1602] define a
cycle of graphs C(G1 , G2 , . . . , Gn ) as the graph obtained by adding an edge joining Gi to
Gi+1 for i = 1, . . . , n − 1 and an edge joining Gn to G1 . (The resulting graph can vary
depending on which vertices of the Gi s are chosen.) When the n graphs are isomorphic to
G the notation C(n · G) is used. Kaneria et al. proved that C(2t · C4n ) and C(2t · Kn,n ) are
graceful. In [1605] and [1607] Kaneria, Makadia, and Meghpara prove that the following
P 2t
graphs
Pt are graceful: C(2t · K m,n ); C(C 4n1 , C4n2 , . . . , C 4nt ) when t is even and i=1 ni =
i= 2t ni ; C(2t · Pm × Pn ); the star of Pm × Pn ; and the path union of t copies of Pm × Pn .
Kaneria, Viradia, Jariya, and Makadia [1625] proved the cycle graph C(t · Pn ) is graceful.
The star of graphs G1 , G2 , . . . , Gn , denoted by S(G1 , G2 , . . . , Gn ), is the graph ob-
tained by identifying each vertex of K1,n , except the center, with one vertex from each of
G1 , G2 , . . . , Gn . The case that G1 = G2 = · · · = Gn = G is denoted by S(n · G). In [1616]
and [1617] Kaneria, Meghpara, and Makadia proved the following graphs are graceful:
S(t · Km,n ); S(t · Pm × Pn ); the barycentric subdivision of Pm × Pn (that is, the graph
obtained from Pm × Pn by inserting a new vertex in each edge); the graph obtained by
replacing each edge of K1,t by Pn ; the graph obtained by identifying each end point of
K1,n with a vertex of Km,n ; and the graph obtained by identifying each end point of K1,n
with a vertex of Pm × Pn . Kanani and Kaneria [1573] proved that the following graphs
are graceful: the barycentric subdivision of Cn -snakes (that is, the graph obtained from
the subdivision of Cn by inserting a new vertex in each edge); the barycentric subdivision
of alternate Cn -snakes; and quadrilateral snakes.
Kaneria and Makadia [1593] and [1594] proved the following graphs are graceful: (Pm ×
Pn ) ∪ (Pr × Ps ); C2f +3 ∪ (Pm × Pn ) ∪ (Pr × Ps ), where f = 2(mn + rs) − (m + n + r + s);
the tensor product of Pn and P3 ; the tensor product of Pm and Pn for odd m and n; the
star of C4n ; the t−supersubdivision of Pm × Pn ; and the graph obtained by joining C4n
and a grid graph with a path. In [1615] Kaneria, Meghpara, and Makadia proved that
the star of K1,n is a graceful tree.
The graph Pnt is obtained by identifying one end point from each of t copies of Pn . The
graph Pnt (G1 , G2 , . . . , Gtn ) obtained by replacing each edge of Pnt , except those adjacent
to the vertex of degree t, by the graphs G1 , G2 , . . . , Gtn is called the one point path union
of G1 , G2 , . . . , Gtn . The case where G1 = G2 = · · · = Gtn = H is denoted by Pnt (tn · H)

the electronic journal of combinatorics (2023), #DS6 35

. In [1616] and [1617] Kaneria, Meghpara, and Makadia proved Pnt and Pnt (tn · Km,r ) are
graceful. In [1614] Kaneria and Meghpara proved Pnt (tn·Pr ×Ps ), Pnt (tn·K1,m ), S(t·C4n ),
and Pnt (tn · C4m ) are graceful.
A graph H is said to be a m-super subdivision of a simple graph G, if every edge
of G is replaced by the complete bipartite graph Km,m with m > 2 in such a way that
the end vertices of the edge are merged with any two vertices of the same partite set
A or B of Km,m after removal of the edge of G. Srinivasan, Chidambaram, Devadoss,
Pakkirisamy, and Krishnamoorthi [3046] proved that m-super subdivision of path and
cycle are graceful.
Kanneria and Makadia [1595] define a step grid graph as the graph obtained by starting
with paths Pn , Pn , Pn−1 , . . . , P2 (n > 3) arranged vertically parallel with the vertices in
the paths forming horizontal rows and edges joining the vertices of the rows. In [1595] and
[1596] they prove the following graphs are graceful: step grid graphs; one point union for
a path of step grid graphs; cycles of step grid graphs; stars of step grid graphs; m−super
subdivisions of the step grid graphs; open stars of step grid graphs; one point unions of
paths of step grid graphs; and graphs obtained by joining C4m and step grid graphs with
a path of arbitrary length.
For n even [1597] Kaneria and Makadia [1597] define a double step grid graph
of size n (denoted by DStn ) as the graph obtained by starting with paths
Pn , Pn , Pn−2 , Pn−4 , . . . , P4 , P2 arranged vertically parallel with the vertices in the paths
forming horizontal rows and edges joining the vertices of the rows. They prove the follow-
ing graphs are graceful: double step grid graphs; path unions of copies of DStn ; cycles of
r ≡ 0, 3 (mod 4) copies of double step grid graphs; and stars of double step grid graphs.
In [1609] Kaneria, Makadia and Viradia prove the following graphs are graceful: open
stars of double step grid graphs; one point union of paths of double step grid graphs
Pn t (tn · DStm ); graphs obtained by joining C4m and a double step grid graph with a path
of arbitrary length; and graphs obtained by starting with a cycle Cm + (m ≡ 2 mod 4)
with chords that form a triangle with an edge of the cycle and joining Cm + and a double
step grid graph with a path of arbitrary length.
For even n > 2 Kaneria and Makadia [1598] define a plus graph of size n (denoted by
P ln ) as the graph obtained by starting with paths P2 , P4 , . . . , Pn−2 , Pn , Pn , Pn−2 , . . . , P4 , P2
arranged vertically parallel with the vertices in the paths forming horizontal rows and
edges joining the vertices of the rows. They prove plus graphs, path unions of copies of
P ln , cycles of r ≡ 0, 3 (mod 4) copies of P ln , and stars of plus graphs are graceful. In
[1599] Kaneria and Makadia prove the following graphs are graceful: open stars of plus
graphs; graphs obtained by joining C4m and a plus graph with a path of arbitrary length;
graphs obtained from cycles Cm + (m ≡ 2 (mod 4)) with twin chords that form a triangle
with an edge of the cycle by joining Cm + and a plus graph with a path of arbitrary length.
Kaneria and Makadia [1600] define a swastik graph as the graph obtained from four
copies of C4n (n > 1) with vertices Vi,j ( i = 1, 2, 3, 4, j = 1, 2, . . . , 4n) and identifying
V1,4t and V2,1 , V2,4t and V3,1 , V3,4t and V4,1 , and V4,4t and V1,1 . They proved that path
unions of swastik graphs of the same size, cycles of r ≡ 0, 3 (mod 4) copies of swastik
graphs of the same size, and the star of swastik graphs are graceful. In [1601] Kaneria and

the electronic journal of combinatorics (2023), #DS6 36

Makadia prove the following graphs are graceful: open stars of swastik graphs; one point
unions for paths of swastik graphs; graphs obtain by joining C4m and a swastik graph
with a path of arbitrary length; graphs obtained from cycles Cm (m ≡ 2 (mod 4)) with
twin chords that form a triangle with an edge by joining Cm K1 and a swastik graph
with a path of arbitrary length.
In [1588] and [1587] Kaneria and Jariya define a smooth graceful graph as a bipartite
graph G with q edges with the property that for all positive integers l there exists a map
g : V −→ {0, 1, . . . , b q−12
c, b q+1
2
c+l, b q+3
2
c+l, . . . , q+l} such that the induced edge labeling
map g ? : E −→ {1 + l, 2 + l, . . . , q + l} defined by g ? (e) = |g(u) − g(v)| is a bijection.
Note that by taking l = 0 a smooth graceful labeling is a graceful labeling. Kaneria and
Jariya proved the following graphs are smooth graceful: Pn ; C4n ; K2,n ; Pm × Pn ; and the
graph obtained by joining a cycle C4m+2 with twin chords to C4n . They also proved that
the graph obtained by joining C4m to Wn with a path is graceful. They proved that K1,n
is semi smooth graceful, the star of K1,n is graceful, the path union of a smooth graceful
tree is graceful, and the star of a smooth graceful tree is a graceful tree.
Kaneria, Makadia and Viradia [1610] proved the following: the star of a semi
smooth graceful graph is graceful; Km,n , P (t · H) are semi smooth graceful where H
is a semi smooth graceful graph; step grid graphs; and the cycle graphs C(t · H) are
smooth graceful, when t ≡ (mod 4), H is a semi smooth; C t (m · Cn ), P t (k · T ),
< Cn1 , Pn2 , Cn3 , . . . , Pn2t , Cn2t+1 >, < Km1 ,n1 , Pr1 , Km2 ,n2 , Pr2 , . . . , Prt−1 , Kmt ,nt >,
< Pn1 × Pm1 , Pr1 , Pn2 × Pm2 , . . . , Prt−1 , Pnt × Pmt > are graceful when T is semi smooth
graceful tree.
Kaneria and Meghpara [1613] prove that Bm,n , the splitting graphs S 0 (Bm,n ) and
0
S (Pn ) are semi smooth graceful and if graphs obtained by joining semi smooth graceful
2
graph and Bm,n by an arbitrary path is graceful.
A komodo dragon is formed by attaching a path to a vertex of degree 3 in a cycle with
a chord and attaching star graphs to the end points of the path. A komodo dragon with
many tails is formed by attaching many paths of length two to an endpoint of the path
in a komodo dragon. In [2852] and [2854] Shahul Hameed, Palanivelrajan, Gunasekaran
and Raziya Begam provide graceful labelings of various komodo dragon graphs and their
extensions. In [2853] and [2855] Shahul Hameed et al. investigated the gracefulness of
classes of graphs constructed by combining some subdivisions of certain theta graphs with
stars.
For a bipartite graph G with partite sets X and Y let G0 be a copy of G and X 0
and Y 0 be copies of X and Y . Lee and Liu [1853] define the mirror graph, M (G), of G
as the disjoint union of G and G0 with additional edges joining each vertex of Y to its
corresponding vertex in Y 0 . The case that G = Km,n is more simply denoted by M (m, n).
They proved that for many cases M (m, n) has a stronger form of graceful labeling (see
§3.1 for details).
The total graph T (Pn ) has vertex set V (Pn ) ∪ E(Pn ) with two vertices adjacent when-
ever they are neighbors in Pn . Balakrishnan, Selvam, and Yegnanarayanan [415] have
proved that T (Pn ) is harmonious.
For any graph G with vertices v1 , . . . , vn and a vector m = (m1 , . . . , mn ) of positive

the electronic journal of combinatorics (2023), #DS6 37

integers the corresponding replicated graph, Rm (G), of G is defined as follows. For each
vi form a stable set Si consisting of mi new vertices i = 1, 2, . . . , n (a stable set S consists
of a set of vertices such that there is not an edge vi vj for all pairs vi , vj in S); two
stable sets Si , Sj , i 6= j, form a complete bipartite graph if each vi vj is an edge in G
and otherwise there are no edges between Si and Sj . Ramı́rez-Alfonsı́n [2577] has proved
that Rm (Pn ) is graceful for all m and all n > 1 (see §3.4 for a stronger result) and that
R(m,1,...,1) (C4n ), R(2,1,...,1) (Cn ) (n > 8) and,R(2,2,1,...,1) (C4n ) (n > 12) are graceful.
For any permutation f on 1, . . . , n, the f -permutation graph on a graph G, P (G, f ),
consists of two disjoint copies of G, G1 and G2 , each of which has vertices labeled
v1 , v2 , . . . , vn with n edges obtained by joining each vi in G1 to vf (i) in G2 . In 1983 Lee
(see [1919]) conjectured that for all n > 1 and all permutations on 1, 2, . . . , n, the permu-
tation graph P (Pn , f ) is graceful. Lee, Wang, and Kiang [1919] proved that P (P2k , f ) is
graceful when f = (12)(34) · · · (k, k + 1) · · · (2k − 1, 2k). They conjectured that if G is a
graceful nonbipartite graph with n vertices, then for any permutation f on 1, 2, . . . , n, the
permutation graph P (G, f ) is graceful. Fan and Liang [913] have shown that if f is a per-
mutation in Sn where n > 2(m −Q1) + 2l then the permutation graph P (Pn , f ) is graceful
if the disjoint cycle form of f is l−1 k=0 (m + 2k, m + 2k + 1), and if n >Q 2(m − 1) + 4l the
permutation graph P (Pn , f ) is graceful the disjoint cycle form of f is l−1 k=0 (m + 4k, m +
4k + 2)(m + 4k + 1, m + 4k + 3). For any integer n > 5 and some permutations f in
S(n), Liang and Y. Miao, [1941] discuss gracefulness of the permutation graphs P (Pn , f )
if f = (m, m+1, m+2, m+3, m+4), (m, m+2)(m+1, m+3), (m, m+1, m+2, m+4, m+
3), (m, m+1, m+4, m+3, m+2), (m, m+2, m+3, m+4, m+1), (m, m+3, m+4, m+2, m+1)
and (m, m + 4, m + 3, m + 2, m + 1). In [1943] Liang, Zhang, Xu, Ye, Fan, and Ge prove
the permutation graphs P (Pn , f ) where f is one of the permutations (12345), (2345),
(234), (123456) and (23)(45) are graceful. Some families of graceful permutation graphs
are given in [1846], [1936], and [1174].
In [2640] Rofa defined generalized strongly graceful permutations and discovered two
new permutations in addition to the known permutation that is obtained by replacing
each vertex label f (v) by q − f (v). He use these permutations to prove, by induction,
that a lobster with a perfect matching that consists of the set of end edges of the lobster,
is strongly graceful. He further showed that there exist strongly graceful labelings that
assign the label 0 to four specific vertices of any tree belonging to this family of lobsters.
He provided a tractable way for proving an equivalent form of Bermond conjecture which
states that all lobsters are graceful. Two out of a total of three cases of the proposed
equivalent form of Bermond’s conjecture are completed leaving the third case open for
refutation or completion. As an applications of his results, he provided in [2641] number
systems that are representable by all vertices of a rooted symmetric tree in such a way that
the number representation of each vertex depends on its distance from the root vertex.
In [529] Bell provided methods to combine graceful bipartite graphs to create new
graceful graphs. These methods unify and generalize some well-known results in the
graceful labeling literature. She also found a new class of graceful trees.
The power graph of a finite group G has the elements of G as its vertex set and two
distinct vertices of G are adjacent if one is a power of other. Sehgal, Takshak, Maan, and

the electronic journal of combinatorics (2023), #DS6 38

Malik [2735] proved that the power graph of Z2k−1 × Z4 has a graceful labeling.
A graph (p, q)-graph G(V, E) is said to be (k, d)-hooked Skolem graceful if there exists
a bijection f from V (G) to {1, 2, . . . , p − 1, p + 1} such that the induced edge labeling gf
from E to {k, k+d, . . . , k+(n−1)d} defined by gf (uv) = |f (u)−f (v)| for all uv in E is also
bijective. Such a labeling f is called a (k, d)-hooked Skolem graceful labeling of G. Note
that when k = d = 1, this notion coincides with that of hooked Skolem graceful labeling of
the graph G. In [2383] Pereira, Singh, and Arumugam present some preliminary results on
(k, d)-hooked Skolem graceful graphs and prove that nK2 is (2, 1)-hooked Skolem graceful
if and only if n ≡ 1 or 2 (mod 4).
Gnanajothi [1104, p. 51] calls a graph G bigraceful if both G and its line graph are
graceful. She shows the following are bigraceful: Pm ; Pm × Pn ; Cn if and only if n ≡ 0, 3
(mod 4); Sn ; Kn if and only if n 6 3; and Bn if and only if n ≡ 3 (mod 4). She also shows
that Km,n is not bigraceful when n ≡ 3 (mod 4). (Gangopadhyay and Hebbare [1014]
used the term “bigraceful” to mean a bipartite graceful graph.) Murugan and Arumugan
[2220] have shown that graphs obtained from C4 by attaching two disjoint paths of equal
length to two adjacent vertices are bigraceful.
Several well-known isolated graphs have been examined. Graceful labelings have been
found for the Petersen graph [984], the cube [1032], the icosahedron and the dodecahe-
dron. In [1033] [pp. 163-164] Gardner credits Ashenfelter and Chandra for showing the
Platonic solids have graceful labelings.1 Gardner stated that the icosahedron has only five
fundamentally different graceful labelings, whereas in 2021 Knuth [1706] determined the
correct number to be 24. Graham and Sloane [1147] showed that all of these solids except
the cube are harmonious. Winters [3481] verified that the Grőtzsch graph (see [596, p.
118]), the Heawood graph (see [596, p. 236]), and the Herschel graph (see [596, p. 53])
are graceful. Graham and Sloane [1147] determined all harmonious graphs with at most
five vertices. Seoud and Youssef [2800] did the same for graphs with six vertices.
In 2009 Zak [3569] defined the following generalization of harmonious labelings. For a
graph G(V, E) and a positive integer t > |E| a function h from V (G) to Zt (the additive
group of integers modulo t) is called a t-harmonious labeling of G if h is injective for
t > |V | or surjective for t < |V |, and h(u) + h(v) 6= h(x) + h(y) for all distinct edges
uv and xy. The smallest such t for which G has a t-harmonious labeling is called the
harmonious order of G. Obviously, a graph G(V, E)with |E| > |V | is harmonious if and
only if the harmonious order of G is |E|. Zak determines the harmonious order of complete
graphs, complete bipartite graphs, even cycles, some cases of Pnk , and 2nK3 . He presents
some results about the harmonious order of the Cartesian products of graphs, the disjoint
union of copies of a given graph, and gives an upper bound for the harmonious order of
trees. He conjectures that the harmonious order of a tree of order n is n + o(n). Hegde
and Murthy [1224] proved Zak’s conjecture [3569] using the value sets of polynomials,
which partially proves the cordial tree conjecture by Hovey [1258] that all trees of order
less than a prime p are p-cordial. (See Section 3.7.)
A graceful labeling of Pn is said to be an (a, b; n)-graceful labeling if one endpoint is
labeled a and the other labeled b. A conjecture made in Gvozdjak’s PhD Thesis [1168]
1
D. Knuth called this to my attention.

the electronic journal of combinatorics (2023), #DS6 39

on the Oberwolfach Problem in 2004 is: “An (a, b; n)-graceful labeling of Pn exists if
and only if the integers a, b, n satisfy (1) b − a has the same parity as n(n + 1)/2; (2)
0 < |b − a| 6 (n + 1)/2 and (3) n/2 6 a + b 6 3n/2.” In [3586] Zhang, Zhang, and Wang
showed that the conjecture is true for every n whenever it is true for n 6 4a + 1 and a is
a fixed value. Moreover, they proved that the conjecture is true for a = 0, 1, 2, 3, 4, 5, 6.
For a graph with e edges Vietri [3378] generalizes the notion of a graceful labeling by
allowing the vertex labels to be real numbers in the interval [0, e]. For a simple graph
G(V, E) he defines an injective map γ from V to [0, e] to be a real-graceful labeling of G
+ 2γ(v)−γ(u) = 2e+1 − 2−e − 1, where the sum is taken over all
P γ(u)−γ(v)
provided that 2
edges uv. In the case that the labels are integers, he shows that a real-graceful labeling is
equivalent to a graceful labeling. In contrast to the case for graceful labelings, he shows
that the cycles C4t+1 and C4t+2 have real-graceful labelings. He also shows that the non-
graceful graphs K5 , K6 , and K7 have real-graceful labelings. With one exception, his
real-graceful labels are integers.
The gamma-number (or gracefulness) of a graph G, denoted by γ (G), is the smallest
positive integer n for which there exists an injective function f : V (G) → {0, 1, . . . , n}
such that each uv ∈ E (G) is labeled |f (u) − f (v)| and the resulting edge labels are
distinct. The strong gamma-number of a graph G, denoted by γs (G), is defined to be the
smallest positive integer n such that γ (G) = n with the additional property that there
exists an integer λ so that min {f (u) , f (v)} 6 λ max {f (u) , f (v)} for each uv ∈ E (G).
The strong gamma-number is defined to be +∞, otherwise. Ichishima and Oshima [1314]
proved that if G is a bipartite graph, then γ (mG) 6 mγ (G) + m − 1 for any positive
integer m. They also show that γs (G) < +∞ and γs (G) 6 2γ (G) + 1 for any bipartite
graph G. Moreover, they provide a sharp upper bound for γ (G ∪ H) in terms of γ (G)
and γs (H) when G and H are graphs such that H is bipartite, and give formulas for
the gamma-number of certain forests. In addition to these, they present strong gamma-
number analogues to the gamma-number results and determine the exact values of the
gamma-number and strong gamma-number for all cycles.
A graph G with m vertices and n edges, is said to be prime graceful if there is an
injection φ from the vertices of G to {1, 2, . . . , k} where k = min{2m, 2n} such that
gcd(φ(vi ), φ(vj )) = 1 and the induced injective function φ∗ from the edges of G to
{1, 2, . . . , k −1} defined by φ∗ (vi vj ) = |φ(vi )−φ(vj )|, the resulting edge labels are distinct.
In [2745] Selvarajan and Subramoniam proved paths, cycles, stars, friendship graphs, bis-
tars, C4 ∪ Pn , Km,2 , and Km,2 ∪ Pn have prime graceful labelings.
In 2020 [3572] Zeen El Deen introduced a new type of labeling of a graph as follows.
For any postive integer δ an edge δ-graceful labeling of a graph G(V, E) with P p vertices and
q edges is a bijective f from E to {δ, 2δ, . . . , qδ} such f [V ) = {f (u) = f (uv) mod(kδ)
over all edges v incident to u and k = max(p, q) are pairwise distinct. He proved the
existence of an edge δ−graceful labeling, for any positive integer δ, for wheels, alternate
triangular cycles, double wheels, Cn ×P2 , Wn ×P2 , gears, helms, butterflies, and friendship
graphs. In [3573] Zeen El Deen and Elmahdy showed that for any positive integer δ there
is an edge δ-graceful labeling for the following graphs: the splitting graphs of cycles, fans,
and crowns; the shadow graphs of the paths, cycles, and fans; the middle graphs and the

the electronic journal of combinatorics (2023), #DS6 40

total graphs of paths, cycles, and crowns; twigs; and snails.
In [635] Byers and O’Mellan introduceed a new concept that combines graceful and [635] new
harmonious labelings as follows. A connected graph G with size m is said to be a graceful-
harmonious labeling if there exits injection f : V (G) → {0, 1, 2, . . . , m} such that when
each edge uv is assigned either |f (u) − f (v)| or (f (u) + f (v)) (mod q). each edge receives
a distinct label from the set {0, 1, 2, . . . , m}. They prove that cycles, friendship graphs,
and double cones C4k + K 2 admit graceful-harmonious labelings.
For a graph G(V, E) without isolated vertices, Pereira, Singh, and Arumugam [2382] [2382] new
defined the gracefulness, grac(G), of G as the smallest positive integer k for which there
exists an injective function f : V → {0, 1, 2, . . . , k} such that the edge induced function
gf : E → {1, 2, . . . , k} defined by gf (uv) = |f (u) − f (v)| is also injective. Let c(f ) =
{1, 2, . . . , i} denote the edge labels and let m(G) = max{c(f )}, where the maximum is
taken over all injective functions f : V → N ∪ {0} such that gf is also injective. This
measure m(G) determines how close G is to being graceful. They determine m(G) for
certain cycles and friendship graphs.
A number of authors have investigated the gracefulness of the directed graphs obtained
from copies of directed cycles C ~ m that have a vertex in common or have an edge in
common. A digraph D(V, E) is said to be graceful if there exists an injection f : V (G) →
{0, 1, . . . , |E|} such that the induced function f 0 : E(G) → {1, 2, . . . , |E|} that is defined
by f 0 (u, v) = (f (v) − f (u)) (mod |E| + 1) for every directed edge uv is a bijection. The
notations n · C ~ m and n − C ~ m are used to denote the digraphs obtained from n copies of
C~ m with exactly one point in common and the digraphs obtained from n copies of C ~m
with exactly one edge in common. Du and Sun [855] proved that a necessary condition
for n − C ~ m to be graceful is that mn is even and that n · C ~ m is graceful when m is even.
They conjectured that n · C ~ m is graceful for any odd m and even n. This conjecture was
proved by Jirimutu, Xu, Feng, and Bao in [1558]. Xu, Jirimutu, Wang, and Min [3502]
proved that n − C ~ m is graceful for m = 4, 6, 8, 10 and even n. Feng and Jirimutu (see
[3589]) conjectured that n − C ~ m is graceful for even n and asked about the situation for
odd n. The cases where m = 5, 7, 9, 11, and 13 and even n were proved Zhao and Jirimutu
[3588]. The cases for m = 15, 17, and 19 and even n were proved by Zhao et al. in [3587],
and [2989]. Zhao, Siqintuya, and Jirimutu [3589] proved that a necessary condition for
n−C ~ m to be graceful is that nm is even.
In a 1985 paper Bloom and Hsu [579] say a directed graph D with e edges has a
graceful labeling θ if for each vertex v there is a vertex labeling θ that assigns each
vertex a distinct integer from 0 to e such that for each directed edge (u, v) the integers
θ(v) − θ(u) mod (e + 1) are distinct and nonzero. They conjectured that digraphs whose
underlying graphs are wheels and that have all directed edges joining the hub and the
rim in the same direction and all directed edges in the same direction are graceful. This
conjecture was proved in 2009 by Hegde and Shivarajkumar [1236]. Yao, Yao, and Cheng
[3532] investigated the gracefulness for many orientations of undirected trees with short
diameters and proved some directed trees do not have graceful labelings. Hegde and
Kumudkshi [1222] established the gracefulness of the directed graph that is an orientation
of the planar grid graph Pm × Pn in which each cell is a unicycle of length four. A

the electronic journal of combinatorics (2023), #DS6 41

graceful difference labeling of a directed graph G with vertex set V is a bijection f : V →
{1, . . . , |V |} such that, when each arc uv is assigned the difference label f (v) − f (u), the
resulting arc labels are distinct. Hertz and Picouleau [1246] conjectured that all disjoint
unions of circuits have a graceful difference labeling, except in two particular cases. They
provided partial results that support this conjecture. A survey of results on graceful
digraphs by Feng, Xu, and Jirimutu is given in [921]. Marr [2094] and [2093] summarizes
previously known results on graceful directed graphs and presents some new results on
directed paths, stars, wheels, and umbrellas.
In [2938] Shivarajkumar, Sriraj, and Hegde provided a 2021 survey results on graceful
labeling of digraphs.

2.8 Summary
The results and conjectures discussed above are summarized in the tables following. The
letter G after a class of graphs indicates that the graphs in that class are known to be
graceful; a question mark indicates that the gracefulness of the graphs in the class is an
open problem; we put a question mark after a “G” if the graphs have been conjectured
to be graceful. The analogous notation with the letter H is used to indicate the status of
the graphs with regard to being harmonious. The tables impart at a glimpse what has
been done and what needs to be done to close out a particular class of graphs. Of course,
there is an unlimited number of graphs one could consider. One wishes for some general
results that would handle several broad classes at once but the experience of many people
suggests that this is unlikely to occur soon. The Graceful Tree Conjecture alone has
withstood the efforts of scores of people over the past four decades. Analogous sweeping
conjectures are probably true but appear hopelessly difficult to prove. I thank Don Knuth
for his correspendence about the results of Smith and Puget [3008] in Table 1 regarding
the gracefulness Km × K, Km × Pn , and Km × Cn .

Table 1: Summary of Graceful Results

Graph Graceful
trees G if 6 35 vertices [914]
G if symmetrical [548]
G if at most 4 end-vertices [1268]
G with diameter at most 5 [1259]
G? Ringel-Kotzig
G caterpillars [2648]
G firecrackers [692]
G bananas [2822], [2821]
G? lobsters [544]

cycles Cn G iff n ≡ 0, 3 (mod 4) [2648]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 42
 Table 1 – Continued from previous page
Graph Graceful
wheels Wn G [984], [1255]

helms (see §2.2) G [266]

webs (see §2.2) G [1633]

gears (see §2.2) G [2043]

cycles with Pk -chord (see §2.2) G [798], [2042], [1723], [2531]

Cn with k consec. chords (see §2.2) G if k = 2, 3, n − 3 [1712], [1720]

unicyclic graphs G? iff G 6= Cn , n ≡ 1, 2 (mod 4) [3229]

Pnk G if k = 2 [1633]

(t)
Cn (see §2.2) n = 3 G iff t ≡ 0, 1 (mod 4)
[545], [547]
G? if nt ≡ 0, 3 (mod 4) [1713]
G if n = 6, t even [1713]
G if n = 4, t > 1 [2874]
G if n = 5, t > 1 [3519]
G if n = 7 and t ≡ 0, 3 (mod 4) [3525]
G if n = 9 and t ≡ 0, 3 (mod 4) [3526]
G if t = 2 n 6≡ 1 (mod 4) [2537], [589]
G if n = 11 [3504]

triangular snakes (see §2.2) G iff no. blocks ≡ 0, 1 (mod 4) [2200]

K4 -snakes (see §2.2) ?

quadrilateral snakes (see §2.2) G [1104], [2537]

crowns Cn K1 G [984]

Cn Pk G [2736]

grids Pm × Pn G [41]

prisms Cm × Pn G if n = 2 [987], [3522]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 43

 Table 1 – Continued from previous page
Graph Graceful
G if m even [1271]
G if m odd and 3 6 n 6 12 [1271]
G if m = 3 [2970]
G if m = 6 see [3524]
G if m ≡ 2 (mod 4), n ≡ 3 (mod 4) [3524]

K m × Pn G if (m, n) = (4, 2), (4, 3), (4, 4), (4, 5),

(5, 2), (5, 3), (6, 3), (4, 6), (4, 7), (4, 8)
not G if (3, 3), (m, 2) m = 6, 7, 8, 9, 10,
11,12
not G? for (m, 2) with m > 12 [3008]

Km × Cn G if (m, n) = (4, 3), (3, 4), (4, 4), (4, 5),

(3, 6), (4, 6)
not G for (m, n) = (6, 3) [3008]

Km K1 G if m = 3, 4, 5, 6, 7, 8, 9
not G if m = 10, 11, 12, 13, 14, 15
not G? if m > 15 [3008]

Km,n K1 G [1551]

Km ∪ Kn (m, n > 1) G iff {m, n} = {4, 2} or {5, 2}

St
i=1 Kmi ,ni G 2 6 mi < ni [439]

torus grids Cm × Cn G if m ≡ 0 (mod 4), n even [1561]

not G if m, n odd (parity condition)

vertex-deleted Cm × Pn G if n = 2 [1007]

edge-deleted Cm × Pn G if n = 2 [1007]

Möbius ladders Mn (see §2.3) G [1001]

stacked books Sm × Pn n = 2, G iff m 6≡ 3 (mod 4) [2053],

(see §2.3) [797], [1006]
G if m even [1006]

n-cube K2 × K2 × · · · × K2 G [1741]
Continued on next page

the electronic journal of combinatorics (2023), #DS6 44

 Table 1 – Continued from previous page
Graph Graceful
Kn × P 3 G iff n 6 6 [1707]

Kn G iff n 6 4 [1115], [2964]

Km,n G [2648], [1115]

K1,m,n G [220]

K1,1,m,n G [1104]

(m)
windmills Kn (n > 3) (see §2.4) G if n = 4, m 6 1000 [1271],[7],[3454],[1065]
G? if n = 4, m > 4 [544]
G if n = 5, m = 4, 5 [3055]
not G if n = 4, m = 2, 3 [544]
not G if (m, n) = (2, 5) [547]
not G if n > 5 [1720]

B(n, r, m) r > 1 (see §2.4) G if (n, r) = (3, 2), (4, 3) [1714], (4,2) [797]
G (n, r, m) = (5, 2, 2) [3008]
not G for (n, 2, 2) for n > 5 [546], [3008]

mKn (see §2.5) G iff m = 1, n 6 4 [1745]

C m ∪ Pn G iff m + n > 6 [3222]

Cm ∪ Cn G iff m + n ≡ 0, 3 (mod 4) [24]

Cn ∪ Kp,q for n > 8 G iff n ≡ 0, 3 (mod 4) [3545]

G C6 × K1,2n+1 [439]
G C3 × Km,n iff m, n > 2 [2799]
G C4 × Km,n iff (m, n) 6= (1, 1)[2799]
G C7 × Km,n [2799]
G C8 × Km,n [2799]

Ki ∪ Km,n G [439]
St
i=1 Kmi ,ni G 2 6 mi < ni [439]
St
Cm ∪ i=1 Kmi ,ni G 2 6 mi < ni ,
m ≡ 0 or 3 (mod 4), m > 11 [439]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 45

 Table 1 – Continued from previous page
Graph Graceful
G + Kt G for connected graceful G [1714]

double cones Cn + K2 G for n = 3, 4, 5, 7, 8, 9, 11, 12

not G for n ≡ 2 (mod 4) [2610]

t-point suspension Cn + Kt G if n ≡ 0 or
3 (mod 12) [563]
not G if t is even and
n ≡ 2, 6, 10 (mod 12)
G if n = 4, 7, 11 or 19 [563]
G if n = 5 or 9 and t = 2 [563]

Pn2 (see §2.7) G [1845]

Petersen P (n, k) (see §2.7) G for n = 5, 6, 7, 8, 9, 10 [2610],

(n, k) = (8t, 3) [3361]

Table 2: Summary of Harmonious Results

Graph Harmonious
trees H if 6 31 vertices [915]
H? [1147]
H caterpillars [1147]
? lobsters

cycles Cn H iff n is odd [1147]

wheels Wn H [1147]

helms (see §2.2) H [1104], [1977]

webs (see §2.2) H if cycle is odd

gears (see §2.2) H [693]

cycles with Pk -chord (see §2.2) ?

Cn with k consec. chords ?

Continued on next page

the electronic journal of combinatorics (2023), #DS6 46

 Table 2 – Continued from previous page
Graph Harmonious
(see §2.2)

unicyclic graphs ?

Pnk H if k = 2 [1144], k odd [2762], [3552]

H if k is even and
k/2 6 (n − 1)/2 [3565]

(t)
Cn (see §2.2) n = 3 H iff t 6≡ 2 (mod 4) [1147]
H if n = 4, t > 1 [2874]

triangular snakes (see §2.2) H if number of blocks is odd [3501]

not H if number of blocks ≡ 2
(mod 4) [3501]

K4 -snakes (see §2.2) H [1145]

quadrilateral snakes (see §2.2) ?

crowns Cn K1 H [1144], [1963]

grids Pm × Pn H iff (m, n) 6= (2, 2) [1561]

prisms Cm × Pn H if n = 2, m 6= 4 [1007]
H if n odd [1147]
H if m = 4 and n > 3 [1561]

torus grids Cm × Cn , H if m = 4, n > 3 [1561]

not H if m 6≡ 0 (mod 4),
n odd [1561]

vertex-deleted Cm × Pn H if n = 2 [1007]

edge-deleted Cm × Pn H if n = 2 [1007]

Möbius ladders Mn (see §2.3) H iff n 6= 3 [1001]

stacked books Sm × Pn (see §2.3) n = 2, H if m even [1143], [2611]

not H m ≡ 3 (mod 4), n = 2,
(parity condition)
Continued on next page

the electronic journal of combinatorics (2023), #DS6 47

 Table 2 – Continued from previous page
Graph Harmonious
H if m ≡ 1 (mod 4), n = 2 [1104]

n-cube K2 × K2 × · · · × K2 H if and only if n > 4 [1310]

K4 × P n H [2611]

Kn H iff n 6 4 [1147]

Km,n H iff m or n = 1 [1147]

K1,m,n H [220]

K1,1,m,n H [1104]

(m)
windmills Kn (n > 3) (see §2.4)
H if n = 4 [1263]
m = 2, H? iff n = 4 [1147]
not H if m = 2, n odd or 6 [1147]
not H for some cases m = 3 [1962]
B(n, r, m) r > 1 (see §2.4) (n, r) = (3, 2), (4, 3) [2796]

mKn (see §2.5) H n = 3, m odd [1964]

not H for n odd and
m ≡ 2 (mod 4) [1964]

nG H when G is harmonious and

n odd [3543]

Gn H when G is harmonious and

n odd [3543]

Cm ∪ P n H n = 1 iff m 6= 2 mod 4 [2284]

H n = 2 [2284]
H (m, 3) odd m > 3 [2614], [2284]
H? (m, 3) m > 3

fans Fn = Pn + K1 H [1147]

nCm + K1 n 6≡ 0 mod 4 H [693]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 48

 Table 2 – Continued from previous page
Graph Harmonious
double fans Pn + K2 H [1147]

t-point suspension Pn + Kt of Pn H [2611]

S m + K1 H [1104], [674]

t-point suspension Cn + Kt of Cn H if n odd and t = 2 [2611], [1104]

not H if n ≡ 2, 4, 6 (mod 8)
and t = 2 [1104]

Petersen P (n, k) (see §2.7) H [1104], [1881]

the electronic journal of combinatorics (2023), #DS6 49

3 Variations of Graceful Labelings
3.1 α-labelings
In 1966 Rosa [2648] defined an α-labeling (or α-valuation) as a graceful labeling with
the additional property that there exists an integer k so that for each edge xy either
f (x) 6 k < f (y) or f (y) 6 k < f (x). (Other names for such labelings are balanced,
interlaced, and strongly graceful.) It follows that such a k must be the smaller of the two
vertex labels that yield the edge labeled 1. Also, a graph with an α-labeling is necessarily
bipartite and therefore can not contain a cycle of odd length. Wu [3490] has shown that a
necessary condition for a bipartite graph with n edges and degree sequence d1 , d2 , . . . , dp
to have an α-labeling is that the gcd(d1 , d2 , . . . , dp , n) divides n(n − 1)/2. Barrientos and
Minion [468] proved that any tree of size n and excess  is a spanning tree of a graph of
size n +  that admits an α-labeling.
For a path with consecutive vertices v1 , v2 , . . . , vn a triangular tree is the tree obtained
identifying each vi to an end vertex of the path Pi . Barrientos [446] proved that all
triangular trees admit an α-labeling. He also presented several ways to combine this type
of trees to construct new trees and unicyclic graphs that can α-labeled.
A common theme in graph labeling papers is to build up graphs that have desired
labelings from pieces with particular properties. In these situations, starting with a
graph that possesses an α-labeling is a typical approach. (See [674], [1144], [692], and
[1561].) Moreover, Jungreis and Reid [1561] showed how sequential labelings of graphs
(see Section 4.1) can often be obtained by modifying α-labelings of the graphs.
Graphs with α-labelings have proved to be useful in the development of the theory of
graph decompositions. Rosa [2648], for instance, has shown that if G is a graph with q
edges and has an α-labeling, then for every natural number p, the complete graph K2qp+1
can be decomposed into copies of G in such a way that the automorphism group of the
decomposition itself contains the cyclic group of order p. In the same vein El-Zanati
and Vanden Eynden [886] proved that if G has q edges and admits an α-labeling then
Kqm,qn can be partitioned into subgraphs isomorphic to G for all positive integers m and
n. Although a proof of Ringel’s conjecture that every tree has a graceful labeling has
withstood many attempts, examples of trees that do not have α-labelings are easy to
construct (one example is the subdivision graph of K1,3 — see [2648]). Kotzig [1739] has
shown however that almost all trees have α-labelings. Sethuraman and Ragukumar [2827]
have proved that every tree is a subtree of a graph with an α-labeling.
As to which graphs have α-labelings, Rosa [2648] observed that the n-cycle has an α-
labeling if and only if n ≡ 0 (mod 4) whereas Pn always has an α-labeling. Other familiar
graphs that have α-labelings include caterpillars [2648], the n-cube [1738], Möbius ladders
Mn when n is odd (see §2.3) for the definition) [2352], B4n+1 (i.e., books with 4n+1 pages)
[1006], C2m ∪ C2m and C4m ∪ C4m ∪ C4m for all m > 1 [1740], C4m ∪ C4m ∪ C4n for all
(m, n) 6= 1, 1) [905], Pn × Qn [2053], K1,2k × Qn [2053], C4m ∪ C4m ∪ C4m ∪ C4m [1798],
C4m ∪ C4n+2 ∪ C4r+2 , C4m ∪ C4n ∪ C4r when m + n 6 r [24], C4m ∪ C4n ∪ C4r ∪ C4s when
m > n + r + s [20], C4m ∪ C4n ∪ C4r+2 ∪ C4s+2 when m > n + r + s + 1 [20], ((m + 1)2 + 1)C4
for all m [3596], k 2 C4 for all k [3596], and (k 2 + k)C4 for all k [3596]. Abrham and Kotzig

the electronic journal of combinatorics (2023), #DS6 50

[22] have shown kC4 has an α-labeling for 4 6 k 6 10 and that if kC4 has an α-labeling
then so does (4k + 1)C4 , (5k + 1)C4 , and (9k + 1)C4 . Eshghi [898] proved that 3C4k and
5C4k have an α-labeling for all k. In [905] Eshghi and Carter show several families of
graphs of the form C4n1 ∪ C4n2 ∪ · · · ∪ C4nk have α-labelings.
In [901] Eshghi provides an integer programming model and a Tabu search algorithm
to generate α-labelings of the quadratic graphs mC4k ) where 6 > m > 10 and 2 > k > 10.
(See also [907].) The computational complexity of the gracefulness of a graph is not
known, but the complexity of finding a harmonious labeling of a graph is in the NP-class
[176]. Research on programming models for finding graceful labelings of graphs can be
found in [897], [907], [906], [1795], [2674], [903], [2610], [3008], [2066], and [2844].
In [176] Amini and Eshghi gave a new mathematical integer programming model for
the graph labeling graphs of the form mCn (some authors use the notation Q(m, n)).
The advantages of this model are linearity and the existence of an objective function.
They also gave two constraint programming models and a meta-heuristics algorithm that
generate feasible graceful labeling and α-labeling for special classes of quadratic graphs.
Their results include: mC4k with 1 6 11 and less than 1000 vertices has an α-labeling
with the exception of 3C4 ; 12C4k has α-labeling for 1 6 k 6 19; and 13C4k has α-labeling
for 1 6 k 6 13. In [906] and [2674] Eshghi and Salarrezaei proved that 7C4k has an
α-labeling for all k. Lakshmi and Vangipuram [1795] proved that 4C4k is graceful.
In [470], Barrientos and Minion investigated series-parallel operations with graphs
that admit α-labelings. They provided necessary conditions on the graphs G1 and G2
to obtain a new α-labeled graph G through each of these operations. As consequence of
the series operation, they proved that the one-point union of three or four copies of Kn,n
has an α-labeling, and that any tree with maximum degree four that can be decomposed
into copies of the path of length eleven has an α-labeling when the distance between any
pair of vertices of degree four is even. They also showed that any graph of order n + 1
and size n with an α-labeling is an induced subgraph of a graph of order n + 3 and size
2n+ 1. Additionally, they presented an α-labeling for any graph of the form K2,n ×Pm . In
[448] Barrientos used vertex and edge duplications, replications of the entire graph, and
k-vertex amalgamations to generate α-labeled graphs. He proved that for some families of
graphs, it is possible to duplicate several vertices or edges. Using k-vertex amalgamations
he obtained an α-labeling of a graph that can be decomposed into multiple copies of a
given α-labeled graph as well as a robust family of irregular grids that can α-labeled.
Figueroa-Centeno, Ichishima, and Muntaner-Batle [935] have shown that if m ≡ 0
(mod 4) then the one-point union of 2, 3, or 4 copies of Cm admits an α-labeling, and
if m ≡ 2 (mod 4) then the one-point union of 2 or 4 copies of Cm admits an α-labeling.
They conjecture that the one-point union of n copies of Cm admits an α-labeling if and
only if mn ≡ 0 (mod 4).
Pei-Shan Lee [1835] proved that C6 ×P2t+1 and gear graphs have α-labelings. He raises
the question of whether C4m+2 × P2t+1 has an α-labeling for all m. Brankovic, Murch,
Pond, and Rosa [608] conjectured that all trees with maximum degree three and a perfect
matching have an α-labeling.
In his 2001 Ph. D. thesis Selvaraju [2739] investigated the one-point union of complete

the electronic journal of combinatorics (2023), #DS6 51

bipartite graphs. He proves that the one-point unions of the following forms have an
α-labeling: Km,n1 and Km,n2 ; Km1 ,n1 , Km2 ,n2 , and Km3 ,n3 where m1 6 m2 6 m3 and
n1 < n2 < n3 ; Km1 ,n , Km2 ,n , and Km3 ,n where m1 < m2 < m3 6 2n.
Zhile [3596] uses Cm (n) to denote the connected graph all of whose blocks are Cm and
whose block-cutpoint-graph is a path. He proves that for all positive integers m and n,
C4m (n) has an α-labeling but Cm (n) does not have an α-labeling when m is odd.
Abrham and Kotzig [24] have proved that Cm ∪ Cn has an α-labeling if and only if
both m and n are even and m + n ≡ 0 (mod 4). Kotzig [1740] has also shown that
C4 ∪ C4 ∪ C4 does not have an α-labeling. He asked if n = 3 is the only integer such that
the disjoint union of n copies of C4 does not have an α-labeling. This was confirmed by
Abrham and Kotzig in [23]. Eshghi [897] proved that every 2-regular bipartite graph with
3 components has an α-labeling if and only if the number of edges is a multiple of four
except for C4 ∪ C4 ∪ C4 . In [900] Eshghi gives more results on the existence of α-labelings
for various families of disjoint union of cycles.
Jungreis and Reid [1561] investigated the existence of α-labelings for graphs of the
form Pm × Pn , Cm × Pn , and Cm × Cn (see also [1004]). Of course, the cases involving
Cm with m odd are not bipartite, so there is no α-labeling. The only unresolved cases
among these three families are C4m+2 × P2n+1 and C4m+2 × C4n+2 . All other cases result
in α-labelings.
Let v1,j , v2,j , . . . , vm,j be the consecutive vertices of the jth copy of Pm in Pm × Pn . An
elementary transformation of Pm ×Pn is the graph obtained by replacing the edge vi,j vi+1,j
by the new edge vi−x,j vi+1+x,j . A graph is said to be a grid-like graph if it is obtained
through a sequence of elementary transformations. In [471] Barrientos and Minion proved
the exitence of an α-labeling for any grid-like graph. As consequence of this result, they
showed that the graphs C4t × Pn ∪ Pn and C4t × Pn ∪ Pt−1 × Pn admit α-labelings.
Balakrishman [408] uses the notation Qn (G) to denote the graph P2 ×P2 ×· · ·×P2 ×G
where P2 occurs n − 1 times. Snevily [3011] has shown that the graphs Qn (C4m ) and the
cycles C4m with the path Pn adjoined at each vertex have α-labelings. He [3012] also has
shown that compositions of the form G[Kn ] (see §2.3 for the definition) have an α-labeling
whenever G does (see §2.3 for the definition of composition). Balakrishman and Kumar
[412] have shown that all graphs of the form Qn (G) where G is K3,3 , K4,4 , or Pm have an
α-labeling. Balakrishman [408] poses the following two problems. For which graphs G
does Qn (G) have an α-labeling? For which graphs G does Qn (G) have a graceful labeling?
Rosa [2648] has shown that Km,n has an α-labeling (see also [436]). In [1313] Ichishima
and Oshima proved that if m, s and t are integers with m > 1, s > 2, and t > 2, then
the graph mKs,t has an α-labeling if and only if (m, s, t) 6= (3, 2, 2). Barrientos [436]
has shown that for n even the graph obtained from the wheel Wn by attaching a pendent
edge at each vertex has an α-labeling. In [443] Barrientos shows how to construct graceful
graphs that are formed from the one-point union of a tree that has an α-labeling, P2 , and
the cycle Cn . In some cases, P2 is not needed. Qian [2537] has proved that quadrilateral
snakes have α-labelings. Yu, Lee, and Chin [3562] showed that Q3 -and Q3 -snakes have
α-labelings. Fu and Wu [991] showed that if T is a tree that has an α-labeling with partite
sets V1 and V2 then the graph obtained from T by joining new vertices w1 , w2 , . . . , wk to

the electronic journal of combinatorics (2023), #DS6 52

every vertex of V1 has an α-labeling. Similarly, they prove that the graph obtained from T
by joining new vertices w1 , w2 , . . . , wk to the vertices of V1 and new vertices u1 , u2 , . . . , ut
to every vertex of V2 has an α-labeling. They also prove that if one of the new vertices of
either of these two graphs is replaced by a star and every vertex of the star is joined to
the vertices of V1 or the vertices of both V1 and V2 , the resulting graphs have α-labelings.
Fu and Wu [991] further show that if T is a tree with an α-labeling and the sizes of the
two partite sets of T differ by at most 1, then T × Pm has an α-labeling. Zhao, Ma, and
Yao [3591] proved that a class of super lobster trees have α-labelings. Ghosh [1096] uses
various methods of joining graceful graphs and graphs with α-labelings to obtain some
classes of graceful lobsters. Lalitha and Tamilselvi [1796] proved that the hexagonal snake
graph has an α-labeling.
Selvaraju and G. Sethurman [2744] prove that the graphs obtained from a path Pn
by joining all the pairs of vertices u, v of Pn with d(u, v) = 3 and the graphs obtained by
identifying one of vertices of degree 2 of such graphs with the center of a star and the
other vertex the graph of degree 2 with the center of another star (the two stars needs
need not have the same size) have α-labelings. They conjecture that the analogous graphs
where 3 is replaced with any t with 2 6 t 6 n − 2 have α-labelings.
Makadia, Karavadiya, and Kanerian [2070] proved that the graph obtained by merging
t consecutive vertices of two cycle C4r and C4s has an α-labeling when t 6 2min{r, s}.
They also proved that if G1 has an α-labeling and G2 is graceful then there exists a
graceful labeling of the graph obtained by joining G1 and G2 by any path. Moreover, if
both G1 and G2 have α-labelings then there exists an α-labeling of the graph obtained by
joining G1 and G2 by any path. Let Cn1 , Cn2 , . . . , Cnk be a collection of cycles. In [469],
Barrientos and Minion say that a graph G is the coalescence of these cycles if for every
2 6 i 6 k, the first ti vertices of Cni are identified with the last ti vertices of Cni−1 , where
ti 6 ni /2. They proved that the coalescence of these cycles admits an α-labeling when
each ni ≡ 0( mod 4).
Lee and Liu [1853] investigated the mirror graph M (m, n) of Km,n (see §2.3 for the
definition) for α-labelings. They proved: M (m, n) has an α-labeling when n is odd or
m is even; M (1, n) has an α-labeling when n ≡ 0 (mod 4); M (m, n) does not have an
α-labeling when m is odd and n ≡ 2 (mod 4), or when m ≡ 3 (mod 4) and n ≡ 4 (mod
8).
Kumar, Mishra, Kumar, and Kumar [1774] proved that the following graphs have
alpha labelings: C4n K1 , the graph obtained by joining any path to a vertex of C4n , and
graphs obtained by joining two isomorphic copies of C4n K1 .
Barrientos and Minion [460] proved that the Cartesian product of two α-trees is an
α-tree when both trees admit α-labelings and their stable sets are balanced. (A stable set
S consists of a set of vertices such that there is not an edge vi vj for all pairs vi , vj in S).
In addition, they present a tree that has the property that when any number of pendent
vertices are attached to the vertices of any subset of its smaller stable set the resulting
graph is an α-tree. They also prove of an α-labeling of three types of graphs obtained by
connecting, sequentially, any number of paths of equal size.
Barrientos [437] defines a chain graph as one with blocks B1 , B2 , . . . , Bm such that for

the electronic journal of combinatorics (2023), #DS6 53

every i, Bi and Bi+1 have a common vertex in such a way that the block-cutpoint graph
is a path. He shows that if B1 , B2 , . . . , Bm are blocks that have α-labelings then there
exists a chain graph G with blocks B1 , B2 , . . . , Bm that has an α-labeling. He also shows
that if B1 , B2 , . . . , Bm are complete bipartite graphs, then any chain graph G obtained by
concatenation of these blocks has an α-labeling.
The symmetric product G1 ⊕ G2 of G1 and G2 is the graph with vertex set V (G1 ) ×
V (G2 ) and edge set {(u1 , v1 )(u2 , v2 )} where u1 u2 is an edge in G1 or v1 v2 is an edge in G2
but not both u1 u2 is an edge in G1 and v1 v2 is an edge in G2 . A snake of length n > 1 is a
packing of n congruent geometrical objects, called cells, such that the first and the last cell
each has only one neighbor and all n − 2 cells in between have exactly two neighbors. In
[456] Barrientos and Minion define a snake polyomino as a snake with square cells. They
prove that given two graphs of sizes m and n with α-labelings, the graph that results
from the edge amalgamation (identification of two edges) of the edges of weight 1 and n,
also has an α-labeling. They use that result to prove the existence of α-labelings of snake
polyominoes and hexagonal chains. The result about snake polyominoes partially answers
the question of Acharya. In [457], they prove that the third power of a caterpillar admits
an α-labeling and that the symmetric product G ⊕ 2K1 has an α-labeling when G does.
In addition they prove that G ∪ Pm is graceful provided that G admits an α-labeling that
does not assign the integer λ + 2 as a label, where λ is its boundary value. They ask if
all triangular chains are graceful.
In [462] Barrientos and Minion proved that under certain conditions, the union Cr ∪ G
of the cycle Cr and a caterpillar G admits a graceful labeling when r is odd, and an
α-labeling when r is even. They also proved the existence of an α-labeling for any tree
obtained by connecting with a path of length two the central vertices of Gi and Gi+1 , where
Gi is a caterpillar of diameter 2d with bipartite sets Ai and Bi such that |Ai | = |Bi | + 1
and Ai contains the vertices of maximum eccentricity in Gi .
Let T1 , T2 , . . . , Ts be trees. A chain tree obtained by identifying, for every 1 6 i 6 s−1,
a vertex of Ti with a vertex of Ti+1 . In [463], Barrientos and Minion prove that if every Ti
admits an α-labeling, then there exists a chain tree that also admits an α-labeling. Let T
be a tree of size n and v be a fixed vertex of T . The tree Tv+r is obtained by connecting,
with a path of length r, two copies of T , by identifying the end-point of this path with
the vertices v of each copy of T . They give necessary conditions for the existence of an
α-labeling for a tree Tv+2 , where v is any of the vertices labeled λ, λ − 1, . . . , λ − deg(v) − 1
by an α-labeling with boundary value λ that assigns the labels λ + 1, λ + 2, . . . , λ + deg(v)
to leaves of T . In addition they proved that Tv+4 has an α-labeling if there exists an α-
labeling f of T , with boundary value λ, such that f (v) = λ − 1. In [463], Barrientos and
Minion prove the following.The tree ⊕(T1 , T2 , T3 , T4 ) obtained by connecting to a new
vertex w, the vertices labeled n in T1 and T3 and the vertices labeled n/2 in T2 and T4 ,
where Ti is an α-labeled tree of even size n that has partite sets of cardinality n/2 and
n/2 + 1. If G is a graph of order m and size n, with m < n, that admits an α-labeling,
and H is any graceful graph of size t − 1, then tG ∪ H is a graceful graph. For every
m > n, m > 3, n > 2, and t > 2, tKm,n ∪ Lt−1 admits an α-labeling where Lt−1 is any
linear forest of size t − 1. If G is a graph of order m and size n, with m < n, that admits

the electronic journal of combinatorics (2023), #DS6 54

an α-labeling, then tG ∪ Lt−1 also admits an α-labeling when Lt−1 is a linear forest of
size t − 1. As a consequence of this result they prove that tG ∪ Pt admits an α-labeling
provided that G does.
Barrientos [467] showed that all lobsters constructed with k copies of any caterpillar of
diameter four by connecting the central vertices of all pairs of consecutive copies with an
edge have an α-labeling. Additionally, he proved that any chain-tree formed by caterpillars
and this type of lobsters admits an α-labeling. Barrientos and Minion [471] say that a tree
is regular when the cardinalities of its stable sets are equal or differ by one. They prove
if S and T are regular trees that admit α-labelings then S × T also admits an α-labeling.
They use this result to prove that S × T admits a sequential labeling (see Section 4.1)
as well as a harmonious labeling. They define a fence as the tree obtained by connecting
an internal vertex of Pni with an internal vertex of Pni+1 by a path of length li for every
1 6 i 6 t. They prove the existence of an α-labeling for any fence constructed with t
copies of Pn , where li = 2. They define a 2-link fence as the graph obtained by connecting
with an edge, two vertices of the ith copy of Pn , with the corresponding two vertices of
the (i + 1)th copy of Pn . They prove that all such graphs admit α-labelings. In [467]
Barrientos says that a fence is irregular if two consecutive copies of Pn are connected by
one or two pairs of corresponding vertices. He proved that all irregular fences have an
α-labeling provided that all their Eulerian subgraphs have size divisible by four. In [472]
Barrientos and Minion study subfamilies of 2-link fences, a subfamily of column-convex
polyominoes, and a subfamily of irregular cyclic-snakes. They prove that under certain
conditions, an α-labelings of these graphs can be transformed into harmonious labelings.
Barrientos and Minion [474] provided new families of harmoniously labeled graphs
built on α-labeled tress. Among them are Pn k , the join of G and tK1 where G has a
restrictive type of harmonious labeling and its order is different of its size by at most one,
Km,n ∪ K1,m−1 , and G ∪ T where G is a unicyclic graph and T is a tree built with α-trees.
They also showed that almost all trees admit harmonious labelings.
In [466] Barrientos and Minion extend the concept of vertex amalgamation as follows.
The k-vertex amalgamation of G1 and G2 is the graph obtained by identifying k indepen-
dent vertices of G1 with k independent vertices of G2 . A t-fold of a graph G is obtained
using t-copies of G, where the ith copy of G is k-vertex amalgamated with the (i + 1)th
copy of G. They prove that if G admits an α-labeling, then any t-fold of G admits an
α-labeling. They consider a more general version of this construction for the case where G
is a tree. They also introduce a new family of trees that admit α-labelings; in particular,
they prove that any tree of diameter 2n formed by identifying the end-vertices of four
caterpillars admits an α-labeling.
Fronček, Kingston, and Vezina [973] generalized snake polyomino graphs by intro-
ducing straight simple polyominal caterpillars and proving that they also admit an alpha
labeling. This implies that every straight simple polyominal caterpillar with n edges
decomposes the complete graph K2kn+1 for any positive integer k. In [967] Fronček in-
troduced a similar family of graphs called full hexagonal caterpillars and prove that they
admit an alpha labeling. This implies that every full hexagonal caterpillar with n edges
decomposes the complete graph K2kn+1 for any positive integer k.

the electronic journal of combinatorics (2023), #DS6 55

 Golomb [1116] introduced polyominoes in 1953 in a talk to the Harvard Mathematics
Club. Polyominoes are planar shapes made by connecting a certain number of equal-sized
squares, each joined together with at least one other square along an edge.
A graph G = (V (G), E(G)) is even graceful if there exists an injection f from the set
of vertices V (G) to {0, 1, 2, 3, 4, . . . , 2|E(G)|} such that when each edge uv is assigned
the label |f (u) − f (v)|, the resulting edge labels are 2, 4, 6, . . . , 2|E(G)|. Elsonbaty and
Mohamed [876] use even graceful labelings to give a new proof for necessary and suffi-
cient conditions for the gracefulness of cycles. They extend this technique to odd graceful
and super Fibonacci graceful labelings of cycle graphs (see §3.3). The polar grid graph
Pm,n consists of n copies of Cm numbered from the inner most cycle to the outer cycle
as C ( 1)m , . . . , C ( n)m and m copies of paths Pn+1 intersected at the center vertex v0 num-
bered as P ( 1)n+1 , . . . , P ( m)n+1 In [877] Elsonbaty and Daoud provided edge even graceful
labelings for various classes of Pm × Cn . El Dean [3571] obtained an edge even graceful
labeling for Y -trees, double stars Bn,m , hK1,2n : K1,2m i, P2n−1 K2m , K2 + Pn , the cycle
v1 , v2 , . . . , v2n with a chord from v1 to vn , P2 Cn , flags, and flowers. Zeen El Deen and
Omar [3575] gave sufficient conditions for Km,n to have an edge even graceful labeling.
They also provided edge even graceful labelings of the join of K1 with stars, wheels, and
sunflowers, and the join of K2 with stars and wheels. For results on Fibonacci trees see
[1716].
Wu ([3489] and [3491]) has given a number of methods for constructing larger grace-
ful graphs from graceful graphs. Let G1 , G2 , . . . , Gp be disjoint connected graphs. Let
wi be in Gi for 1 6 i 6 p. Let w be a new vertex not in any Gi . Form a new
graph ⊕w (G1 , G2 , . . . , Gp ) by adjoining to the graph G1 ∪ G2 ∪ · · · ∪ Gp the edges
ww1 , ww2 , . . . , wwp . In the case where each of G1 , G2 , . . . , Gp is isomorphic to a graph G
that has an α-labeling and each wi is the isomorphic image of the same vertex in Gi , Wu
shows that the resulting graph is graceful. If f is an α-labeling of a graph, the integer
k with the property that for any edge uv either f (u) 6 k < f (v) or f (v) 6 k < f (u)
is called the boundary value or critical number of f . Wu [3489] has also shown that if
G1 , G2 , . . . , Gp are graphs of the same order and have α-labelings where the labelings for
each pair of graphs Gi and Gp−i+1 have the same boundary value for 1 6 i 6 n/2, then
⊕w (G1 , G2 , . . . , Gp ) is graceful. In [3487] Wu proves that if G has n edges and n + 1
vertices and G has an α-labeling with boundary value λ, where |n − 2λ − 1| 6 1, then
G × Pm is graceful for all m.
Given graceful graphs H and G with at least one having an α-labeling Wu and Lu
[3492] define four graph operations on H and G that when used repeatedly or in turns
provide a large number of graceful graphs. In particular, if both H and G have α-labelings,
then each of the graphs obtained by the four operations on H and G has an α-labeling.
Ajitha, Arumugan, and Germina [161] use a construction of Koh, Tan, and Rogers
[1722] to create trees with α-labelings from smaller trees with graceful labelings. These
in turn allows them to generate large classes of trees that have a type of called edge-
antimagic labelings (see §6.1). Shiue and Lu [2937] prove that the graph obtained from
K1,k by replacing each edge with a path of length 3 has an α-labeling if and only if k 6 4.
In [3371] Venkatesh and Bharathi recursively construct new trees starting with caterpillars

the electronic journal of combinatorics (2023), #DS6 56

that admit α-lableings.
Seoud and Helmi [2777] have shown that all gear graphs have an α-labeling, all dragons
with a cycle of order n ≡ 0 (mod 4) have an α-labeling, and the graphs obtained by
identifying an endpoint of a star Sm (m > 3) with a vertex of C4n has an α-labeling.
Mavonicolas and Michael [2110] say that trees hT1 , θ1 , w1 i and hT2 , θ2 , w2 i with roots
w1 and w2 and |V (T1 )| = |V (T2 )| are gracefully consistent if either they are identical or
they have α-labelings with the same boundary value and θ1 (w1 ) = θ2 (w2 ). They use
this concept to show that a number of known constructions of new graceful trees using
several identical copies of a given graceful rooted tree can be extended to the case where
the copies are replaced by a set of pairwise gracefully consistent trees. In particular,
let hT, θ, wi and hT0 , θ0 , w0 i be gracefully labeled trees rooted at w and w0 respectively.
They show that the following four constructions are adaptable to the case when a set
of copies of hT, θ, wi is replaced by a set of pairwise gracefully consistent trees. When
θ(w) = |E(T )| the garland construction due to Koh, Rogers, and Tan [1715] gracefully
labels the tree consisting of h copies of hT, wi with their roots connected to a new vertex
r. In the case when θ(w) = |E(T )| and whenever uw ∈ E(T ) and θ(u) 6= 0, then
vw ∈ E(T ) where θ(u) + θ(v) = |E(T )|, the attachment construction of Koh, Tan and
Rogers [1722] gracefully labels the tree formed by identifying the roots of h copies of
hT, wi. A construction given by Koh, Tan and Rogers [1722] gracefully labels the tree
formed by merging each vertex of hT0 , w0 i with the root of a distinct copy of hT, wi. When
θ0 (w0 ) = |E(T0 )|, let N be the set of neighbors of w0 and let x be the vertex of T at even
distance from w with θ(x) = 0 or θ(x) = |E(T )|. Then a construction of Burzio and
Ferrarese [633] gracefully labels the tree formed by merging each non-root vertex of T0
with the root of a distinct copy of hT, wi so that for each v ∈ N the edge vw0 is replaced
with a new edge xw0 (where x is in the corresponding copy of T ).
Snevily [3012] says that a graph G eventually has an α-labeling provided that there is
a graph H, called a host of G, which has an α-labeling and that the edge set of H can
be partitioned into subgraphs isomorphic to G. He defines the α-labeling number of G to
be Gα = min{t : there is a host H of G with |E(H)| = t|G|}. Snevily proved that even
cycles have α-labeling number at most 2 and he conjectured that every bipartite graph
has an α-labeling number. This conjecture was proved by El-Zanati, Fu, and Shiue [883].
There are no known examples of a graph G with Gα > 2. In [3012] Snevily conjectured
that the α-labeling number for a tree with n edges is at most n. Shiue and Fu [2935] proved
that the α-labeling number for a tree with n edges and radius r is at most dr/2en. They
also prove that a tree with n edges and radius r decomposes Kt for some t 6 (r + 1)n2 + 1.
Ahmed and Snevily [124] investigated the claim that for every tree T there exists an
α-labeling of T , or else there exists a graph HT with an α-labeling such that HT can be
decomposed into two edge-disjoint copies of T . They proved this claim is true for the
graphs Cm,k obtained from K1,m by replacing each edge in K1,m with a path of length k.
A graph G with vertex set V and edge set E is called super edge-graceful if there
is a bijection f from E to {0, ±1, ±2, . . . , ±(|E| − 1)/2} when |E| is odd and from E to
{±1, ±2,P . . . , ±|E|/2} when |E| is even such that the induced vertex labeling f ∗ defined by
f ∗ (u) = f (uv) over all edges uv is a bijection from V to {0, ±1, ±2, . . . , ±(|V | − 1)/2}

the electronic journal of combinatorics (2023), #DS6 57

when |V | is odd and from V to {±1, ±2, . . . , ±|V |/2} when |V | is even. Clifton and
Khodkar [750] proved that graphs formed by identifying the endpoint of a path Pn and
a vertex of a cycle (kites) with n > 5 vertices, n 6= 6 are super edge-graceful. Khodkar,
Nolen, and Perconti [1691] proved that all complete bipartite graphs except for K2,2 , K2,3 ,
and K1,n (n odd) are super edge-graceful. Khodkar [1693] and [1692] proved that all
complete tripartite graphs except K1,1,2 are super edge-graceful and that the union of
vertex disjoint 3-cycles is super edge-graceful. Lee, Su, and Wei [1899] provide a family
of trees of odd orders which are super edge-graceful.
For a tree T with m edges, the α-deficit αdef (T ) equals m−α(T ) where α(T ) is defined
as the maximum number of distinct edge labels over all bipartite labelings of T . Rosa
and Siran [2651] showed that for every m > 1, αdef (Cm,2 ) = bm/3c, which implies that
0
(Cm,2 )α > 2 for m > 3. Ahmed and Snevily [124] define the graph Cm,j as a comet-
like tree with a central vertex of degree m where each neighbor of the central vertex is
attached to j pendent vertices for 1 6 j 6 (m − 1). For m > 3 and 1 6 j 6 (m − 1)
0 0
they prove: (Cm,j )α 6 2; (C2k+1,j )α = 2 for 1 6 j 6 2k and conjecture if ∆T = (2k + 1),
then αdef (T ) 6 k. Ahmed and Snevily [124] prove that for every comet T (that is, graphs
obtained from stars by replacing each edge by a path of some fixed length) there exists
an α-labeling of T , or else there exists a graph HT with an α-labeling such that HT can
be decomposed into two edge-disjoint copies of T . This is particularly noteworthy since
comets are known to have arbitrarily large α-deficits.
Given two bipartite graphs G1 and G2 with partite sets H1 and N L1 and H2 and L2 ,
respectively, Snevily [3011] defines their weak tensor product G1 G2 as the bipartite
graph with vertex set (H1 × H2 , L1 × L2 ) and with edge (h1 , h2 )(l1 , l2 ) if h1 l1 ∈ E(G
N 1)
and h2 l2 ∈ E(G2 ). He proves that if G1 and G2 have α-labelings then so does G1 G2 .
This result considerably enlarges the class of graphs known to have α-labelings. In [1986]
López and Muntaner-Batle gave a generalization of Snevily’s weak tensor product that
allows them to significantly enlarges the classes of graphs admitting α-labelings, near
α-labelings (defined later in this section), and bigraceful graphs.
The sequential join of graphs G1 , G2 , . . . , Gn is formed from G1 ∪ G2 ∪ · · · ∪ Gn by
adding edges joining each vertex of Gi with each vertex of Gi+1 for 1 6 i 6 n − 1. Lee
and Wang [1908] have shown that for all n > 2 and any positive integers a1 , a2 , . . . , an
the sequential join of the graphs K a1 , K a2 , . . . , K an has an α-labeling.
In [1002] Gallian and Ropp conjectured that every graph obtained by adding a single
pendent edge to one or more vertices of a cycle is graceful. Qian [2537] proved this
conjecture and in the case that the cycle is even he shows the graphs have an α-labeling.
He further proves that for n even any graph obtained from an n-cycle by adding one or
more pendent edges at some vertices has an α-labeling as long as at least one vertex has
degree 3 and one vertex has degree 2.
In [2354] Pasotti introduced the following generalization of a graceful labeling. Given a
graph G with e = dm edges, an injective function from V (Γ) to the set {0, 1, 2, . . . , d(m +
1) − 1} such that {|f (x) − f (y)| | [x, y] ∈ E(Γ)} = {1, 2, 3, . . . , d(m + 1) − 1} − {m +
1, 2(m + 1), . . . , (d − 1)(m + 1)} is called a d-divisible graceful labeling of G. Note that
for d = 1 and of d = e one obtains the classical notion of a graceful labeling and of

the electronic journal of combinatorics (2023), #DS6 58

an odd-graceful labeling (see §3.6 for the definition), respectively. A d-divisible graceful
labeling of a bipartite graph G with the property that the maximum value on one of
the two bipartite sets is less than the minimum value on the other one is called a d-
divisible α-labeling of G. Pasotti proved that these new concepts allow to obtain certain
cyclic graph decompositions. In particular, if there exists a d-divisible graceful labeling
of a graph G of size e = dm then there exists a cyclic G-decomposition of K( e +1)×2d
d
and that if there exists a d-divisible α-labeling of a graph Γ of size e then there exists
a cyclic G-decomposition of K( e +1)×2dn for any integer n > 1. She also it is proved the
d
following: paths and stars admit a d-divisible α-labeling for any admissible d; C4k admits
a 2-divisible α-labeling and a 4-divisible α-labeling for any k > 1; C2k admits a 2-divisible
labeling for any odd integer k > 1; and the ladder graph L2k has a 2-divisible α-labeling
if and only if k is even.
Pasotti [2354] generalized the notion of graceful labelings for graphs G with e =
d · m edges by defining a d-graceful labeling as an injective function f from V (G) to
{0, 1, 2, . . . , d(m + 1) − 1} such that {|f (x) − f (y)| | xy ∈ E(G)} = {1, 2, . . . , d(m + 1) −
1} − {m + 1, 2(m + 1), . . . , (d − 1)(m + 1)}. The case d = 1 is a graceful labeling and
the case that d = e is an odd-graceful labeling. A d-graceful α-labeling of a bipartite
graph is a d-graceful labeling with the property that the maximum value in one of the
two bipartite sets is less than the minimum value on the other bipartite set. Pasotti
[2354] proved that paths and stars have d-graceful α-labelings for all admissible d, ladders
Pn × P2 have a 2-graceful labeling if and only if n is even, and provided partial results
about cycles of even length. He showed that the existence of d-graceful labelings can be
used to prove that certain complete graphs have cyclic decompositions. Benini and Pasotti
[531] used d-divisible α-labelings to construct an infinite class of cyclic Γ-decompositions
of the complete multipartite graphs, where Γ is a caterpillar, a hairy cycle or a cycle. Such
labelings imply the existence of cyclic Γ-decompositions of certain complete multipartite
graphs. Riasat, Kanwal, and Javed [2622] give odd-graceful labelings for disjoint unions
of graphs consisting of generalized combs, ladders, stars, bistars, caterpillars and paths.
In [2353], Pasotti proved the existence of d-divisible α-labelings for C4k × Pm for any
integers k > 1, m > 2 for d = 2m − 1, 2(2m − 1) and 4(2m − 1). Benini and Pasotti [532]
proved that the generalized Petersen graph P8n,3 admits an α-labeling for any integer
n > 1 confirming that the conjecture posed by A. Vietri in [3361] is true.
For any tree T (V, E) whose vertices are properly 2-colored Rosa and Širáň [2651]
define a bipartite labeling of T as a bijection f : V → {0, 1, 2, . . . , |E|} for which there
is a k such that whenever f (u) 6 k 6 f (v), then u and v have different colors. They
define the α-size of a tree T as the maximum number of distinct values of the induced
edge labels |f (u) − f (v)|, uv ∈ E, taken over all bipartite labelings f of T . They prove
that the α-size of any tree with n edges is at least 5(n + 1)/7 and that there exist trees
whose α-size is at most (5n + 9)/6. They conjectured that minimum of the α-sizes over
all trees with n edges is asymptotically 5n/6. This conjecture has been proved for trees of
maximum degree 3 by Bonnington and Širáň [597]. For trees with n vertices and maximum
degree 3 Brankovic, Rosa, and Širáň [610] have shown that the α-size is at least b 6n 7
c − 1.
In [608] Brankovic, Murch, Pond, and Rose provide a lower bound for the α-size trees

the electronic journal of combinatorics (2023), #DS6 59

with maximum degree three and a perfect matching as a function of a lower bound for
minimum order of such a tree that does not have an α-labeling. Using a computer search
they showed that all such trees on less than 30 vertices have an α-labeling. This brought
the lower bound for the α-size to 14n/15, for such trees of order n. They conjecture that
all trees with maximum degree three and a perfect matching have an α-labeling. Heinrich
and Hell [1240] defined the gracesize of a graph G with n vertices as the maximum, over
all bijections f : V (G) → {1, 2, . . . , n}, of the number of distinct values |f (u) − f (v)| over
all edges uv of G. So, from Rosa and Širáň’s result, the gracesize of any tree with n edges
is at least 5(n + 1)/7.
In [614] Brinkmann, Crevals, Mélot, Rylands, and Steffan define the parameter αdef
which measures how far a tree is from having an α-labeling as it counts the minimum
number of errors, that is, the minimum number of edge labels that are missing from the
set of all possible labels. Trees with an α-labeling have deficit 0. For a tree T = (V, E)
with bipartition classes V1 and V2 and a bipartite labeling f : V → {0, . . . , |V | − 1} the
edge parity of T is ( |E| 1
P
i=1 i) mod 2 = 2 (|V | − 1)|V | mod 2. So if f is an α-labeling this is
the sum of all edge labels modulo 2; it is 0 if |V | ≡ 0, 1 mod 4 and 1 if |V | ≡ 2, 3 mod 4.
The vertex parity is the parity of the number of vertices of odd degree with odd label.
Brinkmann et al. [614] proved: in a tree T with α-deficit 0 the edge parity and the
vertex parities are equal; and for all non-negative integers k and d and n > k 2 + k, the
number of trees T with n vertices, αdef (T ) = d and maximum degree n − k is the same.
Furthermore, they provide computer results on the α-deficit of all trees with up to 26
vertices; with maximum degree 3 and up to 36 vertices, with maximum degree 4 and up
to 32 vertices, and with maximum degree 5 and up to 31 vertices.
In [1007] Gallian weakened the condition for an α-labeling somewhat by defining a
weakly α-labeling as a graceful labeling for which there is an integer k so that for each
edge xy either f (x) 6 k 6 f (y) or f (y) 6 k 6 f (x). Unlike α-labelings, this condition
allows the graph to have an odd cycle, but still places a severe restriction on the structure
of the graph; namely, that the vertex with the label k must be on every odd cycle. Gallian,
Prout, and Winters [1007] showed that the prisms Cn × P2 with a vertex deleted have
α-labelings. The same paper reveals that Cn × P2 with an edge deleted from a cycle has
an α-labeling when n is even and a weakly α-labeling when n > 3.
In [458] and [461] Barrientos and Minion focused on the enumeration of graphs with
graceful and α-labelings, respectively. They used an extended version of the adjacency
matrix of a graph to count the number of labeled graphs. In [458] they count the number
of gracefully-labeled graphs of size n and order m, for all possible values of m. In [461]
they count the number of α-labeled graphs of size n and order m, for all possible values
of m, as well as those α-labeled graphs of size n with boundary value λ. They also count
the number of α-labeled graphs of size n, order m, and boundary value λ for all possible
values of m and λ.
A special case of α-labeling called strongly graceful was introduced by Maheo [2053]
in 1980. A graceful labeling f of a graph G is called strongly graceful if G is bipartite with
two partite sets A and B of the same order s, the number of edges is 2t + s, there is an
integer k with t − s 6 k 6 t + s − 1 such that if a ∈ A, f (a) 6 k, and if b ∈ B, f (b) > k,

the electronic journal of combinatorics (2023), #DS6 60

and there is an involution π that is an automorphism of G such that: π exchanges A and
B and the s edges aπ(a) where a ∈ A have as labels the integers between t + 1 and t + s.
Maheo’s main result is that if G is strongly graceful then so is G × Qn . In particular, she
proved that (Pn × Qn ) × K2 , B2n , and B2n × Qn have strongly graceful labelings.
In 1999 Broersma and Hoede [615] conjectured that every tree containing a perfect
matching is strongly graceful. Yao, Cheng, Yao, and Zhao [3529] proved that this conjec-
ture is true for every tree with diameter at most 5 and provided a method for constructing
strongly graceful trees.
El-Zanati and Vanden Eynden [887] call a strongly graceful labeling a strong α-labeling.
They show that if G has a strong α-labeling, then G × Pn has an α-labeling. They show
that Km,2 × K2 has a strong α-labeling and that Km,2 × Pn has an α-labeling. They also
show that if G is a bipartite graph with one more vertex than the number of edges, and if
G has an α-labeling such that the cardinalities of the sets of the corresponding bipartition
of the vertices differ by at most 1, then G × K2 has a strong α-labeling and G × Pn has
an α-labeling. El-Zanati and Vanden Eynden [887] also note that K3,3 × K2 , K3,4 × K2 ,
K4,4 ×K2 , and C4k ×K2 all have strong α-labelings. El-Zanati and Vanden Eynden proved
that Km,2 × Qn has a strong α-labeling and that Km,2 × Pn has an α-labeling for all n.
They also prove that if G is a connected bipartite graph with partite sets of odd order
such that in each partite set each vertex has the same degree, then G × K2 does not have
a strong α-labeling. As a corollary they have that Km,n × K2 does not have a strong
α-labeling when m and n are odd.
An α-labeling f of a graph G is called free by El-Zanati and Vanden Eynden in [888]
if the critical number k (in the definition of α-labeling) is greater than 2 and if neither 1
nor k − 1 is used in the labeling. Their main result is that the union of graphs with free
α-labelings has an α-labeling. In particular, they show that Km,n , m > 1, n > 2, has a
free α-labeling. They also show that Qn , n > 3, and Km,2 × Qn , m > 1, n > 1, have free
α-labelings. El-Zanati [personal communication] has shown that the Heawood graph has
a free α-labeling.
Wannasit and El-Zanati [3456] proved that if G is a cubic bipartite graph each of
whose components is either a prism, a Möbius ladder, or has order at most 14, then G
admits free α-labeling. They conjecture that every bipartite cubic graph admits a free
α-labeling.
In [2071] Makadia, Karavadiya, and Kaneria call a vertex v in a graph G with a
graceful labeling f a graceful center of G if f (v) = 0 or f (v) = |E(G)|. They say a graph
G is a universal graceful graph if for every v ∈ V (G), v is a graceful center for G with
respect to some graceful labeling of G. They call G a universal α-graceful graph if for
every v ∈ V (G), v is a graceful center for G with respect to some α-graceful labeling of
G. They define the ring sum of two graphs G1 and G2 denoted G1 ⊕ G2 , as the graph
with vertex set (V (G1 ) ∪ V (G2 ) and edge set E(G1 ) ∪ E(G2 ) − (E(G1 ) ∩ E(G2 )). They
proved: any graph G that admits α-labeling has at least four graceful centers; if G is a
graceful graph, then G ⊕ K1,n is graceful; if G is a universal graceful graph, then G ⊕ K2 is
a graceful; if G1 is graceful and G2 has an α-labeling, then the ring sum G1 ⊕ G2 with the
graceful center of G1 and the graceful center of G2 as a common vertex is a graceful; and

the electronic journal of combinatorics (2023), #DS6 61

if G1 and G2 have α labelings, then the ring sum G1 ⊕ G2 with the two graceful centers
of G1 and G2 as a common vertex has an α labeling.
For connected bipartite graphs Grannell, Griggs, and Holroyd [1148] introduced a
labeling that lies between α-labelings and graceful labelings. They call a vertex labeling
f of a bipartite graph G with q edges and partite sets D and U gracious if f is a bijection
from the vertex set of G to {0, 1, . . . , q} such that the set of edge labels induced by
f (u) − f (v) for every edge uv with u ∈ U and v ∈ D is {1, 2, . . . , q}. Thus a gracious
labeling of G with partite sets D and U is a graceful labeling in which every vertex in
D has a label lower than every adjacent vertex. They verified by computer that every
tree of size up to 20 has a gracious labeling. This led them to conjecture that every tree
has a gracious labeling. For any k > 1 and any tree T Grannell et al. say that T has a
gracious k-labeling if the vertices of T can be partitioned into sets D and U in such a way
that there is a function f from the verticies of G to the integers modulo k such that the
edge labels induced by f (u) − f (v) where u ∈ U and v ∈ D have the following properties:
the number of edges labeled with 0 is one less than the number of verticies labeled with
0 and for each nonzero integer t the number of edges labeled with t is the same as the
number of verticies labeled with t. They prove that every nontrivial tree has a k-gracious
labeling for k = 2, 3, 4, and 5 and that caterpillars are k-gracious for all k > 2. In [530]
Bell and Cummins provided new methods for combining certain families of gracefully
labeled graphs to produce new gracefully labeled graphs. If the constituent graphs have
a gracious labeling, then the methods presented produce a gracious labeling. They also
introduce new infinite families of gracious trees and new classes of graceful trees.
The same labeling that is called gracious by Grannell, Griggs, and Holroyd is called
a near α-labeling by El-Zanati, Kenig, and Vanden Eynden [885]. The latter prove that
if G is a graph with n edges that has a near α-labeling then there exists a cyclic G-
decomposition of K2nx+1 for all positive integers x and a cyclic G-decomposition of Kn,n .
They further prove that if G and H have near α-labelings, then so does their weak
tensor product (see earlier part of this section) with respect to the corresponding vertex
partitions. They conjecture that every tree has a near α-labeling.
In [2052] Mahalingam and Rajendram introduced a new labeling called m-bonacci
graceful labeling as follows. A graph G on n edges is m-bonacci graceful if the vertices can
be labeled with distinct integers from the set of the first n m-bonacci numbers such that
the derived edge labels are the first n m-bonacci numbers. They showed that complete
graphs, complete bipartite graphs, gear graphs, triangular grid graphs, and wheel graphs
are not m-bonacci graceful. They gave m-bonacci graceful labeling for cycles, friendship
graphs, polygonal snake graphs, and double polygonal snake graphs and proved that
almost all trees are m-bonacci graceful.
For a simple, finite, connected, undirected, non-trivial graph G Sumathi and Raman
[3121] introduced the notion of arithmetic sequential graceful as an injection f : V (G) → [3121] new
{a, a + d, a + 2d, a + 3d, . . . , 2(a + qd)}, where a > 0 and d > 1, with the property that
f ∗ : E(G) → {d, 2d, 3d, 4d, . . . , qd} defined by f ∗ (uv) = |f (u) − f (v)| is a bijection. They
proved that stars, double stars, and some star related graphs are arithmetic sequential
graceful.

the electronic journal of combinatorics (2023), #DS6 62

 Another kind of labelings for trees was introduced by Ringel, Llado, and Serra [2627]
in an approach to proving their conjecture Kn,n is edge-decomposable into n copies of
any given tree with n edges. If T is a tree with n edges and partite sets A and B, they
define a labeling f from the set of vertices to {1, 2, . . . , n} to be a bigraceful labeling of
T if f restricted to A is injective, f restricted to B is injective, and the edge labels given
by f (y) − f (x) where yx is an edge with y in B and x in A is the set {0, 1, 2, . . . , n − 1}.
(Notice that this terminology conflicts with that given in Section 2.7 In particular, the
Ringel, Llado, and Serra bigraceful does not imply the usual graceful.) Among the graphs
that they show are bigraceful are: lobsters, trees of diameter at most 5, stars Sk,m with
k spokes of paths of length m, and complete d-ary trees for d odd. They also prove that
if T is a tree then there is a vertex v and a nonnegative integer m such that the addition
of m leaves to v results in a bigraceful tree. They conjecture that all trees are bigraceful.
A pronic number is one of the form n(n + 1), where n is a positive integer. Porchelvi
and Devi [2479] defined a pronic graceful labeling of a graph G with n > 2 verticies as a [2479] new
bijection f : V (G) → {0, 2, . . . , n(n + 1)} such that the upon labeling each edge uv with
|f (u) − f (v)| the labels are distinct. A graph G is called a pronic graceful graph if it
admits pronic graceful labeling. They proved that paths, cycles, wheels, stars, twigs, and
generalized Peterson graphs are pronic graceful. In [812] they proved that the generalized [812] new
Peterson graphs P (6, 2), P (8, 3), (10, 2), P (10, 3), and P (12, 5) are pronic graceful.
Table 3 summarizes some of the main results about α-labelings; α indicates that the
graphs have an α-labeling.

the electronic journal of combinatorics (2023), #DS6 63

 Table 3: Summary of Results on α-labelings

Graph α-labeling
cycles Cn α iff n ≡ 0 (mod 4) [2648]

caterpillars α [2648]

n-cube α [1738]

books B2n , B4n+1 α [2053], [1006]

Möbius ladders M2k+1 α [2352]

Cm ∪ Cn α iff m, n are even and

m + n ≡ 0 (mod 4)[24]

C4m ∪ C4m ∪ C4m (m > 1) α [1740]

C4m ∪ C4m ∪ C4m ∪ C4m α [1740]

mKs,t (m > 1, s, t > 2) iff (m, s, t) 6= (3, 2, 2) [1313]

Pn × Qn α [2053]

B2n × Qn α [2053]

K1,n × Qn α [2053]

Km,2 × Qn α [887]

Km,2 × Pn α [887]

P 2 × P2 × · · · × P2 × G α when G = C4m , Pm , K3,3 ,

K4,4 [3011]

P 2 × P2 × · · · × P2 × Pm α [3011]

P2 × P2 × · · · × P2 × Km,m α [3011] when m = 3 or 4

G[Kn ] α when G is α [3012]

the electronic journal of combinatorics (2023), #DS6 64

3.2 γ-Labelings
In 2004 Chartrand, Erwin, VanderJagt, and Zhang [676] define a γ-labeling of a graph G
of size m as a 1-1 function f from the vertices of G to {0, 1, 2, . . . , m} that induces an edge
labeling f 0 defined by f 0 (uv) = |f (u)−f (v)| for each edge uv. They define the following pa-
rameters of a γ-labeling: val(f ) = Σf 0 (e) over all edges e of G; valmax (G) = max{ val(f ) :
f is a γ-labeling of G}, valmin (G) = min{ val(f ) : f is a γ − labeling of G}. Among
their results are the following:
valmin (Pn ) = valmax (Pn ) = b(n2 − 2)/2c; valmin (Cn ) = 2(n − 1); for even n > 4,
valmax (Cn ) = n(n + 2)/2; for odd n > 3, valmax (Cn ) = (n − 1)(n + 3)/2; for odd
n+1


n, valmin (Kn ) = 3
; for odd n, valmax (Kn ) = (n2 − 1)(3n2 − 5n + 6)/24; for
even n, valmax (Kn ) = n(3n3 − 5n2 + 6n − 4)/24; for every n > 3, valmin (K1,n−1 ) =
b n+1 c d n+1 e n




2
2
+ 2
2
; valmax (K 1,n−1 ) = 2
for a connected graph of order n and size
m, valmin (G) = m if and only if G is isomorphic to Pn ; if G is maximal outerplanar
of order n > 2, valmin (G) > 3n − 5 and equality occurs if and only if G = Pn2 ; if
G is a connected r-regular bipartite graph of order n and size m where r > 2, then
valmax (G) = rn(2m − n + 2)/4.
In another paper on γ-labelings of trees Chartrand, Erwin, VanderJagt, and Zhang
[677] prove for p, q > 2, valmin (Sp,q ) (that is, the graph obtained by joining the centers of
K1,p and K1,q by an edge)= (bp/2c+1)2 +(bq/2c+1)2 −(np bp/2c+1)2 +(nq b(q+2)/2c+1)2 ),
where ni is 1 if i is even and ni is 0 if ni is odd; valmin (Sp,q ) = (p2 +q 2 +4pq−3p−3q+2)/2;
for a connected graph G of order n at least 4, valmin (G) = n if and only if G is a caterpillar
with maximum degree 3 and has a unique vertex of degree 3; for a tree T of order n at
least 4, maximum degree ∆, and diameter d, valmin (T ) > (8n + ∆2 − 6∆ − 4d + δ∆ )/4
where δ∆ is 0 if ∆ is even and δ∆ is 0 if ∆ is odd. They also give a characterization of all
trees of order n at least 5 whose minimum value is n + 1.
Saduakdee and Khemmani [2695] investigated connected graphs having the unique
γ-min labeling. They determined the minimum value of a γ-labeling for some classes of
trees and showed that they have no unique γ-min labeling.
In [630] Buratti and Del Fra solved the existence problem for cyclic k-cycle systems
of the complete graph Kv with v ≡ 1 (mod 2k), and the existence problem for cyclic
k-cycle systems of the complete m-partite graph Km×k for m and k odd. As a particular
consequence, a cyclic p-cycle system of Kv with p a prime exists for all admissible values
of v but (p, v) 6= (3, 9). This was previously known only for p = 3, 5, 7.
In [2694] Sanaka determined valmax (Km,n ) and valmin (Km,n ). In [629] Bunge, Chan-
tasartraaamee, El-Zanati, and Vanden Eynden generalized γ-labelings by introducing two
labelings for tripartite graphs. Graphs G that admit either of these labelings guarantee
the existence of cyclic G-decompositions of K2nx+1 for all positive integers x. They also
proved that, except for C3 ∪ C3 , the disjoint union of two cycles of odd length admits one
of these labelings.

the electronic journal of combinatorics (2023), #DS6 65

3.3 Graceful-like Labelings
As a means of attacking graph decomposition problems, Rosa [2648] invented another
analogue of graceful labelings by permitting the vertices of a graph with q edges to assume
labels from the set {0, 1, . . . , q + 1}, while the edge labels induced by the absolute value of
the difference of the vertex labels are {1, 2, . . . , q − 1, q} or {1, 2, . . . , q − 1, q + 1}. He calls
these ρ̂-labelings. Frucht [986] used the term nearly graceful labeling instead of ρ̂-labelings.
Frucht [986] has shown that the following graphs have nearly graceful labelings with edge
labels from {1, 2, . . . , q − 1, q + 1}: Pm ∪ Pn ; Sm ∪ Sn ; Sm ∪ Pn ; G ∪ K2 where G is graceful;
and C3 ∪ K2 ∪ Sm where m is even or m ≡ 3 (mod 14). Seoud and Elsakhawi [2771]
have shown that all cycles are nearly graceful. Barrientos [435] proved that Cn is nearly
graceful with edge labels 1, 2, . . . , n − 1, n + 1 if and only if n ≡ 1 or 2 (mod 4). Nurvazly
and Sugeng [2315] proved that Θ(C3 )n graphs (n copies of C3 that share an edge) have ρ̂
labelings. Gao [1021] shows that a variation of banana trees is odd-graceful and in some
cases has a nearly graceful labeling. (A graph G with q edges is odd-graceful if there is
an injection f from V (G) to {0, 1, 2, . . . , 2q − 1} such that, when each edge xy is assigned
the label |f (x) − f (y)|, the resulting edge labels are {1, 3, 5, . . . , 2q − 1}).
For a graph G with p vertices and q directed edges that are assigned distinct vertex
labels in {0, . . . , q} and distinct edge labels in {1, . . . , p} so that the label of the directed
edge from u to v is (f (v) − f (u)) mod(q + 1) (this generalizes Rosa’s ρ-valuations. Knuth
[1707] has observed that there is a nice data structure for storing a graph or digraph in a
computer. He calls this a graceful data structure labeling.
In 1988 Rosa [2650] conjectured that triangular snakes with t ≡ 0 or 1 (mod 4) blocks
are graceful and those with t ≡ 2 or 3 (mod 4) blocks are nearly graceful (a parity
condition ensures that the graphs in the latter case cannot be graceful). Moulton [2200]
proved Rosa’s conjecture while introducing the slightly stronger concept of almost graceful
by permitting the vertex labels to come from {0, 1, 2, . . . , q −1, q +1} while the edge labels
are 1, 2, . . . , q − 1, q, or 1, 2, . . . , q − 1, q + 1. More generally, Rosa [2650] conjectured that
all triangular cacti are either graceful or near graceful and suggested the use of Skolem
sequences to label some types of triangular cacti. Dyer, Payne, Shalaby, and Wicks [862]
verified the conjecture for two families of triangular cacti using Langford sequences to
obtain Skolem and hooked Skolem sequences with specific subsequences.
Seoud and Elsakhawi [2771] and [2772] have shown that the following graphs are
almost graceful: Cn ; Pn + Km ; Pn + K1,m ; Km,n ; K1,m,n ; K2,2,m ; K1,1,m,n ; Pn × P3 (n > 3);
K5 ∪ K1,n ; K6 ∪ K1,n , and ladders.
For a graph G with p vertices, q edges, and 1 6 k 6 q, Eshghi [899] defines a holey α-
labeling with respect to k as an injective vertex labeling f for which f (v) ∈ {1, 2, . . . , q +1}
for all v, {|f (u) − f (v)| | for all edges uv} = {1, 2, . . . , k − 1, k + 1, . . . , q + 1}, and there
exist an integer γ with 0 6 γ 6 q such that min{f (u), f (v)} 6 γ 6 max{f (u), f (v)}. He
proves the following: Pn has a holey α-labeling with respect to all k; Cn has a holey α-
labeling with respect to k if and only if either n ≡ 2 (mod 4), k is even, and (n, k) 6= (10, 6),
or n ≡ 0 (mod 4) and k is odd.
Recall from Section 2.2 that a kCn -snake is a connected graph with k blocks whose
block-cutpoint graph is a path and each of the k blocks is isomorphic to Cn . In addition

the electronic journal of combinatorics (2023), #DS6 66

to his results on the graceful kCn -snakes given in Section 2.2, Barrientos [439] proved that
when k is odd the linear kC6 -snake is nearly graceful and that Cm ∪ K1,n is nearly graceful
when m = 3, 4, 5, and 6.
Yet another kind of labeling introduced by Rosa in his 1967 paper [2648] is a ρ-labeling.
(Sometimes called a rosy labeling ). A ρ-labeling (or ρ-valuation) of a graph is an injection
from the vertices of the graph with q edges to the set {0, 1, . . . , 2q}, where if the edge
labels induced by the absolute value of the difference of the vertex labels are a1 , a2 , . . . , aq ,
then ai = i or ai = 2q + 1 − i. Rosa [2648] proved that a cyclic decomposition of the
edge set of the complete graph K2q+1 into subgraphs isomorphic to a given graph G with
q edges exists if and only if G has a ρ-labeling. (A decomposition of Kn into copies of G
is called cyclic if the automorphism group of the decomposition itself contains the cyclic
group of order n.) It is known that every graph with at most 11 edges has a ρ-labeling
and that all lobsters have a ρ-labeling (see [659]).
In [468] Barrientos and Minion proved that a tree admits a ρ–labeling when the deletion
of some of its leaves results in a graceful tree. They use this result to prove the existence
of ρ-labeling for several families of trees such as lobsters and those of diameter up to
seven. Similarly, they showed that if T is any graceful tree of size n and k is an integer
such that 2k > n + 1, then any tree of size n + 2k obtained attaching a path of length 2
to k distinct vertices of T has a ρ-labeling.
Donovan, El-Zanati, Vanden Eyden, and Sutinuntopas [844] prove that rCm has a ρ-
labeling (or a more restrictive labeling) when r 6 4. They conjecture that every 2-regular
graph has a ρ-labeling. Gannon and El-Zanati [1015] proved that for any odd n > 7, rCn
admits ρ-labelings. The cases n = 3 and n = 5 were done in [840] and [884]. Aguado,
El-Zanati, Hake, Stob, and Yayla [69] give a ρ-labeling of Cr ∪ Cs ∪ Ct for each of the
cases where r ≡ 0, s ≡ 1, t ≡ 1 (mod 4); r ≡ 0, s ≡ 3, t ≡ 3 (mod 4); and r ≡ 1,
s ≡ 1, t ≡ 3 (mod 4); (iv) r ≡ 1, s ≡ 2, t ≡ 3 (mod 4); (v) r ≡ 3, s ≡ 3, t ≡ 3 (mod 4).
Caro, Roditty, and Schőnheim [659] provide a construction for the adjacency matrix for
every graph that has a ρ-labeling. They ask the following question: If H is a connected
graph having a ρ-labeling and q edges and G is a new graph with q edges constructed
by breaking H up into disconnected parts, does G also have a ρ-labeling? Kézdy [1689]
defines a stunted tree as one whose edges can be labeled with e1 , e2 , . . . , en so that e1 and
e2 are incident and, for all j = 3, 4, . . . , n, edge ej is incident to at least one edge ek
satisfying 2k 6 j − 1. He uses Alon’s “Combinatorial Nullstellensatz” to prove that if
2n + 1 is prime, then every stunted tree with n edges has a ρ-labeling.
Jeba Jesintha and Ezhilarasi Hilda [1390] introduced a variation of Rosa’s ρ-labeling
as follows. A ρ? -labeling of a graph G is an injection from the vertices of the graph with
q edges to the set {0, 1, . . . , 2q}, where if the edge labels induced by the absolute value of
the difference of the vertex labels are e1 , e2 , . . . , eq , then ei = i or ei = 2q − i. They prove
that all paths and shell-butterfly graphs have a ρ? -labeling.
In [459] Barrientos and Minion proved the existence of ρ-labelings for some types of
forests that considerably reduce the number of trees that need to be studied to prove
Kotzig’s Conjecture that states that K2n+1 can be cyclically decomposed into 2n + 1
subgraphs isomorphic to a given tree with n edges. Among their results are the following.

the electronic journal of combinatorics (2023), #DS6 67

If T1 and T2 admit α-labelings such that one of the end-vertices of the edge of weight 1
in T2 is a leaf, then T1 ∪ T2 admits a ρ-labeling. If G1 , G2 , . . . , Gk is a collection
Sk of graphs
that admit α-labelings, where Gk is a caterpillar of size at least k −2, then i=1 Gi admits
a ρ-labeling. Let R denote the family that consists of all trees G such that G has a branch
H, (i.e., G − H is a tree) that is a caterpillar, where the excess of G − H is at most the
size of H. They prove that G admits a ρ-labeling when G ∈ R.
Recall a kayak paddle KP (k, m, l) is the graph obtained by joining Ck and Cm by
a path of length l. Fronček and Tollefeson [981], [982] proved that KP (r, s, l) has a
ρ-labeling for all cases. As a corollary they have that the complete graph K2n+1 is de-
composable into kayak paddles with n edges.
In [964] Fronček generalizes the notion of an α-labeling by showing that if a graph G
on n edges allows a certain type of ρ-labeling), called α2 -labeling, then for any positive
integer k the complete graph K2nk+1 can be decomposed into copies of G.
In their investigation of cyclic decompositions of complete graphs El-Zanati, Vanden
Eynden, and Punnim [890] introduced two kinds of labelings. They say a bipartite graph
G with n edges and partite sets A and B has a θ-labeling h if h is a one-to-one function from
V (G) to {0, 1, . . . , 2n} such that {|h(b) − h(a)| ab ∈ E(G), a ∈ A, b ∈ B} = {1, 2, . . . , n}.
They call h a ρ+ -labeling of G if h is a one-to-one function from V (G) to {0, 1, . . . , 2n}
and the integers h(x) − h(y) are distinct modulo 2n + 1 taken over all ordered pairs (x, y)
where xy is an edge in G, and h(b) > h(a) whenever a ∈ A, b ∈ B and ab is an edge in
G. Note that θ-labelings are ρ+ -labelings and ρ+ -labelings are ρ-labelings. They prove
that if G is a bipartite graph with n edges and a ρ+ -labeling, then for every positive
integer x there is a cyclic G-decomposition of K2nx+1 . They prove the following graphs
have ρ+ -labelings: trees of diameter at most 5, C2n , lobsters, and comets (that is, graphs
obtained from stars by replacing each edge by a path of some fixed length). They also
prove that the disjoint union of graphs with α-labelings have a θ-labeling and conjecture
that all forests have ρ-labelings.
A σ-labeling of G(V, E) is a one-to-one function f from V to {0, 1, . . . , 2|E|} such
that {|f (u) − f (v)| | uv ∈ E(G)} = {1, 2, . . . , |E|}. Such a labeling of G yields cyclic
G-decompositions of K2n+1 and of K2n+2 − F , where F is a 1-factor of K2n+2 . El-Zanati
and Vanden Eynden (see [68]) have conjectured that every 2-regular graph with n edges
has a ρ-labeling and, if n ≡ 0 or 3 (mod 4), then every 2-regular graph has a σ-labeling.
Aguado and El-Zanati [68] have proved that the latter conjecture holds when the graph
has at most three components.
Given a bipartite graph G with partite sets X and Y and graphs H1 with p vertices
and H2 with q vertices, Fronček and Winters [983] define the bicomposition of G and H1
and H2 , G[H1 , H2 ], as the graph obtained from G by replacing each vertex of X by a
copy of H1 , each vertex of Y by a copy of H2 , and every edge xy by a graph isomorphic to
Kp,q with the partite sets corresponding to the vertices x and y. They prove that if G is a
bipartite graph with n edges and G has a θ-labeling that maps the vertex set V = X ∪ Y
into a subset of {0, 1, 2, . . . , 2n}, then the bicomposition G[Kp , Kq ] has a θ-labeling for
every p, q > 1. As corollaries they have: if a bipartite graph G with n edges and at most
n + 1 vertices has a gracious labeling (see §3.1), then the bicomposition graph G[Kp , Kq ]

the electronic journal of combinatorics (2023), #DS6 68

has a gracious labeling for every p, q > 1, and if a bipartite graph G with n edges has a
θ-labeling, then for every p, q > 1, the bicomposition G[Kp , Kq ] decomposes the complete
graph K2npq+1 .
In a paper published in 2009 [889] El-Zanati and Vanden Eynden survey “Rosa-type”
labelings. That is, labelings of a graph G that yield cyclic G-decompositions of K2n+1 or
K2nx+1 for all natural numbers x. The 2009 survey by Fronček [963] includes generaliza-
tions of ρ- and α-labelings that have been used for finding decompositions of complete
graphs that are not covered in [889].
Blinco, El-Zanati, and Vanden Eynden [572] call a non-bipartite graph almost-bipartite
if the removal of some edge results in a bipartite graph. For these kinds of graphs G they
call a labeling f a γ-labeling of G if the following conditions are met: f is a ρ-labeling;
G is tripartite with vertex tripartition A, B, C with C = {c} and b ∈ B such that {b, c}
is the unique edge joining an element of B to c; if av is an edge of G with a ∈ A, then
f (a) < f (v); and f (c) − f (b) = n. (In § 3.2 the term γ-labeling is used for a different kind
of labeling.) They prove that if an almost-bipartite graph G with n edges has a γ-labeling
then there is a cyclic G-decomposition of K2nx+1 for all x. They prove that all odd cycles
with more than 3 vertices have a γ-labeling and that C3 ∪ C4m has a γ-labeling if and
only if m > 1. In [628] Bunge, El-Zanati, and Vanden Eynden prove that every 2-regular
almost bipartite graph other than C3 and C3 ∪ C4 have a γ-labeling.
In [572] Blinco, El-Zanati, and Vanden Eynden consider a slightly restricted ρ+ -
labeling for a bipartite graph with partite sets A and B by requiring that there exists a
number λ with the property that ρ+ (a) 6 λ for all a ∈ A and ρ+ (b) > λ for all b ∈ B.
They denote such a labeling by ρ++ . They use this kind of labeling to show that if G is a
2-regular graph of order n in which each component has even order then there is a cyclic
G-decomposition of K2nx+1 for all x. They also conjecture that every bipartite graph has
a ρ-labeling and every 2-regular graph has a ρ-labeling.
Dufour [857] and Eldergill [868] have some results on the decomposition of complete
graphs using labeling methods. Balakrishnan and Sampathkumar [414] showed that for
each positive integer n the graph Kn + 2K2 admits a ρ-labeling. Balakrishnan [408] asks
if it is true that Kn + mK2 admits a ρ-labeling for all n and m. Fronček [962] and Fronček
and Kubesa [976] have introduced several kinds of labelings for the purpose of proving
the existence ofspecial kinds of decompositions of complete graphs into spanning trees.
For positive integers c and d, let Kc×d denote the complete multipartite graph with c
parts, each containing d vertices. Let G with n edges be the union of two vertex-disjoint
even cycles. In [3056] Su et al. use Rosa-type graph labelings to show that there exists
a cyclic G- decomposition of K( 2n + 1) × t, K(n/2+1)×4t , K5×(n/2)t , and of K2nt for every
positive integer t. If n ≡ 0 (mod 4),then there also exists a cyclic G-decomposition of
Kn+1 × 2t, K(n/4)+1 × 8t, K9 × (n/4)t, and of K3×nt for every positive integer t.
For (p, q)-graphs with p = q + 1, Frucht [986] has introduced a stronger version of
almost graceful graphs by permitting as vertex labels {0, 1, . . . , q − 1, q + 1} and as edge
labels {1, 2, . . . , q}. He calls such a labeling pseudograceful. Frucht proved that Pn (n > 3),
combs, sparklers (i.e., graphs obtained by joining an end vertex of a path to the center of
a star), C3 ∪ Pn (n 6= 3), and C4 ∪ Pn (n 6= 1) are pseudograceful whereas K1,n (n > 3) is

the electronic journal of combinatorics (2023), #DS6 69

not. Kishore [1704] proved that Cs ∪ Pn is pseudograceful when s > 5 and n > (s + 7)/2
and that Cs ∪ Sn is pseudograceful when s = 3, s = 4, and s > 7. Seoud and Youssef
[2803] and [2799] extended the definition of pseudograceful to all graphs with p 6 q + 1.
They proved that Km is pseudograceful if and only if m = 1, 3, or 4 [2799]; Km,n is
pseudograceful when n > 2, and Pm + Kn (m > 2) [2803] is pseudograceful. They also
proved that if G is pseudograceful, then G ∪ Km,n is graceful for m > 2 and n > 2 and
G ∪ Km,n is pseudograceful for m > 2, n > 2 and (m, n) 6= (2, 2) [2799]. They ask if
G ∪ K2,2 is pseudograceful whenever G is. Seoud and Youssef [2799] observed that if G
is a pseudograceful Eulerian graph with q edges, then q ≡ 0 or 3 (mod 4). Youssef [3545]
has shown that Cn is pseudograceful if and only if n ≡ 0 or 3 (mod 4), and for n > 8
and n ≡ 0 or 3 (mod 4), Cn ∪ Kp,q is pseudograceful for all p, q > 2 except (p, q) = (2, 2).
Youssef [3542] has shown that if H is pseudograceful and G has an α-labeling with k
being the smaller vertex label of the edge labeled with 1 and if either k + 2 or k − 1 is
not a vertex label of G, then G ∪ H is graceful. In [3546] Youssef shows that if G is (p, q)
pseudograceful graph with p = q + 1, then G ∪ Sm is Skolem-graceful (see Section 3.5 for
the definition). As a corollary he obtains that for all n > 2, Pn ∪ Sm is Skolem-graceful
if and only if n > 3 or n = 2 and m is even.
In [3551] Youssef generalizes his results in [3542] and provides new families of discon-
nected graphs that have α-labelings and pseudo α-labelings. (A pseudo α-labeling f is an
α-labeling for which there is an integer kj with the property that for each edge xy of the
graph either f (x) 6 kj < f (y) or f (y) 6 kj < f (x).)
For a graph G Ichishima, Muntaner-Batle, and Oshima [1293] defined the beta-number
of G, β(G), to be either the smallest positive integer n for which there exists an injective
function f from the vertices of G to {1, 2, . . . , n} such that when each edge uv is labeled
|f (u) − f (v)| the resulting set of edge labels is {c, c + 1, . . . , c + |E(G)| − 1} for some
positive integer c or +∞ if there exists no such integer n. They defined the strong
beta-number of G to be either the smallest positive integer n for which there exists an
injective function f from the vertices of G to {1, 2, . . . , n} such that when each edge uv is
labeled |f (u) − f (v)| the resulting set of edge labels is {1, 2, . . . , |E(G)|} or +∞ if there
exists no such integer n. They gave some necessary conditions for a graph to have a
finite (strong) beta-number and some sufficient conditions for a graph to have a finite
(strong) beta-number. They also determined formulas for the beta-numbers and strong
beta-numbers of Cn , 2Cn , Kn (n > 2), Sm ∪ Sn , Pm ∪ Sn , and prove that nontrivial trees
and forests without isolated vertices have finite strong beta-numbers. In [1282] Ichishima,
López, Muntaner-Batte, and Oshima proved that if G is a bipartite graph and m is odd,
then β(mG) 6 m|E(G)| + m − 1. If G has the additional property that G is a graceful
nontrivial tree, then β(mG) = m|V (G)| + m − 1. They also investigate the (strong) beta-
number of forests with components that are isomorphic to either paths or stars. They
propose new conjectures on the (strong) beta-number of forests. In [1309] Ichishima and
Oshima determine a formula for the (strong) beta-number of the linear forests Pm ∪ Pn .
As a corollary they provide a partial formula for the beta-number of the disjoint union
of multiple copies of the same linear forest. In [1295] Ichishima, Muntaner-Batle, Oshima
provide lower and upper bounds for β(G+nK1 ) when β(G) = |V (G)|−1 and formulas for

the electronic journal of combinatorics (2023), #DS6 70

β(G + nK1 ) and βs (G + nK1 )) when βs (G) = |V (G)| − 1. They also determine formulas
for β(G + K1,n ) and βs (G + K1,n ) when βs (G) = |V (G)| − 1. They conclude with two
problems.
In [1288] Ichishima, Oshima, and Takahashi establish a lower bound for the beta- [1288] new
number of an arbitrary galaxy under certain conditions. They also introduce the notions
of odd symmetric and even symmetric galaxies and determine formulas for the beta-
number and gamma-number of odd symmetric galaxies. As corollaries, they provide
formulas for the beta-number and gamma-number of the disjoint union of multiple copies
of the same galaxy when the number of copies is odd. In addition to these, the present an
upper bound for the beta-number of even symmetric galaxies and obtain partial formulas
for the beta-number and gamma-number of even symmetric galaxies.
For a graph G of order p and size q and every positive integer n Ichishima, Muntaner-
Batle, and Oshima [1298] proved if β(G) = p − 1, then there exists some positive integer
c such that q + np 6 β(G + nK1 ) 6 c + q + np − 1; if βs (G) = p − 1, then β(G + nK1 ) =
βs (G + nK1 ) = q + np and G + nK1 is graceful; and if q = p − 1 and βs (G) = p − 1, then
β(G + Sn ) = βs (G + Sn ) = (n + 2)p + n − 1. In particular, if T is a graceful tree of order
p then β(T + nK1 ) = βs (T + nK1 ) = (n + 1)p − 1. Moreover, T + nK1 and T + Sn are
graceful.
In [1301] Ichishima, Muntaner-Batle, and Oshima establish a lower bound for the
strong beta-number of an arbitrary galaxy (that is, a forest whose components are stars)
under certain conditions. They also determine formulas for the (strong) beta-number
and gracefulness of galaxies with three and four components. As corollaries, they provide
formulas for the beta-number and gracefulness of the disjoint union of multiple copies of
the same galaxies if the number of copies is odd. They pose some problems and conjecture.
In [1290] Ichishima and Muntaner-Batle determined formulas for the (strong) beta-number
and gracefulness of galaxies with five components. In [1305] Ichishima, Muntaner-Batle,
and Oshima determined formulas for the (strong) beta-number and gamma-number of
galaxies with five components. As a corollary of these results, they provide formulas for
the beta-number and gamma-number of the disjoint union of multiple copies of the same
galaxies if the number of copies is odd.
McTavish [2120] has investigated labelings of graphs with q edges where the vertex
and edge labels are from {0, . . . , q, q + 1}. She calls these ρ̃-labelings. Graphs that have
ρ̃-labelings include cycles and the disjoint union of Pn or Sn with any graceful graph.
Frucht [986] has made an observation about graceful labelings that yields nearly grace-
ful analogs of α-labelings and weakly α-labelings in a natural way. Suppose G(V, E) is a
graceful graph with the vertex labeling f . For each edge xy in E, let [f (x), f (y)] (where
f (x) 6 f (y)) denote the interval of real numbers r with f (x) 6 r 6 f (y). Then the
intersection ∩[f (x), f (y)] over all edges xy ∈ E is a unit interval, a single point, or empty.
Indeed, if f is an α-labeling of G then the intersection is a unit interval; if f is a weakly
α-labeling, but not an α-labeling, then the intersection is a point; and, if f is a graceful
but not a weakly α-labeling, then the intersection is empty. For nearly graceful labelings,
the intersection also gives three distinct classes.
Let G(V, E) be a graph without isolated vertices and with q edges. The gracefulness

the electronic journal of combinatorics (2023), #DS6 71

grac(G) of G is the smallest positive integer k for which there exists an injective function
f : V → {0, 1, 2, . . . , k} such that the edge induced function gf : E → {1, 2, . . . , k}
defined by gf (uv) = |f (u) − f (v)| for all edges uv is also injective. Let c(f ) = max{i :
1, 2, . . . , i} are edge labels} and let m(G) = maxf {c(f )} where the maximum is taken
over all injective functions f from V to the nonnegative integers such that gf is also
injective. The measure m(G) is called m-gracefulness of G. It determines how close G is
to being graceful. Pereira, Singh, Arumugam [2380] prove that there are infinitely many
nongraceful graphs with m-gracefulness q−1 and give necessary conditions for an Eulerian
graph with q edges and Kp with q edges to have m-gracefulness q − 1 and q − 2. They
prove that K5 is the only complete graph to have m-gracefulness q − 1. They also give
an upper bound for the highest possible vertex label of Kp if m(Kp ) = q − 2.
A (p, q)-graph G is said to be a super graceful graph if there is a a bijective function
f : V (G) ∪ E(G) −→ {1, 2, . . . , p + q} such that f (uv) = |f (u) − f (v)| for every edge
uv ∈ E(G) labeling. Perumal, Navaneethakrishnan, Nagarajan, Arockiaraj [2385] and
[2386] show that the graphs Pn , Cn , Pm nK1 , Km,n , and Pn K1 minus a pendent edge
at an endpoint of Pn are super graceful graphs. Lau, Shiu, and Ng [1810] study the super
gracefulness of complete graphs, the disjoint union of certain star graphs, the complete
tripartite graphs K(1,1,n) , and certain families of trees. They also provide four methods of
constructing new super graceful graphs. They prove all trees of order at most 7 are super
graceful and conjecture that all trees are super graceful. Amutha and Uma Devi [180]
proved the following graphs are super graceful: fans, double fans DFn = Pn + K2 (n > 2),
and for (m > 3, n > 2) the graphs obtained by identifying a central vertex of the star Sm
with an end vertex of path in Pn + K1 .
For k > 1, Lau, Shiu, and Ng [1815] say a bijection f : V ∪ E → [k, k + p + q − 1] [1815] new
is a k-super graceful labeling if f (uv) = |f (u) − f (v)| for every edge uv in G. A graph
G is k-super graceful if it admits a k-super graceful labeling. This is a generalization of
super graceful labeling defined by Perumal, Navaneethakrishnan, Nagarajan, Arockiaraj
in [2386]. It was referred to as a k-sequential labeling by Slater in [3000], in which Slater
gave necessary and sufficient conditions for a star to be k-sequential. In [1814] Lau, [1814] new
Shiu, and Ng investigated the existence of k-sequential labelings (which they call k-super
graceful labelings) of paths, cycles, caterpillars, complete bipartite and complete tripartite
graphs.
In [875] Elsonbaty and Daoud introduce a new version of gracefulness called an edge
even graceful labeling of graphs. A bijective function f from the edges of a (p, q)-graph G
to {2, 4, . . . , 2q} is said to be an edge even graceful labeling of G if the induced function
f ∗ from the vertices to {0, 2, . . . , 2q} defined by f ∗ (e) is the sum of f (e) (mod max(p, q))
is injective. They prove the following graphs have edge even graceful labelings: Pn if and
only if n is odd, Cn if and only if n is odd, K1,n if and only if n is even, wheels, fans,
friendship graphs, and double wheels Wn,n . The polar grid graph Pm,n consists of n copies
of Cm , a new vertex v0 , and m copies on Pn+1 that share a endpoint at v0 The graph
is drawn as m concentric circles with a center at a new vertex v0 and the m vertices of
each cycle lie on a line with one endpoint at v0 and the other endpoint at the outermost
cycle in such a way that the n vertices of the copies on Pn+1 other the v0 intersect the

the electronic journal of combinatorics (2023), #DS6 72

vertices of cycles. Daoud [781] provided necessary and sufficient conditions for the polar
grid graph to be edge even graceful.
Singh and Devaraj [2977] call a graph G with p vertices and q edges triangular grace-
ful if there is an injection f from V (G) to {0, 1, 2, . . . , Tq } where Tq is the qth triangular
number and the labels induced on each edge uv by |f (u) − f (v)| are the first q triangular
numbers. They prove the following graphs are triangular graceful: paths, level 2 rooted
trees, olive trees (see § 2.1 for the definition), complete n-ary trees, double stars, caterpil-
lars, C4n , C4n with pendent edges, the one-point union of C3 and Pn , and unicyclic graphs
that have C3 as the unique cycle. They prove that wheels, helms, flowers (see §2.2 for the
definition) and Kn with n > 3 are not triangular graceful. They conjecture that all trees
are triangular graceful. In [2843] Sethuraman and Venkatesh introduced a new method
for combining graceful trees to obtain trees that have α-labelings.
Van Bussel [3336] considered two kinds of relaxations of graceful labelings as applied
to trees. He called a labeling range-relaxed graceful it is meets the same conditions as
a graceful labeling except the range of possible vertex labels and edge labels are not
restricted to the number of edges of the graph (the edges are distinctly labeled but not
necessarily labeled 1 to q where q is the number of edges). Similarly, he calls a labeling
vertex-relaxed graceful if it satisfies the conditions of a graceful labeling while permitting
repeated vertex labels. He proves that every tree T with q edges has a range-relaxed
graceful labeling with the vertex labels in the range 0, 1, . . . , 2q −d where d is the diameter
of T and that every tree on n vertices has a vertex-relaxed graceful labeling such that
the number of distinct vertex labels is strictly greater than n/2. In 2017 Sethuraman,
Ragukumar, and Slater [2830] improved the bound on the range-relaxed graceful labeling
given by Van Bussel in [3336] in 2002 for a tree T .
The range-relaxed graceful game is a maker-breaker game played in a simple graph
G where two players, Alice and Bob, alternately assign an unused label f (v) ∈
{0, . . . , k} (k > |E(G)|), to an unlabeled vertex v ∈ V (G). If both ends of an edge
vw ∈ E(G) are already labeled, then the label of the edge is defined as |f (v) − f (w)|. Al-
ice’s goal is to end up with a vertex labeling of G where all edges of G have distinct labels,
and Bob’s goal is to prevent this from happening. When it is required that k = |E(G)|,
the game is called a graceful game. The range-relaxed graceful game and the graceful game
were proposed by Tuza in 2017 [3233]. In [2319] Oliveira, Dantas, and Lui, considered a
question about the least number of consecutive non-negative integer labels necessary for
Alice to win the game on an arbitrary simple graph G and also asked if Alice can win the
range-relaxed graceful game on G with the set of labels {0, . . . , k + 1} once it is known
that she can win with the set {0, . . . , k}. They investigated the graceful game in Cartesian
and corona products of graphs, and determined that Bob has a winning strategy in all
investigated families independently of who starts the game. Additionally, they partially
answer Tuza’s questions presenting the first results in the range-relaxed graceful game
and proving that Alice wins on any simple graph G with order n, size m, and maximum
degree ∆, for any set of labels {0, . . . , k} with k > (n − 1) + 2∆(m − ∆) + (∆(∆ − 1))/2.
In [455], Barrientos and Krop introduce left- and right-layered trees as trees with a
specific representation and define the excess of a tree. Applying these ideas, they show

the electronic journal of combinatorics (2023), #DS6 73

a range-relaxed graceful labeling which improves the upper bound for maximum vertex
label given by Van Bussel in [3336]. They also improve the bounds given by Rosa and
Širáň in [2651] for the α-size and gracesize of lobsters.
Sekar [2736] calls an injective function φ from the vertices of a graph with q edges to
{0, 1, 3, 4, 6, 7, . . . , 3(q − 1), 3q − 2} one modulo three graceful if the edge labels induced
by labeling each edge uv with |φ(u) − φ(v)| is {1, 4, 7, . . . , 3q − 2}. He proves that the
following graphs are one modulo three graceful: Pm ; Cn if and only if n ≡ 0 mod 4;
(2) (t) (t)
Km,n ; C2n (the one-point union of two copies of C2n ); Cn for n = 4 or 8 and t > 2; C6
and t > 4; caterpillars; stars; lobsters; banana trees; rooted trees of height 2; ladders; the
graphs obtained by identifying the endpoints of any number of copies of Pn ; the graph
obtained by attaching pendent edges to each endpoint of two identical stars and then
identifying one endpoint from each of these graphs; the graph obtained by identifying a
vertex of C4k+2 with an endpoint of a star; n-polygonal snakes (see §2.2) for n ≡ 0 (mod
4); n-polygonal snakes for n ≡ 2 (mod 4) where the number of polygons is even; crowns
Cn K1 for n even; C2n Pm (C2n with Pm attached at each vertex of the cycle) for
m > 3; chains of cycles (see §2.2) of the form C4,m , C6,2m , and C8,m . He conjectures that
every one modulo three graceful graph is graceful.
A subdivided shell graph is obtained by subdividing the edges in the path of the shell
graph. Jeba Jesintha and Ezhilarasi Hilda [1385] proved that the subdivided uniform shell
bow graphs (that is, double shells in which each shell has the same order) are one modulo
three graceful. Jeba Jesintha and Ezhilarasi Hilda [1384] proved the disjoint union of two
subdivided shell graphs are one modulo three graceful.
In [2569] Ramachandran and Sekar introduced the notion of one modulo N grace-
ful as follows. For a positive integer N a graph G with q edges is said to be one
modulo N graceful if there is an injective function φ from the vertex set of G to
{0, 1, N, N + 1, 2N, 2N + 1, . . . , (q − 1)N, (q − 1)N + 1} such that φ induces a bijection φ∗
from the edge set of G to {1, N +1, 2N +1, . . . , (q −1)N +1} where φ∗ (uv) = |φ(u)−φ(v)|.
They proved the following graph are one modulo N graceful for all positive integers N :
(t)
paths, caterpillars, and stars [2569]; n-polygonal snakes, Cn , Pa,b [2583]; the splitting
graphs S 0 (P2n ), S 0 (P2n+1 ), S 0 (K1,n ), all subdivision graphs of double triangular snakes,
and all subdivision graphs of 2m-triangular snakes [2570]; the graph Ln ⊗ Sm obtained
from the ladder Ln (Pn × P2 ) by identifying one vertex of Ln with any vertex of the star
Sm other than the center of Sm [2572]; arbitrary supersubdivisions of paths, disconnected
paths, cycles, and stars [2571]; and regular bamboo trees and coconut trees [2573]. Ra-
machandran and Sekar [2574] proved the supersubdivisions of ladders are one modulo N
graceful for all positive integers N . In [2575] Ramachandran and Sekar proved that the
crowns, armed crowns, and chain of even cycles are one modulo N graceful for all positive
integers N .
In 1983 Bange and Barkauskas z [418] introduced the notion of Fibonacci graceful [418] new
graphs as follows. A function f : V (G) → {0, 1, 2, . . . , Fq }, where G has q edges and Fq
is the qth Fibonacci number, is a Fibonacci graceful labeling if the induced edge labeling
f (uv) = |f (u) − f (v)| is a bijection to the set of the first q Fibonacci numbers. Such
a graph is called Fibonacci graceful. They derived a number of properties of Fibonacci

the electronic journal of combinatorics (2023), #DS6 74

graceful graphs and provided some forbidden subgraphs of Fibonacci graceful graphs.
Other results include: Cn is Fibonacci graceful if and only if n = 0 or 2 mod 3, trees
with at least 7 vertices are Fibonacci graceful, and a maximal outerplanar graph with at
least four vertices is Fibonacci graceful if and only if it has exactly two vertices of degree
2. Kathiresan and Amutha in [1667] prove the following: Kn is Fibonacci graceful if and [1667] new
only if n 6 3; if an Eulerian graph with q edges is Fibonacci graceful, then q ≡ 0 (mod
3); paths are Fibonacci graceful; fans Pn K1 are Fibonacci graceful; squares of paths Pn2
are Fibonacci graceful; and caterpillars are Fibonacci graceful. Dharman and Shanmuga
Sundaram [815] proved that balloon trees, barycentric subdivisions of bistars, umbrella [815] new
graphs, and double comb graphs are Fibonacci graceful graphs.
Kalyan and Kempepatil [1568] proved that trees and the graphs obtained by joining a [1568] new
vertex of C3m and a vertex of C3n by P2 or P3 admit Fibonacci graceful labelings. They
define a function f : V (G) → {0, F1 , F2 , . . . , Fq }, where Fi is the ith Fibonacci number, to
be a super Fibonacci graceful labeling if the induced labeling f (uv) = |f (u) − f (v)| is onto
the set {F1 , F2 , . . . , Fq }. They show that bistars Bn,n are Fibonacci graceful but not super
Fibonacci graceful for n > 5; cycles Cn are super Fibonacci graceful if and only if n ≡ 0
(mod 3); if G is Fibonacci or super Fibonacci graceful, then G K1 is Fibonacci graceful;
if G1 and G2 are super Fibonacci graceful graphs in which no two adjacent vertices have
the labels 1 and 2, then G1 ∪ G2 is Fibonacci graceful; and if G1 , G2 , . . . , Gn are super
Fibonacci graceful graphs in which no two adjacent vertices are labeled with 1 and 2, then
the amalgamation of G1 , G2 , . . . , Gn obtained by identifying the vertices having labels 0
is also a super Fibonacci graceful. Karthikeyan, Arthi, Abinaya, Swathi, Madhumathi
(t)
[1657] proved that friendship graphs C3 and the graphs obtained by the one-point union
of copies of K4 with an edge deleted are super Fibonacci graceful.
Vaidya and Prajapati [3296] proved: the graphs obtained joining a vertex of C3m and
a vertex of C3n by a path Pk are Fibonacci graceful; the graphs obtained by starting with
any number of copies of C3m and joining each copy with a copy of the next by identifying
the end points of a path with a vertex of each successive pair of C3m (the paths need
not be the same length) are Fibonacci graceful; the one point union of C3m and C3n is
Fibonacci graceful; the one point union of k cycles C3m is super Fibonacci graceful; every
cycle Cn with n ≡ 0 (mod 3) or n ≡ 1 (mod 3) is an induced subgraph of a super Fibonacci
graceful graph; and every cycle Cn with n ≡ 2 (mod 3) can be embedded as a subgraph of
a Fibonacci graceful graph. [3041] Sridevi, Navaneethakrishnan, and Nagarajan proved [3041] new
the following graphs are super Fibonacci graceful: the graphs obtained by identifying the
apex of a fan with the end point of a path, the graphs obtained by identifying the apex of
a fan with the vertex of maximum degree of K1,n P2 , the graphs obtained by identifying
a vextex of C3n with the end point of a path, the graphs obtained by identifying a vextex
of C3n with the center of a star, and the graphs obtained by identifying each endpoint a
star with the center of K1,2 .
For a graph G with q edges an injective function f from the vertices of G to
{0, F1 , F2 , . . . , Fq−1 , Fq+1 }, where Fi is the ith Fibonacci number (as defined by Kathire-
san and Amuth above), is said to be almost super Fibonacci graceful if the induced
edge labeling f ∗ (uv) = |f (u) − f (v)| is a bijection onto the set {F1 , F2 , . . . , Fq } or

the electronic journal of combinatorics (2023), #DS6 75

{0, F1 , F2 , . . . , Fq−1 , Fq+1 }. Sridevi, Navaneethakrishnan, and Nagarajan [3041] proved
that paths, combs, graphs obtained by subdividing each edge of a star, and some special
types of extension of cycle related graphs are almost super Fibonacci graceful labeling.
Sridevi, Navaneethakrishnan, and Nagarajan [3040] showed that paths, combs, and some [3040] new
special types of extension of cycle-related graphs are almost super Fibonacci graceful.
For a graph G and a vertex v of G, a vertex switching Gv is the graph obtained from G
by removing all edges incident to v and adding edges joining v to every vertex not adjacent
to v in G. Vaidya and Vihol [3321] prove the following: trees are Fibonacci graceful; the
graph obtained by switching of a vertex in cycle is Fibonacci graceful; wheels and helms
are not Fibonacci graceful; the graph obtained by switching of a vertex in a cycle is super
Fibonacci graceful except n > 6; the graph obtained by switching of a vertex in cycle Cn
for n > 6 can be embedded as an induced subgraph of a super Fibonacci graceful graph;
and the graph obtained by joining two copies of a fixed fan with an edge is Fibonacci
graceful.
The Perrin sequence of numbers Pn is defined by the linear recurrence relation satisfy-
ing the conditions: P1 = 3, P2 = 0, P3 = 2, and Pn = Pn−2 + Pn−3 , if n > 4. Letting Pi be
the ith term of the Perrin sequence and P0 = 0, Sugumaran and Rajesh [3118] introduced
the notion of Perrin graceful labeling as follows: A function f is called a Perrin grace-
ful labeling of a graph G, if f : V (G) → {P0 , P1 , P2 , ..., Pq } is injective and the induced
function f (∗) : E(G) → {P1 , P2 , ..., Pq } defined by f ∗ (uv) = |f (u) − f (v)| is bijective. A
graph that admits Perrin graceful labeling is called a Perrin graceful graph. In [3118]
Sugumaran and Rajesh proved that the following graphs are Perrin graceful graphs: K1,n ,
Bn,n , Pn K1 , Cn K1 , and < K1,n ; 4 >.
For n > 1 the Pell numbers are defined as p0 = 0, p1 = 1, and pn+1 = 2pn +pn−1 . For a
graph G with q edges Muthuramakrishnan and Sutha [2236] introduced the concept of Pell
graceful labeling as an injective function f from V (G) to the Pell numbers {0, 1, 2, . . . , pq }
such that the induced edge labeling f ∗ (uv) = |f (u) − f (v)| is a bijection onto the Pell
numbers {p1 , p2 , . . . , pq } They prove that paths, combs Pn K1 (n > 3), and the graphs
obtained by the one point union of paths of lengths 1, 2, . . . , n (n > 3) are Pell graceful.
In [613] Brešar and Klavžar define a natural extension of graceful labelings of certain
tree subgraphs of hypercubes. A subgraph H of a graph G is called isometric if for every
two vertices u, v of H, there exists a shortest u-v path that lies in H. The isometric
subgraphs of hypercubes are called partial cubes. Two edges xy, uv of G are in Θ-relation
if dG (x, u) + dG (y, v) 6= dG (x, v) + dG (y, u). A Θ-relation is an equivalence relation that
partitions E(G) into Θ-classes. A Θ-graceful labeling of a partial cube G on n vertices is
a bijection f : V (G) → {0, 1, . . . , n − 1} such that, under the induced edge labeling, all
edges in each Θ-class of G have the same label and distinct Θ-classes get distinct labels.
They prove that several classes of partial cubes are Θ-graceful and the Cartesian product
of Θ-graceful partial cubes is Θ-graceful. They also show that if there exists a class of
partial cubes that contains all trees and every member of the class admits a Θ-graceful
labeling then all trees are graceful.
Cohen and Kovše showed that the graph obtained by merging two vertices of two
4-cycles is not a Θ-graceful partial cube, thereby answering in the negative a question of

the electronic journal of combinatorics (2023), #DS6 76

Brešar and Klavžar [613] who asked whether every partial cube is Θ-graceful.
Table 4 provides a summary results about graceful-like labelings adapted from [611].
“Y” indicates that all graphs in that class have the labeling; “N” indicates that not all
graphs in that class have the labeling; “?” means unknown; “C” means conjectured.

Table 4: Summary of Results on Graceful-like labelings

Graph α-labeling β-labeling σ-labeling ρ-labeling

Cycle Cn , n ≡ 0 mod 4 Y [2648] Y Y Y
Cycle Cn , n ≡ 3 mod 4 N [2648] Y [2648] Y Y
Wheels N Y [984], [1255] Y Y
Trees
Yes, if order 6 5 35 [914] 54
Paths Y [2648] Y Y Y
Caterpillars Y [2648] Y Y Y
Firecrackers Y [692] Y Y Y
Lobsters N[573] ?C [544] Y Y [659]
Bananas ? Y [2822], [2821] Y Y
Symmetrical trees N [573] Y [548] Y Y
Olive trees ? Y [2355], [13] Y Y
Diameter < 8 N [3447] Y Y Y
< 5 end vertices N [573] Y [2648] Y Y
Max degree 3 N [2651] C C C
Max degree 3 and
perfect matching C [608] C C C

3.4 k-graceful Labelings

A natural generalization of graceful graphs is the notion of k-graceful graphs introduced
independently by Slater [3001] in 1982 and by Maheo and Thuillier [2054] in 1982. A graph
G with q edges is k-graceful if there is labeling f from the vertices of G to {0, 1, 2, . . . , q +
k − 1} such that the set of edge labels induced by the absolute value of the difference
of the labels of adjacent vertices is {k, k + 1, . . . , q + k − 1}. Obviously, 1-graceful is
graceful and it is readily shown that any graph that has an α-labeling is k-graceful for
all k. Graphs that are k-graceful for all k are sometimes called arbitrarily graceful. The
result of Barrientos and Minion [456] that all snake polyominoes are α-graphs partially
answers a question of Acharya [30] and supports his conjecture that if the length of every
cycle of a graph is a multiple of 4, then the graph is arbitrarily graceful. In [2772] Seoud
and Elsakhawi show that P2 ⊕ K2 (n > 2) is arbitrarily graceful. Ng [2282] has shown
that there are graphs that are k-graceful for all k but do not have an α-labeling.
Results of Maheo and Thuillier [2054] together with those of Slater [3001] show that:
Cn is k-graceful if and only if either n ≡ 0 or 1 (mod 4) with k even and k 6 (n − 1)/2,

the electronic journal of combinatorics (2023), #DS6 77

or n ≡ 3 (mod 4) with k odd and k 6 (n2 − 1)/2. Maheo and Thuillier [2054] also proved
that the wheel W2k+1 is k-graceful and conjectured that W2k is k-graceful when k 6= 3 or
k 6= 4. This conjecture was proved by Liang, Sun, and Xu [1942]. Kang [1631] proved that
Pm × C4n is k-graceful for all k. Lee and Wang [1906] showed that the graphs obtained
from a nontrivial path of even length by joining every other vertex to one isolated vertex
(a lotus), the graphs obtained from a nontrivial path of even length by joining every other
vertex to two isolated vertices (a diamond), and the graphs obtained by arranging vertices
into a finite number of rows with i vertices in the ith row and in every row the jth vertex
in that row is joined to the jth vertex and j + 1st vertex of the next row (a pyramid) are
k-graceful. Liang and Liu [1930] have shown that Km,n is k-graceful. Bu, Gao, and Zhang
[622] have proved that Pn × P2 and (Pn × P2 ) ∪ (Pn × P2 ) are k-graceful for all k. Acharya
(see [30]) has shown that a k-graceful Eulerian graph with q edges must satisfy one of the
following conditions: q ≡ 0 (mod 4), q ≡ 1 (mod 4) if k is even, or q ≡ 3 (mod 4) if k
is odd. Bu, Zhang, and He [627] have shown that an even cycle with a fixed number of
pendent edges adjoined to each vertex is k-graceful. Lu, Pan, and Li [2041] have proved
that K1,m ∪ Kp,q is k-graceful when k > 1, and p and q are at least 2. Jirimutu, Bao, and
Kong [1552] have shown that the graphs obtained from K2,n (n > 2) and K3,n (n > 3)
by attaching r > 2 edges at each vertex is k-graceful for all k > 2. Seoud and Elsakhawi
[2772] proved: paths and ladders are arbitrarily graceful; and for n > 3, Kn is k-graceful
if and only if k = 1 and n = 3 or 4. Li, Li, and Yan [1927] proved that Km,n is k-graceful
graph. Pradhan and Kamesh [2481] showed that the hairy cycle Cn · rK1 (n ≡ 3 (mod
4), the graph obtained by adding a pendent edge to each pendent vertex of hairy cycle
Cn · K1 ; n ≡ 0 (mod 4), double graphs of path Pn , and double graphs of combs Pn · K1
are k-graceful.
Yao, Cheng, Zhongfu, and Yao [3530] have shown: a tree of order p with maximum
degree at least p/2 is k-graceful for some k; if a tree T has an edge u1 u2 such that the
two components T1 and T2 of T − u1 u2 have the properties that dT1 (u1 ) > |T1 |/2 and
dT2 (u2 ) > |T2 |/2, then T is k-graceful for some positive k; if a tree T has two edges
u1 u2 and u2 u3 such that the three components T1 , T2 , and T3 of T − {u1 u2 , u2 u3 } have
the properties that dT1 (u1 ) > |T1 |/2, dT2 (u2 ) > |T2 |/2, and dT3 (u3 ) > |T3 |/2, then T is
k-graceful for some k > 1; and every Skolem-graceful (see 3.5 for the definition) tree is
k-graceful for all k > 1. They conjecture that every tree is k-graceful for some k > 1.
Several authors have investigated the k-gracefulness of various classes of subgraphs of
grid graphs. Acharya [28] proved that all 2-dimensional polyminoes that are convex and
Eulerian are k-graceful for all k; Lee [1836] showed that Mongolian tents and Mongolian
villages are k-graceful for all k (see §2.3 for the definitions); Lee and K. C. Ng [1860]
proved that all Young tableaus (see §2.3 for the definitions) are k-graceful for all k. (A
special case of this is Pn × P2 .) Lee and H. K. Ng [1860] subsequently generalized these
results on Young tableaus to a wider class of planar graphs.
In [465] Barrientos and Minion say that two caterpillars Γ and Ω of size n are analogous
if the stable sets of Γ have the same cardinalities as the stable sets of Ω. They prove that if
Ω is an induced subgraph of a gracefully labeled graph G, such that the induced labeling is
a bipartite k-labeling shifted c units, then the graph G0 obtained by replacing Ω with any

the electronic journal of combinatorics (2023), #DS6 78

other caterpillar Γ analogous to Ω, is a graceful graph. This result is used to generalize
several existing results that use k-graceful labelings of paths such as the subdivision of
graceful trees [633], the α-labeling of the ith attachment tree [2843], the α-labelings of
path-like trees [438], the α-labelings of the graphs obtained by identifying the end-vertices
of b paths of length a with two new vertices, as well as the graceful labelings of the armed
crowns [2736].
Duan and Qi [856] use Gt (m1 , n1 ; m2 , n2 ; . . . ; ms , ns ) to denote the graph composed of
the s complete bipartite graphs Km1 ,n1 , Km2 ,n2 , . . . , Kms ,ns that have only t
(1 6 t 6 min{m1 , m2 , . . . , ms }) common vertices but no common edge and
G(m1 , n1 ; m2 , n2 ) to denote the graph composed of the complete bipartite graphs
Km1 ,n1 , Km2 ,n2 with exactly one common edge. They prove that these graphs are k-
graceful graphs for all k.
Let c, m, p1 , p2 , . . . , pm be positive integers. For i = 1, 2, . . . , m, let Si be a set of pi + 1
integers and let Di be the set of positive differences of the pairs of elements of Si . If all
these differences are distinct then the system D1 , D2 , . . . , Dm is called a perfect Pm system of
difference sets starting at c if the union of all the sets Di is c, c + 1, . . . , c − 1 + i=1 pi2+1 .

There is a relationship between k-graceful graphs and perfect systems of difference sets. A
perfect system of difference sets starting with c describes a c-graceful labeling of a graph
that is decomposable into complete subgraphs. A survey of perfect systems of difference
sets is given in [18].
Acharya and Hegde [44] generalized k-graceful labelings to (k, d)-graceful labelings by
permitting the vertex labels to belong to {0, 1, 2, . . . , k + (q − 1)d} and requiring the set
of edge labels induced by the absolute value of the difference of labels of adjacent vertices
to be {k, k + d, k + 2d, . . . , k + (q − 1)d}. They also introduce an analog of α-labelings
in the obvious way. Notice that a (1,1)-graceful labeling is a graceful labeling and a
(k, 1)-graceful labeling is a k-graceful labeling. Bu and Zhang [626] have shown: Km,n
is (k, d)-graceful for all k and d; for n > 2, Kn is (k, d)-graceful if and only if k = d
and n 6 4; if mi , ni > 2 and max{mi , ni } > 3, then Km1 ,n1 ∪ Km2 ,n2 ∪ · · · ∪ Kmr ,nr is
(k, d)-graceful for all k, d, and r; if G has an α-labeling, then G is (k, d)-graceful for all
k and d; a k-graceful graph is a (kd, d)-graceful graph; a (kd, d)-graceful connected graph
is k-graceful; and a (k, d)-graceful graph with q edges that is not bipartite must have
k 6 (q − 2)d.
Let T be a tree with adjacent vertices u0 and v0 and pendent vertices u and v such
that the length of the path u0 − u is the same as the length of the path v0 − v. Hegde
and Shetty [1231] call the graph obtained from T by deleting u0 v0 and joining u and v
an elementary parallel transformation of T . They say that a tree T is a Tp -tree if it can
be transformed into a path by a sequence of elementary parallel transformations. They
prove that every Tp -tree is (k, d)-graceful for all k and d and every graph obtained from
a Tp -tree by subdividing each edge of the tree is (k, d)-graceful for all k and d.
Yao, Cheng, Zhongfu, and Yao [3530] have shown: a tree of order p with maximum
degree at least p/2 is (k, d)-graceful for some k and d; if a tree T has an edge u1 u2 such
that the two components T1 and T2 of T − u1 u2 have the properties that dT1 (u1 ) > |T1 |/2
and T2 is a caterpillar, then T is Skolem-graceful (see 3.5 for the definition); if a tree T

the electronic journal of combinatorics (2023), #DS6 79

has an edge u1 u2 such that the two components T1 and T2 of T − u1 u2 have the properties
that dT1 (u1 ) > |T1 |/2 and dT2 (u2 ) > |T2 |/2, then T is (k, d)-graceful for some k > 1 and
d > 1; if a tree T has two edges u1 u2 and u2 u3 such that the three components T1 , T2 ,
and T3 of T − {u1 u2 , u2 u3 } have the properties that dT1 (u1 ) > |T1 |/2, dT2 (u2 ) > |T2 |/2,
and dT3 (u3 ) > |T3 |/2, then T is (k, d)-graceful for some k > 1 and d > 1; and every
Skolem-graceful tree is (k, d)-graceful for k > 1 and d > 0. They conjecture that every
tree is (k, d)-graceful for some k > 1 and d > 1.
Hegde [1215] has proved the following: if a graph is (k, d)-graceful for odd k and
even d, then the graph is bipartite; if a graph is (k, d)-graceful and contains C2j+1 as
a subgraph, then k 6 jd(q − j − 1); Kn is (k, d)-graceful if and only if n 6 4; C4t is
(k, d)-graceful for all k and d; C4t+1 is (2t, 1)-graceful; C4t+2 is (2t − 1, 2)-graceful; and
C4t+3 is (2t + 1, 1)-graceful.
A semismooth graceful graph is a bipartite graph G with the property that for some
fixed positive integer t 6 q and all positive integers l there is an injective map g :
V −→ {0, 1, . . . , t − l, t + l + 1, . . . , q + l} such that the induced edge labeling map
g ? : E −→ {1 + l, 2 + l, . . . , q + l} defined by g ? (e) = |g(u) − g(v)| is a bijection. Kaneria,
Gohil, and Makadia [1585] prove every semismooth graceful graph is a (k, d)-graceful;
graphs obtained by joining two semismooth graceful graphs with an arbitrary path is a
semismooth graceful graph; and the notions of graceful labeling and odd-even graceful
labelings are equivalent. (A graph G with q edges is odd-even graceful if there is an
injection f from the vertices of G to {1, 3, 5, . . . , 2q + 1} such that, when each edge uv is
assigned the label |f (u) − f (v)|, the resulting edge labels are {2, 4, 6, . . . , 2q}). Kaneria,
Meghpara and Khoda [1592] prove: a smooth graceful labeling for a graph is also an
α-labeling for the graph; a graph that has an α-labeling is a semismooth graceful graph;
graphs that admit an α-labeling are semismooth graceful graphs; if m is even and H has
an α-labeling, then the path union P (m · H) is a smooth graceful graph; and the path
union P (m · H) has an α-labeling.
Nurvazly, Chasanah, and Wiranto [2316] showed that the corona of the ladder L2 and [2316] new
Kn and of L3 and Kn , which they call millipedes, admits graceful, ρ̂, and odd-even graceful
labelings. In [3074] Sudha and Kanniga proved that tensor product of a star and P2 is
odd-even graceful. (The tensor product G ⊗ H of graphs G and H, has the vertex set
V (G) × V (H) and any two vertices (u, u0 ) and (v, v 0 ) are adjacent in G ⊗ H if and only
if u0 is adjacent with v 0 and u is adjacent with v.) In [3372] Venkatesh, Mahalakshmi,
and Amirthavahini use Cn,k to denote the dragon obtained by joining an end point of Pk
t
with a vertex of Cn and Cn,k to denote the graph obtained by taking one-point union of t
t
copies of Cn,k at the common vertex v. They proved that the graph Cn,k admits a graceful
labeling, an odd graceful labeling, and odd-even graceful labeling for all values of t with
t
n = 4, k = 1, and that Cn,1 admits vertex cordial labeling for all values of n and t, except
n ≡ 2 mod 4 (see Section 3.7). Nurvazly and Sugeng [2315] proved that Θ(C3 )n graphs
(n copies of C3 that share an edge) have odd-even graceful labelings. Anitha, Selvam,
and Thirusangu [215] provide k-graceful and odd-even graceful labelings for the extended
duplicate graph of the kite graph.
For a graph G let G(1) , G(2) , . . . , G(n) be n > 2 copies of G. The graph obtained by

the electronic journal of combinatorics (2023), #DS6 80

joining vertices u, v of G(i) with same vertices of the graph G(i+1) by two edges, for all
i = 1, 2, . . . , n − 1 is called the double path union of n copies of the graph G. Such graphs
can obtained in p(p−1) 2
different ways, where p = |V (G)| and are denoted by D(n · G).
Kaneria, Teraiya and Meghpara [1620] prove the double path unions of C4m , Km,n , and
P2m have α-labelings.
Hegde [1213] calls a (k, d)-graceful graph (k, d)-balanced if it has a (k, d)-graceful la-
beling f with the property that there is some integer m such that for every edge uv either
f (u) 6 m and f (v) > m, or f (u) > m and f (v) 6 m. He proves that if a graph is (1, 1)-
balanced then it is (k, d)-graceful for all k and d and that a graph is (1, 1)-balanced graph
if and only if it is (k, k)-balanced for all k. He conjectures that all trees are (k, d)-balanced
for some values of k and d.
Slater [3004] has extended the definition of k-graceful graphs to countable infinite
graphs in a natural way. He proved that all countably infinite trees, the complete graph
with countably many vertices, and the countably infinite Dutch windmill is k-graceful for
all k.
In [1237] Hegde and Shivarajkumar extend the idea of k-graceful labeling of undirected
graphs to directed graphs as follows. A simple directed graph D with n vertices and e
edges is labeled by assigning each vertex a distinct element from the set Ze+k and assigning
the edge xy from vertex x to vertex y the label θ(x, y) = θ(y) − θ(x) mod(e + k), where
θ(y) and θ(x) are the values assigned to the vertices y and x respectively. A labeling is a
k-graceful labeling if all θ(x, y) are distinct and belong to {k, k + 1, . . . , k + e − 1}. If a
digraph D admits a k-graceful labeling then D is called a k-graceful digraph. They provide
some values of k for which the unidirectional cycles admit a k-graceful labeling; give a
necessary and sufficient condition for the outspoken unicyclic wheel to be k-graceful; and
prove that to provide a list of values of k for which the unicyclic wheel is k-graceful is
NP-complete.
More specialized results on k-graceful labelings can be found in [1836], [1860], [1864],
[3001], [621], [623], and [622].
Graceful-type labelings methods have been used for cryptographical password con-
struction for network data [3424], [3423], [3425], and [3132].

3.5 Skolem-Graceful Labelings

A number of authors have invented analogues of graceful graphs by modifying the per-
missible vertex labels. For instance, Lee (see [1890]) calls a graph G with p vertices and q
edges Skolem-graceful if there is an injection from the set of vertices of G to {1, 2, . . . , p}
such that the edge labels induced by |f (x)−f (y)| for each edge xy are 1, 2, . . . , q. A neces-
sary condition for a graph to be Skolem-graceful is that p > q+1. Lee and Wui [1920] have
shown that a connected graph is Skolem-graceful if and only if it is a graceful tree. Yao,
Cheng, Zhongfu, and Yao [3530] have shown that a tree of order p with maximum degree
at least p/2 is Skolem-graceful. Although the disjoint union of trees cannot be graceful,
they can be Skolem-graceful. Lee and Wui [1920] prove that the disjoint union of 2 or 3
stars is Skolem-graceful if and only if at least one star has even size. In [720] Choudum
and Kishore show that the disjoint union of k copies of the star K1,2p is Skolem graceful if

the electronic journal of combinatorics (2023), #DS6 81

k 6 4p + 1 and the disjoint union of any number of copies of K1,2 is Skolem graceful. For
k > 2, let St(n1 , n2 , . . . , nk ) denote the disjoint union of k stars with n1 , n2 , . . . , nk edges.
Lee, Wang, and Wui [1913] showed that the 4-star St(n1 , n2 , n3 , n4 ) is Skolem-graceful for
some special cases and conjectured that all 4-stars are Skolem-graceful. Denham, Leu,
and, Liu [801] proved this conjecture. Kishore [1704] has shown that a necessary condition
for St(n1 , n2 , . . . , nk ) to be Skolem graceful is that some ni is even or (k ≡ 0) or 1 (mod
4) (see also [3564] . He conjectures that each one of these conditions is sufficient. Yue,
Yuan-sheng, and Xin-hong [3564] show that for k at most 5, a k-star is Skolem-graceful if
at one star has even size or k ≡ 0 or 1 (mod 4). Choudum and Kishore [718] proved that
all 5-stars are Skolem graceful.
Lee, Quach, and Wang [1876] showed that the disjoint union of the path Pn and the
star of size m is Skolem-graceful if and only if n = 2 and m is even or n > 3 and m > 1.
It follows from the work of Skolem [2993] that nP2 , the disjoint union of n copies of P2 , is
Skolem-graceful if and only if n ≡ 0 or 1 (mod 4). Harary and Hsu [1186] studied Skolem-
graceful graphs under the name node-graceful. Frucht [986] has shown that Pm ∪ Pn is
Skolem-graceful when m + n > 5. Bhat-Nayak and Deshmukh [559] have shown that
Pn1 ∪ Pn2 ∪ Pn3 is Skolem-graceful when n1 < n2 6 n3 , n2 = t(n1 + 2) + 1 and n1 is even
and when n1 < n2 6 n3 , n2 = t(n1 + 3) + 1 and n1 is odd. They also prove that the
graphs of the form Pn1 ∪ Pn2 ∪ · · · ∪ Pni where i > 4 are Skolem-graceful under certain
conditions. In [806] Deshmukh states the following results: the sum of all the edges on
any cycle in a Skolem graceful graph is even; C5 ∪ K1,n if and only if n = 1 or 2; C6 ∪ K1,n
if and only if n = 2 or 4.
Youssef [3542] proved that if G is Skolem-graceful, then G + Kn is graceful. In [3546]
Youssef shows that that for all n > 2, Pn ∪ Sm is Skolem-graceful if and only if n > 3 or
n = 2 and m is even. Yao, Cheng, Zhongfu, and Yao [3530] have shown that if a tree T
has an edge u1 u2 such that the two components T1 and T2 of T − u1 u2 have the properties
that dT1 (u1 ) > |T1 |/2 and T2 is a caterpillar or have the properties that dT1 (u1 ) > |T1 |/2
and dT2 (u2 ) > |T2 |/2, then T is Skolem-graceful.
A graph G = (V, E) is said to be (k, d)-Skolem graceful if there exists a bijection f
from V (G) to {12, . . . , |V |} such that the induced edge labeling gf defined by gf (uv) =
|f (u) − f (v)| is a bijection from E to {k, k + d, . . . , k + (q − 1)d} where k and d are positive
integers. Such a labeling is called a (k, d)-Skolem graceful labeling of G. In [2381] Pereira,
Singh, and Arumugam present a few basic results on (k, d)-Skolem graceful graphs and
prove that nK2 is (2, 1)-Skolem graceful if and only if n ≡ 0 or 3 (mod 4), which produces
the Langford sequence L(2, n).
Mendelsohn and Shalaby [2134] defined a Skolem labeled graph G(V, E) as one for
which there is a positive integer d and a function L : V → {d, d + 1, . . . , d + m}, satisfying
(a) there are exactly two vertices in V such that L(v) = d + i, 0 6 i 6 m; (b) the distance
in G between any two vertices with the same label is the value of the label; and (c) if G0 is
a proper spanning subgraph of G, then L restricted to G0 is not a Skolem labeled graph.
Note that this definition is different from the Skolem-graceful labeling of Lee, Quach,
and Wang. A hooked Skolem sequence of order n is a sequence s1 , s2 , . . . , s2n+1 such that
s2n = 0 and for each j ∈ {1, 2, . . . , n}, there exists a unique i ∈ {1, 2, . . . , 2n − 1, 2n + 1}

the electronic journal of combinatorics (2023), #DS6 82

such that si = si+j = j. Mendelsohn [2133] established the following: any tree can be
embedded in a Skolem labeled tree with O(v) vertices; any graph can be embedded as
an induced subgraph in a Skolem labeled graph on O(v 3 ) vertices; for d = 1, there is
a Skolem labeling or the minimum hooked Skolem (with as few unlabeled vertices as
possible) labeling for paths and cycles; for d = 1, there is a minimum Skolem labeled
graph containing a path or a cycle of length n as induced subgraph. In [2133] Mendelsohn
and Shalaby prove that the necessary conditions in [2134] are sufficient for a Skolem
or minimum hooked Skolem labeling of all trees consisting of edge-disjoint paths of the
same length from some fixed vertex. Graham, Pike, and Shalaby [1146] obtained various
Skolem labeling results for grid graphs. Among them are P1 ×Pn and P2 ×Pn have Skolem
labelings if and only if n ≡ 0 or 1 mod 4; and Pm × Pn has a Skolem labeling for all m
and n at least 3.
In [2395] Pike, Sanaei, and Shalaby introduce pseudo-Skolem sequences, which are
similar to Skolem-type sequences in their structures and applications. They use known
Skolem-type sequences to constructions of such sequences and discuss applications of these
sequences to Skolem labelingsre graphs such that H is bipartite, and give formulas for the
gamma-number of rail-siding graphs and caterpillars.
In [748] Clark and Sanaei present (hooked) vertex Skolem labelings for generalized
Dutch windmills whenever such labelings exist. They present a novel technique for show-
ing that generalized Dutch windmills with more than two cycles cannot be Skolem labelled
and that those composed of two cycles of lengths m and n, n > m cannot be Skolem
labelled if and only if n − m ≡ 3 or 5 (mod 8) and m is odd.

3.6 Odd-Graceful Labelings

Gnanajothi [1104, p. 182] defined a graph G with q edges to be odd-graceful if there is an
injection f from V (G) to {0, 1, 2, . . . , 2q − 1} such that, when each edge xy is assigned the
label |f (x) − f (y)|, the resulting edge labels are {1, 3, 5, . . . , 2q − 1}. She proved that the
class of odd-graceful graphs lies between the class of graphs with α-labelings and the class
of bipartite graphs by showing that every graph with an α-labeling has an odd-graceful
labeling and every graph with an odd cycle is not odd-graceful. She also proved the
following graphs are odd-graceful: Pn ; Cn if and only if n is even; Km,n ; combs Pn K1
(graphs obtained by joining a single pendent edge to each vertex of Pn ); books; crowns
Cn K1 (graphs obtained by joining a single pendent edge to each vertex of Cn ) if and only
if n is even; the disjoint union of copies of C4 ; the one-point union of copies of C4 ; Cn ×K2
if and only if n is even; caterpillars; rooted trees of height 2; the graphs obtained from
Pn (n > 3) by adding exactly two leaves at each vertex of degree 2 of Pn ; the graphs
obtained from Pn × P2 by deleting an edge that joins to end points of the Pn paths; the
graphs obtained from a star by adjoining to each end vertex the path P3 or by adjoining to
each end vertex the path P4 . She conjectures that all trees are odd-graceful and proves the
conjecture for all trees with order up to 10. Barrientos [442] has extended this to trees of
order up to 12. Eldergill [868] generalized Gnanajothi’s result on stars by showing that the
graphs obtained by joining one end point from each of any odd number of paths of equal
length is odd-graceful. He also proved that the one-point union of any number of copies

the electronic journal of combinatorics (2023), #DS6 83

of C6 is odd-graceful. Kathiresan [1665] has shown that ladders and graphs obtained
from them by subdividing each step exactly once are odd-graceful. Barrientos [445] and
[442] has proved the following graphs are odd-graceful: every forest whose components are
caterpillars; every tree with diameter at most five is odd-graceful; and all disjoint unions
of caterpillars. He conjectures that every bipartite graph is odd-graceful. In [2268] Neela
and Selvaraj partially resolved a Barrientos’s conjecture by showing that the following
graphs are odd-graceful: finite unions of paths, stars, and caterpillars; finite unions of
ladders; finite unions of paths, bistars and caterpillars; finite unions of graphs obtained
by the one end point union of an odd number of paths of uniform length; and the coronas
Km;n rKl . Gao, Zhang, and Xu [1031] proved that Pn × Pm (m = 2, 3 or 4), generalized
crown graphs Cn K1,t , and gears are odd graceful.
Seoud, Diab, and Elsakhawi [2769] have shown that a connected complete r-partite
graph is odd-graceful if and only if r = 2 and that the join of any two connected graphs
is not odd-graceful. Yan [3511] proved that Pm × Pn is odd-graceful labeling. Vaidya and
Shah [3304] prove that the splitting graph and the shadow graph of bistar are odd-graceful.
(The shadow graph D2 (G) of a connected graph G is constructed by taking 2 copies G1
and G2 of G and joining each vertex u in G1 to the neighbors of the corresponding vertex v
in G2 . Li, Li, and Yan [1927] proved that Km,n is odd-graceful. Liu, Wang, and Lu [1972]
that proved that a class of bicyclic graphs with a common edge is odd-graceful. Moussa
and Badr [2199] proved tha ladders and subdivisions of ladders with pendent edges are
odd-graceful.
Sekar [2736] has shown the following graphs are odd-graceful: the graph obtained by
identifying an end point of Pn with every vertex of Cm where n > 3 and m is even; Pa,b
when a > 2 and b is odd (see §2.7); P2,b and b > 2; P4,b and b > 2; Pa,b when a and
b are even and a > 4 and b > 4; P4r+1,4r+2 ; P4r−1,4r ; all n-polygonal snakes with n even;
(t)
Cn (see §2.2 for the definition); graphs obtained by beginning with C6 and repeatedly
forming the one-point union with additional copies of C6 in succession; graphs obtained
by beginning with C8 and repeatedly forming the one-point union with additional copies
of C8 in succession; graphs obtained from even cycles by identifying a vertex of the cycle
with the endpoint of a star; C6,n and C8,n (see §2.7); the splitting graph of Pn (see §2.7)
the splitting graph of Cn , n even; lobsters, banana trees, and regular bamboo trees (see
§2.1).
Yao, Cheng, Zhongfu, and Yao [3530] have shown the following: if a tree T has an
edge u1 u2 such that the two components T1 and T2 of T − u1 u2 have the properties that
dT1 (u1 ) > |T1 |/2 and T2 is a caterpillar, then T is odd-graceful; and if a tree T has a
vertex of degree at least |T |/2, then T is odd-graceful. They conjecture that for trees
the properties of being Skolem-graceful and odd-graceful are equivalent. Recall a banana
tree is a graph obtained by starting with any number os stars and connecting one end-
vertex from each to a new vertex. Zhenbin [3593] has shown that graphs obtained by
starting with any number of stars, appending an edge to exactly one edge from each star,
then joining the vertices at which the appended edges were attached to a new vertex are
odd-graceful.
Solairaju and Chithra [3018] defined a graph G with q edges to be edge-odd graceful

the electronic journal of combinatorics (2023), #DS6 84

if there is an bijection f from the edges of the graph to {1, 3, 5, . . . , 2q − 1} such that,
when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting
vertex labels are distinct. They prove they following graphs are odd-graceful: paths with
at least 3 vertices; odd cycles; ladders Pn × P2 (n > 3); stars with an even number of
edges; and crowns Cn K1 . In [3019] they prove the following graphs have edge-odd
graceful labelings: Pn (n > 1) with a pendent edge attached to each vertex (combs); the
graph obtained by appending 2n + 1 pendent edges to each endpoint of P2 or P3 ; and the
graph obtained by subdividing each edge of the star K1,2n .
For a graph G, Kulli and Muddebihai [1772] define the lict graph of G as the graph
whose vertex set is the union of the edges of G and the set of cutpoints of G where two
vertices are adjacent if and only if the corresonding members of G are adjacent or the
corresponding members of G are incident. They define the litact graph of G as the graph
whose vertex set is the union of the edges of G and the set of cutpoints of G where two
vertices are adjacent if and only if the corresonding members of G are adjacent or the
corresponding members of G are adjacent or incident. Mirajkar and Sthavarmath [2153]
provided edge-odd graceful labeling for the lict graph of Pn for n > 1 and odd, the lict
graph of the one-point of Cn and P2 , and the litact graph of Pn for n > 4.
A subdivided shell graph is obtained by subdividing the edges in the path of the shell
graph. Let G1 , G2 , . . . , Gn be n subdivided shell graphs of any order. The graph SSG(n)
is obtained by adding an edge to apexes of Gi and Gi+1 , i = 1, 2, . . . , n − 1. Jeba Jesintha
and Ezhilarasi Hilda [1392] that SSG(2) is odd graceful. In [1386] and [1391] Jeba Jesintha
and Ezhilarasi Hilda proved that the subdivided uniform shell bow graphs (that is, double
shells in which each shell has the same order) are odd graceful and shell butterfly graphs
are edge-odd graceful. Daoud [780] provided necessary and sufficient conditions for Cm ×
Pn and Cm × Cn to be edge-odd graceful.
Gao [1024] has proved the following graphs are odd-graceful: the union of any number
of paths; the union of any number of stars; the union of any number of stars and paths;
Cm ∪ Pn ; Cm ∪ Cn ; and the union of any number of cycles each of which has order divisible
by 4.
If f is an odd-graceful labeling of a bipartite graph G with bipartition (V1 , V2 ) such
that max{f (u) : u ∈ V1 } < min{f (v) : v ∈ V2 }, Zhou, Yao, Chen, and Tao [3601]
say that f is a set-ordered odd-graceful labeling of G. They proved that every lobster
is odd-graceful and adding leaves to a connected set-ordered odd-graceful graph is an
odd-graceful graph.
In [2758] Seoud and Abdel-Aal determined all odd-graceful graphs of order at most
6 and proved that if G is odd-graceful then G ∪ Km,n is odd-graceful. In [2777] Seoud
and Helmi proved: if G has an odd-graceful labeling f with bipartition (V1 , V2 ) such that
max{f (x) : f (x) is even, x ∈ V1 } < min{f (x) : f (x) is odd, x ∈ V2 }, then G has
an α-labeling; if G has an α-labeling, then G Kn is odd-graceful; and if G1 has an
α-labeling and G2 is odd-graceful, then G1 ∪ G2 is odd-graceful. They also proved the
following graphs have odd-graceful labelings: dragons obtained from an even cycle; graphs
obtained from a gear graph by attaching a fixed number of pendent edges to each vertex
of degree 2 on rim of the wheel of the graph; C2m Kn ; graphs obtained from an even

the electronic journal of combinatorics (2023), #DS6 85

cycle by attaching a fixed number of pendent edges to every other vertex; graphs obtained
by identifying an endpoint of a star Sn (n > 3) with a vertex of an even cycle; the graphs
consisting of two even cycles of the same order that share a common vertex with any
number of pendent edges attached at the common vertex; and the graphs obtained by
joining two even cycles of the same order by an edge. Seoud, El Sonbaty, and Abd El
Rehim [2770] proved that the conjunction Pm ∧ Pn for all n, m > 2 and the conjunction
K2 ∧ Fn for n even are odd-graceful. Jeba Jesintha and Ezhilarasi Hilda [1384] proved the
disjoint union of two subdivided shell graphs is odd-graceful and the one vertex union of
three subdivided shells are odd-graceful.
In [2196] and [2197] Moussa proved that Cm ∪ Pn is odd-graceful in some cases and
gave algorithms to prove that for all m > 2 the graphs P4r−1;m , r = 1, 2, 3 and P4r+1;m ,
r = 1, 2 are odd-graceful. (Pn;m is the graph obtained by identifying the endpoints of m
paths each of length n). He also presented an algorithm that showed that closed spider
graphs and the graphs obtained by joining one or two copies of Pm to each vertex of the
path Pn are odd-graceful. Moussa and Badr [2195] proved that Cm Pn is odd-graceful if
and only if m is even (see also [272]). Badr, Moussa, and Kathiresan [272] proved ladders
are odd graceful.
Moussa [2198] defines the tensor product, Pm ∧ Pn , of Pm and Pn as the graph with
vertices vij , i = 1, . . . , n; j = 1, . . . , m and edges v1j v2j+1 , v2j+1 v3j , . . . , vn−1
j
vnj+1 for j odd
and v1j v2j−1 , v2j−1 v3j , . . . , vn−1
j
vnj−1 for j even. He proves that Pm ∧ Pm is odd-graceful.
In [3] Abdel-Aal generalized the notions of shadow graphs and splitting graphs are
follows. The m-shadow graph Dm (G) of a connected graph G is constructed by taking m
copies of G1 , G2 , . . . , Gm of G , and joining each vertex u in Gi to the neighbors of the
corresponding vertex v in Gj for 1 6 i, j 6 m. The m-splitting graph Splm (G) of a graph
G is obtained by adding to each vertex v of G m new vertices, v 1 , v 2 , . . . , v m , such that
v i , 1 6 i 6 m is adjacent to every vertex that is adjacent to v in Gj . Thus the 2-shadow
graph is the shadow graph D2 (G) and the 1-splitting graph of G is the splitting graph of
G. Abdel-Aal proved the following graphs are odd-graceful: Dm (Pn ), Dm (Pn ⊕ K2 ) (the
symmetric product of Pn and K2 ), Dm (Kr,s ), Splm (Pn ), Splm (K1,n) , and Splm (Pn ⊕ K2 ).
Vaidya and Bijukumar [3261] proved the following are odd-graceful: graphs obtained
by joining two copies of Cn by a path; graphs that are two copies of an even cycle that
share a common edge; graphs that are the splitting graph of a star; and graphs that are
the tensor product of a star and P2 . Jeba Jesintha, Jaya Glory, and Elakiya Solai [1393] [1393] new
proved that the path unions of caterpillars are odd graceful.
Acharya, Germina, Princy, and Rao [40] proved that every bipartite graph G can be
embedded in an odd-graceful graph H. The construction is done in such a way that if
G is planar and odd-graceful, then so is H. Varkey and Sunoj [3344] investigate some
new families of odd graceful graphs generated from various graph operations on the given
graph.
In [688] Chawathe and Krishna extend the definition of odd-gracefulness to countably
infinite graphs and show that all countably infinite bipartite graphs that are connected
and locally finite have odd-graceful labelings.
Solairaju and Chithra [3018] defined a graph G with q edges to be edge-odd graceful

the electronic journal of combinatorics (2023), #DS6 86

if there is an bijection f from the edges of the graph to {1, 3, 5, . . . , 2q − 1} such that,
when each vertex is assigned the sum of all the edges incident to it mod 2q, the resulting
vertex labels are distinct. They prove they following graphs are odd-graceful: paths with
at least 3 vertices; odd cycles; ladders Pn × P2 (n > 3); stars with an even number of
edges; and crowns Cn K1 . In [3019] they prove the following graphs have edge-odd
graceful labelings: Pn (n > 1) with a pendent edge attached to each vertex (combs); the
graph obtained by appending 2n + 1 pendent edges to each endpoint of P2 or P3 ; and the
graph obtained by subdividing each edge of the star K1,2n .
Singhun [2981] proved the following graphs have edge-odd graceful labelings: W2n ;
Wn K1 ; and Wn Km , when n is odd, m is even, and n divides m. Seoud and Salim
[2792] present edge-odd graceful labelings for the following families of graphs: Wn for
n ≡ 1, 2 and 3 (mod 4); Cn K2m−1 ; even helms; Pn K2m ; and K2,s . They also provide
two theorems about non edge-odd graceful graphs. Susanti, Ernanto1, and Surodjo [3150]
found edge-odd graceful labelings for some classes of prism related graphs.
In [3042] Sridevi, Navaeethakrishnan, Nagarajan, and Nagarajan call a graph G with q
edges odd-even graceful if there is an injection f from the vertices of G to {1, 3, 5, . . . , 2q +
1} such that, when each edge uv is assigned the label |f (u) − f (v)|, the resulting edge
labels are {2, 4, 6, . . . , 2q}. They proved that Pn , combs Pn K1 , stars K1,n , K1,2,n , Km,n ,
and bistars Bm,n are odd-even graceful.
Sudha and Babu [3071] say a graph G with q edges is even-even graceful if there is an
injection f from the edges of G to {2, 4, 6, . . . , 2q} such that, the induced map f + from
V (G) to {0, 2, . . . , 2k − 2} defined by f ∗ (x) = Σ(f (xy) (mod 2k) where k = max(p, q) is
injective and each value is f ∗ (x) is even. They proved that dumbbells, stars, Cn × P2 ,
and K1 + Cn are even-even graceful.
Behera, Mishra, and Nayak [527] proved the following: bistars Br,r are even-even
graceful, combs are even-even graceful, the trees obtained by joining and even number
of pendent edges to the endpoint of a path are even-even graceful, the graphs obtained
by identifying the center of a star and a vertex of C3 are odd-even graceful, the graphs
obtained by identifying the center of a star and a vertex of C3 and two pendent edges
at the other two verticies are odd-even graceful, and the graphs obtained by identifying
the center of a star with a vertex of Cn and the endpoints of the star with the opposite
vertices of Cn is odd-even graceful.
In [782] Daoud zele introduced vertex odd graceful labelings as follows. Let G be a
graph with q edges. A function f is called a vertex odd gracefulabeling of G if f E(G) →
{1, 2, 3, . . . , 2q} is an injection and the induced function f ∗ V (G) → {1, 3, . . . , 2q − 1}
defined as f ∗ (u) = uv∈E(G) f (uv) (mod 2q) is also an injection. A graph which admits
P
a vertex odd graceful labeling is called a vertex odd graceful graph. Necessary and sufficient
conditions for prisme, tori, wheels, fans and books to be vertex odd graceful are given.

3.7 Cordial Labelings

Cahit [640] has introduced a variation of both graceful and harmonious labelings. Let
f be a function from the vertices of G to {0, 1} and for each edge xy assign the label
|f (x) − f (y)|. Call f a cordial labeling of G if the number of vertices labeled 0 and the

the electronic journal of combinatorics (2023), #DS6 87

number of vertices labeled 1 differ by at most 1, and the number of edges labeled 0 and
the number of edges labeled 1 differ at most by 1. Cahit [641] proved the following: every
tree is cordial; Kn is cordial if and only if n 6 3; Km,n is cordial for all m and n; the
(t)
friendship graph C3 (i.e., the one-point union of t 3-cycles) is cordial if and only if t 6≡ 2
(mod 4); all fans are cordial; the wheel Wn is cordial if and only if n 6≡ 3 (mod 4) (see also
[853]); maximal outerplanar graphs are cordial; and an Eulerian graph is not cordial if its
size is congruent to 2 (mod 4). Kuo, Chang, and Kwong [1780] determine all m and n for
which mKn is cordial. Youssef [3546] proved that every Skolem-graceful graph (see 3.5
for the definition) is cordial. Liu and Zhu [1981] proved that a 3-regular graph of order n
is cordial if and only if n 6≡ 4 (mod 8). In [1319] Imran, Cancan, Ali, Nadeem, Mushtaq, [1319] new
Aslam, Riaz, proved various comb related graphs are cordial. Kastrati, Myrvold, Panjer,
and Williams [1661] proved that a forest is cordial if and only if it does not have 4k + 2 [1661] new
components and every vertex has odd-degree.
A k-angular cactus is a connected graph all of whose blocks are cycles with k vertices.
In [641] Cahit proved that a k-angular cactus with t cycles is cordial if and only if kt 6≡ 2
(mod 4). This was improved by Kirchherr [1702] who showed any cactus whose blocks
are cycles is cordial if and only if the size of the graph is not congruent to 2 (mod 4).
Kirchherr [1703] also gave a characterization of cordial graphs in terms of their adjacency
matrices. Ho, Lee, and Shee [1254] proved: Pn × C4m is cordial for all m and all odd n;
the composition G and H is cordial if G is cordial and H is cordial and has odd order
and even size (see §2.3 for definition of composition); for n > 4 the composition Cn [K2 ] is
cordial if and only if n 6≡ 2 (mod 4); the Cartesian product of two cordial graphs of even
size is cordial. Ho, Lee, and Shee [1253] showed that a unicyclic graph is cordial unless
it is C4k+2 and that the generalized Petersen graph (see §2.7 for the definition) P (n, k) is
cordial if and only if n 6≡ 2 (mod 4). Khan [1684] proved that a graph that consisting of
a finite number of cycles of finite length joined at a common cut vertex is cordial if and
only if the number of edges is not congruent to 2 mod 4.
Du [853] determines the maximal number of edges in a cordial graph of order n and
gives a necessary condition for a k-regular graph to be cordial. Riskin [2628] proved that
Möbius ladders Mn (see §2.3 for the definition) are cordial if and only if n > 3 and n 6≡ 2
(mod 4). (See also [2772].) Diab and Nada [836] show that Pn Pm is cordial; except for
n and m both equal to 2 (mod 4), Cn Cm is cordial; and when n ≡ 2 (mod 4) and m
is odd, Cn Cm is not cordial. In [2686] Salehi, Mukhin, and Saputro showed that Qn is
cordial for all n > 1.
Seoud and Abdel Maqusoud [2760] proved that if G is a graph with n vertices and
m edges and every vertex has odd degree, then G is not cordial when m + n ≡ 2 (mod
4). They also prove the following: for m > 2, Cn × Pm is cordial except for the case
C4k+2 × P2 ; Pn2 is cordial for all n; Pn3 is cordial if and only if n 6= 4; and Pn4 is cordial if and
only if n 6= 4, 5, or 6. Seoud, Diab, and Elsakhawi [2769] have proved the following graphs
are cordial: Pn + Pm for all m and n except (m, n) = (2, 2); Cm + Cn if m 6≡ 0 (mod 4) and
n 6= 2 (mod 4); Cn + K1,m for n 6≡ 3 (mod 4) and odd m except (n, m) = (3, 1); Cn + Km
when n is odd, and when n is even and m is odd; K1,m,n ; K2,2,m ; the n-cube; books Bn if
and only if n 6≡ 3 (mod 4); B(3, 2, m) for all m; B(4, 3, m) if and only if m is even; and

the electronic journal of combinatorics (2023), #DS6 88

B(5, 3, m) if and only if m 6≡ 1 (mod 4) (see §2.4 for the notation B(n, r, m)). In [3014]
Solairaju and Arockiasamy prove that various families of subgraphs of grids Pm × Pn are
cordial.
Diab [829], [830], and [832] proved the following graphs are cordial: Cm + Pn if and
only if (m, n) 6= (3, 3), (3, 2), or (3,1); Pm + K1,n if and only if (m, n) 6= (1, 2); Pm ∪ K1,n
if and only if (m, n) 6= (1, 2); Cm ∪ K1,n ; Cm + Kn for all m and n except m ≡ 3 (mod
4) and n odd, and m ≡ 2 (mod 4) and n even; Cm ∪ Kn for all m and n except m ≡ 2
(mod 4); Pm + Kn ; Pm ∪ Kn ; Pm2 ∪ Pn2 except for (m, n) = (2, 2) or (3,3); Pn2 + Pm except
for (m, n) = (3, 1), (3, 2), (2, 2), (3, 3), and (4,2); Pn2 ∪ Pm except for (n, m) = (2, 2), (3, 3),
and (4,2); Pn2 + Cm if and only if (n, m) 6= (1, 3), (2, 3), and (3, 3).Pn + Km ; Cn + K1,m for
all n > 3 and all m except n ≡ 3 (mod 4); Cn + K1,m for n ≡ 3 (mod 4) (n 6= 3) and even
m > 2; and Cm × Cn if and only if 2mn is not congruent to 2 (mod 4).
In [831] Diab proved the graphs Wn + Wm are cordial if and only if one of the following
conditions is not satisfied: (i) (n, m) = (3, 3), (ii) n = 3 and m ≡ 1 (mod 4), (iii) n ≡ 1
(mod 4) and m ≡ 3 (mod 4); the graphs Wn ∪ Wm are cordial if and only if one of the
following conditions is not satisfied: (i) n = 3 and m ≡ 1 (mod 4), (ii) n ≡ 1 (mod 4)
and m ≡ 3 (mod 4); the graphs Wn + Pm are cordial if and only if one of the following
conditions is not satisfied: (i) (n, m) = (3, 1), (3, 2) and (3, 3), (ii) n ≡ 3 (mod 4) and
m = 1. They also prove that Wn ∪ Pm and Wn ∪ Cm are cordial for all m and n and
Wn + Cm is cordial if and only if (m, n) 6= (3, 3) and (3, 4). In [833] Diab showed that the
second power of Cn is cordial if and only if n = 3 or n is even and greater than 4. He also
investigated the cordiality of the join and union of pairs of second power of cycles and
graphs consisting of one second power of cycle with one cycle and one path.
In [2239] Nada, Diab, Elrokh, and Sabra proved that Pn Cm is cordial if and only if
gcd(n, m) 6= 1 or 3 (mod 4); in [2238] they proved Cn Pm is cordial for all n > 3 and
m > 1. Nada, Elrokh, and Elshafey [2241] provided necessary and sufficient conditions
for Fn2 = K1 + Pn2 , Fn2 + Fm2 , and Fn2 + Fm2 to be cordial.
The generalized Jahangir graph Jm,n m > 3, n > 1 is a graph on mn + 1 vertices,
consisting of a cycle Cmn with one additional vertex that is adjacent to n vertices of Cmn
at distance m to each other on Cmn . Gajjar and Des [1000] proved Jm,n is cordial for all
m > 3 and n > 1, except for J1,4n−1 .
Youssef [3548] has proved the following: If G and H are cordial and one has even
size, then G ∪ H is cordial; if G and H are cordial and both have even size, then G + H
is cordial; if G and H are cordial and one has even size and either one has even order,
then G + H is cordial; Cm ∪ Cn is cordial if and only if m + n 6≡ 2 (mod 4); mCn is
cordial if and only if mn 6≡ 2 (mod 4); Cm + Cn is cordial if and only if (m, n) √ 6= (3, 3)
k
and {m (mod 4), n (mod 4)} 6= {0, 2}; and if Pn is cordial, then n > k + 1 + k − 2.
He conjectures that this latter condition is also sufficient. He confirms the conjecture for
k = 5, 6, 7, 8, and 9. Elirokh and Rabie [874] proved Pn4 + Pm4 and Pn4 ∪ Pm4 are cordial for
all n, m > 7, and Cn4 + Cm 4
, and Cn4 ∪ Cm 4
are cordial for all n, m except (n, m) = (7, 7).
Lee and Liu [1854] have shown that the complete n-partite graph is cordial if and only
if at most three of its partite sets have odd cardinality (see also [853]). Lee, Lee, and
Chang [1829] prove the following graphs are cordial: the Cartesian product of an arbitrary

the electronic journal of combinatorics (2023), #DS6 89

number of paths; the Cartesian product of two cycles if and only if at least one of them
is even; and the Cartesian product of an arbitrary number of cycles if at least one of
them has length a multiple of 4 or at least two of them are even. Ali Al-Shamiri, Elrokh,
El-Mashtawye, and Tallah [160] showed that the Cartesian product of a path and a cycle
is cordial under some conditions and that the Cartesian product of two paths is cordial.
Elrokh, Elmshtaye, and Abd El-hay [818] provided necessary and sufficient conditions for [818] new
cone and lemniscate graphs to be cordial.
Shee and Ho [2875] have investigated the cordiality of the one-point union of n copies
(n)
of various graphs. For Cm , the one-point union of n copies of Cm , they prove:
(n)
(i) If m ≡ 0 (mod 4), then Cm is cordial for all n;
(n)
(ii) If m ≡ 1 or 3 (mod 4), then Cm is cordial if and only if n 6≡ 2 (mod 4);
(n)
(iii) If m ≡ 2 (mod 4), then Cm is cordial if and only if n is even.
(n)
For Km , the one-point union of n copies of Km , Shee and Ho [2875] prove:
(n)
(i) If m ≡ 0 (mod 8), then Km is not cordial for n ≡ 3 (mod 4);
(n)
(ii) If m ≡ 4 (mod 8), then Km is not cordial for n ≡ 1 (mod 4);
(n)
(iii) If m ≡ 5 (mod 8), then Km is not cordial for all odd n;
(n)
(iv) K4 is cordial if and only if n 6≡ 1 (mod 4);
(n)
(v) K5 is cordial if and only if n is even;
(n)
(vi) K6 is cordial if and only if n > 2;
(n)
(vii) K7 is cordial if and only if n 6≡ 2 (mod 4);
(2)
(viii) Kn is cordial if and only if n has the form p2 or p2 + 1.
(n)
For Wm , the one-point union of n copies of the wheel Wm with the common vertex being
the center, Shee and Ho [2875] show:
(n)
(i) If m ≡ 0 or 2 (mod 4), then Wm is cordial for all n;
(n)
(ii) If m ≡ 3 (mod 4), then Wm is cordial if n 6≡ 1 (mod 4);
(n)
(iii) If m ≡ 1 (mod 4), then Wm is cordial if n 6≡ 3 (mod 4). For all n and all m > 1
(n)
Shee and Ho [2875] prove Fm , the one-point union of n copies of the fan Fm = Pm + K1
with the common point of the fans being the center, is cordial (see also [1950]). The flag
F lm is obtained by joining one vertex of Cm to an extra vertex called the root. Shee and
(n)
Ho [2875] show all F lm , the one-point union of n copies of F lm with the common point
being the root, are cordial. In his 2001 Ph. D. thesis Selvaraju [2739] proves that the
one-point union of any number of copies of a complete bipartite graph is cordial. Benson
(n)
and Lee [536] have investigated the regular windmill graphs Km and determined precisely
which ones are cordial for m < 14.
Diab and Mohammedm [835] proved the following: the join of two fans Fn + Fm is
cordial if and only if n, m > 4; Fn ∪ Fm is cordial if and only if (n, m) 6= (1,1) or (2,2);
Fn + Pm is cordial if and only if (n, m) 6= (1,2), (2,1), (2,2), (2,3), or (3,2); Fn ∪ Pm is
cordial if and only if (n, m) 6= (1,2); Fn + Cm is cordial if and only if (n, m) 6= (1,3), (2,3)
or (3,3); and Fn ∪ Cm is cordial if and only if (n, m) 6= (2, 3). Hefnawy, Elsid, and Euat
Tallah [1208] gave necessary and sufficient conditions for a cordial labeling of thesum of
the second power of the path Pn2 + K1,m and Pn2 ∪ K1,m .

the electronic journal of combinatorics (2023), #DS6 90

 Andar, Boxwala, and Limaye [187], [188], and [191] have proved the following graphs
are cordial: helms; closed helms; generalized helms obtained by taking a web (see 2.2 for
the definitions) and attaching pendent vertices to all the vertices of the outermost cycle in
the case that the number cycles is even; flowers (graphs obtained by joining the vertices
of degree one of a helm to the central vertex); sunflower graphs (that is, graphs obtained
by taking a wheel with the central vertex v0 and the n-cycle v1 , v2 , . . . , vn and additional
vertices w1 , w2 , . . . , wn where wi is joined by edges to vi , vi+1 , where i + 1 is taken modulo
n); multiple shells (see §2.2); and the one point unions of helms, closed helms, flowers,
gears, and sunflower graphs, where in each case the central vertex is the common vertex.
In [2487], [2488], [2489], [2494], and [2490] Prajapati and Gajjar provided results about
the existence of cordial labelings of graphs obtained from paths, cycles, flower graphs,
sunflower graphs, flower snarks, lotus inside a circle graphs, helms, closed helms, armed
helms (Wn ⊕ P2 ), and webs by the duplication of vertices and edges. In [872] Elrokh and [872] new
Elkom proved that certain classes any four-leaved rose graphs (the one-point union of four
cycles of the same length) are cordial.
Du [854] proved that the disjoint union of n > 2 wheels is cordial if and only if n is
even or n is odd and the number of vertices of in each cycle is not 0 (mod 4) or n is odd
and the number of vertices of in each cycle is not 3 (mod 4). Prajapati and Gajjar [2486]
prove Wn is not cordial if n 6≡ 4, 7 (mod 8) and Cn is not cordial if n 6≡ 4, 7 (mod 8).
Let O be the family of all cordial graphs of odd order and odd size for which there
is no cordial labeling g such that eg (0) − eg (1) = 1. Barrientos and Minion [473] proved
that if G is a cordial graph such that G 6∈ O, then the corona K1 G is cordial. They
use this result to prove that H G is cordial when G and H are cordial and G has even
order and even size or G 6∈ O. In addition, H G is cordial when G is a cordial graph of
odd order and even size and H is any graph of order m and size n ∈ {m − 1, m, m + 1}.
If H is bipartite such that the difference of the cardinalities of its partite sets is at most
one, and G is a cordial graph of even order and odd size that admits a cordial labeling
g such that eg (0) − eg (1) = 1, then the corona H G is cordial. Barrientos and Minion
proved the cordiality of certain circulant graphs; they also proved that for every positive
integer k, the k-splitting of a cordial graph of even size, results in a cordial graph. They
provide sufficient conditions to prove that any super subdivision of a graph G is cordial.
They study the cordiality of the join of two cordial graphs, proving that G + H is cordial
when G and H have even order and even size, or both have odd order and even size, or
both graphs have odd order, odd size, and the dominating weight in both graphs is not
1, or G has even order, odd size, and the dominating weight on both graphs is not the
same, or both G and H have odd order, but only one has odd size, and the dominating
weight is 0. They also prove that when G is a cordial graph of odd order and even size,
the one-point union of t copies of G is cordial.
In [473] Barrientos and Minion provide necessary conditions for the cordiality of coro-
nas of cordial graphs, prove the cordiality of a family of circulant graphs, prove that any
splitting graph of a cordial graph of even order and even size is cordial, determine a con-
dition that a graph must satisfy in order that any super subdivision of it is cordial, prove
the cordiality of the joint of two cordial graphs, and determine when a one-point union

the electronic journal of combinatorics (2023), #DS6 91

of a cordial graph is cordial.
For positive integers m and n divisible by 4 Venkatesh [3370] constructs graphs ob-
tained by appending a copy of Cn to each vertex of Cm by identifying one vertex of Cn
with each vertex of Cm and iterating by appending a copy of Cn to each vertex of degree
2 in the previous step. He proves that the graphs obtained by successive iterations are
cordial.
Elumalai and Sethurman [879] proved: cycles with parallel cords are cordial and n-
cycles with parallel Pk -chords (see §2.2 for the definition) are cordial for any odd positive
integer k at least 3 and any n 6≡ 2 (mod 4) of length at least 4. They call a graph H an
even-multiple subdivision graph of a graph G if it is obtained from G by replacing every
edge uv of G by a pair of paths of even length starting at u and ending at v. They prove
that every even-multiple subdivision graph is cordial and that every graph is a subgraph
of a cordial graph. In [3464] Wen proves that generalized wheels Cn + mK1 are cordial
when m is even and n 6≡ 2 (mod 4) and when m is odd and n 6≡ 3 (mod 4). Kuppusamy
and Guruswamy [1781] show that the subdivision graph of K2,n is graceful for n > 1 and
the subdivision graph of the shell graph C(n, n − 3) is graceful for n > 4.
Vaidya, Ghodasara, Srivastav, and Kaneria investigated graphs obtained by joining
two identical graphs by a path. They prove: graphs obtained by joining two copies of
the same cycle by a path are cordial [3272]; graphs obtained by joining two copies of the
same cycle that has two chords with a common vertex with opposite ends of the chords
joining two consecutive vertices of the cycle by a path are cordial [3272]; graphs obtained
by joining two rim verticies of two copies of the same wheel by a path are cordial [3274];
and graphs obtained by joining two copies of the same Petersen graph by a path are
cordial [3274]. They also prove that graphs obtained by replacing one vertex of a star by
a fixed wheel or by replacing each vertex of a star by a fixed Petersen graph are cordial
[3274]. In [3313] Vaidya, Ghodasara, Srivastav, and Kaneria investigated graphs obtained
by joining two identical cycles that have a chord are cordial and the graphs obtained by
starting with copies G1 , G2 , . . . , Gn of a fixed cycle with a chord that forms a triangle
with two consecutive edges of the cycle and joining each Gi to Gi+1 (i = 1, 2, . . . , n − 1)
by an edge that is incident with the endpoints of the chords in Gi and Gi+1 are cordial.
Vaidya, Dani, Kanani, and Vihol [3267] proved that the graphs obtained by starting with
copies G1 , G2 , . . . , Gn of a fixed star and joining each center of Gi to the center of Gi+1
(i = 1, 2, . . . , n − 1) by an edge are cordial.
Ghodasara, Rokad, and Jadav [1086] prove that the path union of Pn × Pn is cordial.
They also prove that the graph obtained by joining two copies of Pn × Pn by a path is
cordial. Ghodasara and Jadav [1079] prove: the graph obtained by joining a finite number
of copies of Pn × Pn by path is cordial; the star of Pn × Pn is cordial; and the path union of
the star of Pn × Pn is cordial. Rokad and Patadiya [2645] proved that the shadow graph,
splitting graph, and the degree splitting graph of a star are cordial graphs. They also
showed that the jewel graph and the jellyfish graph are cordial.
Ghodasara and Rokad prove [1087] the star of Kn,n (n > 2) is cordial, the path union
of Kn,n (n > 2) is cordial, and the graph obtained by joining two copies of Kn,n (n > 2)
by a path is cordial [1087]. In [1088] the same authors prove that a vertex switching

the electronic journal of combinatorics (2023), #DS6 92

of any non-apex vertex of a wheel graph, a vertex switching of any internal vertex of
a flower graph, a vertex switching of any non-apex vertex of a gear graph, and a vertex
switching of any non-apex vertex of a shell graph are cordial graphs. In [1089] they proved
that a barycentric subdivision of a shell graph, a barycentric subdivision of Kn,n , and a
barycentric subdivision of a wheel are cordial. Ghodasara and Sonchhatra [1090] prove
that the graph obtained by joining two copies of the same fan by a path is cordial. They
also prove that the star of a fan is cordial and the graph obtained by joining two copies
of the star of the same fan by a path is cordial [1090]. Elrokh, Nada, and El-Shafey [873]
showed that Pk Fm2 (Fm is the fan graph with m + 1 vertices) is cordial for all k > 1
and m > 4.
Vaidya, Kanani, Srivastav, and Ghodasara [3282] proved: graphs obtained by subdi-
viding every edge of a cycle with exactly two extra edges that are chords with a common
endpoint and whose other end points are joined by an edge of the cycle are cordial; graphs
obtained by subdividing every edge of the graph obtained by starting with Cn and adding
exactly three chords that result in two 3-cycles and a cycle of length n − 3 are cordial;
graphs obtained by subdividing every edge of a Petersen graph are cordial. Sankar and
Sethuramam zske [2709] showed that the subdivision graph S(K2 , n) is graceful and cor-
dial, for n > 1 and the shell graph S(C(n, n − 3)) is graceful and cordial for n > 4.
Recall the shell C(n, n−3) is the cycle Cn with n−3 cords sharing a common endpoint.
Vaidya, Dani, Kanani, and Vihol [3268] proved that the graphs obtained by starting with
copies G1 , G2 , . . . , Gn of a fixed shell and joining common endpoint of the chords of Gi
to the common endpoint of the chords of Gi+1 (i = 1, 2, . . . , n − 1) by an edge are
cordial. Vaidya, Dani, Kanani, and Vihol [3283] define Cn (Cn ) as the graph obtained
by subdividing each edge of Cn and connecting the new n vertices to form a copy of Cn
inscribed the original Cn . They prove that Cn (Cn ) is cordial if n 6= 2 (mod 4); the graphs
obtained by starting with copies G1 , G2 , . . . , Gk of Cn (Cn ) the graph obtained by joining a
vertex of degree 2 in Gi to a vertex of degree 2 in Gi+1 (i = 1, 2, . . . , n − 1) by an edge are
cordial; and the graphs obtained by joining vertex of degree 2 from one copy of Cn (Cn )
to a vertex of degree 2 to another copy of Cn (Cn ) by any finite path are cordial. Vaidya
and Shah [3309] and [3310] proved that following graphs are cordial: the shadow graph of
the bistar Bn,n , the splitting graph of Bn,n , the degree splitting graph of Bn,n , alternate
triangular snakes, alternate quadrilateral snakes, double alternate triangular snakes, and
double alternate quadrilateral snakes. In [3312] Vaidya and Shah give cordial labelings of
the degree splitting graph of paths, shells, helms, and gears.
A graph C(2n, n − 2) is called an alternate shell if C(2n, n − 2) is obtained from
the cycle C2n (v0 , v1 , v2 , . . . , v2n−1 ) by adding n − 2 chords between the vertex v0 and
the vertices v2i+1 , for 1 6 i 6 n − 2. Sethuraman and Sankar [2831] proved that some
graphs obtained by merging alternate shells and joining certain vertices by a path have
α-labelings.
Vaidya, Srivastav, Kaneria, and Ghodasara [3314] proved that a cycle with two chords
that share a common vertex and the opposite ends of which join two consecutive vertices
of the cycle is cordial. For a graph G Vaidya, Ghodasara, Srivastav, and Kaneria [3273]
introduced the graph G∗ called the star of G as the graph obtained by replacing each

the electronic journal of combinatorics (2023), #DS6 93

vertex of the star K1,n by a copy of G and prove that Cn∗ admits cordial labeling. Vaidya
and Dani [3263] proved that the graphs obtained by starting with n copies G1 , G2 , . . . , Gn
of a fixed star and joining each center of Gi to the center of Gi+1 by an edge as well as
each of the centers to a new vertex xi (1 6 i 6 n − 1) by an edge admit cordial labelings.
An arbitrary supersubdivison H of a graph G is the graph obtained from G by replacing
every edge of G by K2,m , where m may vary for each edge arbitrarily. Vaidya and Kanani
[3275] proved that arbitrary supersubdivisions of paths and stars admit cordial labelings.
Vaidya and Dani [3264] prove that arbitrary supersubdivisions of trees, Km,n , and Pm ×Pn
are cordial. They also prove that an arbitrary supersubdivision of the graph obtained by
identifying an end vertex of a path with every vertex of a cycle Cn is cordial except when
n is odd, mi (1 6 i 6 n) are odd, and mi (n + 1 6 i 6 mn) of the K2,mi are even. Recall
for a graph G and a vertex v of G Vaidya, Srivastav, Kaneria, and Kanani [3315] define
a vertex switching Gv as the graph obtained from G by removing all edges incident to
v and adding edges joining v to every vertex not adjacent to v in G. They proved that
the graphs obtained by the switching of a vertex in Cn admit cordial labelings. They
also show that the graphs obtained by the switching of any arbitrary vertex of cycle Cn
with one chord that forms a triangle with two consecutive edges of the cycle are cordial.
Moreover they prove that the graphs obtained by the switching of any arbitrary vertex
in cycle with two chords that share a common vertex the opposite ends of which join two
consecutive vertices of the cycle are cordial.
The middle graph M (G) of a graph G is the graph whose vertex set is V (G) ∪ E(G)
and in which two vertices are adjacent if and only if either they are adjacent edges of G
or one is a vertex of G and the other is an edge incident with it. Vaidya and Vihol [3317]
Pn that 2the middle graph M (G) of an Eulerian graph is Eulerian with |E(M (G))| =
prove
i=1 (d(vi ) + 2e)/2. They prove that middle graphs of paths, crowns Cn K1 , stars, and
tadpoles (that is, graphs obtained by appending a path to a cycle) admit cordial labelings.
Vaidya and Dani [3266] define the duplication of an edge e = uv of a graph G by a
new vertex w as the graph G0 obtained from G by adding a new vertex w and the edges
wv and wu. They prove that the graphs obtained by duplication of an arbitrary edge
of a cycle and a wheel admit a cordial labeling. Starting with k copies of fixed wheel
(1) (2) (k) (1)
Wn , Wn , Wn , . . . , Wn , Vaidya, Dani, Kanani, and Vihol [3270] define G =< Wn :
(2) (k) (i)
Wn : . . . : Wn > as the graph obtained by joining the center vertices of each of Wn and
(i+1) (1) (2) (k)
Wn to a new vertex xi where 1 6 i 6 k−1. They prove that < Wn : Wn : ... : Wn >
are cordial graphs. Kaneria and Vaidya [1623] define the index of cordiality of G as n
if the disjoint union of n copies of G is cordial but the disjoint union of fewer than n
copies of G is not cordial. They obtain several results on index of cordiality of Kn . In the
same paper they investigate cordial labelings of graphs obtained by replacing each vertex
of K1,n by a graph G. Kaneria, Jariya, and Karavadiya [1586] proved that the index of
cordiality for Kn is at most 6 for n at most 105; the index of cordiality for Kn is at most
4, when n can be expressed as sum of square of two integers; and it is at most 8 when a
particular different condition on the edge labels are met. See also [1354].
In [191] Andar et al. define a t-ply graph Pt (u, v) as a graph consisting of t internally
disjoint paths joining vertices u and v. They prove that Pt (u, v) is cordial except when it

the electronic journal of combinatorics (2023), #DS6 94

is Eulerian and the number of edges is congruent to 2 (mod 4). In [192] Andar, Boxwala,
and Limaye prove that the one-point union of any number of plys with an endpoint as
the common vertex is cordial if and only if it is not Eulerian and the number of edges is
congruent to 2 (mod 4). They further prove that the path union of shells obtained by
joining any point of one shell to any point of the next shell is cordial; graphs obtained by
attaching a pendent edge to the common vertex of the cords of a shell are cordial; and
cycles with one pendent edge are cordial.
For a graph G and a positive integer t, Andar, Boxwala, and Limaye [189] define the
t-uniform homeomorph Pt (G) of G as the graph obtained from G by replacing every edge
of G by vertex disjoint paths of length t. They prove that if G is cordial and t is odd,
then Pt (G) is cordial; if t ≡ 2 (mod 4) a cordial labeling of G can be extended to a cordial
labeling of Pt (G) if and only if the number of edges labeled 0 in G is even; and when t ≡ 0
(mod 4) a cordial labeling of G can be extended to a cordial labeling of Pt (G) if and only
if the number of edges labeled 1 in G is even. In [190] Ander et al. prove that Pt (K2n ) is
cordial for all t > 2 and that Pt (K2n+1 ) is cordial if and only if t ≡ 0 (mod 4) or t is odd
and n 6≡ 2 (mod 4), or t ≡ 2 (mod 4) and n is even.
In [192] Andar, Boxwala, and Limaya show that a cordial labeling of G can be extended
to a cordial labeling of the graph obtained from G by attaching 2m pendent edges at each
vertex of G. For a binary labeling g of the vertices of a graph G and the induced edge
labels given by g(e) = |g(u) − g(v)| let vg (j) denote the number of vertices labeled with j
and eg (j) denote the number edges labeled with j. Let i(G) = min{|eg (0) − eg (1)|} taken
over all binary labelings g of G with |vg (0) − vg (1)| 6 1. Andar et al. also prove that
a cordial labeling g of a graph G with p vertices can be extended to a cordial labeling
of the graph obtained from G by attaching 2m + 1 pendent edges at each vertex of G
if and only if G does not satisfy either of the conditions: (1) G has an even number of
edges and p ≡ 2 (mod 4); (2) G has an odd number of edges and either p ≡ 1 (mod 4)
with eg (1) = eg (0) + i(G) or n ≡ 3 (mod 4) and eg (0) = eg (1) + i(G). Andar, Boxwala,
and Limaye [193] also prove: if g is a binary labeling of the n vertices of graph G with
induced edge labels given by g(e) = |g(u) − g(v)| then g can be extended to a cordial
labeling of G K2m if and only if n is odd and i(G) ≡ 2 (mod 4); Kn K2m is cordial
if and only if n 6= 4 (mod 8); Kn K2m+1 is cordial if and only if n 6= 7 (mod 8); if
g is a binary labeling of the n vertices of graph G with induced edge labels given by
g(e) = |g(u) − g(v)| then g can be extended to a cordial labeling of G Ct if t 6= 3 mod
4, n is odd and eg (0) = eg (1). For any binary labeling g of a graph G with induced edge
labels given by g(e) = |g(u) − g(v)| they also characterize in terms of i(G) when g can be
extended to graphs of the form G K2m+1 .
For graphs G1 , G2 , . . . , Gn (n > 2) that are all copies of a fixed graph G, Shee and Ho
[2876] call a graph obtained by adding an edge from Gi to Gi+1 for i = 1, . . . , n − 1 a path
union of G (the resulting graph may depend on how the edges are chosen). Among their
results they show the following graphs are cordial: path-unions of cycles; path-unions of
any number of copies of Km when m = 4, 6, or 7; path-unions of three or more copies of
K5 ; and path-unions of two copies of Km if and only if m − 2, m, or m + 2 is a perfect
square. They also show that there exist cordial path-unions of wheels, fans, unicyclic

the electronic journal of combinatorics (2023), #DS6 95

graphs, Petersen graphs, trees, and various compositions.
Lee and Liu [1854] give the following general construction for the forming of cordial
graphs from smaller cordial graphs. Let H be a graph with an even number of edges and
a cordial labeling such that the vertices of H can be divided into t parts H1 , H2 , . . . , Ht
each consisting of an equal number of vertices labeled 0 and vertices labeled 1. Let
G be any graph and G1 , G2 , . . . , Gt be any t subsets of the vertices of G. Let (G, H)
be the graph that is the disjoint union of G and H augmented by edges joining every
vertex in Gi to every vertex in Hi for all i. Then G is cordial if and only if (G, H)
is. From this it follows that: all generalized fans Fm,n = Km + Pn are cordial; the
generalized bundle Bm,n is cordial if and only if m is even or n 6≡ 2 (mod 4) (Bm,n
consists of 2n vertices v1 , v2 , . . . , vn , u1 , u2 , . . . , un with an edge from vi to ui and 2m
vertices x1 , x2 , . . . , xm , y1 , y2 , . . . , ym with xi joined to vi and yi joined to ui ); if m is odd
the generalized wheel Wm,n = Km + Cn is cordial if and only if n 6≡ 3 (mod 4). If m is
even, Wm,n is cordial if and only if n 6≡ 2 (mod 4); a complete k-partite graph is cordial
if and only if the number of parts with an odd number of vertices is at most 3.
Sethuraman and Selvaraju [2840] have shown that certain cases of the union of any
number of copies of K4 with one or more edges deleted and one edge in common are
cordial. Youssef [3552] has shown that the kth power of Cn is cordial for all n when
k ≡ 2 (mod 4) and for all even n when k ≡ 0 (mod 4). Ramanjaneyulu, Venkaiah, and
Kothapalli [2576] give cordial labelings for a family of planar graphs for which each face is
a 3-cycle and a family for which each face is a 4-cycle. Acharya, Germina, Princy, and Rao
[40] prove that every graph G can be embedded in a cordial graph H. The construction
is done in such a way that if G is planar or connected, then so is H.
Recall from §2.7 that a graph H is a supersubdivision of a graph G, if every edge uv
of G is replaced by K2,m (m may vary for each edge) by identifying u and v with the two
vertices in K2,m that form the partite set with exactly two members. Vaidya and Kanani
[3275] prove that supersubdivisions of paths and stars are cordial. They also prove that
supersubdivisions of Cn are cordial provided that n and the various values for m are odd.
Raj and Koilraj [2552] proved that the splitting graphs of Pn , Cn , Km,n , Wn , nK2 , and
(1) (2) (k)
the graphs obtained by starting with k copies of stars K1,n , K1,n , . . . , K1,n and joining the
(p−1) (p)
central vertex of K1,n and K1,n to a new vertex xp−1 for each 2 6 p 6 k are cordial.
Seoud, El Sonbaty, and Abd El Rehim [2770] proved the following graphs are cordial:
K1,l,m,n when mn is even; Pm + K1,n if n is even or n is odd and (m 6= 2); the conjunction
graph P4 ∧ Cn is cordial if n is even; and the join of the one-point union of two copies of
Cn and K1 .
Recall < K1,n1 , . . . , K1,nt > is the graph obtained by starting with the stars
K1,n1 , . . . , K1,nt and joining the center vertices of K1,ni and K1,ni+1 to a new vertex vi where
1 6 i 6 k − 1. Kaneria, Jariya, and Meghpara [1590] proved that < K1,n1 , . . . , K1,nt >
is cordial and every graceful graph with |vf (odd) − vf (even)| 6 1 is cordial. Kaneria,
Meghpara, and Makadia [1618] proved that the cycle of complete graphs C(t · Km,n ) and
the cycle of wheels C(t · Wn ) are cordial. Kaneria, Makadia, and Meghpara [1605] proved
that the cycle of cycles C(t · Cn ) is cordial for t > 3. Kaneria, Makadia, and Meghpara
[1606] proved that a star of Kn and a cycle of n copies of Kn are cordial. Kaneria, Viradia,

the electronic journal of combinatorics (2023), #DS6 96

Jariya, and Makadia [1625] proved that the cycle of paths C(t · Pn ) is cordial, product
cordial (see Section 7.6), and total edge product cordial.
Jeba Jesintha and Subashini proved the following graphs are cordial: the cycle of vertex
switching of cycles [1395]; the path union of vertex switching of wheels in increasing order
[1404]; the path union of jelly fish graphs is cordial and cycle of jelly fish graphs [1405]; the
star of fixed trees of diameter three tree [1397]; and the path union of vertex switching of
cycles in increasing order [1399]. In [1414] Jeba Jesintha, Vinodhini, and Lakshmi, proved [1414] new
that a star glued with subdivided shell graph and super subdivision of circular ladders
(Cn × K2 ) admit cordial labelings.
Cordial labelings and variations of them for fractal graphs are given in [2721] and [2721] new
[2720]. [2720] new
Cahit [646] calls a graph H-cordial if it is possible to label the edges with the numbers
from the set {1, −1} in such a way that, for some k, at each vertex v the sum of the labels
on the edges incident with v is either k or −k and the inequalities |v(k) − v(−k)| 6 1 and
|e(1) − e(−1)| 6 1 are also satisfied, where v(i) and e(j) are, respectively, the number of
vertices labeled with i and the number of edges labeled with j. He calls a graph Hn -cordial
if it is possible to label the edges with the numbers from the set {±1, ±2, . . . , ±n} in such
a way that, at each vertex v the sum of the labels on the edges incident with v is in the
set {±1, ±2, . . . , ±n} and the inequalities |v(i) − v(−i)| 6 1 and |e(i) − e(−i)| 6 1 are
also satisfied for each i with 1 6 i 6 n. Among Cahit’s results are: Kn,n is H-cordial
if and only if n > 2 and n is even; and Km,n , m 6= n, is H-cordial if and only if n ≡ 0
(mod 4), m is even and m > 2, n > 2. Unfortunately, Ghebleh and Khoeilar [1078] have
shown that other statements in Cahit’s paper are incorrect. In particular, Cahit states
that Kn is H-cordial if and only if n ≡ 0 (mod 4); Wn is H-cordial if and only if n ≡ 1
(mod 4); and Kn is H2 -cordial if and only if n ≡ 0 (mod 4) whereas Ghebleh and Khoeilar
instead prove that Kn is H-cordial if and only if n ≡ 0 or 3 (mod 4) and n 6= 3; Wn is
H-cordial if and only if n is odd; Kn is H2 -cordial if n ≡ 0 or 3 (mod 4); and Kn is
not H2 -cordial if n ≡ 1 (mod 4). Ghebleh and Khoeilar also prove every wheel has an
H2 -cordial labeling. In [954] Freeda and Chellathurai prove that the following graphs are
H2 -cordial: the join of two paths, the join of two cycles, ladders, and the tensor product
Pn ⊗ P2 . They also prove that the join of Wn and Wm where n + m ≡ 0 (mod 4) is
H-cordial. Cahit generalizes the notion of H-cordial labelings in [646].
A graph G(V, E) is called Hk -cordial if it has an H-cordial labeling f such that for
each edge e and each vertex v of G have the label 1 6 |f (e)| 6 k, 1 6 |f (v)| 6 k and
|vf (i) − vf (−i))| 6 1, |ef (i)) − ef (−i)| 6 1 for each i with 1 6 i 6 k. Ratilal and
Parmar [2606] investigated Hk -cordial labelings of triangular snakes, double triangular
snakes, triple triangular snakes, alternate triangular snakes, double alternate triangular
snakes, irregular triangular snakes, quadrilateral snakes, double quadrilateral snakes, al-
ternate quadrilateral snakes, and irregular quadrilateral snakes. Joshi and Parmar [1557]
investigated the H-, H2 - and H3 -cordiality of the following snakes: triangular, double
triangular, triple trianglar, quadrilateral, double quadrilateral, alternate trigular, dou-
ble alternate trigular, irregular triangular, quadrilateral, double quadrilateral, alternate
quadrilateral, and irregular quadrilateral. Joshi and Pamar [1557] investigated Hk -cordial

the electronic journal of combinatorics (2023), #DS6 97

labeling of p-triangular, m-polygonal snakes, double m-polygonal snakes, alternate m-
polygonal snakes, double alternate m-polygonal snakes, irregular m-polygonal snakes,
and double irregular m-polygonal snakes.
Cahit and Yilmaz [650] call a graph Ek -cordial if it is possible to label the edges
with the numbers from the set {0, 1, 2, . . . , k − 1} in such a way that, at each vertex v,
the sum of the labels on the edges incident with v modulo k satisfies the inequalities
|v(i) − v(j)| 6 1 and |e(i) − e(j)| 6 1, where v(s) and e(t) are, respectively, the number of
vertices labeled with s and the number of edges labeled with t. Cahit and Yilmaz prove
the following graphs are E3 -cordial: Pn (n > 3); stars Sn if and only if n 6≡ 1 (mod 3);
Kn (n > 3); Cn (n > 3); friendship graphs; and fans Fn (n > 3). They also prove that
Sn (n > 2) is Ek -cordial if and only if n 6≡ 1 (mod k) when k is odd or n 6≡ 1 (mod
2k) when k is even and k 6= 2. Ni, Liu, and Lu [2271] demonstrate the E3 -cordiality of
Wn , Pm × Pn , Km,n , and trees.
Bapat and Limaye [424] provide E3 -cordial labelings for: Kn (n > 3); snakes whose
blocks are all isomorphic to Kn where n ≡ 0 or 2 (mod 3); the one-point union of any
number of copies of Kn where n ≡ 0 or 2 (mod 3); graphs obtained by attaching a copy
of Kn where n ≡ 0 or 3 (mod 3) at each vertex of a path; and Km Kn . Sridharan and
Umarani [3045] proved: for odd n > 1 and k > 2, Pn K1 is Ek -cordial; for n even
and n 6= k/2, Pn K1 is Ek -cordial; and certain cases of fans are Ek -cordial. Youssef
[3549] gives a necessary condition for a graph to be Ek -cordial for certain k. He also gives
some new families of Ek -cordial graphs and proves Lee’s [1886] conjecture about the edge-
gracefulness of the disjoint union of two cycles. Venkatesh, Salah, and Sethuraman [3375]
2t
proved that C2n+1 snakes and C2n+1 are E2 -cordial. Liu, Liu, and Wu [1980] provide two
necessary conditions for a graph G to be Ek -cordial and prove that every Pn (n > 3) is
Ep -cordial if p is odd. They also discuss the E2 -cordiality of a graph G under the condition
that some subgraph of G has a 1-factor. Liu and Liu [1979] proved that a graph with
no isolated vertex is E2 -cordial if and only if it does not have order 4n + 2. Bapat and
Limaye [425] prove that helms, one point unions of helms, and path unions of helms are
E3 -cordial. Jinnah and Beena [1547] prove the graphs Pn (n > 3), Cn where n 6= 4 mod
8, and Kn (n > 3) are E4 -cordial graphs. They also prove that every graph of order at
least 3 is a subgraph of an E4 -cordial graph.
Hovey [1258] introduced a simultaneous generalization of harmonious and cordial la-
belings. For any Abelian group A (under addition) and graph G(V, E) he defines G to be
A-cordial if there is a labeling of V with elements of A such that for all a and b in A when
the edge ab is labeled with f (a) + f (b), the number of vertices labeled with a and the
number of vertices labeled b differ by at most one and the number of edges labeled with
a and the number labeled with b differ by at most one. In the case where A is the cyclic
group of order k, the labeling is called k-cordial. With this definition we have: if G(V, E)
is a graph with |E| > |V | − 1 then G(V, E) is harmonious if and only if G is |E|-cordial;
G is cordial if and only if G is 2-cordial.
Hovey obtained the following: caterpillars are k-cordial for all k; all trees are k-cordial
for k = 3, 4, and 5; odd cycles with pendent edges attached are k-cordial for all k; cycles
are k-cordial for all odd k; for k even, C2mk+j is k-cordial when 0 6 j 6 k2 + 2 and when

the electronic journal of combinatorics (2023), #DS6 98

k < j < 2k; C(2m+1)k is not k-cordial; Km is 3-cordial; and, for k even, Kmk is k-cordial
if and only if m = 1.
Hovey advances the following conjectures: all trees are k-cordial for all k; all connected
graphs are 3-cordial; and C2mk+j is k-cordial if and only if j 6= k, where k and j are even
and 0 6 j < 2k. The last conjecture was verified by Tao [3189]. Tao’s result combined
with those of Hovey show that for all positive integers k the n-cycle is k-cordial with the
exception that k is even and n = 2mk + k. Tao also proved that the crown with 2mk + j
vertices is k-cordial unless j = k is even, and for 4 6 n 6 k the wheel Wn is k-cordial
unless k ≡ 5 (mod 8) and n = (k + 1)/2. In [3231] Tuczyński, Wenus, and Wesek proved
a conjecture of Cichacz, Görlich, and Tuza [745] that all hypertrees are 2-cordial. They
also proved that all hypertree are 3-cordial.
In [2372] Patrias and Pechenik initiated the study of classes of finite Abelian groups
A for which particular graphs are A-cordial. Their results include: P2m and P2m+1 are
not Z2 m -cordial, all paths are A-cordial when A is an Abelian group of odd order, if A is
an Abelian group of order n and Pn is A-cordial, then all paths are A-cordial, and P2n is
A-cordial when A = Z2 × Zk and n = |A|.
They conjecture that for a finite abelian group A, all paths are A-cordial if and only
if A has an element of order greater than 2. Cichacz [737] proved that all cycle graphs
are A-cordial for any Abelian group A of odd order. In [1654] and [1655] Chidambaram,
Athisayanathan, and Ponraj proved that hypercubes, books, Cn × K2 , and Pn × K3
and the splitting graphs of paths, cycles, and wheels are {1, −1, i, −i}-cordial. Since
the group {1, −1, i, −i} is cyclic, this is same as 4-cordial. In [2538] Radha, Venkatesan, [2538] new
Vitaldas, and Perumal prove that triangular ladders, alternate triangular snakes, alternate
quadrilateral snakes, and double triangular snakes admit {1, −1, i, −i} cordial labelings.
Erickson [895]et al. showed that the friendship graph Fn is Z3m -cordial and conjectured
that Fn is Zm -cordial except when n is even and not divisible by 4 and m = 3n/d, where
d is odd.
In [3555] Youssef and Al-Kuleab proved the following: if G is a (p1 , q1 ) k-cordial graph
and G is a (p2 , q2 ) k-cordial graph with p1 or p2 ≡ 0 (mod k) and q1 or q2 ≡ 0 (mod k),
then G + H is k-cordial; if G is a (p1 , q1 ) 4-cordial graph and G is a (p2 , q2 ) 4-cordial
graph with p1 or p2 6≡ 2 ( mod 4) and q1 or q2 ≡ 0 ( mod k), then G + H is 4-cordial; and
Km,n,p is 4-cordial if and only if (m, n, p) mod 4 6≡ (0, 2, 2) or (2, 2, 2).
In [819] ELrokh, Ismail, El-hay, and Elmshtaye define a cubic roots cordial labeling f [819] new
of the vertices of a graph G with 1, ω, and ω 2 , where ω 3 = 1, with induced edge labeling
f ∗ : E(G) to {1, ω, ω 2 } defined by f ∗ (uv) = f (u)f (v) if both the number of vertices and
the number edges labeled with x and the number of vertices and the number edges labeled
with y differ by at most 1. Since {1, ω, ω 2 } is isomorphic the group Z3 , cubic roots cordial
is the same as 3-cordial. They prove the all nontrivial cases of paths, cycles, fans, and
G ∪ H where G and H paths or cycles admit a cubic roots cordial. They also prove that
wheels Wn are cubic roots cordial except when n = 2 mod 3 and n is even.
In [3547] Youssef obtained the following results: C2k with one pendent edge is not
(2k + 1)-cordial for k > 1; Kn is 4-cordial if and only if n 6 6; Cn2 is 4-cordial if and only
if n 6≡ 2 (mod 4); and Km,n is 4-cordial if and only if n 6≡ 2 (mod 4); He also provides

the electronic journal of combinatorics (2023), #DS6 99

some necessary conditions for a graph to be k-cordial. Driscol zele [849] proved that all
trees are 7-cordial.
Modha and Kanani [2178] prove that following graphs have a 5-cordial labeling: the
shadow graph of a path and a cycle, graphs obtained by one point duplication and duplica-
tion of an edge by a vertex in cycle, and the graph obtained by the barycentric subdivision
of wheel. In [2171] Modha and Kanani proved prisms, webs, flowers, and closed helms
admit 5-cordial labelings. In [2172] they proved that fans are k-cordial for all k and dou-
ble fans are k-cordial for all odd k and n = (k + 1)/2. In [2174] they proved that the
following graphs are k-cordial: Wn for odd k, n = mk + j, m > 0, 1 6 j 6 k − 1 except
for j = (k − 1)/2; the total graphs of paths (recall T (Pn ) has vertex set V (Pn ) ∪ E(Pn )
with two vertices adjacent whenever they are neighbors in Pn ); the square Cn2 for odd
k 6 n; the path union of n copies of Ck where k is odd; and Cn with one pendent edge
for odd k 6 n. Rathod and Kanani [2602] proved Pn2 is k-cordial for all k and cycles with
a single pendent edge are k-cordial for all even k. In [2599] Rathod and Kanani proved
the middle graph, total graph, and splitting graph of a path are 4-cordial and Pn2 and
triangular snakes are 4-cordial. Modha and Kanani [2175] proved: Wn is k-cordial for all
odd k and for all n = mk + j, m > 0, 1 6 j 6 k − 1 except for j = k − 1; the path
union of copies of Ck is k-cordial for odd k; the total graph of Pn is k-cordial for all k; the
square Cn2 is k-cordial for odd k odd and n > k; and the graphs obtained by appending
an edge to Cn is k-cordial for odd k and n > k. Modha and Kanani [2177] prove the
following graphs are k-cordial: Pm × Ck , Pm × Ck+1 , Pm × Ck+3 for all odd k and m > 2,
and Pm × C2k−1 for all odd k, m > 2 and m 6= tk. Rathod and Kanani [2602] [2604] prove
that following graphs are 4-cordial: the splitting graph of K1,n ; triangular books; and
the one point union any number of copies of the fan f3 ; braid graphs; triangular ladders;
and irregular quadrilateral snakes obtained from the path Pn with consecutive vertices
u1 , u2 , . . . , un and new vertices v1 , v2 , . . . , vn−2 , w1 , w2 , and edges ui vi , wi ui+2 , vi wi for all
1 6 i 6 n − 2. Rathod and Kanani [2603] prove wheels, fans, friendship graphs, double
fans, and helms are 5-cordial. Driscoll, Krop, and Nguyen [842] proved that all trees are
6-cordial. In [1577], [1578], and [2173] Kanani and Modha prove that fans, friendship
graphs, ladders, double fans, double wheels, wheels, helms, closed helms, and webs are
7-cordial graphs and wheels, fans and friendship graphs, gears, double fans, and helms
are 4-cordial graphs. In [2724] Sathish Narayanan and Vijayaragavan obtained 3-divisor
cordial labelings for graphs derived from paths.
Cichacz, Görlich and Tuza [745] extended the definition of k-cordial labeling for hy-
pergraphs. They presented various sufficient conditions on a hypertree H (a connected
hypergraph without cycles) to be k-cordial. From their theorems it follows that every
k-uniform hypertree is k-cordial, and every hypertree with odd order or size is 2-cordial.
Modha and Kanani [2176] prove the following graphs are k-cordial for all k: bistars,
2
restricted square graphs Bn,n , the one-point union of C3 and K1,n , and Pn K1 .
In [2836] Sethuraman and Selvaraju present an algorithm that permits one to start
with any non-trivial connected graph G and successively form supersubdivisions (see §2.7
for the definition) that are cordial in the case that every edge in G is replaced by K2,m
where m is even. Sethuraman and Selvaraju [2835] also show that the one-vertex union

the electronic journal of combinatorics (2023), #DS6 100

of any number of copies of Km,n is cordial and that the one-edge union of k copies of
shell graphs C(n, n − 3) (see §2.2) is cordial for all n > 4 and all k. They conjectured
that the one-point union of any number of copies of graphs of the form C(ni , ni − 3) for
various ni > 4 is cordial. This was proved by Yue, Yuansheng, and Liping in [3567].
Riskin [2630] claimed that Kn is (Z2 × Z2 )-cordial if and only if n is at most 3 and Km,n is
(Z2 × Z2 )-cordial if and only if (m, n) 6= (2, 2). (Many authors use V4 to denote Z2 × Z2 .)
However, Pechenik and Wise [2375] report that the correct statement for Km,n is Km,n
is (Z2 × Z2 )-cordial if and only if m and n are not both congruent to 2 mod 4. Seoud
and Salim [2788] gave an upper bound on the number of edges of a graph that admits
a (Z2 ⊕ Z2 )-cordial labeling in terms the number of vertices. Rathod and Kanani [2601]
prove the following graphs are (Z2 × Z2 )-cordial for all n and m: Cn mK1 , Cn K2 , and
graphs obtained by appending a single edge to one vertex of Cn . In Rathod and Kanani
[2605] and [2600] proved the following graphs are (Z2 × Z2 )-cordial: alternate triangular
snakes, alternate double triangular snakes, alternate triple triangular snakes, quadrilateral
snakes, alternate quadrilateral snakes, double quadrilateral snakes, and double alternate
quadrilateral snakes.
In [2375] Pechenik and Wise investigate Z2 ×Z2 -cordiality of complete bipartite graphs,
paths, cycles, ladders, prisms, and hypercubes. They proved that all complete bipartite
graphs are Z2 ×Z2 -cordial except Km,n where m, n ≡ 2 mod 4; all paths are Z2 ×Z2 -cordial
except P4 and P5 ; all cycles are Z2 × Z2 -cordial except C4 , C5 , Ck , where k ≡ 2 mod 4; and
all ladders P2 × Pk are Z2 × Z2 -cordial except C4 . They also introduce a generalization of
A-cordiality involving digraphs and quasigroups, and show that there are infinitely many
Q-cordial digraphs for every quasigroup Q. Jinnah and Nair [1548] proved that all trees
except P4 and P5 are Z2 × Z2 -cordial and the graphs obtained by subdividing the pendent
edges of Cn K1 are Z2 × Z2 -cordial for all n.
Cairnie and Edwards [653] have determined the computational complexity of cordial
and k-cordial labelings. They prove the conjecture of Kirchherr [1703] that deciding
whether a graph admits a cordial labeling is NP-complete. As a corollary, this result
implies that the same problem for k-cordial labelings is NP-complete. They remark that
even the restricted problem of deciding whether connected graphs of diameter 2 have a
cordial labeling is also NP-complete.
For a (p, q) graph G and a bijection f from V (G) to {1, 2, . . . , p} Ponraj, Annathurai,
and Kala [2414] introduced a new graph labeling as follows. For each edge uv assign
the remainder when f (u) is divided by f (v) or when f (v) is divided by f (u) depending
on whether f (u) > f (v) or f (v) > f (u). The function f is called a remainder cordial
labeling of G if |ηe − ηo | 6 1 where ηe and ηo respectively denote the number of edges
labeled with even integers and the number of edges labeled with odd integers. A graph
G with a remainder cordial labeling is called a remainder cordial graph. In [2414] and
[2419] they proved that the following graphs are remainder cordial: paths, cycles, stars,
bistars, crowns, combs, K2,n , S(K1,n ), S(Bn,n ), Pn2 , wheels, subdivisions of wheels, K2,2n ,
and the graph obtained by subdividing the pendent edges of the bistar Bn,n . They also
proved the following star related graphs are remainder cordial: K1,n ∪ Bn,n , Pn ∪ K1,n ,
Pn ∪ Bn,n , K1,n ∪ S(K1,n ), K1,n ∪ S(Bn,n ), Pn2 ∪ K1,n , Pn 2 ∪ Bn,n , and S(K1,n ) ∪ S(Bn,n ).

the electronic journal of combinatorics (2023), #DS6 101

They conjecture that Kn is remainder cordial if and only if n 6 3. Ponraj, Annathurai,
and Kala [2415] generalize remainder cordial labelings as follows. Let f be a function
from V (G) to {1, 2, . . . , k} where 2 < k 6 |V (G)|. For each edge uv assign the remainder
when f (u) is divided by f (v) or when f (v) is divided by f (u) depending on whether
f (u) > f (v) or f (v) > f (u). The function f is called a k-remainder cordial labeling of
G if |vf (i) − vf (j)| 6 1, for i, j ∈ {1, . . . , k} where vf (x) denote the number of vertices
labeled with x and |ηe − ηo | 6 1 where ηe and ηo respectively denote the number of edges
labeled with even integers and the number of edges labeled with odd integers. A graph
that admits a k-remainder cordial labeling is called a k-remainder cordial graph. In [2415],
[216], [217], and [2420] they proved the following. Every graph is a subgraph of a connected
k-remainder cordial graph for k > 4. Note that when k = 2, the number of edges with
label 0 is q so there does not exists a 2-remainder cordial labeling. They further investigate
the 3-remainder cordial labeling behavior of paths, cycles, stars, combs, crowns, wheels,
fans, squares of paths, subdivisions of wheels, subdivisions of stars, subdivisions of combs,
armed crowns, and K1,n K2 . They further proved that Wn is 3-remainder cordial if and
only if n ≡ 1 (mod 3), K1,n is 3-remainder cordial if and only if n ∈ {1, 2, 3, 4, 5, 6, 7, 9},
and Kn is 3-remainder cordial if and only if n 6 3. In [2416], [2417], and [2418] Ponraj,
Annathurai, and Kala proved the following graphs are 4-remainder cordial: complete
graphs, paths, cycles, crowns, stars, bistars, books, subdivisions of stars, subdivisions of
bistars, subdivisions of jelly fish, flowers, sunflowers, lotuses inside a circle, friendship
graphs, webs, triangular snakes, durer graphs, planar grids, mongolian tents, prisms,
dragon graphs Cm @Pn (the graph obtained by identifying an endpoint of Pn with one
vertex of Cm ), crossed prisms CP2n , and K2 + mK1 (m ≡ 0, 1, 3 (mod 4). They also
investigate the 4-remainder cordial labeling of Ln mK1 , Ln K2 , Ln mK1 , Pn K1 ,
Pn 2K1 , Cn K1 , and S(Pn K1 ).
In Bapat [283] introduces the following new labeling. A graph G(V, E) has a L-cordial
labeling if there is a bijection f from E(G) to {1, 2, . . . , |E|} that assigns 0 to a vertex
v if the largest label on the edges incident to v is even and assigns 1 to v otherwise and
this assignment satisfies the condition that the number of vertices labeled with 0 and the
number of vertices labeled with 1 differ by at most 1. A graph that admits an L-cordial
labeling is called as L-cordial graph. He shows that stars, path, cycles, and triangular
snakes are L-cordial graphs
In [683] Chartrand, Lee, and Zhang introduced the notion of uniform cordiality as
follows. Let f be a labeling from V (G) to {0, 1} and for each edge xy define f ∗ (xy) =
|f (x) − f (y)|. For i = 0 and 1, let vi (f ) denote the number of vertices v with f (v) = i
and ei (f ) denote the number of edges e with f ∗ (e) = i. They call a such a labeling f
friendly if |v0 (f ) − v1 (f )| 6 1. A graph G for which every friendly labeling is cordial is
called uniformly cordial. They prove that a connected graph of order n > 2 is uniformly
cordial if and only if n = 3 and G = K3 , or n is even and G = K1,n−1 .
In [2628] Riskin introduced two measures of the noncordiality of a graph. He defines
the cordial edge deficiency of a graph G as the minimum number of edges, taken over all
friendly labelings of G, needed to be added to G such that the resulting graph is cordial.
If a graph G has a vertex labeling f using 0 and 1 such that the edge labeling fe given

the electronic journal of combinatorics (2023), #DS6 102

by fe (xy) = |f (x) − f (y)| has the property that the number of edges labeled 0 and the
number of edges labeled 1 differ by at most 1, the cordial vertex deficiency defined as ∞.
Riskin proved: the cordial edge deficiency of Kn (n > 1) is b n2 c − 1; the cordial vertex
deficiency of Kn is j − 1 if n = j 2 + δ, when δ is −2, 0 or 2, and ∞ otherwise. In [2628]
Riskin determines the cordial edge deficiency and cordial vertex deficiency for the cases
when the Möbius ladders and wheels are not cordial. In [2629] Riskin determines the
cordial edge deficiencies for complete multipartite graphs that are not cordial and obtains
a upper bound for their cordial vertex deficiencies.
Recall a graph G the graph G∗ , called the star of G, is the graph obtained by replacing
each vertex G with the star K1,n . In [1619] Kaneria, Patadiya and Teraiya introduced a
balanced cordial labeling for a graph by saying that a cordial labeling f is a vertex balanced
cordial if it satisfies the conditionvf (0) = vf (1); f is a balanced cordial if it satisfies the
conditions ef (0) = ef (1) and vf (0) = vf (1). Kaneria, Teraiya, and Patadiya [1622] proved
the path union P (t · C4n ) is a balanced cordial if t is odd and it is vertex balanced cordial
if t is even; C(t · C4n ) is a balanced cordial if t ≡ 0 (mod 4) and it is a vertex balanced
?
cordial if t ≡ 1, 3 (mod 4); and C4n is balanced cordial. They proved Pn × C4t is balanced
cordial; C2n × C4t is balanced cordial; and G1 G2 is cordial when G1 is cordial and G2
is a balanced cordial. Kaneria and Teraiya [1621] prove if G is a balanced cordial, then
so is G∗ ; if G is a balanced cordial, then so is P2n+1 × G; and if G is a balanced cordial,
∗
then so is G .
An integer cordial labeling of a graph G∗ (p, q) is an injective map g : V → [ −p 2
, . . . , p2 ]∗
or [−b p2 c, . . . , b p2 c] as p is even or odd, which induces an edge labeling g : E → {0, 1}
defined by g(uv) = 1 if g(u) + g(v) > 0 and 0 otherwise such that the number of edges
labeled 1 and the number of edges labeled 0 differ by at most 1. If a graph has inte-
ger cordial labeling it is called an integer cordial graph. In [1128] Gondalia and Rokad
investigated the existence of integer cordial labelings of star and bistar related graphs.
For a a planar graph G with an with integer cordial labeling g and the face labeling
g ∗ ∗ from the faces of G defined by g ∗ ∗(f ) = 1 if g(v1 ) + g(v2 ) + . . . + g(vn ) = 0 and
g ∗ ∗(f ) = 0 otherwise, where v1 , v2 , . . . , vn are the vertices of face f . Such a labeling is
called a face integer cordial labeling of graph G if the number of faces labeled with 0 and
the number of faces labeled with 1 differ by at most 1. Parameswari, Saradha Pritha,
and Rajeswari [2341] proved that the lilly graph, 2K1,n + 2Pn (n > 2), admits an integer [2341] new
cordial lableling and the vanessa graph, 2Fn + K1,n (n > 2), admits an integer cordial
labeling and a face integer cordial lableling. Sheriff, Abbas, and Raj [2883] proved that [2883] new
wheels, fans, friendship graphs, triangular snakes, double triangular snakes, the star of
cycles, the degree splitting graph of bistars are face integer cordial graphs.
For a simple connected graph G(V, E), Sahaya, Maya, and Nicholas [2672] introduced [2672] new
the concept of product integer cordial labeling of as an injective mapping f : V →
{1, 2, . . . , |V |} such that the induced edge labeling f ∗ on E defined f ∗ (uv) = 1 or 0
according as f (u)f (v) even or odd respectively, has the property that the number of
edges labeled with 1 and the the number of edges labeled with 0 differ by at most 1.
They proved that the following graphs admit product integer cordial labelings: paths,
friendship graphs, Cn if and only if n is odd, and Km,n if and only if one of m and n is

the electronic journal of combinatorics (2023), #DS6 103

1. In [2846] Shah and Parmar proved that nontrivial triangular snakes, double triangu- [2846] new
lar snakes, triple triangular snakes, and alternate triangular snakes graph admits integer
cordial labelings. In [2847] Shah and Parmar proved that m-triangular snakes, quadri- [2847] new
lateral snakes, double quadrilateral snakes, m-quadrilateral snakes, pentagonal snakes,
double pentagonal snakes, and m-pentagonal snakes are integer cordial graphs. They also
proved that triangular snake graph, double triangular snakes, alternate triangular snakes,
m-triangular snakes, quadrilateral snakes, double quadrilateral snakes, m-quadrilateral
snakes, pentagonal snakes, double pentagonal snakes, and m-pentagonal snakes graph are
integer cordial graphs. In [2848] Shah and Parmar proved that alternate m-triangular [2848] new
snakes, quadrilateral snakes, alternate m-quadrilateral snakes, pentagonal snakes, alter-
nate m-pentagonal snakes, irregular triangular snakes, irregular quadrilateral snakes, and
irregular pentagonal snakes are integer cordial graphs.
If f is a binary vertex labeling of a graph G Lee, Liu, and Tan [1855] defined a partial
edge labeling of the edges of G by f ∗ (uv) = 0 if f (u) = f (v) = 0 and f ∗ (uv) = 1 if
f (u) = f (v) = 1. They let e0 (G) denote the number of edges uv for which f ∗ (uv) = 0
and e1 (G) denote the number of edges uv for which f ∗ (uv) = 1. They say G is balanced if
it has a friendly labeling f such that if |e0 (f ) − e1 (f )| 6 1. In the case that the number
of vertices labeled 0 and the number of vertices labeled 1 are equal and the number of
edges labeled 0 and the number of edges labeled 1 are equal they say the labeling is
strongly balanced. They prove: Pn is balanced for all n and is strongly balanced if n is
even; Km,n is balanced if and only if m and n are even, m and n are odd and differ by at
most 2, or exactly one of m or n is even (say n = 2t) and t ≡ −1, 0, 1 (mod |m − n|); a
k-regular graph with p vertices is strongly balanced if and only if p is even and is balanced
if and only if p is odd and k = 2; and if G is any graph and H is strongly balanced, the
composition G[H] (see §2.3 for the definition) is strongly balanced. In [1735] Kong, Lee,
Seah, and Tang show: Cm × Pn is balanced if m and n are odd and is strongly balanced if
either m or n is even; and Cm K1 is balanced for all m > 3 and strongly balanced if m
is even. They also provide necessary and sufficient conditions for a graph to be balanced
or strongly balanced. Lee, Lee, and Ng [1826] show that stars are balanced if and only
if the number of edges of the star is at most 4. Kwong, Lee, Lo, and Wang [1787] define
a graph G to be uniformly balanced if |e0 (f ) − e1 (f )| 6 1 for every vertex labeling f
that satisfies if |v0 (f ) − v1 (f )| 6 1. They present several ways to construct families of
uniformly balanced graphs. Kim, Lee, and Ng [1697] prove the following: for any graph
G, mG is balanced for all m; for any graph G, mG is strongly balanced for all even m;
if G is strongly balanced and H is balanced, then G ∪ H is balanced; mKn is balanced
for all m and strongly balanced if and only if n = 3 or mn is even; if H is balanced and
G is any graph, the G × H is strongly balanced; if one of m or n is even, then Pm [Pn ]
is balanced; if both m and n are even, then Pm [Pn ] is balanced; and if G is any graph
and H is strongly balanced, then the tensor product G ⊗ H is strongly balanced. (The
tensor product G ⊗ H of graphs G and H, has the vertex set V (G) × V (H) and any two
vertices (u, u0 ) and (v, v 0 ) are adjacent in G ⊗ H if and only if u0 is adjacent with v 0 and
u is adjacent with v.)
A graph G is k-balanced if there is a function f from the vertices of G to {0, 1, 2, . . . , k−

the electronic journal of combinatorics (2023), #DS6 104

1} such that for the induced function f ∗ from the edges of G to {0, 1, 2, . . . , k − 1} defined
by f ∗ (uv) = |f (u) − f (v)| the number of vertices labeled i and the number of edges
labeled j differ by at most 1 for each i and j. Seoud, El Sonbaty, and Abd El Rehim
[2770] proved the following: if |E| > 2k + 1 and |V | 6 k then G(V, E) is not k-balanced;
if |E| > 3k + 1, (k > 2) and 3k − 1 > |V | > 2k + 1 then G(V, E) is not k-balanced;
r-regular graphs with 3 6 r 6 n − 1 are not r-balanced; if G1 has m vertices and G2
has n vertices then G1 + G2 is not (m + n)-balanced for m, n > 5; P3 × Pn with edge
set E is 3n-balanced and |E|-balanced; Ln × P2 (Ln = Pn × P2 ) with vertex set V and
edge set E is |V |-balanced and k-balanced for k > |E| but not n-balanced for n > 2; the
one-point union of two copies of K2,n is 2n-balanced, |V |-balanced, and |E|-balanced not
is 3-balanced when n > 4. They also proved that the composition graph Pn [P2 ] is not
n-balanced for n > 3, is not 2n-balanced for n > 5, and is not |E|-balanced.
A graph whose edges are labeled with 0 and 1 so that the absolute difference in the
number of edges labeled 1 and 0 is no more than one is called edge-friendly. We say an
edge-friendly labeling induces a partial vertex labeling if vertices which are incident to
more edges labeled 1 than 0, are labeled 1, and vertices which are incident to more edges
labeled 0 than 1, are labeled 0. Vertices that are incident to an equal number of edges
of both labels are called unlabeled. Call a procedure on a labeled graph a label switching
algorithm if it consists of pairwise switches of labels. Krop, Lee, and Raridan [1762] prove
that given an edge-friendly labeling of Kn , we show a label switching algorithm producing
an edge-friendly relabeling of Kn such that all the vertices are labeled.
In 2017 [286] Bapat introduced a new labeling as follows. A function f from the
vertices of a graph G(E, V ) to {0, 1, 2, . . . , |V | − 1} is called an extended vertex edge
additive cordial labeling if the induced function f ∗ from the edges of G to {0, 1} defined
by f ∗ (uv) = f (u) + f (v) (mod 2) for all edges uv of G has the property that the number
of edges labeled 0 and the number of edges labeled 1 differ by at most 1. Bapat [286]
proved paths, stars, K2,n , K3,n , K4,n , Pn C3 , and Pn C4 admit extended vertex edge
additive cordial labeling.
Let G(p, q) a simple finite connected graph. Given a bijective function f from E(G) to
{0, 1, . . . , q − 1} Bapat [287] calls a bijective function f ∗ from E(G) to {0, 1, 2, . . . , q − 1}
an extended edge vertex cordial (eevc) labeling if the induced function f ∗ from V (G) to
{0, 1} defined by f ∗ (u) = Σf (uv) mod 2 where the sum is taken over all edges incident
to u has the property that the number of vertices labeled with 0 differs from the number
labeled with 1 by at most 1. He shows that Pn (n 6= 2 mod 4), Cn (n 6= 2 mod 4),
K1,n (n 6= 1 mod 4), graphs obtained by joining the centers of two copies of K1,2n+1 by
an edge, and triangular snakes have eevc labelings.
Murali, Thirusangu, Madura Meenakshi [2208] say a graph G = (V, E) is bicondi-
tional cordial if there is a function f : V → {0, 1} such that the induced edge function
f ∗ : E → {0, 1} defined by f ∗ (uv) = 1 if (u) = f (v) and 0 if f (u) 6= f (v) and the
number of vertices labeled with 0 and the number labeled with 1 differ by at most 1
and the number of edges labeled with 0 and the number labeled with 1 differ by at most
1. Kalaimathi and Balamurugan [1564] prove the existence of the biconditional cordial
labeling for complete bipartite graphs, books with triangular pages, sunflower graphs and

the electronic journal of combinatorics (2023), #DS6 105

web graphs. Nedumaran, Thirusangu, and Celin Mary [2266] proved that the graph con-
sisting of k copies of a double star admits a biconditional cordial labeling. Kalaimathi,
Balamurugan, and Rao [1565] proved the existence of the biconditional cordial labelings
for super subdivisions of ladders and grids Pm × Pn .
A total cordial labeling of a graph G is a cordial labeling of vertex set and edge set
such that the number of vertices and edges labeled with 0 and the number of vertices
and edges labeled with 1 differ by at most 1. Elrokh, Al-Shamiri, Nada, and El-hay [870]
provided necessary and sufficient conditions for the existence of cordial and total cordial
2
labelings for the corona product of paths and the one-point union Cm and Cn2 .

3.8 The Friendly Index–Balance Index

Recall a function f from V (G) to {0, 1} where for each edge xy, f ∗ (xy) = |f (x) −
f (y)|, vi (f ) is the number of vertices v with f (v) = i, and ei (f ) is the num-
ber of edges e with f ∗ (e) = i is called friendly if |v0 (f ) − v1 (f )| 6 1. Lee
and Ng [1863] define the friendly index set of a graph G as FI(G)= {|e0 (f ) −
e1 (f )| where f runs over all friendly labelings f of G}. They proved: for any graph G
with q edges FI(G) ⊆ {0, 2, 4, . . . , q} if q is even and FI(G)⊆ {1, 3, . . . , q} if q is odd;
for 1 6 m 6 n, FI(Km,n )= {(m − 2i)2 | 0 6 i 6 bm/2c} if m + n is even; and
FI(Km,n )= {i(i + 1)| 0 6 i 6 m} if m + n is odd. In [1866] Lee and Ng prove the
following: FI(C2n ) = {0, 4, 8, . . . , 2n} when n is even; FI(C2n ) = {2, 6, 10, . . . , 2n} when n
is odd; and FI(C2n+1 ) = {1, 3, 5, . . . , 2n − 1}. Elumalai [878] defines a cycle with a full set
of chords as the graph P Cn obtained from Cn = v0 , v1 , v2 , . . . , vn−1 by adding the cords
v1 vn−1 , v2 vn−2 , . . . , v(n−2)/2 , v(n+2)/2 when n is even and v1 vn−1 , v2 vn−2 , . . . , v(n−3)/2 , v(n+3)/2
when n is odd. Lee and Ng [1865] prove: FI(P C2m+1 ) = {3m − 2, 3m − 4, 3m − 6, . . . , 0}
when m is even and FI(P C2m+1 ) = {3m − 2, 3m − 4, 3m − 6, . . . , 1} when m is odd;
FI(P C4 ) = {1, 3}; for m > 3, FI(P C2m ) = {3m − 5, 3m − 7, 3m − 9, . . . , 1} when m is
even; FI(P C2m ) = {3m − 5, 3m − 7, 3m − 9, . . . , 0} when m is odd.
Salehi and Lee [2681] determined the friendly index for various classes of trees. Among
their results are: for a tree with q edges that has a perfect matching, the friendly index is
the odd integers from 1 to q and for n > 2, FI(Pn )= {n − 1 − 2i| 0 6 ib(n − 1)/2c. Law
[1821] determined the full friendly index sets of spiders and disproved a conjecture by
Salehi and Lee [2681] that the friendly index set of a tree forms an arithmetic progression.
In [1869] Lee, Ng, and Lau determine the friendly index sets of several classes of spiders.
Gao, Sun, and Lee [1029] determined the full friendly index of Pm × Pn with the extra
mn + 1 − m − n edges uij − u(i+1)(j+1) . Sun, Gao, and Lee [3131] determined the full
friendly index and friendly index for the twisted product of Mőbius ladders. Sinha and
Kaur [2967] determined the full edge friendly index of stars, wheels, 2-regular graphs, and
mPn . In [2896] Shiu determined the full edge-friendly index sets of complete bipartite
graphs. Salehi and McGinn [2684] obtained partial results about the friendly index set of
Qn and strenghten a conjecture about the friendly index set of Qn made in [2686]. Teffilia1
and Devaraj [3195] found the friendly index set of the graphs obtained by identifying the
central vertex of a fan with the endpoint of a path (umbrella), the graphs obtained by
identifying the central vertex of a star with the endpoint of a path, the graphs obtained

the electronic journal of combinatorics (2023), #DS6 106

by identifying the endpoints of copies of P2 (globe), the splitting graph of a star, and
P2 + mK1 . Lee, Low, Ng, and Wang [1857] determined the friendly index sets for various
classes of disjoint unions of stars. Gao, Ruo-Yuan, Lee, Ren, and Sun [1028] determined
F F I(G), F I(G) and F P CI(G) for a class of cubic graphs G.
Lee and Ng [1865] define P C(n, p) as the graph obtained from the cycle Cn with
consecutive vertices v0 , v1 , v2 , . . . , vn−1 by adding the p cords joining vi to vn−i for 1 6
pbn/2c − 1. They prove FI(P C(2m + 1, p)) = {2m + p − 1, 2m + p − 3, 2m + p − 5, . . . , 1}
if p is even and FI(P C(2m + 1, p)) = {2m + p − 1, 2m + p − 3, 2m + p − 5, . . . , 0} if
p is odd; FI(P C(2m, 1)) = {2m − 1, 2m − 3, 2m − 5, . . . , 1}; for m > 3, and p > 2,
FI(P C(2m, p)) = {2m + p − 4, 2m + p − 6, 2m + p − 8, . . . , 0} when p is even, and
FI(P C(2m, p)) = {2m + p − 4, 2m + p − 6, 2m + p − 8, . . . , 1} when p is odd. More
generally, they show that the integers in the friendly index of a cycle with an arbitrary
nonempty set of parallel chords form an arithmetic progression with a common difference
2. Shiu and Kwong [2901] determine the friendly index of the grids Pn ×P2 . The maximum
and minimum friendly indices for Cm × Pn were given by Shiu and Wong in [2932].
In [1867] Lee and Ng prove: for n > 2, FI(C2n ×P2 ) = {0, 4, 8, . . . , 6n−8, 6n} if n is even
and FI(C2n × P2 ) = {2, 6, 10, . . . , 6n − 8, 6n} if n is odd; FI(C3 × P2 ) = {1, 3, 5}; for n > 2,
FI(C2m+1 ×P2 ) = {6n−1}∪{6n−5−2k| where k > 0 and 6n−5−2k > 0}; FI(M4n ) (here
M4n is the Möbius ladder with 4n steps) = {6n−4−4k| where k > 0 and 6n−4−4k > 0};
FI(M4n+2 ) = {6n +3}∪{6n − 5 − 2k| where k > 0 and 6n − 5 − 2k > 0}. In [1788] Kwong,
Lee, and Ng completely determine the friendly index of all 2-regular graphs. As a corollary,
they show that Cm ∪ Cn is cordial if and only if m + n = 0, 1 or 3 (mod 4). Ho, Lee,
and Ng [1251] determine the friendly index sets of stars and various regular windmills. In
[3464] Wen determines the friendly index of generalized wheels Cn +mK1 for all m > 1. In
[2680] Salehi and De determine the friendly index sets of certain caterpillars of diameter
4 and disprove a conjecture of Lee and Ng [1866] that the friendly index sets of trees form
an arithmetic progression. The maximum and minimum friendly indices for for Cm × Pn
were given by Shiu and Wong in [2932]. Salehi and Bayot [2677] have determined the
friendly index set of Pm × Pn . In [1867] Lee and Ng determine the friendly index sets for
two classes of cubic graphs, prisms d Möbius ladders. Sinha and Kaur [2967] investigate
the full region index sets of friendly labelings of cycles, wheels fans, and P2 × Pn .
For positive integers a 6 b 6 c, Lee, Ng, and Tong [1872] define the broken wheel
W (a, b, c) with three spokes as the graph obtained from K4 with vertices u1 , u2 , u3 , c by
inserting vertices x1,1 , x1,2 , . . . , x1,a−1 along the edge u1 u2 , x2,1 , x2,2 , . . . , x2,b−1 along the
edge u2 u3 , x3,1 , x3,2 , . . . , x3,c−1 along the edge u3 u1 . They determine the friendly index set
for broken wheels with three spokes.
Lee and Ng [1865] define a parallel chord of Cn as an edge of the form vi vn−i
(i < n − 1) that is not an edge of Cn . For n > 6, they call the cycle Cn with con-
secutive vertices v1 , v2 , . . . , vn and the edges v1 vn−1 , v2 vn−2 , . . . , v(n−2)/2 v(n+2)/2 for n even
and v2 vn−1 , v3 vn−2 , . . . , v(n−1)/2 v(n+3)/2 for n odd, Cn with a full set of parallel chords.
They determine the friendly index of these graphs and show that for any cycle with an
arbitrary non-empty set of parallel chords the numbers in its friendly index set form an
arithmetic progression with common difference 2.

the electronic journal of combinatorics (2023), #DS6 107

 For a graph G(V, E) and a graph H rooted at one of its vertices v, Ho, Lee, and Ng
[1250] define a root-union of (H, v) by G as the graph obtained from G by replacing each
vertex of G with a copy of the root vertex v of H to which is appended the rest of the
structure of H. They investigate the friendly index set of the root-union of stars by cycles.
For a graph G(V, E), the total graph T (G) of G, is the graph with vertex set V ∪ E
and edge set E ∪ {(v, uv)| v ∈ V, uv ∈ E}. Note that the total graph of the n-star
is the friendship graph and the total graph of Pn is a triangular snake. Lee and Ng
[1862] use SP (1n , m) to denote the spider with one central vertex joining n isolated
vertices and a path of length m. They show: FI(K1 + 2nK2 ) (friendship graph with 2n
triangles) = {2n, 2n − 4, 2n − 8, . . . , 0} if n is even; {2n, 2n − 4, 2n − 8, . . . , 2} if n is odd;
FI(K1 +(2n+1)K2 ) = {2n+1, 2n−1, 2n−3, . . . , 1}; for n odd, FI(T (Pn )) = {3n−7, 3n−
11, 3n − 15, . . . , z} where z = 0 if n ≡ 1 (mod 4) and z = 2 if n ≡ 3 (mod 4); for n even,
FI(T (Pn )) = {3n−7, 3n−11, 3n−15, . . . , n+1}∪{n−1, n−3, n−5, . . . , 1}; for m 6 n−1
and m+n even, FI(T (SP (1n , m))) = {3(m+n)−4, 3(m+n)−8, 3(m+n)−12, . . . , (m+n)
(mod 4)}; for m + n odd, FI(T (SP (1n , m))) = {3(m + n) − 4, 3(m + n) − 8, 3(m + n) −
12, . . . , m + n + 2} ∪ {m + n, m + n − 2, m + n − 4, . . . , 1}; for n > m and m + n even,
FI(T (SP (1n , m))) = {|4k − 3(m + n)| |(n − m + 2)/2 6 k 6 m + n}; for n > m and m + n
odd, FI(T (SP (1n , m))) = {|4k − 3(m + n)| |(n − m + 3)/2 6 k 6 m + n}.
Kwong and Lee [1784] determine the friendly index any number of copies of C3 that
share an edge in common and the friendly index any number of copies of C4 that share
an edge in common. Lau, Gao, Lee, and Sun determine the friendly index sets and the
cordiality of the edge-gluing of a complete graph Kn and n copies of cycles C3 .
For a planar graph G(V, E) Sinha and Kaur [2986] extended the notion of an index
set of a friendly labeling to regions of a planar graph and determined the full region index
sets of friendly labeling of cycles, wheels fans, and grids Pn × P2 .
An edge-friendly labeling f of a graph G induces a function f ∗ from V (G) to {0, 1}
defined as the sum of all edge labels mod 2. The edge-friendly index set, If (G), of f
is the number of vertices of f labeled 1 minus the number of vertices labeled 0. The
edge-friendly index set of a graph G, EFI(G), is {|If (G)|} taken over all edge-friendly
labelings f of G. The full edge-friendly index set of a graph G, FEFI(G), is {If (G)}
taken over all edge-friendly labelings f of G. Sinha and Kaur [2985] determined the full
edge-friendly index sets of stars, 2-regular graphs, wheels, and mPn . In [2987] Sinha and
Kaur extended the notion of index set of an edge-friendly labeling to regions of a planar
graph and determined the full region index set of edge-friendly labelings of cycles, wheels,
fans Pn + K1 , double fans Pn + K2 , and grids Pm × Pn (m > 2, n > 3). Sinha and Kaur
[2966] investigate the full edge-friendly index sets of double stars, fans generalized fans,
and Pn × P2 . In [2895] Shiu determined the extreme values of edge-friendly indices of
complete bipartite graphs.
In [1698] Kim, Lee, and Ng define the balance index set of a graph G as {|e0 (f )−e1 (f )|}
where f runs over all friendly labelings f of G. Zhang, Lee, and Wen [1826] investigate
the balance index sets for the disjoint union of up to four stars and Zhang, Ho, Lee,
and Wen [3576] investigate the balance index sets for trees with diameter at most four.
Kwong, Lee, and Sarvate [1792] determine the balance index sets for cycles with one

the electronic journal of combinatorics (2023), #DS6 108

pendent edge, flowers, and regular windmills. Lee, Ng, and Tong [1871] determine the
balance index set of certain graphs obtained by starting with copies of a given cycle and
successively identifying one particular vertex of one copy with a particular vertex of the
next. For graphs G and H and a bijection π from G to H, Lee and Su [1892] define
Perm(G, π, H) as the graph obtaining from the disjoint union of G and H by joining each
v in G to π(v) with an edge. They determine the balanced index sets of the disjoint union
of cycles and the balanced index sets for graphs of the form Perm(G, π, H) where G and
H are regular graphs, stars, paths, and cycles with a chord. They conjecture that the
balanced index set for every graph of the form Perm(G, π, H) is an arithmetic progression.
Lee, Ho, and Su [1842] investigated the balance index sets of k-level wheel graphs.
Wen [3463] determines the balance index set of the graph that is constructed by
identifying the center of a star with one vertex from each of two copies of Cn and provides
a necessary and sufficient for such graphs to be balanced. In [1895] Lee, Su, and Wang
determine the balance index sets of the disjoint union of a variety of regular graphs of the
same order. Kwong [1782] determines the balanced index sets of rooted trees of height at
most 2, thereby settling the problem for trees with diameter at most 4. His method can
be used to determine the balance index set of any tree. The homeomorph Hom(G, p) of a
graph G is the collection of graphs obtained from G by adding p (p > 0) additional degree
2 vertices to its edges. For any regular graph G, Kong, Lee, and Lee [1728] studied the
changes of the balance index sets of Hom(G, p) with respect to the parameter p. They
derived explicit formulas for their balance index sets provided new examples of uniformly
balanced graphs. In [601] Bouchard, Clark, Lee, Lo, and Su investigate the balance index
sets of generalized books and ear expansion graphs. In [2652] Rose and Su provided
an algorithm to calculate the balance index sets of a graph. Hua and Raridan [1267]
determine the balanced index sets of all complete bipartite graphs with a larger part of
odd cardinality and a smaller part of even cardinality.
In[2902] Shiu and Kwong made a major advance by introducing an easier approach
to find the balance index sets of a large number of families of graphs in a unified and
uniform manner. They use this method to determine the balance index sets for r-regular
graphs, amalgamations of r-regular graphs, complete bipartite graphs, wheels, one point
unions of regular graphs, sun graphs, generalized theta graphs, m-ary trees, spiders, grids
Pm × Pn , and cylinders Cm × Pn . They provide a formula that enables one to determine
the balance index sets of many biregular graphs (that is, graphs with the property that
there exist two distinct positive integers r and s such that every vertex has degree r or
s).
A labeling f from the vertices of a graph G to {0, 1} is said to be vertex-friendly if the
number of vertices labeled with 0 and the number labeled with 1 differ by at most 1. The
vertex balance index set of G is |e0 (f ) − e1 (f )| taken over all vertex-friendly labelings f .
Adiga, Subbaraya, Shrikanth and Sriraj [60] completely determined the vertex balance
index set of Kn , Km,n , Cn × P2 , and complete binary trees.
Manico and Pedrano [2075] prove that if the number of edges in a vertex-friendly of
a graph G is even, then the vertex balance index of G contains only even numbers, and
if the number of edges in a vertex-friendly graph G is odd, then the the vertex balance

the electronic journal of combinatorics (2023), #DS6 109

index of G contains only odd numbers. Furthermore, they provide the vertex balance
index set of triangular snakes, quadrilateral snakes, double triangular snakes), and double
quadrilateral snakes.
In [2901] Shiu and Kwong define the full friendly index set of a graph G as {e0 (f ) −
e1 (f )} where f runs over all friendly labelings of G. The full friendly index for P2 × Pn is
given by Shiu and Kwong in [2901]. The full friendly index of Cm × Cn is given by Shiu
and Ling in [2918]. In [2983] and [2984] Sinha and Kaur investigated the full friendly
index sets complete graphs, cycles, fans, double fans, wheels, double stars, P3 × Pn , and
the tensor product of P2 and Pn . Shiu and Ho [2898] investigated the full friendly index
sets of cylinder graphs Cm × P2 (m > 3), Cm × P3 (m > 4), and C3 × Pn (n > 4). These
results, together with previously proven ones, completely determine the full friendly index
of all cylinder graphs. Shiu and Ho [2899] study the full friendly index set and the full
product-cordial index set of odd twisted cylinders and two permutation Petersen graphs.
Gao [1017] determined the full friendly index set of Pm × Pn , but he used the terms
“edge difference set” instead of “full friendly index set” and “direct product” instead of
“Cartesian product.” The twisted cylinder graph is the permutation graph on 4n (n > 2)
vertices, P (2n; σ), where σ = (1, 2)(3, 4) · · · (2n − 1, 2n) (the product of n transpositions).
Shiu and Lee [2916] determined the full friendly index sets of twisted cylinders.
In [714] and [1785] Chopra, Lee, and Su and Kwong and Lee introduce a dual of
balance index sets as follows. For an edge labeling f using 0 and 1 they define a partial
vertex labeling f ∗ by assigning 0 or 1 to f ∗ (v) depending on whether there are more
0-edges or 1-edges incident to v and leaving f ∗ (v) undefined otherwise. For i = 0 or
1 and a graph G(V, E), let ef (i) = |{uv ∈ E : f (uv) = i}| and vf (i) = |{v ∈ V :
f ∗ (v) = i}|. They define the edge-balance index of G as EBI(G) = {|vf (0) − vf (1)| :
the edge labeling f satisfies |ef (0) − ef (1)| 6 1}. Among the graphs whose edge-balance
index sets have been investigated by Lee and his colleagues are: fans and wheels [714];
generalized theta graphs [1785]; flower graphs [1786] and [1786]; stars, paths, spiders,
and double stars [1903]; (p, p + 1)-graphs [1897]; prisms and Möbius ladders [3437]; 2-
regular graphs, complete graphs [3436]; and the envelope graphs of stars, paths, and
cycles [724]. (The envelope graph of G(V, E) is the graph with vertex set V (G) ∪ E(G)
and set E(G) ∪ {(u, (u, v)) : U ∈ V, (u, v) ∈ E)}).
Lee, Kong, Wang, and Lee [1729] found the EBI(Km,n ) for m = 1, 2, 3, 4, 5 and m = n.
Krop, Minion, Patel, and Raridan [1764] did the case for complete bipartite graphs with
both parts of odd cardinality. Dao, Hua, Ngo, and Raridan [779] determined the edge-
balanced index sets for complete even bipartite graphs. Krop and Sikes [1766] determined
EBI(Km,m−2a ) for 1 6 a 6 (m − 3)/4 and m odd.
For a graph G and a connected graph H with a distinguished vertex s, the L-product
of G and (H, s), G ×L (H, s), is the graph obtained by taking |V (G)| copies of (H, s)
and identifying each vertex of G with s of a single copy of H. In [716] and [605] Chou,
Galiardi, Kong, Lee, Perry, Bouchard, Clark, and Su investigated the edge-balance index
sets of L-product of cycles with stars. Bouchard, Clark, and Su [604] gave the exact values
of the edge-balance index sets of L-product of cycles with cycles.
Chopra, Lee, and Su [717] prove that the edge-balance index of the fan P3 + K1

the electronic journal of combinatorics (2023), #DS6 110

is {0, 1, 2} and edge-balance index of the fan Pn + K1 , n > 4, is {0, 1, 2, . . . , n − 2}.
They define the broken fan graphs BF (a, b) as the graph with V (BF (a, b)) = {c} ∪
{v1 , . . . , va } ∪ {u1 , . . . , ub } and E(BF (a, b)) = {(c, vi )| i = 1, . . . , a} ∪ {(c, ui )| 1, . . . , b} ∪
E(Pa ) ∪ E(Pb ) (a > 2 and b > 2). They prove the edge-balance index set of BF (a, b) is
{0, 1, 2, . . . , a + b − 4}. In [1893] Lee, Su, and Todt give the edge-balance index sets of
broken wheels. See also [3057] and [3219]. In [1827] Lee, Lee, and Su present a technique
that determines the balance index sets of a graph from its degree sequence. In addition,
they give an explicit formula giving the exact values of the balance indices of generalized
friendship graphs, envelope graphs of cycles, and envelope graphs of cubic trees.

3.9 k-equitable Labelings

In 1990 Cahit [642] proposed the idea of distributing the vertex and edge labels among
{0, 1, . . . , k − 1} as evenly as possible to obtain a generalization of graceful labelings
as follows. For any graph G(V, E) and any positive integer k, assign vertex labels from
{0, 1, . . . , k−1} so that when the edge labels induced by the absolute value of the difference
of the vertex labels, the number of vertices labeled with i and the number of vertices
labeled with j differ by at most one and the number of edges labeled with i and the
number of edges labeled with j differ by at most one. Cahit has called a graph with
such an assignment of labels k-equitable. Note that G(V, E) is graceful if and only if it
is |E| + 1-equitable and G(V, E) is cordial if and only if it is 2-equitable. Cahit [641]
has shown the following: Cn is 3-equitable if and only if n 6≡ 3 (mod 6); the triangular
(n)
snake with n blocks is 3-equitable if and only if n is even; the friendship graph C3 is
3-equitable if and only if n is even; an Eulerian graph with q ≡ 3 (mod 6) edges is not
3-equitable; and all caterpillars are 3-equitable [641]. Cahit [641] claimed to prove that
Wn is 3-equitable if and only if n 6≡ 3 (mod 6) but Youssef [3544] proved that Wn is
3-equitable for all n > 4. Youssef [3542] also proved that if G is a k-equitable Eulerian
graph with q edges and k ≡ 2 or 3 (mod 4) then q 6≡ k (mod 2k). Cahit conjectures
[641] that a triangular cactus with n blocks is 3-equitable if and only if n is even. In [642]
Cahit proves that every tree with fewer than five end vertices has a 3-equitable labeling.
He conjectures that all trees are k-equitable [643]. In 1999 Speyer and Szaniszló [3039]
proved Cahit’s conjecture for k = 3. Coles, Huszar, Miller, and Szaniszlo [751] proved
caterpillars, symmetric generalized n-stars (or symmetric spiders), and complete n-ary
trees are 4-equitable. Vaidya and Shah [3303] proved that the splitting graphs of K1,n
and the bistar Bn,n and the shadow graph of Bn,n are 3-equitable. Rokad [2643] found
3-equitable labelings of the ring sum of different graphs.
Vaidya, Dani, Kanani, and Vihol [3267] proved that the graphs obtained by starting
with copies G1 , G2 , . . . , Gn of a fixed star and joining each center of Gi to the center of
Gi+1 (i = 1, 2, . . . , n−1) by an edge are 3-equitable. Recall the shell C(n, n−3) is the cycle
Cn with n − 3 cords sharing a common endpoint called the apex. Vaidya, Dani, Kanani,
and Vihol [3268] proved that the graphs obtained by starting with copies G1 , G2 , . . . , Gn
of a fixed shell and joining each apex of Gi to the apex of Gi+1 (i = 1, 2, . . . , n − 1) by an
edge are 3-equitable. For a graph G and vertex v of G, Vaidya, Dani, Kanani, and Vihol

the electronic journal of combinatorics (2023), #DS6 111

[3269] prove that the graphs obtained from the wheel Wn , n > 5, by duplicating (see 3.7
for the definition) any rim vertex is 3-equitable and the graphs obtained from the wheel
Wn by duplicating the center is 3-equitable when n is even and not 3-equitable when n is
odd and at least 5. They also show that the graphs obtained from the wheel Wn , n 6= 5,
by duplicating every vertex is 3-equitable.
Vaidya, Srivastav, Kaneria, and Ghodasara [3314] prove that cycle with two chords
that share a common vertex with opposite ends that are incident to two consecutive
vertices of the cycle is 3-equitable. Vaidya, Ghodasara, Srivastav, and Kaneria [3273]
prove that star of cycle Cn∗ is 3-equitable for all n. Vaidya and Dani [3263] proved
that the graphs obtained by starting with n copies G1 , G2 , . . . , Gn of a fixed star and
joining the center of Gi to the center of Gi+1 by an edge and each center to a new vertex
xi (1 6 i 6 n − 1) by an edge have 3-equitable labeling. Vaidya and Dani [3266] prove
that the graphs obtained by duplication of an arbitrary edge of a cycle or a wheel have
3-equitable labelings.
The Mycielski graph of a graph G is obtained from G by adding to each vertex v a
new vertex u that is adjacent to the neighbors of v and a adding a new vertex w that is
adjacent to every u. In [2707] Sangeeta, Parthiban, Selvaraju proved the non-existence of [2707] new
3-equitable labelings for non-trivial cases of the total graphs of fans, the middle graph of
ladders, the degree splitting graphs of friendship graphs, and the Mycielskian graphs of
paths.
(1) (2) (k)
Recall G =< Wn : Wn : . . . : Wn > 1s the graph obtained by joining the center
(i) (i+1)
vertices of each of Wn and Wn to a new vertex xi where 1 6 i 6 k − 1. Vaidya, Dani,
(1) (2) (k)
Kanani, and Vihol [3270] prove that < Wn : Wn : ... : Wn > is 3-equitable. Vaidya
and Vihol [3318] prove that any graph G can be embedded as an induced subgraph of a
3-equitable graph thereby ruling out any possibility of obtaining any forbidden subgraph
characterization for 3-equitable graphs.
The shadow graph D2 (G) of a connected graph G is constructed by taking two copies
of G, G0 and G00 and joining each vertex u0 in G0 to the neighbors of the corresponding
vertex u00 in G00 . Vaidya, Vihol, and Barasara [433] prove that the shadow graph of Cn is
3-equitable except for n = 3 and 5 while the shadow graph of Pn is 3-equitable except for
n = 3. They also prove that the middle graph of Pn is 3-equitable and the middle graph
of Cn is 3-equitable for n even and not 3-equitable for n odd.
Bhut-Nayak and Telang have shown that crowns Cn K1 , are k-equitable for k =
n, . . . , 2n − 1 [564] and Cn K1 is k-equitable for all n when k = 2, 3, 4, 5, and 6 [565].
In [2759] Seoud and Abdel Maqsoud prove: a graph with n vertices and q edges in
which every vertex has odd degree is not 3-equitable if n ≡ 0 (mod 3) and q ≡ 3 (mod
6); all fans except P2 + K1 are 3-equitable; all double fans Pn + K2 except P4 + K2 are
3-equitable; Pn2 is 3-equitable for all n except 3; K1,1,n is 3-equitable if and only if n ≡ 0
or 2 (mod 3); K1,2,n , n > 2, is 3-equitable if and only if n ≡ 2 (mod 3); Km,n , 3 6 m 6 n,
is 3-equitable if and only if (m, n) = (4, 4); and K1,m,n , 3 6 m 6 n, is 3-equitable if
and only if (m, n) = (3, 4). They conjectured that Cn2 is not 3-equitable for all n > 3.
However, Youssef [3550] proved that Cn2 is 3-equitable if and only if n is at least 8. Youssef
[3550] also proved that Cn + K2 is 3-equitable if and only if n is even and at least 6 and

the electronic journal of combinatorics (2023), #DS6 112

determined the maximum number of edges in a 3-equitable graph as a function of the
number of its vertices. For a graph with n vertices to admit a k-equitable labeling, Seoud
and Salim [2788] proved that the number of edges is at most kd(n/k)c2 + k − 1.
Bapat and Limaye [422] have shown the following graphs are 3-equitable: helms
Hn , n > 4; flowers (see §2.2 for the definition); the one-point union of any number
of helms; the one-point union of any number of copies of K4 ; K4 -snakes (see §2.2 for the
definition); Ct -snakes where t = 4 or 6; C5 -snakes where the number of blocks is not
congruent to 3 modulo 6. A multiple shell MS{nt11 , . . . , ntrr } is a graph formed by ti shells
each of order ni , 1 6 i 6 r, that have a common apex. Bapat and Limaye [423] show that
every multiple shell is 3-equitable and Chitre and Limaye [706] show that every multiple
shell is 5-equitable. In [707] Chitre and Limaye define the H-union of a family of graphs
G1 , G2 , . . . , Gt , each having a graph H as an induced subgraph, as the graph obtained by
starting with G1 ∪ G2 ∪ · · · ∪ Gt and identifying all the corresponding vertices and edges
of H in each of G1 , . . . , Gt . In [707] and [708] they proved that the Kn -union of gears and
helms Hn (n > 6) are edge-3-equitable.
Szaniszló [3180] has proved the following: Pn is k-equitable for all k; Kn is 2-equitable
if and only if n = 1, 2, or 3; Kn is not k-equitable for 3 6 k < n; Sn is k-equitable for
all k; K2,n is k-equitable if and only if n ≡ k − 1 (mod k), or n ≡ 0, 1, 2, . . . , bk/2c − 1
(mod k), or n = bk/2c and k is odd. She also proves that Cn is k-equitable if and only if
k meets all of the following conditions: n 6= k; if k ≡ 2, 3 (mod 4), then n 6= k − 1 and
n 6≡ k (mod 2k). Coles, Huszar, Miller, and Szaniszló [751] proved that all caterpillars,
symmetric generalized n-stars (or symmetric spiders), and complete n-ary trees for all are
4-equitable.
Vickrey [3360] has determined the k-equitability of complete multipartite graphs. He
shows that for m > 3 and k > 3, Km,n is k-equitable if and only if Km,n is one of the
following graphs: K4,4 for k = 3; K3,k−1 for all k; or Km,n for k > mn. He also shows that
when k is less than or equal to the number of edges in the graph and at least 3, the only
complete multipartite graphs that are k-equitable are Kkn+k−1,2,1 and Kkn+k−1,1,1 . Partial
results on the k-equitability of Km,n were obtained by Krussel [1767].
In [3557] Youssef and Al-Kuleab proved the following: Cn3 is 3-equitable if and only
if n is even and n > 12; gear graphs are k-equitable for k = 3, 4, 5, 6; ladders Pn × P2
are 3-equitable for all n > 2; Cn × P2 is 3-equitable if and only if n 6≡ (mod 6); Möbius
ladders Mn are 3-equitable if and only if n 6≡ (mod6); and the graphs obtained from
Pn × P2 (n > 2) where by adding the edges ui vi+1 (1 6 i 6 n − 1) to the path vertices
u1 , u2 , . . . , un and v1 , v2 , . . . , vn .
In [1993] López, Muntaner-Batle, and Rius-Font prove that if n is an odd integer and
F is optimal k-equitable for all proper divisors k of |E(F )|, then nF is optimal k-equitable
for all proper divisors k of |E(F )|. They also prove that if m − 1 and n are odd, then
then nCm is optimal k-equitable for all proper divisors k of |E(F )|.
As a corollary of the result of Cairnie and Edwards [653] on the computational com-
plexity of cordially labeling graphs it follows that the problem of finding k-equitable
labelings of graphs is NP-complete as well.
Seoud and Abdel Maqsoud [2760] call a graph k-balanced if the vertices can be labeled

the electronic journal of combinatorics (2023), #DS6 113

from {0, 1, . . . , k − 1} so that the number of edges labeled i and the number of edges
labeled j induced by the absolute value of the differences of the vertex labels differ by at
most 1. They prove that Pn2 is 3-balanced if and only if n = 2, 3, 4, or 6; for k > 4, Pn2
is not k-balanced if k 6 n − 2 or n + 1 6 k 6 2n − 3; for k > 4, Pn2 is k-balanced if
k > 2n − 2; for k, m, n > 3, Km,n is k-balanced if and only if k > mn; for m 6 n, K1,m,n
is k-balanced if and only if (i) m = 1, n = 1 or 2, and k = 3; (ii) m = 1 and k = n + 1
or n + 2; or (iii) k > (m + 1)(n + 1).
In [3550] Youssef gave some necessary conditions for a graph to be k-balanced and
some relations between k-equitable labelings and k-balanced labelings. Among his results
are: Cn is 3-balanced for all n > 3; Kn is 3-balanced if and only if n 6 3; and all trees
are 2-balanced and 3-balanced. He conjectures that all trees are k-balanced (k > 2).
Bloom has used the term k-equitable to describe another kind of labeling (see [3482]
and [3483]). He calls a graph k-equitable if the edge labels induced by the absolute value
of the difference of the vertex labels have the property that every edge label occurs exactly
k times. Bloom calls a graph of order n minimally k-equitable if the vertex labels are 1,
2,. . ., n and it is k-equitable. Both Bloom and Wojciechowski [3482], [3483] proved that
Cn is minimally k-equitable if and only if k is a proper divisor of n. Barrientos and Hevia
[453] proved that if G is k-equitable of size q = kw (in the sense of Bloom), then δ(G) 6 w
and ∆(G) 6 2w. Barrientos, Dejter, and Hevia [452] have shown that forests of even size
are 2-equitable. They also prove that for k = 3 or k = 4 a forest of size kw is k-equitable
if and only if its maximum degree is at most 2w and that if 3 divides mn + 1, then the
double star Sm,n is 3-equitable if and only if q/3 6 m 6 b(q − 1)/2c. (Sm,n is P2 with m
pendent edges attached at one end and n pendent edges attached at the other end.) They
discuss the k-equitability of forests for k > 5 and characterize all caterpillars of diameter 2
that are k-equitable for all possible values of k. Acharya and Bhat-Nayak [50] have shown
that coronas of the form C2n K1 are minimally 4-equitable. In [434] Barrientos proves
that the one-point union of a cycle and a path (dragon) and the disjoint union of a cycle
and a path are k-equitable for all k that divide the size of the graph. Barrientos and Havia
[453] have shown the following: Cn × K2 is 2-equitable when n is even; books Bn (n > 3)
are 2-equitable when n is odd; the vertex union of k-equitable graphs is k-equitable; and
wheels Wn are 2-equitable when n 6≡ 3 (mod 4). They conjecture that Wn is 2-equitable
when n ≡ 3 (mod 4) except when n = 3. Their 2-equitable labelings of Cn × K2 and the
n-cube utilized graceful labelings of those graphs.
M. Acharya and Bhat-Nayak [51] have proved the following: the crowns C2n K1
are minimally 2-equitable, minimally 2n-equitable, minimally 4-equitable, and minimally
n-equitable; the crowns C3n K1 are minimally 3-equitable, minimally 3n-equitable,
minimally n-equitable, and minimally 6-equitable; the crowns C5n K1 are minimally
5-equitable, minimally 5n-equitable, minimally n-equitable, and minimally 10-equitable;
the crowns C2n+1 K1 are minimally (2n + 1)-equitable; and the graphs Pkn+1 are k-
equitable.
In [436] Barrientos calls a k-equitable labeling optimal if the vertex labels are con-
secutive integers and complete if the induced edge labels are 1, 2, . . . , w where w is the
number of distinct edge labels. Note that a graceful labeling is a complete 1-equitable

the electronic journal of combinatorics (2023), #DS6 114

labeling. Barrientos proves that Cm nK1 (that is, an m-cycle with n pendent edges
attached at each vertex) is optimal 2-equitable when m is even; C3 nK1 is complete
2-equitable when n is odd; and that C3 nK1 is complete 3-equitable for all n. He also
shows that Cn K1 is k-equitable for every proper divisor k of the size 2n. Barrientos
and Havia [453] have shown that the n-cube (n > 2) has a complete 2-equitable labeling
and that Km,n has a complete 2-equitable labeling when m or n is even. They conjecture
that every tree of even size has an optimal 2-equitable labeling.

3.10 Hamming-graceful Labelings

Mollard, Payan, and Shixin [2184] introduced a generalization of graceful graphs called
Hamming-graceful. A graph G = (V, E) is called Hamming-graceful if there exists an
injective labeling g from V to the set of binary |E|-tuples such that {d(g(v), g(u))| uv ∈
E} = {1, 2, . . . , |E|} where d is the Hamming distance. Shixin and Yu [2939] have shown
that all graceful graphs are Hamming-graceful; all trees are Hamming-graceful; Cn is
Hamming-graceful if and only if n ≡ 0 or 3 (mod 4); if Kn is Hamming-graceful, then n
has the form k 2 or k 2 + 2; and Kn is Hamming-graceful for n = 2, 3, 4, 6, 9, 11, 16, and 18.
They conjecture that Kn is Hamming-graceful for n of the forms k 2 and k 2 + 2 for k > 5.

the electronic journal of combinatorics (2023), #DS6 115

4 Variations of Harmonious Labelings
4.1 Sequential and Strongly c-harmonious Labelings
Chang, Hsu, and Rogers [674] and Grace [1143], [1144] have investigated subclasses of
harmonious graphs. Chang et al. define an injective labeling f of a graph G with q
vertices to be strongly c-harmonious if the vertex labels are from {0, 1, . . . , q − 1} and
the edge labels induced by f (x) + f (y) for each edge xy are c, . . . , c + q − 1. Strongly
1-harmoinious labelings are more simply called strongly harmonious. Grace called such
a labeling sequential. In the case of a tree, Chang et al. modify the definition to permit
exactly one vertex label to be assigned to two vertices whereas Grace allows the vertex
labels to range from 0 to q with no vertex label being used twice. For graphs other than
trees, we use the term c-sequential labelings interchangeably with strongly c-harmonious
labelings. By taking the edge labels of a sequentially labeled graph with q edges modulo
q, we obviously obtain a harmoniously labeled graph. It is not known if there is a graph
that can be harmoniously labeled but not sequentially labeled. Grace [1144] proved that
caterpillars, caterpillars with a pendent edge, odd cycles with zero or more pendent edges,
trees with α-labelings, wheels W2n+1 , and Pn2 are sequential. Liu and Zhang [1963] finished
off the crowns C2n K1 . (The case C2n+1 K1 was a special case of Grace’s results. Liu
[1976] proved crowns are harmonious.)
Bača and Youssef [390] investigated the existence of harmonious labelings for the
corona graphs of a cycle and a graph G. They proved that if G+K1 is strongly harmonious
with the 0 label on the vertex of K1 , then Cn G is harmonious for all odd n > 3. By
combining this with existing results they have as corollaries that the following graphs are
harmonious: Cn Cm for odd n > 3 and m 6≡ 2 (mod 3); Cn Ks,t for odd n > 3; and
Cn K1,s,t for odd n > 3.
Bu [618] also proved that crowns are sequential as are all even cycles with m pendent
edges attached at each vertex. Figueroa-Centeno, Ichishima, and Muntaner-Batle [934]
proved that all cycles with m pendent edges attached at each vertex are sequential. Wu
[3488] has shown that caterpillars with m pendent edges attached at each vertex are
sequential. exactly one path of fixed length to each vertex of some path is sequential.
Singh has proved the following: Cn K2 is sequential for all odd n > 1 [2972]; Cn P3
is sequential for all odd n [2973]; K2 Cn (each vertex of the cycle is joined by edges to
the end points of a copy of K2 ) is sequential for all odd n [2973]; helms Hn are sequential
when n is even [2973]; and K1,n + K2 , K1,n + K 2 , and ladders are sequential [2975].
Santhosh [2710] has shown that Cn P4 is sequential for all odd n > 3. Both Grace
[1143] and Reid (see [1006]) have found sequential labelings for the books B2n . Jungreis
and Reid [1561] have shown the following graphs are sequential: Pm × Pn (m, n) 6= (2, 2);
C4m × Pn (m, n) 6= (1, 2); C4m+2 × P2n ; C2m+1 × Pn ; and C4 × C2n (n > 1). The graphs
C4m+2 × C2n+1 and C2m+1 × C2n+1 fail to satisfy a necessary parity condition given by
Graham and Sloane [1147]. The remaining cases of Cm × Pn and Cm × Cn are open.
Gallian, Prout, and Winters [1007] proved that all graphs Cn × P2 with a vertex or an
edge deleted are sequential. Zhu and Liu [3602] give necessary and sufficient conditions

the electronic journal of combinatorics (2023), #DS6 116

for sequential graphs, provide a characterization of non-tree sequential graphs by way of
by vertex closure, and obtain characterizations of sequential trees.
Gnanajothi [1104] [pp. 68-78] has shown the following graphs are sequential: K1,m,n ;
mCn , the disjoint union of m copies of Cn if and only if m and n are odd; books with
triangular pages or pentagonal pages; and books of the form B4n+1 , thereby answering
a question and proving a conjecture of Gallian and Jungreis [1006]. Sun [3127] has also
proved that Bn is sequential if and only if n 6≡ 3 (mod 4). Ichishima and Oshima [1313]
pose determining whether or not mKs,t is sequential as a problem.
Yuan and Zhu [3565] have shown that mCn is sequential when m and n are odd.
Although Graham and Sloane [1147] proved that the Möbius ladder M3 is not harmonious,
Gallian [1001] established that all other Möbius ladders are sequential (see §2.3 for the
definition of Möbius ladder). Chung, Hsu, and Rogers [674] have shown that Km,n + K1 ,
which includes Sm + K1 , is sequential. Seoud and Youssef [2798] proved that if G is
sequential and has the same number of edges as vertices, then G + Kn is sequential for all
n. Recall that Θ(Cm )n denotes the book with n m-polygonal pages. Lu [2039] proved that
Θ(C2m+1 )2n is 2mn-sequential for all n and m = 1, 2, 3, 4, and Θ(Cm )2 is (m−2)-sequential
if m > 3 and m ≡ 2, 3, 4, 7 (mod 8).
Zhou and Yuan [3599] have shown that for every c-sequential graph G with p vertices
and q edges and any positive integer m the graph (G + Km ) + Kn is also c-sequential
when q − p + 1 6 m 6 q − p + c. Zhou [3598] has shown that the analogous results
hold for strongly c-harmonious graphs. Zhou and Yuan [3599] have shown that for every
c-sequential graph G with p vertices and q edges and any positive integer m the graph
(G + Km ) + Kn is c-sequential when q − p + 1 6 m 6 q − p + c.
Shee [1881] proved that every graph is a subgraph of a sequential graph. Acharya,
Germina, Princy, and Rao [40] prove that every connected graph can be embedded in
a strongly c-harmonious graph for some c. Miao and Liang [2135] use Cn (d; i, j; Pk ) to
denote a cycle Cn with path Pk joining two nonconsecutive vertices xi and xj of the
cycle, where d is the distance between xi and xj on Cn . They proved that the graph
Cn (d; i, j; Pk ) is strongly c-harmonious when k = 2, 3 and integer n > 6. Lu [2038]
provides three techniques for constructing larger sequential graphs from some smaller
one: an attaching construction, an adjoining construction, and the join of two graphs.
Using these, he obtains various families of sequential or strongly c-indexable graphs.
For 1 6 s 6 n3 , let Cn (i : i1 , i2 , . . . , is ) denote an n-cycle with consecutive vertices
x1 , x2 , . . . , xn to which the s chords xi xi1 , xi xi2 , . . . , xi xis have been added. Liang [1938]
proved a variety of graphs of the form Cn (i : i1 , i2 , . . . , is ) are strongly c-harmonious.
Youssef [3547] observed that a strongly c-harmonious graph with q edges is c-cordial
for all c > q and a strongly k-indexable graph is k-cordial for every k. The converse of
this latter result is not true.
In [1310] Ichishima and Oshima show that the hypercube Qn (n > 2) is sequential if
and only if n > 4. They also introduce a special kind of sequential labeling of a graph
G with size 2t + s by defining a sequential labeling f to be a partitional labeling if G is
bipartite with partite sets X and Y of the same cardinality s such that f (x) 6 t + s − 1
for all x ∈ X and f (y) > t − s for all y ∈ Y , and there is a positive integer m such that

the electronic journal of combinatorics (2023), #DS6 117

the induced edge labels are partitioned into three sets [m, m + t − 1], [m + t, m + t + s − 1],
and [m + t + s, m + 2t + s − 1] with the properties that there is an involution π, which
is an automorphism of G such that π exchanges X and Y , xπ(x) ∈ E(G) for all x ∈ X,
and {f (x) + f (π(x))| x ∈ X} = [m + t, m + t + s − 1]. They prove if G has a partitional
labeling, then G × Qn has a partitional labeling for every nonnegative integer n. Using
this together with existing results and the fact that every graph that has a partitional
labeling is sequential, harmonious, and felicitous (see §4.5) they show that the following
graphs are partitional, sequential, harmonious, and felicitous: for n > 4, hypercubes Qn ;
generalized books S2m × Qn ; and generalized ladders P2m+1 × Qn .
In [1311] Ichishma and Oshima proved the following: if G is a partitional graph, then
G × K2 is partitional, sequential, harmonious and felicitous; if G is a connected bipartite
graph with partite sets of distinct odd order such that in each partite set each vertex has
the same degree, then G × K2 is not partitional; for every positive integer m, the book
Bm is partitional if and only if m is even; the graph B2m × Qn is partitional if and only if
(m, n) 6= (1, 1); the graph Km,2 × Qn is partitional if and only if (m, n) 6= (2, 1); for every
positive integer n, the graph Km,3 × Qn is partitional when m = 4, 8, 12, or 16. As open
problems they ask which m and n is Km,n × K2 partitional and for which l, m and n is
Kl,m × Qn partitional?
Ichishma and Oshima [1311] also investigated the relationship between partitional
graphs and strongly graceful graphs (see §3.1 for the definition) and partitional graphs
and strongly felicitous graphs (see §4.5) for the definition). They proved the following. If
G is a partitional graph, then G × K2 is partitional, sequential, harmonious and felicitous.
Assume that G is a partitional graph of size 2t + s with partite sets X and Y of the same
cardinality s, and let f be a partitional labeling of G such that λ1 = max{f (x) : x ∈ X}
and λ2 = max{f (y) : y ∈ Y }. If λ1 + 1 = m + 2t + s − λ2 , where m = min{f (x) + f (y) :
xy ∈ E(G)} = min{f (y) : y ∈ Y }, then G has a strong α-valuation. Assume that G
is a partitional graph of size 2t + s with partite sets X and Y of the same cardinality
s, and let f be a partitional labeling of G such that λ1 = max{f (x) : x ∈ X} and
λ2 = max{f (y) : y ∈ Y }. If λ1 + 1 = m + 2t + s − λ2 , where m = min{f (x) + f (y) :
xy ∈ E(G)} = min{f (y) : y ∈ Y }, then G is strongly felicitous. Assume that G is
a partitional graph of size 2t + s with partite sets X and Y of the same cardinality s,
and let f be a partitional labeling of G such that µ1 = f (x1 ) = min{f (x) : x ∈ X}
and µ2 = f (y1 ) = min{f (y) : y ∈ Y }. If t + s = m + 1 and µ1 + µ2 = m, where
m = min{f (x) + f (y) : xy ∈ E(G)} and x1 y1 ∈ E(G), then G has a strong α-valuation
and strongly felicitous labeling.
Vaidya and Lekha [3292] provedJ the following graphs are odd sequential: Pn , Cn
for n ≡ 0 (mod 4), crowns Cn K1 for even n, the graph obtained by duplication of
arbitrary vertex in even cycles, path unions of stars, arbitrary super subdivisions in Pn ,
and shadows of stars. They also introduced the concept of a bi-odd sequential labeling
of a graph G as one for which both G and its line graph L(G) admit odd sequential
labeling. They proved Pn and Cn for n ≡ ( mod 4) are bi-odd sequential graphs and trees
are bi-odd sequential if and only if they are paths. They also prove that P4 is the only
graph with the property that it and its complement are odd sequential.

the electronic journal of combinatorics (2023), #DS6 118

 Arockiaraj, Mahalakshmi, and Namasivayam [230] proved that the subdivision graphs
of the following graphs have odd sequential labelings (they call them odd sum labelings):
triangular snakes; quadrilateral snakes; slanting ladders SLn (n > 1) (the graphs obtained
from two paths u1 u2 . . . un and v1 v2 . . . vn by joining each ui with vi+1 ); Cp K1 , Hn K1 ,
Cm @Cn (the graph obtained by attaching paths Pn to Cm by identifying the endpoints of
the paths with each successive pairs of vertices of Cm ); Pm × Pn ; and graphs obtained by
the duplication of a vertex of a path and the duplication of a vertex of a cycle. Arockiaraj,
Mahalakshmi, and Namasivayam [232] investigate the odd sum labeling behavior of paths,
combs, cycles, crowns, and ladders under duplication of an edge. In [233] they investigated
the odd sum property of shadow graphs, edge duplication graphs and vertex identification
graphs. In [1132] Gopi proved the following graphs are odd sum graphs: graphs Hn
obtained from two copies of Pn (n > 3) with vertices v1 , v2 , . . . , vn and u1 , u2 , . . . , un
by joining v(n+1)/2 and u(n+1)/2 if n is odd and vn/2 and u(n+2)/2 if n is even; graphs
obtained from Hn by attaching a fixed number of pendent edges at each vertex, graphs
obtained from Pn (n > 4) by attaching a two pendent edges at each interior vertex; and
graphs obtained from Pm (m > 4) by identifying an endpoint of the star Sn (n > 2)
with each vertex of Pm . In [1136] Gopi and Irudaya Mary proved that slanting ladders,
shadow graphs of stars and bistars and mirror graphs and duplicate vertex graphs of paths
with at least four verticies are odd sum graphs. In [1131] Gopi proved that alternative
quadrilateral snakes A(D(Qn )) (n > 4) are odd sum graphs.
Arockiaraj and Mahalakshmi [229] proved the following graphs have odd sequential
labelings (odd sum labelings): Pn (n > 1), Cn if and only if n ≡ 0 (mod 4); C2n
K1 ; Pn × P2 (n > 1); Pm K1 if m is even or m is odd and n = 1 or 2; the balloon
graph Pm (Cn ) obtained by identifying an end point of Pm with a vertex of Cn if either
n ≡ 0 (mod 4) or n ≡ 2 (mod 4) and m 6≡ 1 (mod 3); quadrilateral snakes Qn ; Pm Cn
if m > 1 and n ≡ 0 (mod 4); Pm Q3 ; bistars; C2n × P2 ; the trees Tpn obtained from n
copies of Tp by joining an edge uu0 between every pair of consecutive paths where u is a
vertex in ith copy of the path and u0 is the corresponding vertex in the (i + 1)th copy of
the path; Hn -graphs obtained by starting with two copies of Pn with vertices v1 , v2 , . . . , vn
and u1 , u2 , . . . , un and joining the vertices v(n+1)/2 and u(n+1)/2 if n is odd and the vertices
vn/2+1 and un/2 if n; and Hn mK1 .
Arockiaraj and Mahalakshmi [231] proved the splitting graphs of following graphs have
odd sequential labelings (odd sum labelings): Pn ; Cn if and only if n ≡ 0 (mod 4); Pn
K1 ; C2n K1 ; K1,n if and only if n 6 2; Pn × P2 (n > 1); slanting ladders SLn (n > 1);
the quadrilateral snake Qn ; and Hn -graphs.
Among the strongly 1-harmonious (also called strongly harmonious) graphs are: fans
Fn with n > 2 [674]; wheels Wn with n 6≡ 2 (mod 3) [674]; Km,n + K1 [674]; French
(t) (n)
windmills K4 [1263], [1634]; the friendship graphs C3 if and only if n ≡ 0 or 1 (mod 4)
(t)
[1263], [1634], [3509]; C4k [3128]; and helms [2555].
Seoud, Diab, and Elsakhawi [2769] have shown that the following graphs are strongly
harmonious: Km,n with an edge joining two vertices in the same partite set; K1,m,n ; the
composition Pn [P2 ] (see §2.3 for the definition); B(3, 2, m) and B(4, 3, m) for all m (see
§2.4 for the notation); Pn2 (n > 3); and Pn3 (n > 3). Seoud et al. [2769] have also

the electronic journal of combinatorics (2023), #DS6 119

proved: B2n is strongly 2n-harmonious; Pn is strongly bn/2c-harmonious; ladders L2k+1
are strongly (k + 1)-harmonious; and that if G is strongly c-harmonious and has an equal
number of vertices and edges, then G + Kn is also strongly c-harmonious.
Bača and Youssef [390] investigated the existence of harmonious labelings for the
corona graphs of a cycle and a graph G, and for the corona graph of K2 and a tree. They
prove: if join of a graph G of order p and K1 , G + K1 , is strongly harmonious with the 0
label on the vertex of K1 , then the corona of Cn with G, Cn G, is harmonious for all
odd n > 3; if T is a strongly c-harmonious tree of odd size q and c = q+1 2
then the corona
of K2 with T , K2 T , is also strongly c-harmonious; if a unicyclic graph G of odd size
q is a strongly c-harmonious and c = q−1 2
then the corona of K2 with G, K2 G, is also
strongly c-harmonious.
Seenivasan and Lourdusamy [2734] define an absolutely harmonious labeling f as an
injection from the vertex set of a graph G with q edges to the set {0, 1, 2, . . . , q − 1}, if
when each edge uv is assigned f (u) + f (v), the resulting edge labels can be arranged as
a0 , a1 , a2 , . . . , aq−1 where ai = q − i or q + i for 0 6 i 6 q − 1. When G is a tree one of the
vertex labels may be assigned to exactly two vertices. A graph that admits absolutely
harmonious labeling is called an absolutely harmonious graph. Observe that a strongly
harmonious graph is an absolutely harmonious graph. They prove the following graphs
are absolutely harmnious: Pn (n > 3), Pn Km , Cn Km , the banana tree obtained
by joining a vertex of degree 1 of each of any number of copies of K1,n to an isolated
vertex, ladders, triangular snakes, quadrilateral snakes, mK4 , Kn if and only if n = 3
or 4. They also prove that if G is an absolutely harmonious graph, then there exists
a partition (V1 , V2 ) of the vertex set V (G), such that the number of edges connecting
the vertices of V1 to the vertices of V2 is exactly dq/2e snd that if every vertex of an
absolutely harmonious graph with q edges is even then q ≡ 1 or 2. As corollaries of the
latter condition, they have that Cn when n ≡ 1 or 2 (mod 4), Cm × Cn when m and n
are odd, and mK3 , m > 2 are not absolutely harmonious.
Sethuraman and Selvaraju [2839] have proved that the graph obtained by joining two
complete bipartite graphs at one edge is graceful and strongly harmonious. They ask
whether these results extend to any number of complete bipartite graphs.
For a graph G(V, E) Gayathri and Hemalatha [1060] define an even sequential harmo-
nious labeling f of G as an injection from V to {0, 1, 2, . . . , 2|E|} with the property that
the induced mapping f + from E to {2, 4, 6, . . . , 2|E|} defined by f + (uv) = f (u) + f (v)
when f (u) + f (v) is even, and f + (uv) = f (u) + f (v) + 1 when f (u) + f (v) is odd, is an in-
jection. They prove the following have even sequential harmonious labelings (all cases are
the nontrivial ones): Pn , Pn+ , Cn ( n > 3), triangular snakes, quadrilateral snakes, Möbius
ladders, Pm × Pn (m > 2, n > 2), Km,n ; crowns Cm K1 , graphs obtained by joining the
centers of two copies of K1,n by a path; banana trees (see §2.1), Pn2 , closed helms (see
§2.2), C3 nK1 (n > 2); D K1,n where D is a dragon (see §2.2); hK1,n : mi (m, n > 2)
(see §4.5); the wreath product Pn ∗ K2 (n > 2) (see §4.5); combs Pn K1 ; the one-point
union of the end point of a path to a vertex of a cycle (tadpole); the one-point union
of the end point of a tadpole and the center of a star; the graphs P Cn obtained from
Cn = v0 , v1 , v2 , . . . , vn−1 by adding the cords v1 vn−1 , v2 vn−2 , . . . , v(n−2)/2 , v(n+2)/2 when n

the electronic journal of combinatorics (2023), #DS6 120

is even and v1 vn−1 , v2 vn−2 , . . . , v(n−3)/2 , v(n+3)/2 when n is odd (that is, cycles with a full
set of cords); Pm nK1 ; the one-point union of a vertex of a cycle and the center of a
star; graphs obtained by joining the centers of two stars with an edge; graphs obtained by
joining two disjoint cycles with an edge (dumbbells); graphs consisting of two even cycles
of the same order sharing a common vertex with an arbitrary number of pendent edges
attached at the common vertex (butterflies).
In [1296] Ichishima, Muntaner-Batle, and Oshima define the harmonious number,
η(G), of a graph G with q edges as the smallest positive integer n for which there exists
an injective function f from V (G) to Zn+1 such that each uv of G is labeled f (u) + f (v)
(mod q) and the resulting edge labels are distinct, or +∞ if there exists no such integer
n. If such functions exist, they are called harmonious numberings. The strong harmo-
nious number, ηs (G), of a graph G is defined to be either the smallest positive integer
n such that n = η(G) with the additional property that there exists an integer λ such
that min{f (u), f (v)} 6 λ 6 max{f (u), f (v)} for each edge in G or +∞ if there ex-
ists no such integer n. They provide a necessary condition for a graph to have a finite
harmonious number and sufficient conditions for a graph to have an infinite (strong) har-
monious number. In addition, they examine the relations between harmonious numbers,
gamma-numbers, alpha-numbers, and super edge magic deficiencies (see §5.2). They de-
termine the formulas for the (strong) harmonious numbers of some 2-regular graphs and
all complete bipartite graphs.
In her PhD thesis [2235] (see also [1061]) Muthuramakrishnan defined a labeling f
of a graph G(V, E) to be k-even sequential harmonious if f is an injection from V to
{k − 1, k, k + 1, . . . , k + 2q − 1} such that the induced mapping f + from E to {2k, 2k +
2, 2k + 4, . . . , 2k + 2q − 2} defined by f + (uv) = f (u) + f (v) if f (u) + f (v) is even and
f + (uv) = f (u) + f (v) + 1 if f (u) + f (v) is odd are distinct. A graph G is called a k-even
sequential harmonious graph if it admits a k-even sequential harmonious labeling. Among
the numerous graphs that she proved to be k-even sequential harmonious are: paths,
cycles, Km,n , Pn2 (n > 3), crowns Cm K1 , Cm @Pn (the graph obtained by identifying
an endpoint of Pn with one vertex of Cm ), double triangular snakes, double quadrilateral
snakes, bistars, grids Pm ×Pn (m, n > 2), Pn [P2 ], C3 nK1 (n > 2), flags F lm (the cycle Cm
with one pendent edge), dumbbell graphs (two disjoint cycles joined by an edge) butterfly
graphs Bn (two even cycles of the same order sharing a common vertex with an arbitrary
number of pendent edges attached at the common vertex), K2 + nK1 , Kn + 2K2 , banana
trees, sparklers Pm @K1,n (m, n > 2), (graphs obtained by identifying an endpoint of Pm
with the center of a star), twigs (graphs obtained from Pn (n > 3) by attaching exactly
two pendent edges at each internal vertex of Pn ), festoon graphs Pm nK1 (m > 2), the
graphs Tm,n,t obtained from a path Pt by appending m edges at one endpoint of Pt and
n edges at the other endpoint of Pt , Ln K1 (Ln is the ladder Pn × P2 ), shadow graphs
of paths, stars and bistars, and split graphs of paths and stars. Muthuramakrishnan also
defines k-odd sequential harmonious labeling of graphs in the natural way and obtains a
handful of results.
In [521] Beatress and Sarasija introduced a new harmonious-like labeling as follows.
A graph G(V, E) with n vertices and m edges is said to be a square harmonius graph if

the electronic journal of combinatorics (2023), #DS6 121

there exists an injection f from V (G) to {1, 2, . . . , m2 + 1} such that the induced mapping
f ∗ from E(G) to {1, 4, 9, . . . , m2 } defined by f ∗ (uv) = (f (u) + f (v)) mod(m2 + 1) is a
bijection. Such a function f is called a square harmonious labeling of G. They prove
that Pn (n > 3), K1,n (n > 2), bistars, combs, Pn pK1 (n > 2), and C3 @pK1 (p > 2)
are square harmonious graphs. Lawas and Lim [1822] proved that stars have a square
harmonious labelings.
In [475] Barrientos and Youssef generalize the concepts of harmonious and (k, d)- [475] new
arithmetic graphs by relaxing the injectivity constraint of the corresponding labelings.
They call these labelings semi harmonious and semi (k, d)-arithmetic. They showed
the existence of a semi harmonious labeling for several types of cycle-related graphs and
characterized the cycles that admit semi harmonius labelings. They proved that if G is
semi (k, d)-arithmetic, then it is also semi (rk, rd)-arithmetic for every r > 1 and that nG
is both semi (k, d)-arithmetic and semi (k + d, d)-arithmetic. They further showed that
any graph whose components are complete bipartite graphs is semi (k, d)-arithmetic for
any ordered pair (k, d) of positive integers, and if Gi is a semi (ki , d)-arithmetic graph of
size qi for each i = 1, 2, then G1 ∪ G2 is semi (ki , d)-arithmetic.

4.2 (k, d)-arithmetic Labelings

Acharya and Hegde [44] have generalized sequential labelings as follows. Let G be a
graph with q edges and let k and d be positive integers. A labeling f of G is said to be
(k, d)-arithmetic if the vertex labels are distinct nonnegative integers and the edge labels
induced by f (x) + f (y) for each edge xy are k, k + d, k + 2d, . . . , k + (q − 1)d. They
obtained a number of necessary conditions for various kinds of graphs to have a (k, d)-
arithmetic labeling. The case where k = 1 and d = 1 was called additively graceful by
Hegde [1209]. Hegde [1209] showed: Kn is additively graceful if and only if n = 2, 3, or
4; every additively graceful graph except K2 or K1,2 contains a triangle; and a unicyclic
graph is additively graceful if and only if it is a 3-cycle or a 3-cycle with a single pendent
edge attached. Jinnah and Singh [1549] noted that Pn2 is additively graceful. Hegde
[1210] proved that if G is strongly k-indexable, then G and G + Kn are (kd, d)-arithmetic.
Acharya and Hegde [46] proved that Kn is (k, d)-arithmetic if and only if n > 5 (see also
[624]). They also proved that a graph with an α-labeling is a (k, d)-arithmetic for all k
and d. Bu and Shi [624] proved that Km,n is (k, d)-arithmetic when k is not of the form
id for 1 6 i 6 n − 1. For all d > 1 and all r > 0, Acharya and Hegde [44] showed the
following: Km,n,1 is (d + 2r, d)-arithmetic; C4t+1 is (2dt + 2r, d)-arithmetic; C4t+2 is not
(k, d)-arithmetic for any values of k and d; C4t+3 is ((2t + 1)d + 2r, d)-arithmetic; W4t+2
is (2dt + 2r, d)-arithmetic; and W4t is ((2t + 1)d + 2r, d)-arithmetic. They conjecture that
C4t+1 is (2dt + 2r, d)-arithmetic for some r and that C4t+3 is (2dt + d + 2r, d)-arithmetic
for some r. Hegde and Shetty [1229] proved the following: the generalized web W (t, n)
(see §2.2 for the definition) is ((n − 1)d/2, d)-arithmetic and ((3n − 1)d/2, d)-arithmetic
for odd n; the join of the generalized web W (t, n) with the center removed and Kp where
n is odd is ((n − 1)d/2, d)-arithmetic; every Tp -tree (see §3.2 for the definition) with
q edges and every tree obtained by subdividing every edge of a Tp -tree exactly once is
(k + (q − 1)d, d)-arithmetic for all k and d. Lu, Pan, and Li [2041] proved that K1,m ∪ Kp,q

the electronic journal of combinatorics (2023), #DS6 122

is (k, d)-arithmetic when k > (q − 1)d + 1 and d > 1.
Yu [3560] proved that a necessary condition for C4t+1 to be (k, d)-arithmetic is that
k = 2dt + r for some r > 0 and a necessary condition for C4t+3 to be (k, d)-arithmetic is
that k = (2t + 1)d + 2r for some r > 0. These conditions were conjectured by Acharya
and Hegde [44]. Singh proved that the graph obtained by subdividing every edge of the
ladder Ln is (5, 2)-arithmetic [2971] and that the ladder Ln is (n, 1)-arithmetic [2974].
He also proves that Pm × Cn is ((n − 1)/2, 1)-arithmetic when n is odd [2974]. Acharya,
Germina, and Anandavally [38] proved that the subdivision graph of the ladder Ln is
(k, d)-arithmetic if either d does not divide k or k = rd for some r > 2n and that Pm × Pn
and the subdivision graph of the ladder Ln are (k, k)-arithmetic if and only if k is at least
3. Lu, Pan, and Li [2041] proved that Sm ∪ Kp,q is (k, d)-arithmetic when k > (q − 1)d + 1
and d > 1.
A graph is called arithmetic if it is (k, d)-arithmetic for some k and d. Singh and
Vilfred [2979] showed that various classes of trees are arithmetic. Singh [2974] has proved
that the union of an arithmetic graph and an arithmetic bipartite graph is arithmetic. He
conjectures that the union of arithmetic graphs is arithmetic. He provides an example to
show that the converse is not true.
Germina and Anandavally [1072] investigated embedding of graphs in arithmetic
graphs. They proved: every graph can be embedded as an induced subgraph of an
arithmetic graph; every bipartite graph can be embedded in a (k, d)-arithmetic graph for
all k and d such that d does not divide k; and any graph containing an odd cycle cannot
be embedded as an induced subgraph of a connected (k, d)-arithmetic with k < d.
In [3531] Yao, Liu, and Yao give necessary and sufficient conditions for a tree to
have the following mutually equivalent labelings: set-ordered odd-graceful, (k, d)-graceful,
super edge-magic total, odd-elegant (see §4.4), harmonious, (k, d)-arithmetic, and edge-
antimagic (see §6.1).

4.3 (k, d)-indexable Labelings

Acharya and Hegde [44] call a graph with p vertices and q edges (k, d)-indexable if there is
an injective function from V to {0, 1, 2, . . . , p − 1} such that the set of edge labels induced
by adding the vertex labels is a subset of {k, k+d, k+2d, . . . , k+q(d−1)}. When the set of
edges is {k, k+d, k+2d, . . . , k+q(d−1)} the graph is said to be strongly (k, d)-indexable. A
(k, 1)-graph is more simply called k-indexable and strongly 1-indexable graphs are simply
called strongly indexable. Notice that strongly indexable graphs are a stronger form of
sequential graphs and for trees and unicyclic graphs the notions of sequential labelings
and strongly k-indexable labelings coincide. Hegde and Shetty [1234] have shown that
the notions of (1, 1)-strongly indexable graphs and super edge-magic total labelings (see
§5.2) are equivalent.
Zhou [3598] has shown that for every k-indexable graph G with p vertices and q edges
the graph (G + Kq−p+k ) + K1 is strongly k-indexable. Acharaya and Hegde prove that the
only nontrivial regular graphs that are strongly indexable are K2 , K3 , and K2 × K3 , and
that every strongly indexable graph has exactly one nontrivial component that is either
a star or has a triangle. Acharya and Hegde [44] call a graph with p vertices indexable

the electronic journal of combinatorics (2023), #DS6 123

if there is an injective labeling of the vertices with labels from {0, 1, 2, . . . , p − 1} such
that the edge labels induced by addition of the vertex labels are distinct. They conjecture
that all unicyclic graphs are indexable. This conjecture was proved by Arumugam and
Germina [242] who also proved that all trees are indexable. Bu and Shi [625] also proved
that all trees are indexable and that all unicyclic graphs with the cycle C3 are indexable.
Hegde [1210] has shown the following: every graph can be embedded as an induced
subgraph of an indexable graph; if a connected graph with p vertices and q edges (q > 2)
is (k, d)-indexable, then d 6 2; Pm × Pn is indexable for all m and n; if G is a connected
(1, 2)-indexable graph, then G is a tree; the minimum degree of any (k, 1)-indexable graph
with at least two vertices is at most 3; a caterpillar with partite sets of orders a and b
is strongly (1, 2)-indexable if and only if |a − b| 6 1; in a connected strongly k-indexable
graph with p vertices and q edges, k 6 p − 1; and if a graph with p vertices and q edges is
(k, d)-indexable, then q 6 (2p − 3 − k + d)/d. As a corollary of the latter, it follows that
Kn (n > 4) and wheels are not (k, d)-indexable.
Lee and Lee [1825] provide a way to construct a (k, d)-strongly indexable graph from
two given (k, d)-strongly indexable graphs. Lee and Lo [1856] show that every given (1,2)-
strongly indexable spider can extend to an (1,2)-strongly indexable spider with arbitrarily
many legs.
Seoud, Abd El Hamid, and Abo Shady [2757] proved the following graphs are in-
dexable: Pm × Pn (m, n > 2); the graphs obtained from Pn + K1 by inserting one vertex
between every two consecutive vertices of Pn ; the one-point union of any number of copies
of K2,n ; and the graphs obtained by identifying a vertex of a cycle with the center of a star.
They showed Pn is strongly dn/2e-indexable; odd cycles Cn are strongly dn/2e-indexable;
K(m,n) (m, n > 2) is indexable if and only if m or n is at most 2. For a simple indexable
graph G(V, E) they proved |E| 6 2|V | − 3. Also, they determine all indexable graphs of
order at most 6.
Hegde and Shetty [1233] also prove that if G is strongly k-indexable Eulerian graph
with q edges then q ≡ 0, 3 (mod 4) if k is even and q ≡ 0, 1 (mod 4) if k is odd. They
further showed how strongly k-indexable graphs can be used to construct polygons of
equal internal angles with sides of different lengths.
Germina [1069] has proved the following: fans Pn + K1 are strongly indexable if and
only if n = 1, 2, 3, 4, 5, 6; Pn + K2 is strongly indexable if and only if n 6 2; the only
strongly indexable complete m-partite graphs are K1,n and K1,1,n ; ladders Pn ×P2 are d n2 e-
strongly indexable, if n is odd; Kn ×Pk is a strongly indexable if and only if n = 3; Cm ×Pn
is 2-strongly indexable if m is odd and n > 2; K1,n +Ki is not strongly indexable for n > 2;
for Gi ∼= K1,n , 1 6 i 6 n, the sequential join G ∼
= (G1 +G2 )∪(G2 +G3 )∪· · ·∪(Gn−1 +Gn )
is strongly indexable if and only if, either i = n = 1 or i = 2 and n = 1 or i = 1, n = 3;
P1 ∪Pn is strongly indexable if and only if n 6 3; P2 ∪Pn is not strongly indexable; P2 ∪Pn
is d n+3
2
e-strongly indexable; mCn is k-strongly indexable if and only if m and n are odd;
K1,n ∪ K1,n+1 is strongly indexable; and mK1,n is d 3m−1 2
e-strongly indexable when m is
odd.
Acharya and Germina [33] proved that every graph can be embedded in a strongly
indexable graph and gave an algorithmic characterization of strongly indexable unicyclic

the electronic journal of combinatorics (2023), #DS6 124

graphs. In [35] they provide necessary conditions for an Eulerian graph to be strongly
k-indexable and investigate strongly indexable (p, q)-graphs for which q = 2p − 3.
Hegde and Shetty [1229] proved that for n odd the generalized web graph W (t, n) with
the center removed is strongly (n − 1)/2-indexable. Hegde and Shetty [1234] define a level
joined planar grid as follows. Let u be a vertex of Pm × Pn of degree 2. For every pair
of distinct vertices v and w that do not have degree 4, introduce an edge between v and
w provided that the distance from u to v equals the distance from u to w. They prove
that every level joined planar grid is strongly indexable. For any sequence of positive
integers (a1 , a2 , . . . , an ) Lee and Lee [1824] show how to associate a strongly indexable
(1, 1)-graph. As a corollary, they obtain the aforementioned result Hegde and Shetty on
level joined planar grids.
Section 5.2 of this survey includes a discussion of a labeling method called super edge-
magic. In 2002 Hegde and Shetty [1234] showed that a graph has a strongly k-indexable
labeling if and only if it has a super edge-magic labeling.

4.4 Elegant Labelings

In 1981 Chang, Hsu, and Rogers [674] defined an elegant labeling f of a graph G with
q edges as an injective function from the vertices of G to the set {0, 1, . . . , q} such that
when each edge xy is assigned the label f (x) + f (y) (mod (q + 1)) the resulting edge labels
are distinct and nonzero. An injective labeling f of a graph G with q vertices is called
strongly k-elegant if the vertex labels are from {0, 1, . . . , q} and the edge labels induced
by f (x) + f (y) (mod (q + 1)) for each edge xy are k, . . . , k + q − 1. Note that in contrast
to the definition of a harmonious labeling, for an elegant labeling it is not necessary to
make an exception for trees.
Whereas the cycle Cn is harmonious if and only if n is odd, Chang et al. [674] proved
that Cn is elegant when n ≡ 0 or 3 (mod 4) and not elegant when n ≡ 1 (mod 4). Chang
et al. further showed that all fans are elegant and the paths Pn are elegant for n 6≡ 0 (mod
4). Cahit [639] then showed that P4 is the only path that is not elegant. Balakrishnan,
Selvam, and Yegnanarayanan [416] have proved numerous graphs are elegant. Among
them are Km,n and the mth-subdivision graph of K1,2n for all m. They prove that the
bistar Bn,n (K2 with n pendent edges at each endpoint) is elegant if and only if n is
even. They also prove that every simple graph is a subgraph of an elegant graph and
that several families of graphs are not elegant. Deb and Limaye [792] have shown that
triangular snakes (see §2.2 for the definition) are elegant if and only if the number of
triangles is not equal to 3 (mod 4). In the case where the number of triangles is 3
(mod 4) they show the triangular snakes satisfy a weaker condition they call semi-elegant
whereby the edge label 0 is permitted. In [793] Deb and Limaye define a graph G with
q edges to be near-elegant if there is an injective function f from the vertices of G to
the set {0, 1, . . . , q} such that when each edge xy is assigned the label f (x) + f (y) (mod
(q + 1)) the resulting edge labels are distinct and not equal to q. Thus, in a near-elegant
labeling, instead of 0 being the missing value in the edge labels, q is the missing value.
Deb and Limaye show that triangular snakes where the number of triangles is 3 (mod
4) are near-elegant. For any positive integers α 6 β 6 γ where β is at least 2, the

the electronic journal of combinatorics (2023), #DS6 125

theta graph θα,β,γ consists of three edge disjoint paths of lengths α, β, and γ having the
same end points. Deb and Limaye [793] provide elegant and near-elegant labelings for
some theta graphs where α = 1, 2, or 3. Seoud and Elsakhawi [2771] have proved that
the following graphs are elegant: K1,m,n ; K1,1,m,n ; K2 + Km ; K3 + Km ; and Km,n with
an edge joining two vertices of the same partite set. Elumalai and Sethuraman [881]
proved P2 n , Pm2 + Kn , Sm + Sn , Sm + Km , C3 × Pm , and even cycles C2n with vertices
a0 , a1 , . . . , a2n−1 , a0 and 2n − 3 chords a0 a2 , a0 a3 , . . . , a0 a2n−2 (n > 2) are elegant. Zhou
[3598] has shown that for every strongly k-elegant graph G with p vertices and q edges
and any positive integer m the graph (G + Km ) + Kn is also strongly k-elegant when
q − p + 1 6 m 6 q − p + k.
If f is a strongly k-elegant labeling of a bipartite graph G with partite sets V1 and V2
and max f (u) < min f (v) for all u in V1 and v in V2 , f is said to be a set-ordered strongly
k-elegant labeling of G. Su, Wang, and Yao [3058] proved that if a connected (p, q)-graph
admits a strongly k-elegant labeling, then q 6 2p−3 and if a graph is a set-ordered strongly
k-elegant, then q = p − 1. They constructed several classes of large-scale trees that have
strongly k-elegant labelings through graph operations that connect edges between two
vertices or identify two vertices to form a new graph and proved that caterpillars with
p vertices admits a set-ordered strongly k-elegant labelings. They further showed that a
graph admits a strongly k-elegant labeling if and only if it has a super edge-magic total
labeling (SEMT)–see Section 5.2.
Sethuraman and Elumalai [2814] proved that every graph is a vertex induced subgraph
of a elegant graph and present an algorithm that permits one to start with any non-trivial
connected graph and successively form supersubdivisions (see §2.7) that have a strong form
of elegant labeling. Acharya, Germina, Princy, and Rao [40] prove that every (p, q)-graph
G can be embedded in a connected elegant graph H. The construction is done in such a
way that if G is planar and elegant (harmonious), then so is H.
In [2813] Sethuraman and Elumalai define a graph H to be a K1,m -star extension of a
graph G with p vertices and q edges at a vertex v of G where m > p − 1 − deg(v) if H is
obtained from G by merging the center of the star K1,m with v and merging p − 1 − deg(v)
pendent vertices of K1,m with the p − 1 − deg(v) nonadjacent vertices of v in G. They
prove that for every graph G with p vertices and q edges and for every vertex v of G and
every m > 2p−1 − 1 − q, there is a K1,m -star extension of G that is both graceful and
harmonious. In the case where m > 2p−1 − q, they show that G has a K1,m -star extension
that is elegant. Sethuraman and Selvaraju [2840] have shown that certain cases of the
union of any number of copies of K4 with one or more edges deleted and one edge in
common are elegant.
In [893] Ephremnath and Elumlai say a graph G is a cycle with a chord Hamiltonian
path if G is obtained from the cycle v0 , v1 , . . . , vn−1 , v0 (n > 6) by adding the chords
v1 vn−1 , vv vn−2 , . . . , vα vβ where α = β = (n − 2)/2 if n is even and α = (n + 3)/2, β =
(n − 1)/2 if n is odd. They proved that Cn (n > 6) with a chord Hamiltonian path is
harmonious and elegant.
Gallian extended the notion of harmoniousness to arbitrary finite Abelian groups as
follows. Let G be a graph with q edges and H a finite Abelian group (under addition) of

the electronic journal of combinatorics (2023), #DS6 126

order q. Define G to be H-harmonious if there is an injection f from the vertices of G to
H such that when each edge xy is assigned the label f (x) + f (y) the resulting edge labels
are distinct. When G is a tree, one label may be used on exactly two vertices. Beals,
Gallian, Headley, and Jungreis [516] have shown that if H is a finite Abelian group of
order n > 1 then Cn is H-harmonious if and only if H has a non-cyclic or trivial Sylow
2-subgroup and H is not of the form Z2 × Z2 × · · · × Z2 . Thus, for example, C12 is not
Z12 -harmonious but is (Z2 × Z2 × Z3 )-harmonious. In [867] Ehard, Glock, and Joos apply
rainbow colorings to graph decompositions and harmonious labeling of graphs.
Analogously, the notion of an elegant graph can be extended to arbitrary finite Abelian
groups. Let G be a graph with q edges and H a finite Abelian group (under addition)
with q + 1 elements. We say G is H-elegant if there is an injection f from the vertices
of G to H such that when each edge xy is assigned the label f (x) + f (y) the resulting
set of edge labels is the non-identity elements of H. Beals et al. [516] proved that if
H is a finite Abelian group of order n with n 6= 1 and n 6= 3, then Cn−1 is H-elegant
using only the non-identity elements of H as vertex labels if and only if H has either a
non-cyclic or trivial Sylow 2-subgroup. This result completed a partial characterization of
elegant cycles given by Chang, Hsu, and Rogers [674] by showing that Cn is elegant when
n ≡ 2 (mod 4). Mollard and Payan [2183] also proved that Cn is elegant when n ≡ 2
(mod 4) and gave another proof that Pn is elegant when n 6= 4. In 2014 Ollis [2320] used
harmonious labelings for Zm given by Beals, Gallian, Headley, and Jungreis in [516] to
construct new Latin squares of odd order.
A function f is said to be an odd-elegant labeling of a graph G with q edges if f is an
injection from the vertices of G to the integers from 0 to 2q − 1 such that the induced
mapping f ∗ (uv) = f (u) + f (v) (mod 2q) from the edges of G to the odd integers between
1 to 2q − 1 is a bijection. Zhou, Yao, and Chen [3600] proved that every lobster is odd-
elegant. In [3422] Wang, Xu, Ma, and Zhang gave a new type of graphical passwords
based on odd-elegant labeled graphs. See also [3423] and [3583].
For a graph G(V, E) and an Abelian group H Valentin [3335] defines a polychrome
labeling of G by H to be a bijection f from V to H such that the edge labels induced
by f (uv) = f (v) + f (u) are distinct. Valentin investigates the existence of polychrome
labelings for paths and cycles for various Abelian groups.

4.5 Felicitous Labelings

Another generalization of harmonious labelings are felicitous labelings. An injective func-
tion f from the vertices of a graph G with q edges to the set {0, 1, . . . , q} is called felicitous
if the edge labels induced by f (x) + f (y) (mod q) for each edge xy are distinct. (Recall
a harmonious labeling only allows the vertex labels 0, 1, . . . , q − 1.) This definition first
appeared in a paper by Lee, Schmeichel, and Shee in [1881] and is attributed to E. Choo.
labeling of the graph. Balakrishnan and Kumar [413] proved the conjecture of Lee, Schme-
ichel, and Shee [1881] that every graph is a subgraph of a felicitous graph by showing the
stronger result that every graph is a subgraph of a sequential graph. Among the graphs
known to be felicitous are: Cn except when n ≡ 2 (mod 4) [1881]; Km,n when m, n > 1
[1881]; P2 ∪ C2n+1 [1881]; P2 ∪ C2n [3199]; P3 ∪ C2n+1 [1881]; Sm ∪ C2n+1 [1881]; Kn if

the electronic journal of combinatorics (2023), #DS6 127

 (n)
and only if n 6 4 [2813]; Pn + Km [2813]; the friendship graph C3 for n odd [1881];
Pn ∪ C3 [2877]; Pn ∪ Cn+3 [3199]; and the one-point union of an odd cycle and a caterpillar
[2877]. Shee [2873] conjectured that Pm ∪ Cn is felicitous when n > 2 and m > 3. Lee,
Schmeichel, and Shee [1881] ask for which m and n is the one-point union of n copies of
Cm felicitous. They showed that in the case where mn is twice an odd integer the graph is
not felicitous. In contrast to the situation for felicitous labelings, we remark that C4k and
Km,n where m, n > 1 are not harmonious and the one-point union of an odd cycle and a
caterpillar is not always harmonious. Lee, Schmeichel, and Shee [1881] conjectured that
the n-cube is felicitous. This conjecture was proved by Figueroa-Centeno and Ichishima
in 2001 [929].
Balakrishnan, Selvam, and Yegnanarayanan [415] obtained numerous results on fe-
licitous labelings. The wreath product, G ∗ H, of graphs G and H has vertex set
V (G) × V (H) and (g1 , h1 ) is adjacent to (g2 , h2 ) whenever g1 g2 ∈ E(G) or g1 = g2
and h1 h2 ∈ E(H). They define Hn,n as the graph with vertex set {u1 , . . . , un ; v1 , . . . , vn }
and edge set {ui vj | 1 6 i 6 j 6 n}. They let hK1,n : mi denote the graph obtained by
taking m disjoint copies of K1,n , and joining a new vertex to the centers of the m copies
of K1,n . They prove the following are felicitous: Hn,n ; Pn ∗ K2 ; hK1,m : mi; hK1,2 : mi
when m 6≡ 0 (mod 3), or m ≡ 3 (mod 6), or m ≡ 6 (mod 12); hK1,2n : mi for all m and
n > 2; hK1,2t+1 : 2n+1i when n > t; Pnk when k = n−1 and n 6≡ 2 (mod 4), or k = 2t and
n > 3 and k < n − 1; the join of a star and Kn ; and graphs obtained by joining two end
vertices or two central vertices of stars with an edge. Yegnanarayanan [3533] conjectures
that the graphs obtained from an even cycle by attaching n new vertices to each vertex
of the cycle is felicitous. This conjecture was verified by Figueroa-Centeno, Ichishima,
and Muntaner-Batle in [934]. In [2836] Sethuraman and Selvaraju [2840] have shown that
certain cases of the union of any number of copies of K4 with 3 edges deleted and one
edge in common are felicitous. Sethuraman and Selvaraju [2836] present an algorithm
that permits one to start with any non-trivial connected graph and successively form
supersubdivisions (see §2.7) that have a felicitous labeling. Krisha and Dulawat [1757]
give algorithms for finding graceful, harmonious, sequential, felicitous, and antimagic (see
§5.7) labelings of paths. A linear cactus Pm (Kn ) is a connected graph in which all the
blocks are isomorphic to a complete graph Kn and block-cutpoint is a path P2m−1 . Go-
mathi [1125] proved the follow graphs are felicitous: Pm (K4 ), splitting graphs of (Bn,n) ,
planar graphs Plm,n , and C2k+1 Sm . Gomathi and Nagarajan [1120] proved the following
graphs are felicitous: a vertex switching of Cn (n > 4), a vertex switching of Cn (n > 4)
with one chord, a vertex duplication of Cn , and the square of the book Bn,n (n > 2).
Ezhilarasi Hilda and Jeba Jesintha [1247] proved that all shell flower graphs are felicitous.
In [3078] Sudhakar, Ranjani, Swathy, and Balaji provided a technique for coding a [3078] new
secret messages by applying an even felicitous labeling for the union of two star graphs
using a GMJ (Graph Message Jumbled) code. They include two illustrations for convert-
ing plain text into cipher text (picture coding) and a method for a felicitous labeling of a
graph. In [3077] Manshath, Hariprabakaran, Veerasamy, and Balaji used a GMJ code to [3077] new
create a confidential message by applying an even felicitous labeling to a bistar.
Figueroa-Centeno, Ichishima, and Muntaner-Batle [935] define a felicitous graph to be

the electronic journal of combinatorics (2023), #DS6 128

strongly felicitous if there exists an integer k so that for every edge uv, min{f (u), f (v)}
6 k < max{f (u), f (v)}. For a graph with p vertices and q edges with q > p − 1 they
show that G is strongly felicitous if and only if G has an α-labeling (see §3.1). They also
show that for graphs G1 and G2 with strongly felicitous labelings f1 and f2 the graph
obtained from G1 and G2 by identifying the vertices u and v such that f1 (u) = 0 = f2 (v)
is strongly felicitous and that the one-point union of two copies of Cm where m > 4 and m
is even is strongly felicitous. As a corollary they have that the one-point union of n copies
of Cm where m is even and at least 4 and n ≡ 2 (mod 4) is felicitous. They conjecture
that the one-point union of n copies of Cm is felicitous if and only if mn ≡ 0, 1, or 3
(mod 4). In [939] Figueroa-Centeno, Ichishima, and Muntaner-Batle prove that 2Cn is
strongly felicitous if and only if n is even and at least 4. They conjecture [939] that mCn
is felicitous if and only if mn 6≡ 2 (mod 4) and that Cm ∪ Cn is felicitous if and only if
m + n 6≡ 2 (mod 4).
As consequences of their results about super edge-magic labelings (see §5.2) Figueroa-
Centeno, Ichishima, Muntaner-Batle, and Oshima [939] have the following corollaries: if
m and n are odd with m > 1 and n > 3, then mCn is felicitous; 3Cn is felicitous if and
only if n 6≡ 2 (mod 4); and C5 ∪ Pn is felicitous for all n.
For a graph G with q edges Shainy and Balaji [2879] call a one-to-one function f
from V (G) to {0, 1, 2, . . . , 2q − 1} a even felicitous if the edge labels generated by (f (r) +
f (s)) mod(2q − 1) for each edge are even and distinct. They proved that stars, bistars,
the union two stars, and the union of three stars are even felicitous graph.
In [2074] Manickam, Marudai, and Kala prove the following graphs are felicitous: the
one-point union of m copies of Cn if mn ≡ 1, 3 mod 4; the one-point union of m copies of
C4 ; mCn if mn ≡ 1, 3 (mod 4); and mC4 . These results partially answer questions raised
by Figueroa-Centeno, Ichishima, Muntaner-Batle, and Oshima in [935] and [939].
Chang, Hsu, and Rogers [674] have given a sequential counterpart to felicitous la-
belings. They call a graph with q edges strongly c-elegant if the vertex labels are from
{0, 1, . . . , q} and the edge labels induced by addition are {c, c+1, . . . , c+q−1}. (A strongly
1-elegant labeling has also been called a consecutive labeling.) Notice that every strongly
c-elegant graph is felicitous and that strongly c-elegant is the same as (c, 1)-arithmetic in
the case where the vertex labels are from {0, 1, . . . , q}. Chang et al. [674] have shown:
Kn is strongly 1-elegant if and only if n = 2, 3, 4; Cn is strongly 1-elegant if and only if
n = 3; and a bipartite graph is strongly 1-elegant if and only if it is a star. Shee [2874]
has proved that Km,n is strongly c-elegant for a particular value of c and obtained several
more specialized results pertaining to graphs formed from complete bipartite graphs.
Seoud and Elsakhawi [2773] have shown: Km,n (m 6 n) with an edge joining two
vertices of the same partite set is strongly c-elegant for c = 1, 3, 5, . . . , 2n + 2; K1,m,n is
strongly c-elegant for c = 1, 3, 5, . . . , 2m when m = n, and for c = 1, 3, 5, . . . , m + n + 1
when m 6= n; K1,1,m,m is strongly c-elegant for c = 1, 3, 5, . . . , 2m + 1; Pn + Km is strongly
bn/2c-elegant; Cm + Kn is strongly c-elegant for odd m and all n for c = (m − 1)/2, (m −
1)/2 + 2, . . . , 2m when (m − 1)/2 is even and for c = (m − 1)/2, (m − 1)/2 + 2, . . . , 2m −
(m − 1)/2 when (m − 1)/2 is odd; ladders L2k+1 (k > 1) are strongly (k + 1)-elegant; and
B(3, 2, m) and B(4, 3, m) (see §2.4 for notation) are strongly 1-elegant and strongly 3-

the electronic journal of combinatorics (2023), #DS6 129

elegant for all m; the composition Pn [P2 ] (see §2.3 for the definition) is strongly c-elegant
for c = 1, 3, 5, . . . , 5n − 6 when n is odd and for c = 1, 3, 5, . . . , 5n − 5 when n is even;
Pn is strongly bn/2c-elegant; Pn2 is strongly c-elegant for c = 1, 3, 5, . . . , q where q is the
number of edges of Pn2 ; and Pn3 (n > 3) is strongly c-elegant for c = 1, 3, 5, . . . , 6k −1 when
n = 4k; c = 1, 3, 5, . . . , 6k + 1 when n = 4k + 1; c = 1, 3, 5, . . . , 6k + 3 when n = 4k + 2;
c = 1, 3, 5, . . . , 6k + 5 when n = 4k + 3.
In [464] Barrientos and Minion study a technique to transform an α-labeling of some
snakes whose cells are squares into a felicitous labeling and the felicitous labeling into a
harmonious labeling. They prove that all quadrilateral snakes, all snake polyominoes, and
all hybrid quadrilateral snakes are both, felicitous (see §4.5) and harmonious. A hybrid
quadrilateral snake is a snake obtained with n copies of C4 where the ith copy of C4 is
attached to the (i + 1)th copy via vertex amalgamation or edge amalgamation. Barrientos
and Minion [464] prove that all hybrid quadrilateral snakes admit α-labelings.

4.6 Odd Harmonious and Even Harmonious Labelings

Liang and Bai [1940] introduced odd harmonious labelings by defining a function f to be
an odd harmonious labeling of a graph G with q edges if f is an injection from the vertices
of G to the integers from 0 to 2q − 1 such that the induced mapping f ∗ (uv) = f (u) + f (v)
from the edges of G to the odd integers between 1 to 2q − 1 is a bijection. A function
f is said to be a strongly odd harmonious labeling of a graph G with q edges if f is an
injection from the vertices of G to the integers from 0 to q such that the induced mapping
f ∗ (uv) = f (u) + f (v) from the edges of G to the odd integers between 1 to 2q − 1 is a
bijection. Liang and Bai [1940] have shown the following: odd harmonious graphs are
√
bipartite; if a (p, q)-graph is odd harmonious, then 2 q 6 p 6 2q − 1; if a (p, q)-graph
with degree sequence (d1 , d2 , . . . , dp ) is odd harmonious, then gcd(d1 , d2 , . . . , dp ) divides
q 2 ; Pn (n > 1) is odd harmonious and strongly odd harmonious; Cn is odd harmonious if
and only if n ≡ 0 mod 4; Kn is odd harmonious if and only if n = 2; Kn1 ,n2 ,...,nk is odd
harmonious if and only if k = 2; Knt is odd harmonious if and only if n = 2; Pm × Pn is
odd harmonious; the tadpole graph obtained by identifying the endpoint of a path with a
vertex of an n-cycle is odd harmonious if n ≡ 0 mod 4; the graph obtained by appending
two or more pendent edges to each vertex of C4n is odd harmonious; the graph obtained
by subdividing every edge of the cycle of a wheel (gear graphs) is odd harmonious; the
graph obtained by appending an edge to each vertex of a strongly odd harmonious graph
is odd harmonious; and caterpillars and lobsters are odd harmonious. They conjecture
that every tree is odd harmonious.
Liang and Bai [1940] also showned that the kC4 -snake graph is an odd harmonious
graph. Abdel-Aal [4] generalize this result by showing that the kCn -snake with string
1, 1, . . . , 1 for n ≡ 0 (mod 4) are odd harmonious. He also showed that the kC4 snake
with m pendent edges is odd harmonius and that all subdivisions of 2m-triangular snakes
are odd harmonious. Alyani, Firmansah, Giyarti, and Sugeng [171] constructed odd [171] new
harmonious labelings for kCn -snakes for n = 4 and n = 8 and gave odd harmonious
labelings for a variation of kCn -snakes. An n hair-kC4 snake is a graph obtained by
attaching n leaves to vertices of degree two in a kC4 -snake graph. Mumtaz and Silaban

the electronic journal of combinatorics (2023), #DS6 130

[2204] proved that n hair-kC4 -snakes are odd harmonious. A k(G) snake graph is a [2204] new
graph obtained from a path on k edges by replacing each edge by a graph isomorphic to
G. Asumpta, Purwanto, and Chandra [262] showed that the snake graph k(G) is odd [262] new
harmonious when G is a gear graph based on W3 and when G is K2,m (m > 2).
Renuka and Palanivelu [2615] proved that the one vertex union of some classes of [2615] new
complete bipartite graphs, the one vertex union of paths, and extended bistars and their
subdivisions are odd harmonious. They further proved that the collection of paths passing
through another path at a selected common mid vertex and each vertex of ladder appended
by an edge are strongly odd harmonious and that the subdivision of the Cartesian product
of two paths is strongly odd harmonious.
Abdel-Aal also proved that a necessary condition for odd harmonious Eulerian graphs
with q edges is q ≡ 0 (mod 4) and that the following graphs are odd harmonious:
Cm × Pn (n > 2, m ≡ 0 (mod 4); C4m C4 ; Sn Km ; two copies of an even n-cycle
sharing a common edge is an odd harmonious graph when n ≡ 0 (mod 4); two copies of
an even n-cycle sharing a common vertex is odd harmonious when n ≡ 0 (mod 4); and
graphs obtained from K2,n (n > 2) by adding r pendent edges to one of the two vertices
of degree n and s pendent edges to the other vertex of degree n. In [2203] Mumtaz, John,
and Silaban proved that the grid-like graph of order 2mn+mm+n and size 4mn obtained
by arranging m-rows connected rows of nC4 -snake graphs is odd harmonious.
Vaidya and Shah [3300] prove that the shadow graphs (see §3.8 for the definition) of
path Pn and star K1n are odd harmonious. They also show that the splitting graphs (see
§2.7 for the definition) ) of path Pn and star K1,n are odd harmonious. In [3301] Vaidya
and Shah proved the following graphs are odd harmonious: the shadow graph and the
splitting graph of bistar Bn,n ; the arbitrary supersubdivision of paths; graphs obtained by
joining two copies of cycle Cn for n ≡ 0(mod 4) by an edge; and the graphs Hn,n , where
V (Hn,n ) = {v1 , v2 , . . . , vn , u1 , u2 , . . . , vn } and E(Hn,n ) = {vi uj : 1 6 i 6 n, n − i + 1 6
j 6 n}. In [3511] Yan proves that Pm × Pn is strongly odd harmonious. Koppendrayer
[1730] has proved that every graph with an α-labeling is odd harmonious. Li, Li, and Yan
[1927] proved that Km,n is odd strongly harmonious. Saputri, Sugeng, and Fronček [2716]
proved that the graph obtained by joining Cn to Ck by an edge (dumbbell graph Dn,k,2 )
is odd harmonious for n ≡ k ≡ 0 (mod 4) and n ≡ k ≡ 2 (mod 4), and Cn × Pm is odd
harmonious if and only if n ≡ 0 (mod 4). They also observe that Cn K1 with n ≡ 0
(mod 4) is odd harmonious. Pujiwatia, Halikinb, and Wijayac [2530] proved double stars
and even cycles odd harmonious. Sugeng, Surip, and Rismayati [3092] proved that the
m-shadow of C4n and nontivial gears are odd harmonious graphs.
Jeyanthi [1484] proved that the shadow and splitting graphs of K2,n , C4n , the double
quadrilateral snakes DQ(n) (n > 2), and the graph Hn,n with vertex set V (Hn,n ) =
{v1 , v2 , . . . , vn , u1 , u2 , . . . , un } and the edge set E(Hn,n ) = {vi uj : 1 6 i 6 n, n − i + 1 6
j 6 n} are odd harmonious. Jeyanthi and Philo [1484] proved that the shadow graphs
D2 (K2,n ) and D2 (Hn,n ) are odd harmonious and the splitting of graphs of K2,n and Hn,n
are odd harmonious. They also showed that the shadow graph D2 (Cn ) is odd harmonious
if n ≡ 0 (mod 4), the splitting of Cn is odd harmonious if n ≡ 0 (mod 4), and the
double quadrilateral snake DQ(n) is odd harmonious for n > 2. In [1488] Jeyanthi

the electronic journal of combinatorics (2023), #DS6 131

and Philo prove that super subdivision of cycles, ladders, C4n ⊕ K1,m , and uniform fire
crackers are odd harmonious graphs. Jeyanthi and Philo [1494] proved that the graph
Pn−1 (1, 2, 3, . . . , n) obtained from a path of n vertices v1 , v2 , . . . , vn−1 by appending a path
of length n − i at each vi and certain one point unions of the end points of paths are odd
harmonious.
Philo, Jeyanthi, and Davazz [2869] proved that the following graphs are odd harmo- [2869] new
nious: the path union of r copies of Km,n ; the path union of copies of complete bipartite
graphs; the graphs obtained from t copies of Km,n by joining each one to the next one with
an islolated vertex (the join sum) ; the one point union of t copies of complete bipartite
graphs (not necessarily the same); the graphs obtained by replacing each vertex of K1,t ,
except the apex vertex, with the graph Km,n ; and the one point union of isomorphic path
graphs of Km,n . Let ui,1 , ui,2 , . . . , ui,m and vi,1 , vi,2 , . . . , vi,n be the vertices of r copies of
Km,n . The circle formation [2869] of r copies of Km,n is the graph obtained by joining the [2869] new
ith copy of Km,n (1 6 i 6 r) by joining the vertices ui,m to ui+1,1 for 1 6 i 6 r − 1 and
joining the vertex ur,m to u1,1 . Philo, Jeyanthi, and Davazz [2869] proved that he circle [2869] new
formation of r copies of Km,n when r = 0(mod 4) is odd harmonious.
Suptri, Sugeng, and Fronček [2716] proved that that dumbbell graphs Dn,k,2 are odd [2716] new
harmonious if and only if n, k = 2(mod 4). In [1490] Jeyanthi and Philo proved that [1490] new
the graphs obtained by attaching m pendant vertices to each vertex of paths of odd
length, the splitting graph of combs, slanting ladders, graphs obtained from m copies of
hK1,n : K1,n i by joining one leaf of ith copy of hK1,n : K1,n i with the center of (i + 1)th
copy of hK1,n : K1,n i where 1 6 i 6 m − 1, and H-super subdivisions of Pn and C4n
admit odd harmonious labeling. Moveover, they observe that all strongly odd harmonious
graphs admit a mean labeling, an odd mean labeling, an odd sequential labeling, all
odd sequential graphs are odd harmonious, and all odd harmonious graphs are even
sequential harmonious. They also proved the n-splitting graphs for paths, stars, and
symmetric product between paths and null graphs are odd harmonious graphs for all n.
Selvaraju, Balaganesan, and Renuka [2740] proved that quadrilateral snakes and k-regular [2740] new
caterpillars are odd harmonious. Abdel-Aal1 and Seoud [5] proved that the m-shadow [5] new
graphs for paths and complete bipartite graphs are odd harmonious graphs for all m.
For a Tp -tree T with vertices v1 , v2 , . . . , vn , the graph T ◦ˆPm is obtained from T and n
copies of Pm by identifying a pendant vertex of ith copy of Pm with vertex vi of T . For Cn
with consecutive vertices v1 , v2 , . . . , vn , the graph Cn ◦ˆPm is obtained from Cn and n copies
of Pm by identifying a pendant vertex of ith copy of Pm with vertex vi of Cn . Jeyanthi and
Philo [1496] proved that Tp -trees, T ◦ˆPm , T ◦ˆ2Pm , regular bamboo trees, Cn ◦ˆPm , Cn ◦ˆ2Pm ,
and subdivided grid graphs are odd harmonious.
Recall a subdivided shell graph is obtained by subdividing the edges in the path of the
shell graph. Let G1 , G2 , . . . , Gn be n subdivided shell graphs of any order. The graph
SSG(n) is obtained by adding an edge to apexes of Gi and Gi+1 , i = 1, 2, . . . , (n − 1). Jeba
Jesintha and Ezhilarasi Hilda [1392] proved that the subdivided shell graph and SSG(2)
are odd harmonious.
The following definitions are taken from [1495]. The m-shadow graph Dm (G) of a
connected graph G is constructed by taking m-copies of G, G1 ,G2 ,G3 ,. . . ,Gm , and joining

the electronic journal of combinatorics (2023), #DS6 132

each vertex u in Gi to the neighbors of the corresponding vertex v in Gj , 1 6 j 6 m.
The m-splitting graph Splm (G) of a graph G is obtained by adding to each vertex v of G
m new vertices, v 1 , v 2 , . . . , v m such that v i , 1 6 i 6 m, is adjacent to every vertex that
is adjacent to v in G. Note that the 2-shadow graph is the shadow graph D2 (G) and the
1-splitting graph is splitting graph. The m-mirror graph Mm (G) is defined as the disjoint
union of m copies of G, G1 , G2 , . . . , Gm , together with additional edges joining each vertex
of Gi to its corresponding vertex in Gi+1 , 1 6 i 6 m − 1. The graph Wm,n is obtained
from the gear graph arising from the wheel Wn as follows: Join the vertices vi and vi+2
j
with the new vertices vi+1 for 1 6 j 6 m and 2 6 i 6 n − 2 and join vn and v2 with v2i−1 .
The graph K2,n (r, s) is obtained from K2,n (n > 2) by adding r and s pendent edges to
the two vertices of degree n. The graph G = hCn : K2,m : Cr i is obtained from K2,m with
the partite set {u, v} by identifying the vertex u with a vertex of Cn and the vertex v
with a vertex of Cr . Let Pn be a path on n vertices denoted by (1, 1), (1, 2), . . . , (1, n)
and with n − 1 edges denoted by e1 , e2 , . . . , en−1 where ei is the edge joining the vertices
(1, i) and (1, i + 1). The step ladder graph S(Tn ) has (n2 + 3n − 2)/2 vertices denoted by
(1, 1), (1, 2), . . . , (1, n), (2, 1), (2, 2), . . . , (2, n), (3, 1), (3, 2), . . . , (3, n − 1), (4, 1), . . . , (4, n −
2), . . . , (n, 1), (n, 2) and n2 + n + 2 edges. In any ordered pair (i, j), i denotes the row
(counted from bottom to top) and j denotes the column(from left to right) in which the
vertex occurs.
The cocktail party graph, Hm,n (m, n > 2), is the graph with a vertex set V =
{v1 , v2 , . . . , vmn } partitioned into n independent sets V = {I1 , I2 , . . . , In } each of size
m such that vi vj ∈ E for all i, j ∈ {1, 2, . . . , mn} where i ∈ Ip , j ∈ Iq , p 6= q.
Jeyanthi and Philo [1487] proved that following graphs are odd harmonious: Dm (Pn )
for all m, n > 2; Splm (Pn ) for m, n > 2; Dm (Hn,n ) for all m > 2 and n > 1; Splm (Hn,n )
for all m > 2 and n > 1; Dm (Kr,s ) for all r, s > 1; Splm (Kr,s ) for all m > 2 and r, s > 1;
Dm (Pn ⊕ K2 ) for all m, n > 2; Splm (Pn ⊕ K2 ), m, n > 2; and Splm (Cn ) if and only if
n ≡ 0 (mod 4).
Jeyanthi and Philo [1495] proved that following graphs are odd harmonious: Wm,n
for n ≡ 0 (mod 4), m > 1; Dm (Pn K1 ) (the authors use the notion Cbn for the comb
Pn K1 ) for all m > 2 and n > 1; Splm (K2,n (r, s)); hCn : K2,m : Cr i for n, r ≡ 0 (mod 4)
and m > 2; and the graphs obtained by arranging vertices into a finite number of rows
(at least 2) with i vertices in the ith row and in every row the jth vertex in that row is
joined to the jth vertex and j + 1st vertex of the next row (a pyramid) for n > 2. They
also prove that if G is a strongly odd harmonious tree, then Mm (G) is odd harmonious.
Let P2n be a path of length 2n − 1 with 2n vertices, denoted by (1, 1), (1, 2), . . . , (1, 2n)
and with 2n − 1 edges, denoted by e1 , e2 , . . . , e2n−1 where ei is the edge joining the vertices
(1, i) and (1, i + 1). On each edge ei for i = n + 1, n + 2, . . . , 2n − 1, we erect a ladder with
2n+1−i steps including the edge ei . The double sided step ladder graph 2S(T2×n ) has ver-
tices denoted by (1, 1), (1, 2), . . . , (1, 2n),(2, 1), (2, 2), . . . , (2, 2n),(3, 2), (3, 3), . . . , (3, 2n −
1),(4, 3), (4, 4), . . . , (4, 2n − 2), . . . , (n + 1, n), (n + 1, n + 1). In any ordered pair (i, j),
i denotes the row (counted from bottom to top) and j denotes the column (from left
to right) in which the vertex occurs. Jeyanthi and Philo [1493] proved that the path
union of t copies of S(Tn ), the double sided step ladder 2S(T2×n ), the path union of

the electronic journal of combinatorics (2023), #DS6 133

t copies of 2S(T2×n ), S(t.Cbn ), S(t.C4 ), C4 t , C6 t , and C8 t are odd harmonious graphs.
Jeyanthi and Philo [1489] proved that path union of r copies of Km,n , the path union
t t
of r copies of Kmi ,ni , 1 6 i 6 r, Km,n , K(m 1 ,n1 ),(m2 ,n2 ),...,(mt ,nt )
, the join sum of graph
hKm,n ; Km,n ; . . . , Km,n (t copies i, hKm1 ,n1 ; Km2 ,n2 ; . . . , Kmt ,nt i, the circle formation of r
copies of Km,n when r ≡ 0 (mod 4), S(t.Km,n ) and Pnt (t.n.Kp,q ) are odd harmonious
graphs. Jeyanthi and Philo [1492] proved that the subdivided shell graphs, disjoint union
of two subdivided shell graphs, subdivided shell flower graphs, and subdivided uniform
shell bow graphs are odd harmonious. Jeyanthi, Philo, and Youssef [1497] proved that
the path union of t copies of Pm × Pn , the path union of t copies of Pmi × Pni where
1 6 i 6 t, the vertex union of t copies of Pm × Pn , the vertex union of t different copies
of Pmi × Pni where 1 6 i 6 t, the one point union of path of Pnt (t.n.Pm × Pm ), and the
super subdivision of grid graph Pm × Pn are odd harmonious graphs.
Recall from Section 2.7 that for even n > 2 a plus graph of size n (denoted by P ln ) is the
graph obtained by starting with paths P2 , P4 , . . . , Pn−2 , Pn , Pn , Pn−2 , . . . , P4 , P2 arranged
vertically parallel with the vertices in the paths forming horizontal rows and edges joining
the vertices of the rows. Jeyanthi [1486] proved that following graphs are odd harmonious:
P ln where n ≡ 0 (mod 2), n 6= 2; path unions of finitely many copies of P ln where n ≡ 0
(mod 2), n 6= 2; open stars of plus graphs S(t.P ln ) where n ≡ 0 (mod 2), n 6= 2 and t
odd; graphs obtained by joining Cm , m ≡ 0 (mod 4) and a plus graph P ln , n ≡ 0 (mod
2), n 6= 2 with a path of arbitrary length; the graph obtained by replacing all vertices of
K1,t , except the apex vertex, by the path union of n copies of the graph P lm .
In [1488] Jeyanthi and Philo prove that super subdivision of cycles, ladders, C4n ⊕K1,m ,
and uniform fire crackers are odd harmonious graphs. They also proved the (m, n)-
firecracker graph obtained by the concatenation of m n-stars by linking one leaf from
each is odd harmonius; the arbitrary super subdivision of cycles Cm are odd harmonious;
and the super subdivision of ladders are odd harmonious. Jeyanthi and Philo [1495] proved
that the m-mirror graph Mm (G) (m > 2), m-splitting graph of K2,n (r, s) (obtained from
K2,n , (n > 2) by adding r and s (r, s > 1) pendent edges to the two vertices of degree
n), W(m,4n) obtained from the gear graph of Wn by joining the vertices vi and vi+2 with
j
the new vertices vi+1 for 1 6 j 6 m and 2 6 i 6 n − 2 and joining vn and v2 with v1j for
1 6 j 6 m, hC4n : K2,m : C4r i obtained from K2,m with one partite set V1 = {u, v} and
Cr by identifying the vertex u of V1 with a vertex of Cn and the other vertex v of V1 with
a vertex of Cr , and the pyramid graph P Yn (n > 2) are odd harmonious graphs. They
also proved that G is a strongly odd harmonious tree, then Mm (G) is an odd harmonious.
The edge comb product of two graphs G and H is the graph formed by taking one
copy of G and |E(G)| copies of H, then attaching the i-th copy of H at the edge e to the
i-th edge of G. In [949] Sarasvati, Halikin, and Wijaya showed that graphs constructed [949] new
by the edge comb product of Pn and C4 and the shadow of C4 are odd harmonious.
Firmansah and Tasari [950] gave odd harmonious labelings for a line amalgamation of [950] new
double quadrilateral graphs and the graphs obtained by connecting two copies of double
quadrilateral graph by an edge. Firmansah and Giyarti [946] proved that graphs obtaned [946] new
by the edge amalgamation of double quadrilateral graphs are odd harmonious. Febriana
and Sugeng [947] proved that squid graphs (obtained from Cn by add pendant edges to [947] new

the electronic journal of combinatorics (2023), #DS6 134

one vertex of Cn ) are odd harmonious if and only if n is even and double squid graphs
(obtained from two copies of Cn that share one common vertex and adding pendant edges
to the common vertex) are odd harmonious if and only n > 4 is even. In [943], [942], [943] new
[945] Firmansah proved that multiple net snake graphs and a variation of the double [942] new
quadrilateral windmill graphs, layered graphs, and some classes of string graphs are odd
harmonious graphs. Firmansah, Tasari, and Yuwono [948] proved that the zinnia flower [945] new
graph and its variations are odd harmonious graphs. [948] new
In [1488] Jeyanthi and Philo modified the notion of odd harmonious by defining an
odd harmonious labelings as a function f to be an odd harmonious labeling of a graph G
with q edges if f is an injection from the vertices of G to the integers from 0 to 2q − 1
such that the induced mapping f ∗ (uv) = f (u) + f (v) mod (2q) from the edges of G to
the odd integers between 1 to 2q − 1 is a bijection. Using this definition they proved that
an m-cycle and an n-cycle sharing a common vertex is an odd harmonious if and only
if either both m, n ≡ 0 (mod 4) or both m, n ≡ 2 (mod 4) and the same holds for
an m-cycle and an n-cycle sharing a common edge. They also proved that any two even
cycles sharing a common vertex and a common edge are odd harmonious graphs.
Sarasija and Binthiya [2717] say a function f is an even harmonious labeling of a
graph G with q edges if f : V → {0, 1, . . . , 2q} is injective and the induced function
f ∗ : E → {0, 2, . . . , 2(q −1)} defined as f ∗ (uv) = f (u)+f (v) (mod 2q) is bijective. Notice
that for an even harmonious labeling of a connected graph all the vertex labels must have
the same parity. Moveover, in the case of even harmonious labelings for connected graphs
there is no loss of generality to assume that all the vertex labels are even integers and
the duplicate vertex is 0. They proved the following graphs are even harmonious: non-
trivial paths; complete bipartite graphs; odd cycles; bistars Bm,n ; K2 + Kn ; Pn2 ; and
the friendship graphs F2n+1 . López, Muntaner-Batle and Rious-Font [1992] proved that
every super edge-magic graph (see Section 5.2 for the definition of super edge-magic)
with p vertices and q edges where q > p − 1 has an even harmonious labeling. In [3554]
Youssef provided a necessary condition for some regular graphs to be even harmonious,
showed that the disjoint union of two k-sequential graphs is even 2k-sequential under
some conditions, and showed that in some cases G is k-sequential implies mG is even
2k-sequential for all positive integer m.
Because 0 and 2q are equal modulo 2q the following retricted form of even harmonious
labelings is of interest. A function f is said to be a properly even harmonious labeling of
a graph G with q edges if f is an injection from the vertices of G to the integers from 0
to 2q − 1 and the induced function f ∗ from the edges of G to {0, 2, . . . , 2q − 2} defined by
f ∗ (xy) = f (x)+f (y)(mod 2q) is bijective. In their definition of properly even harmonious
in [1008] Gallian and Schoenhard incorrectly required that the vertex labels should be the
even integers from 0 to 2q − 2. For connected graphs the two definitions are equivalent
but for disconnected graph they are not. They used vertex labels from 0 to 2q − 1 for
their results on disconnected graphs.
A graph with a properly even harmonious labeling is said to be properly even harmo-
nious. Gallian and Schoenhard [1008] say a properly even harmonious labeling of a graph
with q edges is strongly even harmonious if it satisfies the additional condition that for

the electronic journal of combinatorics (2023), #DS6 135

any two adjacent vertices with labels u and v, 0 < u + v 6 2q.
Jared Bass [513] has observed that for connected graphs any harmonious labeling of
a graph with q edges yields an even harmonious labeling by simply multiplying each
vertex label by 2 and adding the vertex labels modulo 2q. Thus we know that every
connected harmonious graph is an even harmonious graph and every connected graph
that is not a tree that has a harmonious labeling also has a properly even harmonious
labeling. Conversely, a properly even harmonious labeling of a connected graph with q
edges (assuming that the vertex labels are even) yields a harmonious labeling of the graph
by dividing each vertex label by 2 and adding the vertex labels modulo q.
Gallian and Schoenhard [1008] proved the following: wheels Wn and helms Hn are
properly even harmonious when n is odd; nP2 is even harmonious for n odd; nP2 is
properly even harmonious if and only if n is even; Kn is even harmonious if and only if
n 6 4; C2n is not even harmonious when n is odd; Cn ∪ P3 is properly even harmonious
when odd n > 3; C4 ∪Pn is even harmonious when n > 2; C4 ∪Fn is even harmonious when
n > 2; Sm ∪ Pn is even harmonious when n > 2; K4 ∪ Sn is properly even harmonious;
Pm ∪ Pn is properly even harmonious for all m > 2 and n > 2; C3 ∪ Pn2 is even harmonious
when n > 2; C4 ∪ Pn2 is even harmonious when n > 2; the disjoint union of two or
three stars where each star has at least two edges and one has at least three edges is
properly even harmonious; Pm2 ∪ Pn is even harmonious for m > 2 and 2 6 n < 4m − 5;
the one-point union of two complete graphs each with at least 3 vertices is not even
harmonious; Sm ∪ Pn is strongly even harmonious if n > 2; and Sn1 ∪ Sn2 ∪ · · · ∪ Snt is
strongly even harmonious for n1 > n2 > · · · > nt and t < n21 + 2. They conjecture that
Sn1 ∪ Sn2 ∪ · · · ∪ Snt is strongly even harmonious if at least one star has more than 2
edges. They also note that C4 , C8 , C12 , C16 , C20 , C24 are even harmonious and conjecture
that C4n is even harmonious for all n. This conjecture was proved by Youssef [3552] who
also proved that if a connected even harmonious graph with q edges where q is even and
each vertex has degree divisible by 2k (k > 1), then q is divisible by 2k+1 . As a corollary
2
of the latter he gets that C4n+2 is not even harmonious. Hall, Hillesheim, Kocina, and
Schmit [1172] proved that nC2m+1 is properly even harmonious for all n and m.
In [1009] and [1010] Gallian and Stewart investigated properly even harmonious la-
belings of unions of graphs. They use Pm +t to denote the graph obtained from the
path Pm by appending t edges to an endpoint; Catm +t to denote a caterpillar of path
length m with t pendent edges; and Cm +t to denote an m-cycle with t pendent edges.
They proved the following graphs are properly even harmonious: nPm if n is even and
m > 2; Pn ∪ Km,2 for n odd and n > 1, m > 1; Pn ∪ Sm1 ∪ Sm2 for n > 2 and m1 + m2 is
odd; Cn ∪ Sm1 ∪ Sm2 for n odd and m1 , m2 > 3; Pm +t ∪ Pn +s ; the union of any number
of caterpillars; Cm ∪ Catn +t for m > 1 odd, n > 1; C4 ∪ Catm +t ; the union of C4 and
a hairy cycle; K4 ∪ Cm +n for some cases; W4 ∪ Cm +n for some cases; C4 ∪ (Pn + K2 )
for n > 1; K4 ∪ (Pn + Km ) for n ≡ 1, 2 (mod 4); C3 ∪ (Pn + Km ) for n ≡ 1, 2 (mod 4);
W4 ∪ (Pn + Km ) for n ≡ 1, 2 ( mod 4); W4 ∪ Pn for n ≡ 1, 2 ( mod 4); K4 ∪ Pn for n > 1 and
n ≡ 1, 2 ( mod 4); K4 ∪Pm2 1 ∪Pm2 2 ∪· · ·∪Pm2 n for mi > 2, n > 1; W4 ∪Pm2 1 ∪Pm2 2 ∪· · ·∪Pm2 n
for mi > 2, n > 1; Cm ∪ Pn2 for m ≡ 3 (mod 4) and n > 1; and 2Pm ∪ 2Pn . They also
prove that nP3 is even harmonious if n > 1 is odd and Pm2 1 ∪ Pm2 2 ∪ · · · ∪ Pm2 n is strongly

the electronic journal of combinatorics (2023), #DS6 136

even harmonious for m > 2, n > 1.
Gallian and Stewart [1011] call an injective labeling f of a graph G with q edges even
2a-sequential if the vertex labels are from {0, 1, . . . , 2q − 1} and the edge labels induced
by f (u) + f (v) for each edge uv are 2a, 2a + 2, . . . , 2a + 2q − 2. When G is a tree, the
allowable vertex labels are 0, 1, . . . , 2q. For connected a-sequential graphs, a connected
2a-sequential graph can be obtained by multiplying all the vertex labels by 2. Notice
that the vertex labels in resulting graph belong to {0, 2, . . . , 2q − 2} (or {0, 2, . . . , 2q}
for trees) and the edges labels are from 2a to 2a + 2q − 2. Moreover, a connected a-
sequential graph can be obtained from a connected even 2a-sequential graph with even
vertex labels by dividing all the vertex labels by 2. Likewise, a 2a-sequential labeling of
a connected graph with odd vertex labels induces an a-sequential labeling of the graph
by subtracting 1 from each vertex label and dividing by 2. Thus for connected graphs,
a-sequential is equivalent to 2a-sequential. They prove that if G is even 2a-sequential the
following graphs are properly even harmonious: G ∪ Pm2 for m > 2, G ∪ Pn for n > 1,
n ≡ 1, 2 (mod 4), G ∪ Cm +t for some cases, G ∪ Catm +n for m > 1, and G ∪ W2n+1 .
For n and k odd and m, n, k, t > 1, Mbianda and Gallian (see [2111]) proved the
following graphs have properly even harmonious labelings: mP3 for even m; 2Pm ∪2Pn ∪St ;
2Pm ∪ 2Pn ∪ Pk ; 2Pm ∪ 2Pn ∪ Ck ; 2Pm ∪ 2Pn ∪ C4 ; 2Pm ∪ 2Pn ∪ 2K4 ; 2Pm ∪ 2Pn ∪ 2W4 ;
2Pm ∪ 2Pn ∪ 2Ck ; Fn ∪ K4 (Fn = Pn + K1 is the fan); Fn ∪ 2K4 ; Fn ∪ W4 ; Fn ∪ 2W4 ;
Wn ∪K4 ; Wn ∪2K4 ; Wn ∪W4 ; Wn ∪2W4 ; (Cn +K1 )∪K4 ; (Cn +K1 )∪W4 ; (Cn +K1 )∪2K4 ;
(Cn +K1 )∪2W4 ; and (Cn +K2 )∪K4 ((Cn +K2 ) is the double cone). Gallian [1005] proved
the following graphs have properly even harmonious labelings (in all cases m, n > 1): mPn
for m even; 2Pm ∪ 2Pn ∪ 2C3 ; 2Pm ∪ 2Pn ∪ 2C4 ; 2Pm ∪ 2Pn ∪ C3 ∪ C4 ; Fn ∪ P4 ; Fn ∪ 2P4 ;
Fn ∪ C4 ; and Fn ∪ 2C4 .
Binthiya and Sarasija [571] prove the following graphs are even harmonious: Cn
mK1 (n odd), Pn mK1 (n > 1 odd), C2n @K2 , Pn (n even) with n − 1 copies of mK1 , the
shadow graph D2 (K1,n ), the splitting graph spl(K1,n ), and the graph obtained from the
Pn (n even) with n − 1 copies of Km incident with first n − 1 vertices of Pn . Vargheese and
Arun [3342] prove that the triangular books, the disjoint union of two triangular book
graphs, total graphs T (Pn ), the disjoint union of T (Pn ) and a triangular book, and the
graph obtained by joining the centers of two disjoint copies of K1,n to an isolated vertex
are even harmonious.
Lasim, Halikin, and Wijaya [1799] showed how to build new harmonious, odd harmo- [1799] new
nious, even harmonious labelings based on the existing such labelings.
In [520] Beatress and Sarasija introduced the notion of even-odd harmonious graphs
as follows. Let G be a graph with m vertices and n edges. An injective mapping from the
vertices of G to {1, 3, 5, . . . , 2m − 1} is called an even-odd harmonious labeling of G if the
induced edge mapping f ∗ from the edges of G to {0, 2, 4, . . . , 2(n − 1)} is a bijection and
f ∗ (uv) = (f (u)∗ + f ∗ (v)) mod 2n for all edges uv. They proves that the bistars, cycles
with one pendent edge, crowns, K1,m,n , Pn 2 (n > 4), and nP2 are even-odd harmonious
graphs. Kalaimathi and Balamurugan [1563] proved caterpillars, lobsters, coconut trees,
spider trees, and star graphs admit even-odd harmonious labelings. Zala, Chotaliya, and
Chaurasiya [3570] proved H-graphs, combs, and bistars graph have even-odd harmonious

the electronic journal of combinatorics (2023), #DS6 137

labelings. Ganeshwari and Sudhana [1013] proved that paths, cycles, stars, bistars, combs,
Pn 2 , C3 @pK1 and C2r−1 @K1 are even-odd average harmonious graphs.

the electronic journal of combinatorics (2023), #DS6 138

5 Magic-type Labelings
5.1 Magic Labelings
Motivated by the notion of magic squares in number theory, magic labelings were intro-
duced by Sedláček [2732] in 1963.2 Responding to a problem raised by Sedláček, Stewart
[3053] and [3054] studied various ways to label the edges of a graph in the mid 1960s.
Stewart calls a connected graph semi-magic if there is a labeling of the edges with integers
such that for each vertex v the sum of the labels of all edges incident with v is the same
for all v. (Berge [538] used the term “regularisable” for this notion.) A semi-magic label-
ing where the edges are labeled with distinct positive integers is called a magic labeling.
Stewart calls a magic labeling supermagic if the set of edge labels consists of consecutive
positive integers. The classic concept of an n × n magic square in number theory cor-
responds to a supermagic labeling of Kn,n . Stewart [3053] proved the following: Kn is
magic for n = 2 and all n > 5; Kn,n is magic for all n > 3; fans Fn are magic if and only
if n is odd and n > 3; wheels Wn are magic for n > 4; and Wn with one spoke deleted
is magic for n = 4 and for n > 6. Stewart [3053] also proved that Km,n is semi-magic if
and only if m = n. In [3054] Stewart proved that Kn is supermagic for n > 5 if and only
if n > 5 and n 6≡ 0 (mod 4). Sedláček [2733] showed that Möbius ladders Mn (see §2.3
for the definition) are supermagic when n > 3 and n is odd and that Cn × P2 is magic,
but not supermagic, when n > 4 and n is even. Shiu, Lam, and Lee [2908] have proved:
the composition of Cm and K n (see §2.3 for the definition) is supermagic when m > 3
and n > 2; the complete m-partite graph Kn,n,...,n is supermagic when n > 3, m > 5 and
m 6≡ 0 (mod 4); and if G is an r-regular supermagic graph, then so is the composition of
G and K n for n > 3. Ho and Lee [1249] showed that the composition of Km and Kn is
supermagic for m = 3 or 5 and n = 2 or n odd. Bača, Holländer, and Lih [335] have found
two families of 4-regular supermagic graphs. Shiu, Lam, and Cheng [2905] proved that
for n > 2, mKn,n is supermagic if and only if n is even or both m and n are odd. Ivančo
[1338] gave a characterization of all supermagic regular complete multipartite graphs. He
proved that Qn is supermagic if and only if n = 1 or n is even and greater than 2 and
that Cn × Cn and C2m × C2n are supermagic. He conjectures that Cm × Cn is supermagic
for all m and n. Trenklér [3224] has proved that a connected magic graph with p vertices
and q edges other than P2 exits if and only if 5p/4 < q 6 p(p − 1)/2. In [3129] Sun, Guan,
and Lee give an efficient algorithm for finding a magic labeling of a graph. In [3467] Wen,
Lee, and Sun show how to construct a supermagic multigraph from a given graph G by
adding extra edges to G.
Sudarsana, Suryanto, Lusianti, and Putri [3067] show how magic graph labelings can
be used to increase the security level of encrypted text on social media. Angel Sherin
and Maheswari [196] and Ali Ahmed and Baskar Babujee [121] used magic labeling of [196] new
graph to devise encryption and decryption schemes. In [1118] Lakshmi, Sudhakar, and [121] new
Sudhakar provided a cryptographic technique for data encryption and decryption using
[1118] new
2
A comprehensive expository treatment of magic labelings is given by Bača, Miller, Ryan, and Se-
maničová-Feňovčı́kováin [370].

the electronic journal of combinatorics (2023), #DS6 139

magic labelings of graphs.
In [1748] Kovář provides a general technique for constructing supermagic labelings of
copies of certain kinds of regular supermagic graphs. In particular, he proves: if G is a
supermagic r-regular graph (r > 3) with a proper edge r coloring, then nG is supermagic
when r is even and supermagic when r and n are odd; if G is a supermagic r-regular
graph with m vertices and has a proper edge r coloring and H is a supermagic s-regular
graph with n vertices and has a proper edge s coloring, then G × H is supermagic when
r is even or n is odd and is supermagic when s or m is odd.
Kovář, Kravčenko, Krbeček, and Silber [1750] affirmatively answered a question by
Madaras about existence of supermagic graphs with arbitrarily many different degrees.
Their construction provided graphs with all degrees even. They asked if there exists a
supermagic graph with d different odd degrees for any positive integer d. This question
was answered affirmatively by Fronček and Qiu with a construction based on the use of
3-dimensional magic rectangles.
In [848] Drajnová, Ivančo, and Semaničová proved that the maximal number of edges
in a supermagic graph of order n is 8 for n = 5 and n(n−1) 2
for 6 6 n 6≡ 0 (mod 4), and
n(n−1)
2
− 1 for 8 6 n ≡ 0 (mod 4). They also establish some bounds for the minimal num-
ber of edges in a supermagic graph of order n. Ivančo, and Semaničová [1348] proved that
every 3-regular triangle-free supermagic graph has an edge such that the graph obtained
by contracting that edge is also supermagic and the graph obtained by contracting one of
the edges joining the two n-cycles of Cn × K2 (n > 3) is supermagic.
Ivančo [1340] proved: the complement of a d-regular bipartite graph of order 8k is
supermagic if and only if d is odd; the complement of a d-regular bipartite graph of order
2n where n is odd and d is even is supermagic if and only if (n, d) 6= (3, 2); if G1 and G2
are disjoint d-regular Hamiltonian graphs of odd order and d > 4 and even, then the join
G1 ⊕ G2 is supermagic; and if G1 is d-regular Hamiltonian graph of odd order n, G2 is
d − 2-regular Hamiltonian graph of order n and 4 6 d ≡ 0 (mod 4), then the join G1 ⊕ G2
is supermagic.
For k > 2 and graphs G and H, the graph G k H defined as (G k−1 H) H (where
G 1 H = G H) is called the k-multilevel corona of G with H. Marbun and Salman
[2078] proved (Wn k−1 ) Cn is Wn -edge magic.
In [552] Bezegová and Ivančo [554] extended the notion of supermagic regular graphs
by defining a graph to be degree-magic if the edges can be labeled with {1, 2, . . . , |E(G)|}
such that the sum of the labels of the edges incident with any vertex v is equal to
(1 + |E(G))/deg(v). They used this notion to give some constructions of supermagic
graphs and proved that for any graph G there is a supermagic regular graph which con-
tains an induced subgraph isomorphic to G. In [554] they gave a characterization of
complete tripartite degree-magic graphs and in [555] they provided some bounds on the
number of edges in degree-magic graphs. They say a graph G is conservative if it admits
an orientation and a labeling of the edges by {1, 2, . . . , |E(G)|} such that at each vertex
the sum of the labels on the incoming edges is equal to the sum of the labels on the out-
going edges. In [553] Bezegová and Ivančo introduced some constructions of degree-magic
labelings for a large family of graphs using conservative graphs. Using a connection be-

the electronic journal of combinatorics (2023), #DS6 140

tween degree-magic labelings and supermagic labelings they also constructed supermagic
labelings for the disjoint union of some regular non-isomorphic graphs. Among their re-
sults are: If G is a δ-regular graph where δ is even and at least 6, and each component
of G is a complete multipartite graph of even size, then G is a supermagic graph; for
any δ-regular supermagic graph H, the union of disjoint graphs H and G is supermagic;
if G is a δ-regular graph with δ ≡ 0 (mod 8) and each component is a circulant graph,
then G is a supermagic graph; for any δ-regular supermagic graph H, the union of dis-
joint graphs H and G is a supermagic graph; and that the complement of the union of
disjoint cycles Cn1 , . . . , Cnk is supermagic when k ≡ 1 (mod 4) and 11 6 ni ≡ 3 (mod
8) for all i = 1, . . . , k. In [1333] Inpoonjal gave necessary and suficient conditions for the
existence of degree-magic labelings of graphs obtained by taking the join and composition
of complete tripartite graphs.
A graph G is said to be (F, H)-sim-(super)magic if there exists a bijection f 0 that
is simultaneously F -(super) magic and H-(super) magic. In [258], Ashari, Salman, and
Simanjuntak consider (K2 , H)-sim-(super) magic graphs where H is isomorphic to three
classes of graphs with varied symmetry: a cycle which is symmetric (both vertex-transitive
and edge-transitive), a star which is edge-transitive but not vertex-transitive, and a path
which is neither vertex-transitive nor edge-transitive. They provide forbidden subgraphs
for the existence of (K2 , H)-sim-(super) magic graphs and classify classes of (K2 , H)-
sim-(super) magic graphs. They also derive sufficient conditions for edge-(super) magic
graphs to be (K2 , H)-sim-(super) magic and utilize such conditions to characterize some
(K2 , H)-sim-(super) magic graphs.
Let G0 be a copy of a simple graph G and for each vertex vi of G let ui be the vertex
of G0 corresponding with vi . The double graph has vertex set V (G) ∪ V (G0 ) and edge
set E(G) ∪ E(G0 ) ∪ {ui vj | ui ∈ V (G); vj ∈ V (G0 ) and ui uj ∈ E(G)}. Ivančo [1341]
establishes sufficient conditions for generalized double graphs to be degree-magic and
constructs supermagic labelings of some graphs generalizing double graphs.
Sedláček [2733] proved that graphs obtained from an odd cycle with consecutive ver-
tices u1 , u2 , . . . , um , um+1 , vm , . . . , v1 (m > 2) by joining each ui to vi and vi+1 and u1 to
vm+1 , um to v1 and v1 to vm+1 are magic. Trenklér and Vetchý [3227] have shown that if
G has order at least 5, then Gn is magic for all n > 3 and G2 is magic if and only if G
is not P5 and G does not have a 1-factor whose every edge is incident with an end-vertex
of G. Avadayappan, Jeyanthi, and Vasuki [263] have shown that k-sequential trees are
magic (see §4.1 for the definition).
Seoud and Abdel Maqsoud [2759] proved that K1,m,n is magic for all m and n and
that Pn2 is magic for all n. However, Serverino has reported that Pn2 is not magic for
n = 2, 3, and 5 [1076]. Jeurissan [1378] characterized magic connected bipartite graphs.
Ivančo [1339] proved that bipartite graphs with p > 8 vertices, equal sized partite sets,
and minimum degree greater than p are magic. Bača [296] characterizes the structure
of magic graphs that are formed by adding edges to a bipartite graph and proves that a
regular connected magic graph of degree at least 3 remains magic if an arbitrary edge is
deleted. In [3014] Solairaju and Arockiasamy prove that various families of subgraphs of
grids Pm × Pn are magic. Dayanand and Ahmed [787] investigate super magic properties

the electronic journal of combinatorics (2023), #DS6 141

of several classes of connected and disconnected graphs. They show that there can be
arbitrarily large gaps among the possible valences for certain super magic graphs. They
also prove that the disjoint union of multiple copies of a super magic linear forest is super
magic if the number of copies is odd and that the super magic labeling is complementary
edge antimagic as well. The broom Bn,t is a graph obtained by attaching n − t pendent
edges to an end point vertex of the path Pt . Marimuthu, Raja, and Raja Durga [2089]
prove that Bn,n−1 is E-super vertex magic if and only if n > 3 is odd and Bn,t is not
E-super vertex magic for n > 4 and t > 3. In [2270] Nemani and Joshi defined a new
class of graph called the cartoon flower and showed that a E-super vertex magic labeling
does not exist for the class of cartoon flower graphs. They also define the wounded
cartoon flower graphs and establish some sufficient conditions for the graph not to be
E-super vertex magic. They give examples of some wounded cartoon flowers that admit
an E-super vertex magic labeling and some others that do not. In [1775] Kumar and [1775] new
Marimuthu proved that semi-regular bipartite graphs are not E-super vertex-magic and
gave an upper bound for the maximum degree of an E-super vertex-magic graph. They
also ontained upper and lower bounds of any vertex degree d of a E-super vertex-magic
graph.
A vertex magic total labeling is said to be a V -super vertex magic labeling if f (V (G)) =
{1, 2, 3, . . . , |V |}. A graph G is called V -super vertex magic if it admits a V -super vertex
magic labeling. In [3401] Vimal Kumar and Vijayalakshmi establish the V -super vertex
magic labelings of some classes of parity graphs (that is, for every two induced paths
between the same two vertices both paths have odd length, or both have even length).
A Γ-supermagic labeling of a graph G(V, E) with |E| = k is a bijection from E to
an Abelian group Γ of order k such that the sum of labels of all incident edges of every
vertex x ∈ V is equal to the same element µ ∈ Γ. An existence of a Z2nm -supermagic
labeling of Cartesian product of two cycles, Cn × Cm for n odd was proved recently. This
along with an earlier result by Ivanč [1338] proved the existence of a Z2nm -supermagic
labeling of Cm × Cn for every m, n > 3 and conjectured that such labeling is possible for
all Cm × Cn . In [977] Fronček and McKeown present a simple unified labeling method for
Fronček [972] proved this conjecture for all m, n odd that not relatively prime. [972] new
Ponnappan, Nagaraj, and Prabakaran [2403] say a vertex magic labeling f of a
graph G(V, E) is an odd vertex magic if f maps V to {1, 3, 5, . . . , 2|V | − 1} and E to
{1, 2, 3, 4, . . . , |V | + |E|} − {1, 3, 5, . . . , 2|V | − 1} if |E| > |V | − 1) and otherwise f maps E
to {2, 4, 6, . . . , 2|E|} and V to {1, 2, 3, 4, . . . , |V | + |E|} − {2, 4, 6, . . . , 2|E|}. They prove
that Pn (n > 3), Cn and mC3 are odd vertex magic if and only if n is odd, (3, t)-kites are
vertex magic if and only if t is even, and Cn K1 are not odd vertex for all n.
A triplet [H, φ, t] is called a supermagic frame of G if φ is a homomorphism of H onto
G and t : E(H) → {1, 2, . . . , |E(H)|} is an injective mapping such that the sum of t(uw)
over all u ∈ φ−1 (v) is independent of the vertex v ∈ V (G). In 2000, Ivančo proved that
if there is a supermagic frame of a graph G, then G is supermagic. Singhun, Boonklurb,
and Charnsamorn [2982] construct a supermagic frame of m > 2 copies of the Cartesian
product of cycles and show that m copies of the Cartesian product of cycles is supermagic.
A prime-magic labeling is a magic labeling for which every label is a prime. Sedláček

the electronic journal of combinatorics (2023), #DS6 142

[2733] proved that the smallest magic constant for prime-magic labeling of K3,3 is 53
while Bača and Holländer [331] showed that the smallest magic constant for a prime-
magic labeling of K4,4 is 114. Letting σn be the smallest natural number such that nσn is
equal to the sum of n2 distinct prime numbers we have that the smallest magic constant
for a prime-magic labeling of Kn,n is σn . Bača and Hollaänder [331] conjecture that for
n > 5, Kn,n has a prime-magic labeling with magic constant σn . They proved the
conjecture for 5 6 n 6 17 and confirmed the conjecture for n = 5, 6 and 7.
Characterizations of regular magic graphs were given by Doob [847] and necessary and
sufficient conditions for a graph to be magic were given in [1378], [1543], and [805]. Some
sufficient conditions for a graph to be magic are given in [845], [3223], and [2202]. Bertault,
Miller, Pé-Rosés, Feria-Puron, and Vaezpour [549] provided a heuristic algorithm for
finding magic labelings for specific families of graphs. The notion of magic graphs was
generalized in [846] and [2693].
Let m, n, a1 , a2 , . . . , am be positive integers where 1 6 ai 6 bn/2c and the ai are dis-
tinct. The circulant graph Cn (a1 , a2 , . . . , am ) is the graph with vertex set {v1 , v2 , . . . , vm }
and edge set {vi vi+aj | 1 6 i 6 n, 1 6 j 6 m} where addition of indices is done modulo
n. In [2748] Semaničová characterizes magic circulant graphs and 3-regular supermagic
circulant graphs. In particular, if G = Cn (a1 , a2 , . . . , am ) has degree r at least 3 and
d = gcd(a1 , n/2) then G is magic if and only if r = 3 and n/d ≡ 2 (mod 4), a1 /d ≡ 1
(mod 2), or r > 4 (a necessary condition for Cn (a1 , a2 , . . . , am ) to be 3-regular is that n
is even). In the 3-regular case, Cn (a1 , n/2) is supermagic if and only n/d ≡ 2 (mod 4),
a1 /d ≡ 1 (mod 2) and d ≡ 1 (mod 2). Semaničová also notes that a bipartite graph that
is decomposable into an even number of Hamilton cycles is supermagic. As a corollary
she obtains that Cn (a1 , a2 , . . . , a2k ) is supermagic in the case that n is even, every ai is
odd, and gcd(a2j−1 , a2j , n) = 1 for i = 1, 2, . . . , 2k and j = 1, 2, . . . , k.
Ivančo, Kovář, and Semaničová-Feňovčková [1344] characterize all pairs n and r for
which an r-regular supermagic graph of order n exists. They prove that for positive
integers r and n with n > r + 1 there exists an r-regular supermagic graph of order n if
and only if one of the following statements holds: r = 1 and n = 2; 3 6 r ≡ 1 (mod 2) and
n ≡ 2 (mod 4); and 4 6 r ≡ 0 (mod 2) and n > 5. The proof of the main result is based
on finding supermagic labelings of circulant graphs. The authors construct supermagic
labelings of several circulant graphs.
In [1338] Ivančo completely determines the supermagic graphs that are the disjoint
unions of complete k-partite graphs where every partite set has the same order.
Trenklér [3225] extended the definition of supermagic graphs to include hypergraphs
and proved that the complete k-uniform n-partite hypergraph is supermagic if n 6= 2 or
6 and k > 2 (see also [3226]). In [3094] Sugiyama gave a generalized definition of magic
graphs, for which any number of digits can be used to label a vertex and edge, and de-
scribed the construction of such magic graphs and their properties. He determined the
minimum and maximum magic sums for regular graphs, including polygons and polyhe-
drons, and provided techniques for transforming and synthesizing magic graphs using an
affine transform.
For connected graphs of size at least 5, Ivančo, Lastivkova, and Semaničová [1345]

the electronic journal of combinatorics (2023), #DS6 143

provide a forbidden subgraph characterization of the line graphs that can be magic. As a
corollary they obtain that the line graph of every connected graph with minimum degree
at least 3 is magic. They also prove that the line graph of every bipartite regular graph
of degree at least 3 is supermagic.
For any non-trivial abelian group A under addition, a graph G is said to be strong
A-magic if there exists a labeling f of the edges P of G with non-zero elements of A such
that the vertex labeling f + defined as f + (v) = f (uv) taken over all edges uv incident at
v is a constant, and the constant is same for all possible values of |V (G)|. Stella Arputha
Mary, Navaneethakrishnan, and Nagarajan [3052] provide strong Z4 -magic labelings for
various graphs and strong Z4p -magic labelings for those graphs.
In [2608] Razzaq, Rizvi, and Ali introduce the concept of an H-group magic total
labeling of a graph G over a finite Abelian group A as a bijection λ : V (G)P ∪ E(G) → A
0 0 0
such
P that for any subgraph H (V , E ) 0of G isomorphic to H, the sum v∈V 0 λ(v) +
e∈E 0 λ(e) is equal to magic constant k . A graph is called H-group magic if it admits
an H-group magic total labeling. They determine the H-group magic total labelings of
fan graphs over the finite Abelian group A ∼ = Z3 × Zt , where t > 3 and show that disjoint
union of isomorphic as well as non-isomorphic copies of fan graphs are H-group magic
over A ∼ = Z3 × Zt .
For a graph G(V, E) and a set of positive integers S with |S| = |V |, Godinho, Singh,
and Arumugam [1112] say G is S-magic if there exists a bijection φ : V → S such that [1112] new
P
φ(u) over all u ∈ N (v) is a constant k for all v ∈ V . They proved that if G is S-magic,
then the corresponding magic constant is unique. They proved that several families of
graphs are S-magic and that several families are not S-magic. They also determined the
set of all S-magic constants for certain classes of graphs for different label sets S.
For a natural number h, Salehi [2675] defines a graph G to be h-magic if there is a
labeling α from the edges of G to the nonzero integers in Zh such that for each vertex
v in G the sum of all α values of edges incident to v is a constant (called the magic
sum index) that is independent of the choice of v. If the constant is 0, G is called a
zero-sum h-magic graph. The null set of graph G is the set of all natural numbers h for
which G admits a zero-sum h-magic labeling. In [2675] Salehi determines the null sets
for Kn , Km,n , Cn , books, and cycles with a Pk chord. Lin and Wang [1951] determine
the null sets of generalized wheels and generalized fans, and construct infinitely many
examples of Zh -magic graphs with magic sum zero and present some open problems.
In 2020, Kamatchi, Paramasivam, Prajeesh, Sabeel, and Arumugam [1569] introduced [1569] new
the notion group vertex magic graphs as follows. For a simple undirected graph G and
an additive Abelian group A with identity 0, a mapping f from the vertices of G to the
nonzero elements of PA is said to be an A-vertex magic labeling of G if there exists a µ in A
such that w(v) = f (u) taken over all u ∈ N (v) is µ for all vertices v of G. If G admits
such a labeling it is called an A-vertex magic graph. If G is an A-vertex magic for every
non-trivial Abelian group A, G is called a group vertex magic graph. They obtained some
necessary conditions for a graph to be group vertex magic and gave a characterization of
trees with diameter at most 4 that are Z2 × Z2 -vertex magic. In [1656] Karthik, Sabeel, [1656] new
and Paramasivama provided some necessary conditions for the group vertex magicness

the electronic journal of combinatorics (2023), #DS6 144

of graphs with at least one pendant edge and for the group vertex magicness of product
graphs. They also characterized group vertex magicness of trees of diameter up to 5 for all
infinite Abelian groups with finitely many elements of finite order. Sabeel, Paramasivam,
Prajeesh, Kamatchi, and Arumugam [2665] characterized the Z2 × Z2 -vertex magicness [2665] new
of any tree with diameter 5. They further characterized A-vertex magic trees of diameter
at most 5 for any finite abelian group A and proved that A-vertex magic graphs do not
possess any forbidden structures. They gave a method for constructing larger A-vertex
magic graphs from the existing ones. Balamoorthy, Bharanedhar, and Kamatchi [277] [277] new
obtained various results about the A-vertex magicness for graphs formed using joins,
tensor products, and lexicographic products of graphs. Kavitha and Stella Arputha Mary
[1678] say a vertex magic labeling of V4 (Z2 × Z2 ) is a hefty V4 -magic if its magic number [1678] new
is 1. They proved regular graphs, Kn (n > 3). vertex transitive graphs, and Cm × Cn
are hefty V4 -magic graphs and connected acyclic graphs are not V4 -magic graphs. Stella
Arputha Mary, Navaneetha Krishnan, and Nagarajan [2108] proved that triangular snakes, [2108] new
books, the one-point union of the apexes of t fans, and the splitting graph of paths, are
Z4p -magic graphs. In [1945] Liao and and Liu provided characterizations of unicyclic [1945] new
graphs with diameter at most 4 that are A-vertex magic and a characterization of bicyclic
graphs of diameter 3 thatb are group vertex magic.
In 1976 Sedláček [2733] defined a connected graph with at least two edges to be pseudo-
magic if there exists a real-valued function on the edges with the property that distinct
edges have distinct values and the sum of the values assigned to all the edges incident to
any vertex is the same for all vertices. Sedláček proved that when n > 4 and n is even,
the Möbius ladder Mn is not pseudo-magic and when m > 3 and m is odd, Cm × P2 is
not pseudo-magic.
A vertex magic total labeling of a graph with p vertices and q edges is a bijection
from the union of the vertex set and edge set to the consecutive integers 1, 2, . . . , p + q
with the property that for every vertex u, the sum of the label of u and the labels of
the edges incident with u is a constant k. A vertex magic total labeling is said to be a-
vertex multiple magic if the set of the labels of the vertices is {a, 2a, . . . , na} and is b-edge
multiple magic b-edge multiple magic if the set of labels of the edges is {b, 2b, . . . , mb}.
Nagaraj, Ponnappan, and Prabakaran [2251] provide properties of a-vertex multiple magic
graphs and b-edge multiple magic graphs. In [3579] Zhang and Wang verify the existence
of E-super vertex magic total labeling for odd regular graphs containing a particular 3-
factor. Listiana, Darmaji, and Slamin [1959] investigated the existence of vertex magic [1959] new
total labelings of directed sun graphs Sn = Cn K1 and mSn .
Kong, Lee, and Sun [1736] used the term “magic labeling” for a labeling of the edges
with nonnegative integers such that for each vertex v the sum of the labels of all edges
incident with v is the same for all v. In particular, the edge labels need not be distinct.
They let M (G) denote the set of all such labelings of G. For any L in M (G), they let
s(L) = max{L(e) | e ∈ E} and define the magic strength of G as m(G) = min{s(L) | L ∈
M (G)}. To distinguish these notions from others with the same names and notation,
which we will introduced in the next section for labelings from the set of vertices and
edges, we call the Kong, Lee, and Sun version the edge magic strength and use em(G)

the electronic journal of combinatorics (2023), #DS6 145

for min{s(L) : L in M (G)} instead of m(G). Kong, Lee, and Sun [1736] use DS(k) to
denote the graph obtained by taking two copies of K1,k and connecting the k pairs of
corresponding leafs. They show: for k > 1, em(DS(k)) = k − 1; em(Pk + K1 ) = 1 for
k = 1 or 2, em(Pk + K1 ) = k if k is even and greater than 2, and 0 if k is odd and
greater than 1; for k > 3, em(W (k)) = k/2 if k is even and em(W (k)) = (k − 1)/2
if k is odd; em(P2 × P2 ) = 1, em(P2 × Pn ) = 2 if n > 3, em(Pm × Pn ) = 3 if m or
(n)
n is even and greater than 2; em(C3 ) = 1 if n = 1 (Dutch windmill, – see §2.4), and
(n)
em(C3 ) = 2n − 1 if n > 1. They also prove that if G and H are magic graphs then
G × H is magic and em(G × H) = max{em(G), em(H)} and that every connected graph
is an induced subgraph of a magic graph (see also [891] and [932]). They conjecture that
almost all connected graphs are not magic.
In [1284] Ichishima, López, Muntaner-Batle, and Takahashi introduce the parameter [1284] new
l(n) as the minimum size of a graph G of order n for which all graphs of order n and size
at least l(n) have µs (G) = +∞, and provide lower and upper bounds for l(G). Imran,
Baig, and Feňovčiková, [1318] established that for n = 0 (mod 4), µs (Cn ×K2 ) 6 3n/2−1. [1318] new
Ichishima, López, Muntaner-Batle, and Takahashi, improve this bound by showing that
µs (n) + 1 when > 4 is even. Enomoto, Lladó, Nakamigawa, and Ringel [891] posed the
conjecture that every nontrivial tree is super edge-magic. They propose a new approach
to attack this conjecture. They believe that their approach may also help to resolve the
conjecture by Graham and Sloane that every nontrivial tree is harmonious [1147]. Huang,
Hanif, Siddiqui, and Nadeem, [1273] showed the super edge-magicness of certain types of [1273] new
generalized combs and disjoint unions of generalized combs and stars.
Recall a lexicographic product of two graphs G1 and G2 is a graph that arises from G1
by replacing each vertex of G1 by a copy of the G2 and each edge of G1 with Kn,n where
n is the order of G2 . Sun and Lee [3130] show that the Cartesian, conjunctive, normal,
lexicographic, and disjunctive products of two magic graphs are magic and the sum of
two magic graphs is magic. They also determine the edge magic strengths of the products
and sums in terms of the edge magic strengths of the components graphs. In [1878] Lee,
Saba, and Sun show that the edge magic strength of Pnk is 0 when k and n are both odd.
In [136] Akka and Warad define the super magic strength of a graph G, sms(G) as the
minimum of all magic constants c(f ) where the minimum is taken over all super magic
labeling f of G if there exist at least one such super magic labeling. They determine
the super magic strength of paths, cycles, wheels, stars, bistars, Pn2 , < K1,n : 2 > (the
graph obtained by joining the centers of two copies of K1,n by a path of length 2), and
(2n + 1)P2 .
For a simple graph G(V, E) a bijection f from V ∪E to {1, 2, . . . , |V |+|E|} is said to be
edge-magic total labeling of G, if there exists an integer k such that f (u)+f (uv)+f (v) = k
for every edge uv ∈ E. If, in addition, f (V ) = {1, 2, . . . , |V |}, f is said to be an super
edge-magic total labeling. Deeothi [795] investigated the super edge-magic total strength [795] new
of the family of unicyclic graphs having an odd cycle a varying number of pendant vertices
adjacent to each vertex.
A Halin graph ia a planar 3-connected graphs that consist of a tree and a cycle
connecting the end vertices of the tree. Let G be a (p, q)-graph in which the edges are

the electronic journal of combinatorics (2023), #DS6 146

labeled k, k + 1, . . . , k + q − 1, where k > 0. In [1896] Lee, Su, and Wang define a graph
with p vertices to be k-edge-magic for every vertex v the sum of the labels of the incident
edges at v are constant modulo p. They investigate some classes of Halin graphs that
are k-edge-magic. Lee, Su, and Wang [1898] investigated some classes of cubic graphs
that are k-edge-magic andb provided a counterexample to a conjecture that any cubic
graph of order p ≡ 2 (mod 4) is k-edge-magic for all k. Shiu and Lau [2912] gave some
necessary conditions for families of wheels with certain spokes missing to admit k-edge-
magic labelings.
Lau, Alikhani, Lee, and Kocay [1802] (see also [159]) show that maximal outerplanar
graphs of orders p = 4, 5, 7 are k-edge magic if and only if k ≡ 2 (mod p) and determined all
maximal outerplanar graphs that are k-edge magic for k = 3 and 4. They also characterize
all (p, p − h)-graphs that are k-edge magic for h > 0 and conjecture that a maximal
outerplanar graph of prime order p is k-edge magic if and only if k ≡ 2 (mod p).
S. M. Lee and colleagues [1917] and [1849] call a graph G k-magic if there is a labeling
from the edges of G to the set {1, 2, . . . , k − 1} such that for each vertex v of G the sum
of all edges incident with v is a constant independent of v. The set of all k for which G
is k-magic is denoted by IM(G) and called the integer-magic spectrum of G. In [1917]
Lee and Wong investigate the integer-magic spectrum of powers of paths. They prove:
IM(P42 ) is {4, 6, 8, 10, . . .}; for n > 5, IM(Pn2 ) is the set of all positive integers except 2; for
d
all odd d > 1, IM(P2d ) is the set of all positive integers except 1; IM(P43 ) is the set of all
positive integers; for all odd n > 5, IM(Pn3 ) is the set of all positive integers except 1 and
2; and for all even n > 6, IM(Pn3 ) is the set of all positive integers except 2. For k > 3 they
conjecture: IM(Pnk ) is the set of all positive integers when n = k + 1; the set of all positive
integers except 1 and 2 when n and k are odd and n > k; the set of all positive integers
except 1 and 2 when n and k are even and k > n/2; the set of all positive integers except
2 when n is even and k is odd and n > k; and the set of all positive integers except 2
when n and k are even and k 6 n/2. In [1894] Lee, Su, and Wang showed that besides the
natural numbers there are two types of the integer-magic spectra of honeycomb graphs.
Fu, Jhuang and Lin [989] determine the integer-magic spectra of graphs obtained from
attaching a path of length at least 2 to the end vertices of each edge of a cycle.
In [1849] Lee, Lee, Sun, and Wen investigated the integer-magic spectrum of various
graphs such as stars, double stars (trees obtained by joining the centers of two disjoint
stars K1,m and K1,n with an edge), wheels, and fans. In [2678] Salehi and Bennett report
that a number of the results of Lee et al. are incorrect and provide a detailed accounting
of these errors as well as determine the integer-magic spectra of caterpillars. Shiu and
Low [2929] determined the integer-magic spectra and null sets of the Cartesian product
of two trees.
Lee, Lee, Sun, and Wen [1849] use the notation Cm @Cn to denote the graph obtained
by starting with Cm and attaching paths Pn to Cm by identifying the endpoints of the
paths with each successive pairs of vertices of Cm . They prove that IM(Cm @Cn ) is the
set of all positive integers if m or n is even and IM(Cm @Cn ) is the set of all even positive
integers if m and n are odd.
Lee, Valdés, and Ho [1905] investigate the integer magic spectrum for special kinds

the electronic journal of combinatorics (2023), #DS6 147

of trees. For a given tree T they define the double tree DT of T as the graph obtained
by creating a second copy T ∗ of T and joining each end vertex of T to its corresponding
vertex in T ∗ . They prove that for any tree T, IM(DT ) contains every positive integer
with the possible exception of 2 and IM(DT ) contains all positive integers if and only if
the degree of every vertex that is not an end vertex is even. For a given tree T they define
ADT , the abbreviated double tree of T , as the the graph obtained from DT by identifying
the end vertices of T and T ∗ . They prove that for every tree T , IM(ADT ) contains every
positive integer with the possible exceptions of 1 and 2 and IM(ADT ) contains all positive
integers if and only if T is a path.
Lee, Salehi, and Sun [1880] have investigated the integer-magic spectra of trees with
diameter at most four. Among their findings are: if n > 3 and the prime power factor-
ization of n − 1 = pr11 pr22 · · · prkk , then IM(K1,n ) = p1 N ∪ p2 N ∪ · · · ∪ pk N (here pi N
means all positive integer multiples of pi ); for m, n > 3, the double star IM(DS(m, m))
(that is, stars Km,1 and Kn,1 that have an edge in common) is the set of all natural num-
bers excluding all divisors of m − 2 greater than 1; if the prime power factorization of
m − n = p1r1 pr22 · · · prkk and the prime power factorization of n − 2 = ps11 ps22 · · · pskk , (the ex-
ponents are permitted to be 0) then IM(DS(m, n)) = A1 ∪A2 ∪· · ·∪Ak where Ai = p1+s i
i
N
if ri > si > 0 and Ai = ∅ if si > ri > 0; for m, n > 3, IM(DS(m, n)) = ∅ if and only
if m − n divides n − 2; if m, n > 3 and |m − n| = 1, then DS(m, n) is not magic. Lee
and Salehi [1879] give formulas for the integer-magic spectra of trees of diameter four but
they are too complicated to include here.
For a graph G(V, E) and a function f from the V to the positive integers, Salehi
and Lee [2682] define the functional extension of G by f , as the graph H with
V (H) = ∪{ui | u ∈ V (G) and i = 1, 2, . . . , f (u)} and E(H) = ∪{ui uj | uv ∈ E(G), i =
1, 2, . . . , f (u); j = 1, 2, . . . , f (v)}. They determine the integer-magic spectra for P2 , P3 ,
and P4 .
A reverse edge magic (REM) labeling of a graph G(V, E) with p vertices and q edges
is a bijection f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that k = f (uv) − (f (u) + f (v)) is a
constant k for any edge uv ∈ E(G). A REM labeling f is called reverse super edge magic
(RSEM) labeling if f (V (G)) = {1, 2, 3, . . . , p} and f (E(G)) = {p+1, p+2, p+3, . . . , p+q}.
Reddy and Sharief Basha [2609] find some new classes of RSEM labeling and investigate
the connection between the RSEM labeling and different classes of labelings.
More specialized results about the integer-magic spectra of amalgamations of stars
and cycles are given by Lee and Salehi in [1879].

Table 5 summarizes the state of knowledge about magic-type labelings. In the table,
SM means semi-magic, M means magic, and SPM means supermagic. A question mark
following an abbreviation indicates that the graph is conjectured to have the corresponding
property. The table was prepared by Petr Kovář and Tereza Kovářová.

the electronic journal of combinatorics (2023), #DS6 148

 Table 5: Summary of Magic Labelings

Graph Types Notes

Kn M if n = 2, n > 5 [3053]
SPM for n > 5 iff n > 5
n 6≡ 0 (mod 4) [3054]

Km,n SM if n > 3 [3053]

Kn,n M if n > 3 [3053]

fans fn M iff n is odd, n > 3 [3053]

not SM if n > 2 [1076]

wheels Wn M if n > 4 [3053]

SM if n = 5 or 6 [1076]

wheels with one M if n = 4, n > 6 [3053]

spoke deleted

null graph with n vertices

Möbius ladders Mn SPM if n > 3, n is odd [2733]

Cn × P 2 not SPM for n > 4, n even [2733]

Cm [K n ] SPM if m > 3, n > 2 [2908]

Kn, n, . . . , n SPM n > 3, p > 5 and

| {z }
p

p 6≡ 0 (mod 4) [2908]

composition of r-regular SPM if n > 3 [2908]

SPM graph and K n

Kk [K n ] SPM if k = 3 or 5, n = 2 or n odd [1249]

mKn,n SPM for n > 2 iff n is even or

both n and m are odd [2905]

Qn SPM iff n = 1 or n > 2 even [1338]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 149

 Table 5 – Continued from previous page
Graph Types Notes
Cm × Cn SPM m = n or m and n are even [1338]

Cm × Cn SPM? for all m and n [1338]

connected (p, q)-graph M iff 5p/4 < q 6 p(p − 1)/2 [3224]

other than P2

Gi M |G| > 5, i > 3 [3227]

G2 M G 6= P5 and G does not

have a 1-factor whose every edge
is incident with an
end-vertex of G [3227]

K1,m,n M for all m, n [2759]

Pn2 M for all n except 2, 3, 5 [2759], [1076]

G×H M iff G and H are magic [1736]

5.2 Edge-magic Total and Super Edge-magic Total Labelings

In 1970 Kotzig and Rosa [1743] defined a magic valuation of a graph G(V, E) as a bijection
f from V ∪ E to {1, 2, . . . , |V ∪ E|} such that for all edges xy, f (x) + f (y) + f (xy) is
constant (called the magic constant). This notion was rediscovered by Ringel and Lladó
[2626] in 1996 who called this labeling edge-magic. To distinguish between this usage from
that of other kinds of labelings that use the word magic we will use the term edge-magic
total labeling as introduced by Wallis [3407] in 2001. (We note that for 2-regular graphs
a vertex-magic total labeling is an edge-magic total labeling and vice versa.) Kotzig and
Rosa proved: Km,n has an edge-magic total labeling for all m and n; Cn has an edge-
magic total labeling for all n > 3 (see also [1108], [2638], [542], and [891]); and the disjoint
union of n copies of P2 has an edge-magic total labeling if and only if n is odd. They
further state that Kn has an edge-magic total labeling if and only if n = 1, 2, 3, 5, or 6
(see [1744], [755], and [891]) and ask whether all trees have edge-magic total labelings.
Wallis, Baskoro, Miller, and Slamin [3411] enumerate every edge-magic total labeling of
complete graphs. They also prove that the following graphs are edge-magic total: paths,
crowns, complete bipartite graphs, and cycles with a single edge attached to one vertex.
Enomoto, Llado, Nakamigana, and Ringel [891] prove that all complete bipartite graphs
are edge-magic total. They also show that wheels Wn are not edge-magic total when n ≡ 3
(mod 4) and conjectured that all other wheels are edge-magic total. This conjecture was

the electronic journal of combinatorics (2023), #DS6 150

proved when n ≡ 0, 1 (mod 4) by Phillips, Rees, and Wallis [2393] and when n ≡ 6 (mod
8) by Slamin, Bača, Lin, Miller, and Simanjuntak [2996]. Fukuchi [995] verified all cases
of the conjecture independently of the work of others. Slamin et al. further show that
all fans are edge-magic total. In 2002 Lee and Kong [1845] conjectured that odd star
forests are super edge magic. In 2019 Cerioli, Fernandes, Lee, Lintzmayer, Mota, and
da Silva [657] proved this conjecture for odd symmetric star forests and proved that odd
uniform forests of catterpillars are edge-magic. Afzal, Ather, Baig, and Maheshwari [63]
analyzed pyramidion ladders and Cn -books for their super edge-magicness and gave some
methods for finding new super edge-magic graphs from existing ones. In [785] Darmaji [785] new
and Saputro use G(+)Pm (+)H (m > 2) to denote the graph obtained by taking one copy
of the graphs G, H, and Pm , then connecting one endpoint of Pm to all vertices of G and
the other endpoint of Pm to all vertices of H. For any super edge-magic total graphs G,
they provide some graphs H such that G(+)Pm (+)H is also super edge-magic total. They
further show how to construct a super edge-magic total graph from a super edge-magic
total graph by considering a super edge-magic labeling of the original graph. In [1291] [1291] new
Ichishima and Muntaner-Batle study the super edge-magicness of graphs of order n with
degree sequences: 4, 2, 2, . . . , 2. They also investigate the super edge-magic properties of
certain families of graphs.
In [1650] Kanwal, Riasat, Imtiaz, Iftikhar, Javed, and Ashraf define a fork as the graph
obtained by starting with three paths of length t with vertices x1,j , x2,j , x3,j , 1 6 j 6 t, a
single new edge x2,0 adjacent to x2,1 , an edge joining x1,1 and x2,1 and an edge joining x2,1
and x3,1 . They gave super edge-magic total labelings and deficiencies of forks, the disjoint
union of a fork with a star, a bistar, and a path, and of trees obtained by starting with
two copies of P2t+1 and adding an edge joining the middle vertex of each path. The super
edge-magic total labeling strengths of forks and the trees are also determined. Girija
and Karthikeyan [1103] proved that 3 copies of the jelly fish graphs are super edge magic
graphs.
Inspired by Kotzig-Rosa’s notion, Enomoto, Lladó, Nakamigawa, and Ringel [891]
called a graph G(V, E) with an edge-magic total labeling that has the additional property
that the vertex labels are 1 to |V | a super edge-magic total labeling (SEMT). Kanwal and
Kanwal [1649] determined super edge-magic total labelings and deficiencies for forests
formed by two sided generalized combs, stars, combs, and banana trees. A two-sided
generalized comb Cb2a,b , where b is odd, is obtained from a path Pa+1 by attaching two
paths P(b+1)/2 to each of the vertices of degree two and one vertex of degree one of Pa+1 .
In [1645] Kanwal, Azam, and Iftikhar investigate the SEMT strength of generalized comb
and the SEMT labeling and deficiency of forests composed of two components, where
one of the components for each forest is a generalized comb and other component is star,
bistar, comb, or path. In [1647] Kanwal, Imtiaz, Iftikhar, Ashraf, Arshad, Irfan, and
Sumbal z studied the super edge-magic deficiency of paths, caterpillars, and the disjoint
union of a 2-sided generalized comb with a bistar. They also provide the super edge-magic
total strength for a 2-sided generalized comb. Javed, Riasat, and Kanwal [1366] study
super edge-magic total labeling and deficiencies of forests consisting of combs, generalized
combs, and stars. Their results provide the evidence to support a conjecture proposed

the electronic journal of combinatorics (2023), #DS6 151

by Figueroa-Centeno, Ichishima, and Muntaner-Bartle [937]. Cerioli, Fernandes, Lee,
Lintzmayer [656] proved certain forests of stars admit a super edge-magic labeling and
that certain forests of caterpillars admit an edge-magic labeling.
Baskoro, Sudarsana, and Cholily [512] provided some constructions of new super edge-
magic graphs from some old ones by attaching 1, 2, or 3 pendent vertices and edges. In
[1700] Kim introduces a new construction of new super edge-magic graphs by attaching
any number pendent vertices and edges under some conditions. In [785] Darmaji and [785] new
Saputro define a graph G(+)Pm (+)H where m > 2 as a graph obtained by taking one
copy of the graphs G and H and Pm , then connect an end point of Pm to all vertices of
G and the other end Pm to all vertices of H. For any super edge-magic total graphs G,
they provide some graphs H such that G(+)Pm (+)H is also super edge-magic total. They
further show how to construct a super edge-magic total graph from a super edge-magic
total graph by considering a super edge-magic labeling of the origin graph. One such
instance is (P2n ∪ mK1 ) + 2K1 .
Ringel and Llado [2626] prove that a graph with p vertices and q edges is not edge-
magic total if q is even and p + q ≡ 2 (mod 4) and each vertex has odd degree. Ringel
and Llado conjecture that trees are edge-magic total. In [502] Baskar Babujee and Rao
show that the path with n vertices has an edge-magic total labeling with magic constant
(5n + 2)/2 when n is even and (5n + 1)/2 when n is odd. For stars with n vertices they
provide an edge-magic total labeling with magic constant 3n. In [904] Eshghi and Azimi
discuss a zero-one integer programming model for finding edge-magic total labelings of
large graphs.
Santhosh [2713] proved that for n odd and at least 3, the crown Cn P2 has an
edge-magic total labeling with magic constant (27n + 3)/2 and for n odd and at least 3,
Cn P3 has an edge-magic total labeling with magic constant (39n + 3)/2. Ngurah and
Adiwijaya [2286] investigated whether various classes of chain graphs formed from ladders,
triangular ladders, diagonal ladders, C4 , and K4 have an edge-magic or super edge-magic
labelings. Baig and Afzal [274] investigated the super edge-magicness of special classes of
graphs having maximum magic constant k = 3p.
In [955] Freyberg introduced a generalization of edge-magic total labeling that allows
multiple labels on the vertices or edges of a graph. He used this new labeling as a tool to
construct face-magic labelings of some infinite families of graphs. He then considered the
question “Given a graph G, for which a, b, c ∈ {0, 1} does G admit a face-magic labeling
of type (a, b, c)? He completely answered this question for two families of chained cycles,
ladders and subdivided ladders, fans and subdivided fans, and wheels and subdivided
wheels. See [956] for some corrections for these results. Freyberg [957] provided (1, 1, 1)- [956] new
face-magic labelings for square tilings, hexagon tilings on a torus, and a special class of [957] new
triangle tilings on a cylinder.
Ahmad, Baig, and Imran [100] define a zig-zag triangle as the graph obtained from the
path x1 , x2 , . . . , xn by adding n new vertices y1 , y2 , . . . , yn and new edges y1 x1 , yn xn−1 ; xi yi
for 1 6 i 6 n; yi xi−1 yi xi+1 for 2 6 i 6 n − 1. They define a graph Cbn as one obtained
from the path x1 , x2 , . . . , xn adding n − 1 new vertices y1 , y2 , . . . , yn−1 and new edges
yi xi+1 for 1 6 i 6 n − 1. The graph Cb∗n is obtained from the Cbn by joining a new

the electronic journal of combinatorics (2023), #DS6 152

edge x1 y1 . They prove that zig-zag triangles, graphs that are the disjoint union of a star
and a banana tree, certain disjoint unions of stars, and for n > 4, Cb∗n ∪ Cbn−1 are super
edge-magic total. Baig, Afzal, Imran, and Javaid [275] investigate the existence of super
edge-magic labeling of volvox and pancyclic graphs.
The super edge-magic deficiency of a graph G, denoted by µs (G), is either the minimum
nonnegative integer n such that G∪nK1 is super edge-magic or +∞ if there exists no such
n. Krisnawati, Ngurah, Hidayat, and Alghofari [1759] investigated the super edge-magic
deficiency of forests whose components are subdivided stars or paths. Imran, Afzal, and
Baig investigate the super edge-magic deficiency of volvox and dumbbell type graphs in
[1316]. Kanwal, Iftikhar, and Azam [1646] found super edge magic total labelings and
deficiencies of forests consisting of two components, where one of the components for each
forest is a generalized comb and the other component is a star, bistar, comb, or path.
They also investigated the super edge magic total strength of generalized combs.
Let G be a graph with p vertices with V (G) = {v1 , v2 , . . . , vp } and let Sm be the star
with m leaves. If in G, every vertex vi is identified to the center vertex of Smi , for some
mi > 0, 1 6 i 6 n, where S0 = K1 , then the graph obtained is denoted by G(m1 ,m2 ,...,mp ) .
Let M (G) = {(m1 , m2 , . . . , mp ) | G(m1 ,m2 ,...,mp ) is a super edge-magic graph}. The star
super edge-magic deficiency Sµ∗ (G) is defined as
(
min(m1 ,m2 ,...,mp ) (m1 + m2 + · · · + mp ) if M (G) 6= ∅,
Sµ∗ (G) =
+∞, if M (G) = ∅.

In [1675] Kathiresan and Sabarimalai Madha determine the star super edge-magic defi-
ciency of certain classes of graphs. In [1760] Krisnawati, Ngurah, Hidayat, and Alghofar
showed that some subdivisions of double stars have zero (consecutively) super edge-magic
deficiency.
Beardon [518] extended the notion of edge-magic total to countable infinite graphs
G(V, E) (that is, V ∪ E is countable). His main result is that a countably infinite tree
that processes an infinite simple path has a bijective edge-magic total labeling using the
integers as labels. He asks whether all countably infinite trees have an edge-magic total
labeling with the integers as labels and whether the graph with the integers as vertices
and an edge joining every two distinct vertices has a bijective edge-magic total labeling
using the integers.
Cavenagh, Combe, and Nelson [663] investigate edge-magic total labelings of countably
infinite graphs with labels from a countable Abelian group A. Their main result is that
if G is a countable graph that has an infinite set of mutually disjoint edges and A is
isomorphic to a countable subgroup of the real numbers under addition then for any k in
A there is an edge-magic labeling of G with elements from A that has magic constant k.
Balakrishnan and Kumar [413] proved that the join of Kn and two disjoint copies of K2
is edge-magic total if and only if n = 3. Yegnanarayanan [3534] has proved the following
graphs have edge-magic total labelings: nP3 where n is odd; Pn + K1 ; Pn × C3 (n > 2);
the crown Cn K1 ; and Pm × C3 with n pendent vertices attached to each vertex of
the outermost C3 . He conjectures that for all n, Cn Kn , the n-cycle with n pendent

the electronic journal of combinatorics (2023), #DS6 153

vertices attached at each vertex of the cycle, and nP3 have edge-magic total labelings. In
fact, Figueroa-Centeno, Ichishima, and Muntaner-Batle, [939] have proved the stronger
statement that for all n > 3, the corona Cn Km admits an edge-magic labeling where
the set of vertex labels is {1, 2, . . . , |V |}. (See also [2073].)
Yegnanarayanan [3534] also introduces several variations of edge-magic labelings and
provides some results about them. Kotzig [3409] provides some necessary conditions for
graphs with an even number of edges in which every vertex has odd degree to have an
edge-magic total labeling. Craft and Tesar [755] proved that an r-regular graph with r odd
and p ≡ 4 (mod 8) vertices can not be edge-magic total. Wallis [3407] proved that if G is
an edge-magic total r-regular graph with p vertices and q edges where r = 2t s + 1 (t > 0)
and q is even, then 2t+2 divides p.
Figueroa-Centeno, Ichishima, and Muntaner-Batle [933] have proved the following
graphs are edge-magic total: P4 ∪ nK2 for n odd; P3 ∪ nK2 ; P5 ∪ nK2 ; nPi for n odd
and i = 3, 4, 5; 2Pn ; P1 ∪ P2 ∪ · · · ∪ Pn ; mK1,n ; Cm nK1 ; K1 nK2 for n even;
W2n ; K2 × K n , nK3 for n odd (the case nK3 for n even and larger than 2 is done
in [2114]); binary trees, generalized Petersen graphs (see also [2288]), ladders (see also
[3470]), books, fans, and odd cycles with pendent edges attached to one vertex.
In [939] Figueroa-Centeno, Ichishima, Muntaner-Batle, and Oshima, investigate super
edge-magic total labelings of graphs with two components. Among their results are:
C3 ∪ Cn is super edge-magic total if and only if n > 6 and n is even; C4 ∪ Cn is super
edge-magic total if and only if n > 5 and n is odd; C5 ∪ Cn is super edge-magic total if
and only if n > 4 and n is even; if m is even with m > 4 and n is odd with n > m/2 + 2,
then Cm ∪ Cn is super edge-magic total; for m = 6, 8, or 10, Cm ∪ Cn is super edge-magic
total if and only if n > 3 and n is odd; 2Cn is strongly felicitous if and only if n > 4 and n
is even (the converse was proved by Lee, Schmeichel, and Shee in [1881]); C3 ∪ Pn is super
edge-magic total for n > 6; C4 ∪ Pn is super edge-magic total if and only if n 6= 3; C5 ∪ Pn
is super edge-magic total for n > 4; if m is even with m > 4 and n > m/2+2 then Cm ∪Pn
is super edge-magic total; Pm ∪ Pn is super edge-magic total if and only (m, n) 6= (2, 2)
or(3,3); and Pm ∪ Pn is edge-magic total if and only (m, n) 6= (2, 2). In [2634] Rizvi, Ali,
Iqbal, and Gulraze give super edge-magic total labelings of forests whose components are
caterpillars and stars, forests whose components are stars and banana trees, and a new
families of trees.
Enomoto, Llado, Nakamigawa, and Ringel [891] conjecture that if G is a graph of order
n + m that contains Kn , then G is not edge-magic total for n  m. Wijaya and Baskoro
[3470] proved that Pm × Cn is edge-magic total for odd n at least 3. Ngurah and Baskoro
[2288] state that P2 × Cn is not edge-magic total. Hegde and Shetty [1225] have shown
that every Tp -tree (see §4.4 for the definition) is edge-magic total. Ngurah, Simanjuntak,
and Baskoro [2298] show that certain subdivisions of the star K1,3 have edge-magic total
labelings. Ali, Hussain, Shaker, and Javaid [156] provide super edge-magic total labelings
of subdivisions of stars K1,p for p > 5. In [2293] Ngurah, Baskoro, Tomescu gave methods
for construction new (super) edge-magic total graphs from old ones by adding some new
pendent edges. They also proved that K1,m ∪ Pn m is super edge-magic total. Wallis [3407]
proves that a cycle with one pendent edge is edge-magic total. In [3407] Wallis poses a

the electronic journal of combinatorics (2023), #DS6 154

large number of research problems about edge-magic total graphs.
For n > 3, López, Muntaner-Batle, and Rius-Font [1993] (see [1994] for (corrigen-
dum) let Sn denote the set of all super edge-magic total 1-regular labeled digraphs of
order n where each vertex takes the name of the label that has been assigned to it. For
π ∈ Sn . they define a generalization of generalized Petersen graphs that they denote
by GGP (n; π), which consists of an outer n-cycle x0 , x1 , . . . , xn−1 , x0 , a set of n-spokes
xi yi , 0 6 i 6 n − 1, and n inner edges defined by yi yπ(i) , i = 0, . . . , n − 1. Notice that, for
the permutation π defined by π(i) = i + k (mod n) we have GGP (n; π) = P (n; k). They
define a second generalization of generalized Petersen graphs, GGP (n; π2 , . . . , πm ), as the
j
graphs with vertex sets ∪m 1 1 1
j=1 {xi : i = 0, . . . , n − 1}, an outer n-cycle x0 , x1 , . . . , xn−1 , x0 ,
1

and inner edges xij−1 xji and xji xjπj (i) , for j = 2, . . . , m, and i = 0, . . . , n − 1. Notice that,
GGP (n; π2 , . . . , πm ) = Pm × Cn , when πj (i) = i + 1 (mod n) for every j = 2, . . . , m.
Among their results are the Petersen graphs are super edge-magic total; for each m with
1 < l 6 m and 1 6 k 6 2, the graph GGP (5; π2 , . . . , πm ), where πi = σ1 for i 6= l and
πl = σk , is super edge-magic total; for each 1 6 k 6 2, the graph P (5n; k + 5r) where r
is the smallest integer such that k + 5r = 1 (mod n) is super edge-magic total.
A w-graph, W (n), has vertices {(c1 , c2 , b, w, d) ∪ (x1 , x2 , . . . , xn ) ∪ (y 1 , y 2 , . . . , y n )} and
edges {(c1 x1 , c1 x2 , . . . , c1 xn ) ∪ (c2 y 1 , c2 y 2 , . . . , c2 y n ) ∪ (c1 b, c1 w) ∪ (c2 w, c2 d)}. A w-tree,
W T (n, k), is a tree obtained by taking k copies of a w-graph W (n) and a new vertex a
and joining a with in each copy d where n > 2 and k > 3. An extended w-tree Ewt(n, k, r)
is a tree obtained by taking k copies of an extended w-graph Ew(n, r) and a new vertex a
and joining a with the vertex d in each of the k copies for n > 2, k > 3 and r > 2. Super
edge-magic total labelings for w-trees, extended w-trees, and disjoint unions of extended
w-trees are given in [1363], [1360], and [155]. Javaid, Hussain, Ali, and Shaker [1364]
provided super edge-magic total labelings of subdivisions of K1,4 and w-trees. Shaker,
Rana, Zobair, and Hussain [2856] gave a super edge-magic total labeling for a subdivided
star with a center of degree at least 4.
In 1988 Godbod and Slater [1108] made the following conjecture. If n is odd, n 6= 5,
Cn has an edge magic labeling with valence k, when (5n + 3)/2 6 k 6 (7n + 3)/2. If n
is even, Cn has an edge-magic labeling with valence k when 5n/2 + 2 6 k 6 7n/2 + 1.
Except for small values of n, very few valences for edge-magic labelings of Cn are known.
In [1998] López, Muntaner-Batle, and Rius-Font use the ⊗h -product in order to prove
the following two results. Let n = pα1 1 pα2 2 · · · pαk k be the unique prime factorization of an
odd number n. Then Cn admits at least 1 + ki=1 αi edge-magic labelings with at least
P

1 + ki=1 αi mutually different valences. Let n = 2α pα1 1 pα2 2 · · · pαk k be the unique prime
P
factorization
Pk of an even number n, with p1P> p2 > · · · > pk . Then Cn admits at least
k
i=1 αi edge-magic labelings with at least Pk i=1 i
α mutually different valences. If α > 2
this lower bound can be improved to 1 + i=1 αi . In [1988] López, Muntaner-Batle, and
Prabu introduce a new ⊗h labeling construction that has a wider range of applications
and applies it to the magic valences of cycles and crowns.
In [3178] Swita, Rafflesia, Henni Ms, Adji, and Simanihuruk use B[(Ca , m), (Cb , n), Pt ]
to denote the graph that consists of m cycles Ca and n cycles Cb with a common
path Pt . They proved that B[(C7 , 1), (C3 , n), P2 ] admits an edge-magic total labeling,

the electronic journal of combinatorics (2023), #DS6 155

B[(Ca , 1), (C3 , n), P2 ] admits a super edge-magic total labeling for all a ≡ 3 mod 4 (a > 3),
and B[(C7 , 2), (C3 , n), P2 ] admits a super edge-magic total labeling.
In 1996 Erdős asked for M (n), the maximum number of edges that an edge-magic
total graph of order n can have (see [755]). In 1999 Craft and Tesar [755] gave the bound
bn2 /4c 6 M (n) 6 bn(n − 1)/2c. For large n this was improved by Pikhurko [2397] in
2006 to 2n2 /7 + O(n) 6 M (n) 6 (0.489 + · · · + o(1)n2 ).
Enomoto, Lladó, Nakamigawa, and Muntaner-Batle [891] proved that a super edge-
magic total graph G(V, E) with |V | > 4 and with girth at least 4 has at most 2|V | − 5
edges. They prove this bound is tight for graphs with girth 4 and 5 in [891] and [1308].
In his Ph.D. thesis, Barrientos [438] introduced the following notion. Let L1 , L2 , . . . , Lh
be ordered paths in the grid Pr × Pt that are maximal straight segments such that the
end vertex of Li is the beginning vertex of Li+1 for i = 1, 2, . . . , h − 1. Suppose for some
i with 1 < i < h we have V (Li ) = {u0 , v0 } where u0 is the end vertex of Li−1 and the
beginning vertex of Li and v0 is the end vertex of L1 and the beginning vertex of Li+1 .
Let u ∈ V (Li−1 ) − {u0 } and v ∈ V (Li+1 ) − {v0 }. The replacement of the edge u0 v0 by
a new edge uv is called an elementary transformation of the path Pn . A tree is called a
path-like tree if it can be obtained from Pn by a sequence of elementary transformations
on an embedding of Pn in a 2-dimensional grid. In [357] Bača, Lin, and Muntaner-Batle
proved that if T1 , T2 , . . . , Tm are path-like trees each of order n > 4 where m is odd
and at least 3, then T1 ∪ T2 , ∪ · · · ∪ Tm has a super edge-magic labeling. In [356] Bača,
Lin, Muntaner-Batle and Rius-Font proved that the number of such trees grows at least
exponentially with m. As an open problem Bača, Lin, Muntaner-Batle and Rius-Font ask
if graphs of the form T1 ∪T2 ∪· · ·∪Tm where T1 , T2 , . . . , Tm are path-like trees each of order
n > 2 and m is even have a super edge-magic labeling. In [438] Barrientos proved that all
path-like trees admit an α-valuation. Using Barrientos’s result, it is very easy to obtain
that all path-like trees are a special kind of super edge-magic by using a super edge-magic
labeling of the path Pn , and hence they are also super edge-magic. Furthermore, Figueroa-
Centeno, Ichishima, and Muntaner-Batle proved that if a tree is super edge-magic, then
it is also harmonious. Therefore all path-like trees are also harmonious. In [1990] López,
Muntaner-Batle, and Rius-Font also use a variation of the Kronecker product of matrices
in order to obtain lower bounds for the number of non isomorphic super edge-magic
labeling of some types of path-like trees. As a corollary they obtain lower bounds for the
number of harmonious labelings of the same type of trees. López, Muntaner-Batle, and
Rius-Font [1999] proved that if m > 4 is an even integer and n > 3 is an odd divisor of
m, then Cm ∪ Cn is super edge-magic. Lee and Kong conjecture that if n is an odd, then
St(a1 , a2 , . . . , an ) is super edge-magic, and they proved that the following graphs are super
edge-magic: St(m, n) (n ≡ 0 mod(m + 1)), St(1, k, n)(k = 1, 2 or n), St(2, k, n) (k =
2, 3), St(1, 1, k, n) (k = 2, 3), St(k, 2, 2, n) (k = 1, 2). Zhenbin and Chongjin [3595] proved
that St(1, m, n), St(3, m, m + 1), St(n, n + 1, n + 2) are super edge-magic, and under some
conditions St(a1 , a2 , . . . , a2n+1 ), St(a1 , a2 , . . . , a4n+1 ), St(a1 , a2 , . . . , a4n+3 ) are also super
edge-magic. In [932] Figueroa-Centeno, Ichishima, and Muntaner-Batle conjectured that
the cycle books B(4, m) that consists of m cycles C4 with a common path P2 is super
edge-magic total if and only if m is even or m ≡ 5 (mod 8). Simanihuruk, Kusmayadi,

the electronic journal of combinatorics (2023), #DS6 156

Swita, Romala, and Damanik [2957] proved this conjecture for m > 36 and m even.
For a simple graph H we say that G(V, E) admits an H-covering if every edge in E(G)
belongs to a subgraph of G that is isomorphic to H. In [2001] López, Muntaner-Batle,
Rius-Font study a relationship existing among (super) magic coverings and the Kronecker
product of matrices. (For a simple graph H, G(V, E) admits an H-covering if every edge
in E(G) belongs to a subgraph of G that is isomorphic to H.) Their results can be
applied to construct S-magic partitions. For m copies of a graph G and a fixed subgraph
H of each copy the graph I(G, H, m) is formed by taking of all the Gi ’s and identifying
their subgraph H. Liang [1939] determined which I(G, H, m) and which mG have G
supermagic coverings. Farida, Indah, and Sudiby [916] study magic coverings of domino [916] new
graphs (graphs for which every vertex is contained in at most two maximal cliques) and
edge magic labelings of domino graphs. They note that coverings can be applied to secret
sharing schemes and edge magic labelings can be applied to ruler models.
Bača, Lin and Muntaner-Batle in [355] using a generalization of the Kronecker product
of matrices prove that the number of non-isomorphic super edge-magic labelings of the
disjoint union of m copies of the path Pn , m ≡ 2 (mod 4), m > 2, n > 4, is at least
(m/2)(2n−2) .
In [1992] López, Muntaner-Batle and Rius-Font proved that every super edge-magic
graph with p vertices and q edges where q > p − 1 has an even harmonious labeling (See
Section 4.6.) In [1997] they stated some open problems concerning relationships among
super edge-magic labelings and graceful and harmonious labelings. A Langford sequence
of order m and defect d is a sequence (t1 , t2 , . . . , t2m ) of 2m numbers such that (i) for every
k ∈ [d, d + m − 1] there exist exactly two subscripts i, j ∈ [1, 2m] with ti = tj = k and (ii)
the subscripts i and j satisfy the condition |i − j| = k. López and Muntaner-Batle [1987]
provided new lower bounds on the number of distinct Langford sequences with certain
properties in terms of the number of 1-regular super edge-magic labeled digraphs of a
particular order.
Lee and Lee [1848] prove the following graphs are super edge-magic: P2n + Km , (P2 ∪
nK1 ) + K2 , graphs obtained by appending a path to the apex of a fan with at least 4
vertices (umbrella), and jelly fish graphs J(m, n) obtained from a 4-cycle v1 , v2 , v3 , v4 by
joining v1 and v3 with an edge and appending m pendent edges to v2 and n pendent
edges to v4 . In [62] Afzel introduces two new familes of graphs called carrom and jukebox
graphs and proves they admit super edge-magic labelings. Carroms are generalizations of
C n × P2 .
Marimuthu and Balakrishnan [2080] define a graph G(p, q) to be edge magic graceful if
there exists a bijection f from V (G) ∪ E(G) to {1, 2, . . . , p + q} such |f (u) + f (v) − f (uv)|
is a constant for all edges uv of G. An edge magic graceful graph is said to be super
edge magic graceful if V (G) = {1, 2, . . . , p}. They present some properties of super edge
magic graceful graphs, prove some classes of graphs are super edge magic graceful, and
prove that every super edge magic graceful graph with either f (uv) > f (u) + f (v) for all
edges uv or f (uv) < f (u) + f (v) for all edges uv is sequential, harmonious, super edge
magic and not graceful. Marimuthu, Kavitha, and Balakrishnan [2081] proved that the
generalized Petersen graphs P (n, 1) and P (n, (n − 1)/2) are super edge magic graceful

the electronic journal of combinatorics (2023), #DS6 157

when n is odd.
Let G = (V, E) be a (p, q)-linear forest. In [356] Bača, Lin, Muntaner-Batle, and Rius-
Font call a labeling f a strong super edge-magic labeling of G and G a strong super edge-
magic graph if f : V ∪E → {1, 2, . . . , p+q} with the extra property that if uv ∈ E, u0 , v 0 ∈
V (G) and dG (u, u0 ) = dG (v, v 0 ) < +∞, then we have that f (u) + f (v) = f (u0 ) + f (v 0 ). In
[110] Ahmad, López, Muntaner-Batle, and Rius-Font define the concept of strong super
edge-magic labeling of a graph with respect to a linear forest as follows. Let G = (V, E)
be a (p, q)-graph and let F be any linear forest contained in G. A strong super edge-
magic labeling of G with respect to F is a super edge-magic labeling f of G with the extra
property with if uv ∈ E(F ), u0 , v 0 ∈ V (F ) and dF (u, u0 ) = dF (v, v 0 ) < +∞ then we have
that f (u) + f (v) = f (u0 ) + f (v 0 ). If a graph G admits a strong super edge-magic labeling
with respect to some linear forest F , they say that G is a strong super edge-magic graph
with respect to F . They prove that if m is odd and G is an acyclic graph which is strong
super edge-magic with respect to a linear forest F , then mG is strong super edge-magic
with respect to F1 ∪ F2 ∪ · · · ∪ Fm , where Fi ' F for i = 1, 2, . . . , m and every regular
caterpillar is strong super edge-magic with respect to its spine.
Noting that for a super edge-magic labeling f ofPa graph G with p vertices Pp+q and q edges,
the magic constant k is given by the formula: k = ( u∈V deg(u)f (u)+ i=p+1 i)/q, López,
Muntaner-Batle
nP and Rius-Font [1991] define the set o
SG = ( u∈V deg(u)g(u) + p+q p
P
i=p+1 i)/q : the function g : V → {i} i=1 is bijective . If
dmin SG e 6 bmax SG c then the super edge-magic interval of G is the set IG =
[dmin SG e, bmax SG c] ∩ N. The super edge-magic set of G is σG = {k ∈ IG :
there exists a super edge-magic labeling of G with valence k}. López et al. call a graph
G perfect super edge-magic if IG = σG . They show that the family of paths Pn is a
family of perfect super edge-magic graphs with |IPn | = 1 if n is even and |IPn | = 2 if n is
odd and raise the question of whether there is an infinite family F1 , F2 , . . . of graphs such
that each member of the family is perfect super edge-magic and limi→+∞ |IFi | = +∞.
They show that graphs G ∼ = Cpk Kn where p > 2 is a prime is such a family. Taka-
hasi, Muntaner-Batle, and Ichishima [3185] investigated the perfect (super) edge-magic [3185] new
deficiency of K1,n
In [1992] López et al. define the irregular crown C(n; j1 , j2 , . . . , jn ) = (V, E), where
n > 2 and ji > 0 for all i ∈ {1, 2, . . . , n} as follows: V = {vi }ni=1 ∪ V1 ∪ V2 ∪ · · · ∪ Vn ,
where Vk = {vk1 , vk2 , . . . , vkjk }, if jk 6= 0 and Vk = ∅ if jk = 0, for each k ∈ {1, 2, . . . , n}
l jk n ∼
and E = {vi vi+1 }n−1 n
i=1 ∪ {v1 vn } ∪ (∪k=1,jk 6=0 {vk vk }l=1 ). In particular, they denote Cm =
C(m; j1 , j2 , . . . , jm ), where j2i−1 = n, for each i with 1 6 i 6 (m + 1)/2, and j2i = 0, for
each i, 1 6 i 6 (m − 1)/2. They prove that the graphs C3n and C5n are perfect edge-magic
for all n > 1.
López et al. [1995] define Fk -family and Ek -family of graphs as follows. The infinite
family of graphs (F1 , F2 , . . . ) is an Fk -family if each element Fn admits exactly k different
valences for super edge-magic labelings, and limn→+∞ |I(Fn )| = +∞. The infinite family
of graphs (F1 , F2 , . . . ) is an Ek -family if each element Fn admits exactly k different va-
lences for edge-magic labelings, and limn→+∞ |J(Fn )| = +∞. An easy observation is that
(K1,2 , K1,3 , . . . ) is an F2 -family and an E3 -family. They pose the two problems: for which

the electronic journal of combinatorics (2023), #DS6 158

positive integers k is it possible to find Fk -families and Ek -families? Their main results
in [1995] are that an Fk -family exits for each k = 1, 2, 3; and an Ek -family exits for each
k = 3, 4 and 7.
McSorley and Trono [2119] define a relaxed version of edge-magic total labelings of
a graph as follows. An edge-magic injection µ of a graph G is an injection µ from the
set of vertices and edges of G to the natural numbers such that for every edge uv the
sum µ(u) + µ(v) + µ(uv) is some constant kµ . They investigate κ(G), the smallest kµ
among all edge-magic injections of a graph G. They determine κ(G) in the cases that
G is K2 , K3 , K5 , K6 (recall that these are the only complete graphs that have edge-magic
total labelings), a path, a cycle, or certain types of trees. They also show that every graph
has an edge-magic injection and give bounds for κ(Kn ).
Avadayappan, Vasuki, and Jeyanthi [264] define the edge-magic total strength of a
graph G as the minimum of all constants over all edge-magic total labelings of G. We
denote this by emt(G). They use the notation < K1,n : 2 > for the tree obtained from
the bistar Bn,n (the graph obtained by joining the center vertices of two copies of K1,n
with an edge) by subdividing the edge joining the two stars. They prove: emt(P2n ) =
5n+1; emt(P2n+1 ) = 5n+3; emt(< K1,n : 2 >) = 4n+9; emt(Bn,n ) = 5n+6; emt((2n+
1)P2 ) = 9n+6; emt(C2n+1 ) = 5n+4; emt(C2n ) = 5n+2; emt(K1,n ) = 2n+4; emt(Pn2 ) =
3n; and emt(Kn,m ) 6 (m + 2)(n + 1) where n 6 m. Using an analogous definition for
super edge-magic total strength, Swaninathan and Jeyanthi [3172], [3172], [3173] provide
results about the super edge-magic strength of trees, fire crackers, unicyclic graphs, and
generalized theta graphs. Basha [289] determined the reverse super edge-magic strength
of banana trees.
Ngurah, Simanjuntak, and Baskoro [2298] show that certain subdivisions of the star
K1,3 have super edge-magic total labelings. In [891] Enomoto, Lladó, Nakamigawa and
Ringel conjectured that all trees have a super edge-magic total labeling. Ichishima,
Muntaner-Batle, and Rius-Font [1307] have shown that any tree of order p is contained
in a tree of order at most 2p − 3 that has a super edge-magic total labeling.
In [356] Bača, Lin, Muntaner-Batle, and Rius-Font use a generalization of the Kro-
necker product of matrices introduced by Figueroa-Centeno, Ichishima, Muntaner-Batle,
and Rius-Font [941] to obtain an exponential lower bound for the number of non-
isomorphic strong super edge-magic labelings of the graph mPn , for m odd and any
n, starting from the strong super edge-magic labeling of Pn . They prove that the number
of non-isomorphic strong super edge-magic labelings of the graph mPn , n > 4, is at least
5 bm
2
2 2 c + 1 where m > 3 is an odd positive integer. This result allows them to gener-
ate anSmexponential number of non-isomorphic super edge-magic labelings of the forest
∼
F = j=1 Tj , where each Tj is a path-like tree of order n and m is an odd integer.
López, Muntaner-Batle, and Rius-Font [1989] introduced a generalization of super
edge-magic graphs called super edge-magic models and prove some results about them.
Yegnanarayanan and Vaidhyanathan [3535] use the term nice (1, 1) edge-magic labeling
for a super edge-magic totalPlabeling. They prove: a super edge-magic total labeling f of
a (p, q)-graph G satisfies 2 v∈V (G) f (v)deg(v) ≡ 0 mod q; if G is (p, q) r-regular graph
(r > 1) with a super edge-magic total labeling then q is odd and the magic constant is

the electronic journal of combinatorics (2023), #DS6 159

(4p + q + 3)/2; every super edge-magic total labeling has at least two vertices of degree
less than 4; fans Pn + K1 are edge-magic total for all n and super edge-magic total if and
only if n is at most 6; books Bn are edge-magic total for all n; a super edge-magic total
(p, q)-graph with q > p is sequential; a super edge-magic total tree is sequential; and a
super edge-magic total tree is cordial. These last three results had been proved earlier by
Figueroa-Centenoa, Ichishima, and Muntaner-Batle [932].
In [3534] Yegnanarayanan conjectured that the disjoint union of 2t copies of P3 has a
(1, 1) edge-magic labeling and posed the problem of determining the values of m and n
such that mPn has a (1, 1) edge-magic labeling. Manickam and Marudai [2073] prove the
conjecture and partially settle the open problem.
Hegde and Shetty [1231] (see also [1230]) define the maximum magic strength of a
graph G as the maximum magic constant over all edge-magic total labelings of G. We use
eM t(G) to denote the maximum magic strength of G. Hegde and Shetty call a graph G
with p vertices strong magic if eM t(G) = emt(G); ideal magic if 1 6 eM t(G) − emt(G) 6
p; and weak magic if eM t(G) − emt(G) > p. They prove that for an edge-magic total
graph G with p vertices and q edges, eM t(G) = 3(p + q + 1) − emt(G). Using this result
they obtain: Pn is ideal magic for n > 2; K1,1 is strong magic; K1,2 and K1,3 are ideal
magic; and K1,n is weak magic for n > 3; Bn,n is ideal magic; (2n + 1)P2 is strong magic;
cycles are ideal magic; and the generalized web W (t, 3) (see §2.2 for the definition) with
the central vertex deleted is weak magic.
Santhosh [2713] has shown that for n odd and at least 3, eM t(Cn P2 ) = (27n + 3)/2
and for n odd and at least 3, (39n + 3)/2 6 eM t(Cn P2 ) 6 (40n + 3)/2. Moreover, he
proved that for n odd and at least 3 both Cn P2 and Cn P3 are weak magic. In [711]
Chopra and Lee provide an number of families of super edge-magic graphs that are weak
magic.
In [2219] Murugan introduces the notions of almost-magic labeling, relaxed-magic la-
beling, almost-magic strength, and relaxed-magic strength of a graph. He determines the
magic strength of Huffman trees and twigs of odd order and the almost-magic strength of
nP2 (n is even) and twigs of even order. Also, he obtains a bound on the magic strength
of the path-union Pn (m) and on the relaxed-magic strength of kSn and kPn .
Enomoto, Llado, Nakamigawa, and Ringel [891] call an edge-magic total labeling super
edge-magic if the set of vertex labels is {1, 2, . . . , |V |} (Wallis [3407] calls these labelings
strongly edge-magic). They prove the following: Cn is super edge-magic if and only if n
is odd; caterpillars are super edge-magic; Km,n is super edge-magic if and only if m = 1
or n = 1; and Kn is super edge-magic if and only if n = 1, 2, or 3. They also prove that
if a graph with p vertices and q edges is super edge-magic then, q 6 2p − 3. In [2051]
MacDougall and Wallis study super edge-magic (p, q)-graphs where q = 2p − 3. Enomoto
et al. [891] conjecture that every tree is super edge-magic. Lee and Shan [1889] have
verified this conjecture for trees with up to 17 vertices with a computer. Fukuchi, and
Oshima, [997] have shown that if T is a tree of order n > 2 such that T has diameter
greater than or equal to n − 5, then T has a super edge-magic labeling.
Various classes of banana trees that have super edge-magic total labelings have been
found by Swaminathan and Jeyanthi [3172] and Hussain, Baskoro, and Slamin [1277]. In

the electronic journal of combinatorics (2023), #DS6 160

[85] Ahmad, Ali, and Baskoro [85] investigate the existence of super edge-magic labelings
of subdivisions of banana trees and disjoint unions of banana trees. They pose three open
problems.
Kotzig and Rosa’s ([1743] and [1744]) proof that nK2 is edge-magic total when n is
odd actually shows that it is super edge-magic. Kotzig and Rosa also prove that every
caterpillar is super-edge magic. Figueroa-Centeno, Ichishima, and Muntaner-Batle prove
the following: if G is a bipartite or tripartite (super) edge-magic graph, then nG is (super)
edge-magic when n is odd [936]; if m is a multiple of n + 1, then K1,m ∪ K1,n is super edge-
magic [936]; K1,2 ∪ K1,n is super edge-magic if and only if n is a multiple of 3; K1,m ∪ K1,n
is edge-magic if and only if mn is even [936]; K1,3 ∪ K1,n is super edge-magic if and only
if n is a multiple of 4 [936]; Pm ∪ K1,n is super edge-magic when m > 4 [936]; 2Pn is super
edge-magic if and only if n is not 2 or 3; K1,m ∪ 2nK2 is super edge-magic for all m and n
[936]; C3 ∪ Cn is super edge-magic if and only if n > 6 and n is even [939] (see also [1149]);
C4 ∪ Cn is super edge-magic if and only if n > 5 and n is odd [939] (see also [1149]);
C5 ∪ Cn is super edge-magic if and only if n > 4 and n is even [939]; if m is even and at
least 6 and n is odd and satisfies n > m/2 + 2, then Cm ∪ Cn is super edge-magic [939];
C4 ∪ Pn is super edge-magic if and only if n 6= 3 [939]; C5 ∪ Pn is super edge-magic if n > 4
[939]; if m is even and at least 6 and n > m/2 + 2, then Cm ∪ Pn is super edge-magic [939];
and Pm ∪ Pn is super edge-magic if and only if (m, n) 6= (2, 2) or (3,3) [939]. They [936]
conjecture that K1,m ∪ K1,n is super edge-magic only when m is a multiple of n + 1 and
they prove that if G is a super edge-magic graph with p vertices and q edges with p > 4
and q > 2p − 4, then G contains triangles. In [939] Figueroa-Centeno et al. conjecture
that Cm ∪ Cn is super edge-magic if and only if m + n > 9 and m + n is odd.
Singgih [2968] gave super edge magic total labelings for unions of books mB(n) for
odd m; m(P2 × Pn ) for m and n odd; r(Pm × Pn ) for odd r and (m, n) 6= (2, 2) or (3,3);
r(P3 × mPn ) for odd r; mPn for m ≡ 2 (mod 4), n 6= 2, 3; and mP4n for m ≡ 2 (mod 4),
n > 1.
In [996] Fukuchi and Oshima describe a construction of super edge-magic labelings of
some families of trees with diameter 4. Salman, Ngurah, and Izzati [2688] use Snm (n > 3)
to denote the graph obtained by inserting m vertices in every edge of the star Sn . They
prove that Snm is super edge-magic when m = 1 or 2.
In [2000] López, Muntaner-Batle, and Ruis-Font introduce a new construction for
super edge-magic labelings of 2-regular graphs which allows loops and is related to the
knight jump in the game of chess. They also study the super edge-magic properties of
cycles with cords.
Muntaner-Batle calls a bipartite graph with partite sets V1 and V2 special super edge-
magic if is has a super edge-magic total labeling f with the property that f (V1 ) =
{1, 2, . . . , |V1 |}. He proves that a tree has a special super edge-magic labeling if and
only if it has an α-labeling (see §3.1 for the definition). Figueroa-Centeno, Ichishima,
Muntaner-Batle, and Rius-Font [941] use matrices to generate edge-magic total labeling
and define the concept of super edge-magic total labelings for digraphs. They prove that
if G is a graph with a super edge-magic total labeling then for every natural number d
there exists a natural number k such that G has a (k, d)-arithmetic labeling (see §4.2 for

the electronic journal of combinatorics (2023), #DS6 161

the definition). In [1825] Lee and Lee prove that a graph is super edge-magic if and only
if it is (k, 1)-strongly indexable (see §4.3 for the definition of (k, d)-strongly indexable
graphs). They also provide a way to construct (k, d)-strongly indexable graphs from two
given (k, d)-strongly indexable graphs. This allows them to obtain several existing results
about super edge-magic graphs as special cases of their constructions. Acharya and Ger-
mina [33] proved that the class of strongly indexable graphs is a proper subclass of super
edge-magic graphs.
In [1283] Ichishima, López, Muntaner-Batle and Rius-Font show how one can use the
product ⊗h of super edge-magic 1-regular labeled digraphs and digraphs with harmonious,
or sequential labelings to create new undirected graphs that have harmonious, sequential
labelings or partitional labelings (see §4.1 for the definition). They define the product
→
− →
−
⊗h as follows. Let D = (V, E) be a digraph with adjacency matrix A( D ) = (aij ) and
0
let Γ = {Fi }m i=1 be a family of m digraphs all with the same set of vertices V . Assume
that h : E −→ Γ is any function that assigns elements of Γ to the arcs of D. Then the
→
−
digraph D ⊗h Γ is defined by V (D ⊗h Γ) = V × V 0 and ((a1 , b1 ), (a2 , b2 )) ∈ E(D ⊗h Γ) ⇐⇒
[(a1 , a2 ) ∈ E(D)∧(b1 , b2 ) ∈ E(h(a1 , a2 ))]. An alternative way of defining the same product
→
−
is through adjacency matrices, since one can obtain the adjacency matrix of D ⊗h Γ as
follows: if aij = 0 then aij is multiplied by the p0 × p0 0-square matrix, where p0 = |V 0 |.
If aij = 1 then aij is multiplied by A(h(i, j)) where A(h(i, j)) is the adjacency matrix of
→
−
the digraph h(i, j). They prove the following. Let D = (V, E) be a harmonious (p, q)-
digraph with p 6 q and let h be any function from E to the set of all super edge-magic
1-regular labeled digraphs of order n, which we denote by Sn . Then the undirected graph
→
− →
−
und( D ⊗h Sn ) is harmonious. Let D = (V, E) be a sequential digraph and let h : E −→ Sn
→
−
be any function. Then und( D ⊗h Sn ) is sequential. Let D be a partitional graph and let
→
−
h : E −→ Sn be any function, where D = (V, E) is the digraph obtained by orienting all
→
−
edges from one stable set to the other one. Then und( D ⊗h Sn ) is partitional.
Marr, Ochel, and Perez [2096] say a digraph D with v vertices and e directed edges
has an in-magic total labeling if there exists a bijective function
P λ from V (D) ∪ E(D) to
{1, 2, . . . , v +e} such that for every vertex x we have λ(x)+ λ(y, x) = k for some integer
k, where the sum is taken over all directed edges (y, x). They provide such labelings for
trees and cycles and discuss some relationships between this labeling and other digraph
labelings.
In [1996] López, Muntaner-Batle and Rius-Font introduce the concept of {Hi }i∈I -
super edge-magic decomposable as follows: Let G = (V, E) be any graph and let {Hi }i∈I
be a set of graphs such that G = ⊕i∈I Hi (that is, G decomposes into the graphs in the
set {Hi }i∈I ). Then we say that G is {Hi }i∈I -super edge-magic decomposable if there is a
bijection β : V → [1, |V |] such that for each i ∈ I the subgraph Hi meets the following two
requirements: (i) β(V (Hi )) = [1, |V (Hi )|] and (ii) {β(a) + β(b) : ab ∈ E(Hi )} is a set of
consecutive integers. Such function β is called an {Hi }i∈I -super edge-magic labeling of G.
When Hi = H for every i ∈ I we just use the notation H-super edge-magic decomposable
labeling. Among their results are the following. Let G = (V, E) be a (p, q)-graph which is
{H1 , H2 }-super edge-magic decomposable for a pair of graphs H1 and H2 . Then G is super

the electronic journal of combinatorics (2023), #DS6 162

edge-bimagic; Let n be an even integer. Then the cycle Cn is (n/2)K2 -super edge-magic
decomposable if and only if n ≡ 2 (mod 4). Let n be odd. Then for any super edge-magic
tree T there exists a bipartite connected graph G = G(T, n) such that G is (nT )-super
edge-magic decomposable. Let G be a {Hi }i∈I -super edge magic decomposable graph,
→
−
where Hi is an acyclic digraph for each i ∈ I. Assume that G is any orientation of G
→
− →
−
and h : E( G ) → Sp is any function. Then und( G ⊗h Sp ) is {pHi }i∈I -super edge magic
decomposable.
As a corollary of the last result they have that if G is a 2-regular, (1-factor)-super
→
− →
−
edge-magic decomposable graph and G is any orientation of G and h : E( G ) → Sp is
→
−
any function, then und( G ⊗h Sp ) is a 2-regular, (1-factor)-super edge-magic decomposable
→
−
graph. Moreover, if we denote the 1-factor of G by F then pF is the 1-factor of und( G ⊗h
Sp ).
They pose the following two open questions: Fix p ∈ N. Find the maximum r ∈ N such
that there is a r-regular graph of order p which is (p/2)K2 -super edge-magic decomposable:
and characterize the set of 2-regular graphs of order n, n ≡ 2 (mod 4), such that each
component has even order and admits an (n/2)K2 -super edge-magic decomposition. In
connection to open question 1 they prove: For all r ∈ N, there is n ∈ N such that there
exists a k-regular bipartite graph B(n), with k > r and |V (B(n))| = 2 · 3n , such that
B(n) is (3n K2 )-super edge-magic decomposable.
Hendy, Sugeng, Salman, and Ayunda [1245] provided a sufficient condition for Cn [Km ]
to have a Pt [Km ]-magic decompositions, where n > 3, m > 1, and t = 3, 4, n − 2.
An H-magic labeling in an H-decomposable graph G is a bijection f VP(G) ∪ E(G) →
{1, 2, . . . , p + q} such that, for every copy H in the decomposition, v∈V (H) f (v) +
P
e∈E(H) f (e) is constant. The function f is said to be an H-V -super magic labeling
if f (V (G)) = {1, 2, . . . , p}. In [2224] Murugan and Chandra Kumar find the magic con-
stant for H-factorable graphs that are H-V -super magic. Also, they give a necessary and
sufficient condition for an H-factorable graph to be H-V -super magic and characterize
the even regular graphs with a 2-factor-V -super magic labeling.
A bipartite graph G with partite sets X1 and X2 is called consecutively super edge-
magic if there exists a bijective function f : V (G) ∪ E (G) → {1, 2, . . . , |V (G)| + |E (G)|}
such that f (X1 ) = {1, 2, . . . , |X1 |}, f (X2 ) = {|X1 | + 1, |X1 | + 2, . . . , |V (G)|} and f (u) +
f (v) + f (uv) is a constant for each uv ∈ E (G). In [1294] Ichishima, Muntaner-Batle,
and Oshima investigated for which bipartite graphs is it possible to add a finite number
of isolated vertices so that the resulting graph is consecutively super edge-magic. If it
is possible for a bipartite graph G, then they say that the minimum such number µc (G)
of isolated vertices is the consecutively super edge-magic deficiency of G; otherwise, it
is +∞. Thus, the consecutively super edge-magic deficiency of a graph G is a measure
of how close G is to being consecutively super edge-magic. They also include a detailed
discussion of other concepts that are closely related to the consecutively super edge-magic
deficiency.
In [1297] Ichishima, Muntaner-Batle, and Oshima prove that α(G) = µc (G)+|V (G)|+
1. Thus a tree has a consecutively super edge-magic if and only if it has an α-valuation.

the electronic journal of combinatorics (2023), #DS6 163

They explore the relation between super edge-magic labelings and graceful labelings of
trees.
In [1315] Ichishima, Oshima, and Takamashi introduce the notion of strength sum of
a non-empty graph as follows. The strength sum strsf (G) of a numbering f : V (G) →
{1, 2, . . . , |V P
(G)|} is defined by strs(G) = min{strsf (G) | f is a numbering of G}, where
strsf (G) = uv∈E(G) (f (u) + f (v)). A numbering f of a graph G for which strsf (G) =
strs(G) is called a strength sum labeling of G. They also discuss relations among invariants
on super edge-magic graphs and their its strength sums. Ichishima, Muntaner-Batle, and
Oshima [1303] proved that for every k ∈ [1, n − 1], there exists a graph G of order n
satisfying δ(G) = k and str(G) = n + k, where δ(G) denotes the minimum degree of G.
Avadayappan, Jeyanthi, and Vasuki [263] define the super magic strength of a graph G
as sm(G) = min{s(L)} where L runs over all super edge-magic labelings of G. They use
the notation < K1,n : 2 > for the tree obtained from the bistar Bn,n (the graph obtained
by joining the center vertices of two copies of K1,n with an edge) by subdividing the edge
joining the two stars. They prove: sm(P2n ) = 5n + 1; sm(P2n+1 ) = 5n + 3;
sm(< K1,n : 2 >) = 4n + 9; sm(Bn,n ) = 5n + 6; sm((2n + 1)P2 ) = 9n + 6; sm(C2n+1 ) =
5n + 4; emt(C2n ) = 5n + 2; sm(K1,n ) = 2n + 4; and sm(Pn2 ) = 3n. Note that in each
case the super magic strength of the graph is the same as its magic strength.
Santhosh and Singh [2712] proved that Cn P2 and Cn P3 are super edge-magic for
all odd n > 3 and prove for odd n > 3, sm(Cn P2 ) = (15n + 3)/2 and (20n + 3) 6
sm(Cn P3 ) 6 (21n + 3)/2.
Gray [1150] proves that C3 ∪ Cn is super edge-magic if and only if n > 6 and C4 ∪ Cn
is super edge-magic if and only if n > 5. His computer search shows that C5 ∪ 2C3 does
not have a super edge-magic labeling.
In [3407] Wallis posed the problem of investigating the edge-magic properties of Cn
with the path of length t attached to one vertex. Kim and Park [1699] call such a graph
an (n, t)-kite. They prove that an (n, 1)-kite is super edge-magic if and only if n is odd
and an (n, 3)-kite is super edge-magic if and only if n is odd and at least 5. Park, Choi,
and Bae [2344] show that (n, 2)-kite is super edge-magic if and only if n is even. Wallis
[3407] also posed the problem of determining when K2 ∪ Cn is super edge-magic. In [2344]
and [1699] Park et al. prove that K2 ∪Cn is super edge-magic if and only if n is even. Kim
and Park [1699] show that the graph obtained by attaching a pendent edge to a vertex
of degree one of a star is super-edge magic and that a super edge-magic graph with edge
magic constant k and q edges satisfies q 6 2k/3 − 3.
Lee and Kong [1845] use St(a1 , a2 , . . . , an ) to denote the disjoint union of the n stars
St(a1 ), St(a2 ), . . . , St(an ). They prove the following graphs are super edge-magic:
St(m, n) where n ≡ 0 mod(m+1); St(1, 1, n); St(1, 2, n); St(1, n, n); St(2, 2, n); St(2, 3, n);
St(1, 1, 2, n) (n > 2); St(1, 1, 3, n); St(1, 2, 2, n); and St(2, 2, 2, n). They conjecture that
St(a1 , a2 , . . . , an ) is super edge-magic when n > 1 is odd. Gao and Fan [1026] proved
that St(1, m, n); St(3, m, m + 1); and St(n, n + 1, n + 2) are super edge-magic, and under
certain conditions St(a1 , a2 , . . . , a2n+1 ), St(a1 , a2 , . . . , a4n+1 ), and St(a1 , a2 , . . . , a4n+3 ) are
also super edge magic.
In [2050] MacDougall and Wallis investigate the existence of super edge-magic labelings

the electronic journal of combinatorics (2023), #DS6 164

of cycles with a chord. They use Cvt to denote the graph obtained from Cv by joining
t
two vertices that are distance t apart in Cv . They prove: C4m+1 (m > 3) has a super
t
edge-magic labeling for every t except 4m − 4 and 4m − 8; C4m (m > 3) has a super
t
edge-magic labeling when t ≡ 2 mod 4; and that C4m+2 (m > 1) has a super edge-magic
labeling for all odd t other than 5, and for t = 2 and 6. They pose the problem of what
t
values of t does C2n have a super edge-magic labeling.
Enomoto, Masuda, and Nakamigawa [892] have proved that every graph can be em-
bedded in a connected super edge-magic graph as an induced subgraph. Slamin, Bača,
Lin, Miller, Simanjuntak [2996] proved that the friendship graph consisting of n triangles
is super edge-magic if and only if n is 3, 4, 5, or 7. Fukuchi proved [994] the generalized
Petersen graph P (n, 2) (see §2.7 and at least 5. Baskoro and Ngurah [511] showed that
nP3 is super edge-magic for n > 4 and n even.
Hegde and Shetty [1234] showed that a graph is super edge-magic if and only if it
is strongly k-indexable (see §4.1 for the definition). Figueroa-Centeno, Ichishima, and
Muntaner-Batle [932] proved that a graph is super edge-magic if and only if it is strongly
1-harmonious and that every super edge-magic graph is cordial. They also proved that
Pn2 and K2 × C2n+1 are super edge-magic. In [933] Figueroa-Centeno et al. show that the
following graphs are super edge-magic: P3 ∪ kP2 for all k; kPn when k is odd; k(P2 ∪ Pn )
when k is odd and n = 3 or n = 4; and fans Fn if and only if n 6 6. They conjecture that
kP2 is not super edge-magic when k is even. This conjecture has been proved by Z. Chen
[696] who showed that kP2 is super edge-magic if and only if k is odd. Figueroa-Centeno
et al. proved that the book Bn is not super edge-magic when n ≡ 1, 3, 7 (mod 8) and
when n = 4. They proved that Bn is super edge-magic for n = 2 and 5 and conjectured
that for every n > 5, Bn is super edge-magic if and only if n is even or n ≡ 5 (mod 8).
Yuansheng, Yue, Xirong, and Xinhong [3566] proved this conjecture for the case that n
is even. They prove that every tree with an α-labeling is super edge-magic. Yokomura
(see [891]) has shown that P2m+1 × P2 and C2m+1 × Pm are super edge-magic (see also
[932]). In [934], Figueroa-Centeno et al. proved that if G is a (super) edge-magic 2-regular
graph, then G K n is (super) edge-magic and that Cm K n is super edge-magic. Fukuchi
[993] shows how to recursively create super edge-magic trees from certain kinds of existing
super edge-magic trees. Ngurah, Baskoro, and Simanjuntak [2292] provide a method for
constructing new (super) edge-magic graphs from existing ones. One of their results is
that if G has an edge-magic total labeling and G has order p and size p or p − 1, then
G nK1 has an edge-magic total labeling.
Ichishima, Muntaner-Batle, Oshima [1292] enlarged the classes of super edge-magic
2-regular graphs by presenting some constructions that generate large classes of super
edge-magic 2-regular graphs from previously known super edge-magic 2-regular graphs or
pseudo super edge-magic graphs. By virtue of known relationships among other classes
of labelings the 2-regular graphs obtained from their constructions are also harmonious,
sequential, felicitous and equitable. Their results add credence to the conjecture of Holden
et al. [1256] that all 2-regular graphs of odd order with the exceptions of C3 ∪C4 , 3C3 ∪C4 ,
and 2C3 ∪ C5 possess a strong vertex-magic total labeling, which is equivalent to super
edge-magic labelings for 2-regular graphs. For a 2-regular graph G with 2m + 1 vertices

the electronic journal of combinatorics (2023), #DS6 165

that has a strong vertex-magic total labeling McQuillan and McQuillan [2115] proved that
G ∪ 2mC3 , G ∪ (2m + 2)C3 , G ∪ mC8 and G ∪ (m + 1)C8 also have a strong vertex-magic
total labeling.
Lee and Lee [1847] investigate the existence of total edge-magic labelings and super
edge-magic labelings of unicylic graphs. They obtain a variety of positive and negative
results and conjecture that all unicyclic are edge-magic total.
Shiu and Lee [2915] investigated edge labelings of multigraphs. Given a multigraph
G with q edges they call a bijection from the set of edges of G to {1, 2, . . . , q} with the
property that for each vertex v the sum of all edge labels incident to v is a constant
independent of v a supermagic labeling of G. They use K2 [n] to denote the multigraph
consisting of n edges joining 2 vertices and mK2 [n] to denote the disjoint union of m
copies of K2 [n]. They prove that for m and n at least 2, mK2 [n] is supermagic if and
only if n is even or if both m and n are odd.
In 1970 Kotzig and Rosa [1743] defined the edge-magic deficiency, µ(G), of a graph G
as the minimum n such that G ∪ nK1 is edge-magic total. If no such n exists they define
µ(G) = ∞. In 1999 Figueroa-Centeno, Ichishima, and Muntaner-Batle [938] extended
this notion to super edge-magic deficiency, µs (G), is the analogous way. They prove the
following: µs (nK2 ) = µ(nK2 ) = n − 1 (mod 2); µs (Cn ) = 0 if n is odd; µs (Cn ) = 1
if n ≡ 0 (mod 4); µs (Cn ) = ∞ if n ≡ 2 (mod 4); µs (Kn ) = ∞ if and only if n >
5; µs (Km,n ) 6 (m − 1)(n − 1); µs (K2,n ) = n − 1; and µs (F ) is finite for all forests F .
They also prove that if a graph G has q edges with q/2 odd, and every vertex is even, then
µs (G) = ∞ and conjecture that µs (Km,n ) 6 (m − 1)(n − 1). This conjecture was proved
for m = 3, 4, and 5 by Hegde, Shetty, and Shankaran [1235] using the notion of strongly
k-indexable labelings. Baig, Baskoro, and Semaničová-Feňovčı́ková [276] investigated the
super edge-magic deficiency of a forest consisting of stars. Ngurah investigates the (super)
edge-magic deficiency of chain graphs in [2287] and Ngurah and Adiwijaya does the same
in [2286].
For an (n, t)-kite graph (a path of length t attached to a vertex of an n-cycle) G
Ahmad, Siddiqui, Nadeem, and Imran [117] proved the following: for odd n > 5 and even
t > 4, µs (G) = 1; for odd n > 5, t > 5, t 6= 11, and t ≡ 3, 7 (mod 8), µs (G) 6 1; for
n > 10, n ≡ 2 (mod 4) and t = 4, µs (G) 6 1; and for t = 5, µs (G) = 1.
In [394] Baig, Ahmad, Baskoro, and Simanjuntak provide an upper bound for the
super edge-magic deficiency of a forest formed by paths, stars, combs, banana trees, and
subdivisions of K1,3 . Baig, Baskoro, and Semaničová-Feňovčı́ková [395] investigate the
super edge-magic deficiency of forests consisting of stars. Among their results are: a
forest consisting of k > 3 stars has super edge-magic deficiency at most k − 2; for every
positive integer n a forest consisting of 4 stars with exactly 1, n, n, and n + 2 leaves has a
super edge-magic total labeling; for every positive integer n a forest consisting of 4 stars
with exactly 1, n + 5, 2n + 6, and n + 1 leaves has a super edge-magic total labeling;
and for every positive integers n and k a forest consisting of k identical stars has super
edge-magic deficiency at most 1 when k is even and deficiency 0 when k is odd. In [108]
Ahmad, Javaid, Nadeem, and Hasni investigate the super edge-magic deficiency of some
families of graphs related to ladder graphs. Kanwal, Javed, and Riasat [1648] give super

the electronic journal of combinatorics (2023), #DS6 166

edge-magic total labelings and the deficiency for forests consisting of extended w-trees,
combs, stars and paths. In [112] Ahmad, Nadeem, and Gupta provided bounds for the
super edge-magic deficiency of some Toeplitz graphs.
The generalized Jahangir graph Jn,m for m > 3 is a graph on nm+1 vertices, consisting
of a cycle Cnm with one additional vertex that is adjacent to m vertices of Cnm at distance
n to each other on Cnm . In [396] Baig, Imran, Javaid, and Semaničová-Feňovčiková study
the super edge-magic deficiencies of the web graph W bn,m , the generalized Jahangir graph
J2,n , crown products Ln K1 , K4 nK1 , and gave the exact value of super edge-magic
deficiency for one class of lobsters.
In [937] Figueroa-Centeno, Ichishima, and Muntaner-Batle proved that µs (Pm ∪
K1,n ) = 1 if m = 2 and n is odd, or m = 3 and n is not congruent to 0 mod 3, whereas
in all other cases µs (Pm ∪ K1,n ) = 0. They also proved that µs (2K1,n ) = 1 when n is odd
and µs (2K1,n ) 6 1 when n is even. They conjecture that µs (2K1,n ) = 1 in all cases. Other
results in [937] are: µs (Pm ∪ Pn ) = 1 when (m, n) = (2, 2) or (3, 3) and µs (Pm ∪ Pn ) = 0 in
all other cases; µs (K1,m ∪ K1,n ) = 0 when mn is even and µs (K1,m ∪ K1,n ) = 1 when mn is
odd; µ(Pm ∪ K1,n ) = 1 when m = 2 and n is odd and µ(Pm ∪ K1,n ) = 0 in all other cases;
µ(Pm ∪ Pn ) = 1 when (m, n) = (2, 2) and µ(Pm ∪ Pn ) = 0 in all other cases; µs (2Cn ) = 1
when n is even and ∞ when n is odd; µs (3Cn ) = 0 when n is odd; µs (3Cn ) = 1 when
n ≡ 0 (mod 4); µs (3Cn ) = ∞ when n ≡ 2 (mod 4); and µs (4Cn ) = 1 when n ≡ 0 (mod 4).
They conjecture the following: µs (mCn ) = 0 when mn is odd; µs (mCn ) = 1 when mn ≡ 0
(mod 4); µs (mCn ) = ∞ when mn ≡ 2 (mod 4); µs (2K1,n ) = 1; and if F is a forest with
two components, then µ(F ) 6 1 and µs (F ) 6 1. Santhosh and Singh [2711] proved: for
n odd at least 3, µs (K2 Cn ) 6 (n − 3)/2; for n > 1, 1 6 µs (Pn [P2 ]) = d(n − 1)/2e; and
for n > 1, 1 6 µs (Pn × K4 ) 6 n.
Ichishima and Oshima [1313] prove the following: if a graph G(V, E) has an α-labeling
and no isolated vertices, then µs (G) 6 |E| − |V | + 1; if a graph G(V, E) has an α-labeling,
is not sequential, and has no isolated vertices, then µs (G) = |E| − |V | + 1; and, if m is
even, then µs (mK1,n ) 6 1. As corollaries of the last result they have: µs (2K1,n ) = 1; when
m ≡ 2 (mod 4) and n is odd, µs (mK1,n ) = 1; µs (mK1,3 ) = 0 when m ≡ 4 (mod 8) or m
is odd; µs (mK1,3 ) = 1 when m ≡ 2 (mod 4); µs (mK2,2 ) = 1; for n > 4, (n − 4)2n−2 + 3 6
µs (Qn ) 6 (n − 2)2n−1 − 4; and for s > 2 and t > 2, µs (mKs,t ) 6 m(st − s − t) + 1. They
conjecture that for s > 2 and t > 2, µs (mKs,t ) = m(st − s − t) + 1 and pose as a problem
determining the exact value of µs (Qn ).
Ichishima and Oshima [1311] determined the super edge-magic deficiency of graphs
of the form Cm ∪ Cn for m and n even and for arbitrary n when m = 3, 4, 5, and 7.
They state a conjecture for the super edge-magic deficiency of Cm ∪ Cn in the general
case. Afzal and Aslam [64] investigate the super edge-magic deficiency of various disjoint
unions of K2,n with stars, paths and disjoint union of paths. The join product of two
graphs is their graph union with additional edges that connect all vertices of the first
graph to each vertex of the second graph. In [2296] Ngurah and Simanjuntak investigate
the super edge-magic deficiencies of a wheel minus an edge and join products of a path, a
star, and a cycle with isolated vertices. They also show that the join product of a super
edge-magic graph with isolated vertices has finite super edge-magic deficiency.

the electronic journal of combinatorics (2023), #DS6 167

 A block of a graph is a maximal subgraph with no cut-vertex. The block-cut-vertex
graph of a graph G is a graph H whose vertices are the blocks and cut-vertices in G; two
vertices are adjacent in H if and only if one vertex is a block in G and the other is a cut-
vertex in G belonging to the block. A chain graph is a graph with blocks B1 , B2 , B3 , . . . , Bk
such that for every i, Bi and Bi+1 have a common vertex in such a way that the block-
cut-vertex graph is a path. The chain graph with k blocks where each block is identical
and isomorphic to the complete graph Kn is called the kKn -path.
Ngurah, Baskoro, and Simanjuntak [2291] investigate the exact values of µs (kKn -path)
when n = 2 or 4 for all values of k and when n = 3 for k ≡ 0, 1, 2 (mod 4), and give an
upper bound for k ≡ 3 (mod 4). They determine the exact super edge-magic deficiencies
for fans, double fans, wheels of small order and provide upper and lower bounds for the
general case as well as bounds for some complete partite graphs. They also include some
open problems. Lee and Wang [1909] show that various chain graphs with blocks that
are complete graphs are super edge-magic. In [107] investigate the super edge-magic
deficiency of some kites and Cn ∪ K2 .
Figueroa-Centeno and Ichishima [930] introduce the notion of the sequential number
σ(G) of a graph G without isolated vertices to be either the smallest positive integer
n for which it is possible to label the vertices of G with distinct elements from the set
{0, 1, . . . , n} in such a way that each uv ∈ E(G) is labeled f (u) + f (v) and the resulting
edge labels are |E(G)| consecutive integers or +∞ if there exists no such integer n.
They prove that σ(G) = µs (G) + |V (G)| − 1 for any graph G without isolated vertices,
and σ(Km,n ) = mn, which settles the conjecture of Figueroa-Centeno, Ichishima, and
Muntaner-Batle [938] that µs (Km,n ) = (m − 1)(n − 1).
In [1289] Ichishima and Muntaner-Batle define the strong sequential number σs (G) of
G as the smallest positive integer n for which there exists an injective function from the
vertices of G to [0, n] such that when each edge uv is labeled f (u) + f (v), the resulting set
of edge labels is [c, c+q −1] for some positive integer c and there exists an integer λ so that
min{f (u), f (v)} 6 λ < max{f (u), f (v)} for all edges uv. Note that for G to have finite
σs (G), it must be bipartite. They prove for a graph G of order p, σ (G) = µs (G) + p − 1.
From this it follows that the problems of determining the sequential number and super
edge-magic deficiency are equivalent and that for any graph G, σ (G) is finite if and
only if µs (G) is finite. They also introduced the following parameter as a measure of
how close a graph G is to having an α-labeling. The alpha-number α (G) of a graph G
with q edges is the smallest positive integer n for which there exists an injective function
f : V (G) → [0, n] such that when each edge uv is labeled |f (u) − f (v)| the resulting set
of edge labels is [c, c + q − 1] for some positive integer c, and there exists an integer λ so
that min {f (u), f (v)} 6 λ < max{f (u), f (v)} for each uv ∈ E(G). If no such n exists
the alpha-number of G is defined to be +∞. Since a graph that admits an α-labeling is
necessarily bipartite, graphs with finite α (G) are bipartite.
Ichishima and Muntaner-Batle [1289] prove: if every vertex of graph G has even
degree and |E (G)| ≡ 2 (mod 4), then σ (G) = σs (G) = +∞; for every graph G of order
p, σs (G) = µc (G)+p−1; and if G is a super edge-magic graph with at least one edge, then
the graph G + nK1 is sequential for every positive integer n. As corollaries they have: for

the electronic journal of combinatorics (2023), #DS6 168

every graph σs (G) = α (G); a graph G has an α-labeling if and only if σs (G) = |E(G)|;
and if a graph G of order p and size q > 1 has a super edge-magic labeling f with s =
min{f (u) + f (v) : uv ∈ E(G)}, then σ (G + nK1 ) 6 s + q + (n − 1) p − 2; if G is
a graph of order p and size q > 1 and G has a super edge-magic labeling f with s =
min{f (u) + f (v) : uv ∈ E(G)}, then µs (G + nK1 ) 6 s + q + (n − 2) (p − 1) − 3; and if G
is a super edge-magic graph with at least one edge, then the graph G + nK1 is harmonious
and felicitous for any positive integer n.
For a graph G order p and size q Ichishima, Muntaner-Batle, and Oshima [1304] prove
the following: if q = p − 1 and βs (G) = p − 1, then β (G nK1 ) = βs (G nK1 ) =
(n + 1) p − 1 for every positive integer n; if q > p − 1 and βs (G) = q, then there exists
a supergraph H of G such that β (H nK1 ) = βs (H nK1 ) = (n + 1) (q + 1) − 1 for
every positive integer n; if G has a subgraph H such that βs (H) = q < p − 1, then
β (H nK1 ) = βs (H nK1 ) = (n + 1) (q + 1) − 1 for every positive integer n; and if
G has a subgraph H such that βs (H) = q < p − k (H 0 ), where H 0 is a subgraph of H
without isolated vertices, then β (H nK1 ) = βs (H nK1 ) = (n + 1) (q + 1) − 1 for
every positive integer n.
As the concept of super magic strength is effectively defined only for super edge-magic
graphs, Ichishima, Muntaner-Batle, and Oshima [1299] generalize it for any nonempty
graph as follows. A numbering f of a graph G of order p is a labeling that assigns distinct
elements of the set [1, p] to the vertices of G, where each edge uv of G is labeled f (u)+f (v).
The strength, strf (G), of a numbering f : V (G) → [1, p] of G is defined by strf (G) =
max {f (u) + f (v) |uv ∈ E (G)} , that is, strf (G) is the maximum edge label of G, and the
strength, str(G), of a graph G itself is str (G) = min {strf (G) |f is a numbering of G} . A
numbering f of a graph G for which strf (G) = str (G) is called a strength labeling of G.
If G is an empty graph, then str (G) is undefined. For a graph G of order p they prove
the following: if G has order at least 3 and contains a path of order k (k ∈ [2, p − 1]) as
an induced subgraph, then str (G) 6 2p − (k − 1); if ∆ (G) + 2 6 str (G) 6 2p − 1; and if
p + m + min {p, δ (G) + m} 6 str (G + mK1 ) 6 str (G) + 2m for every positive integer m.
They determine the exact strength for many basic families of graphs such as paths, cycles
complete graphs, ladders, books, and hypercubes. They conclude with six problems and
a conjecture.
In [1300] Ichishima, Muntaner-Batle, and Oshima determined the strength of cater-
pillars and complete n-ary k-level trees. The strength str(G) is also given for graphs G
obtained by taking the corona of certain graphs and arbitrary number of isolated vertices.
They further proved if G is a graph of order p with δ (G) > 1 and str (G) = p + δ (G),
then str (G nK1 ) = (n + 1) p + 1. for every positive integer n. In [1302] Ichishima,
Muntaner-Batle, Oshima show that for every k ∈ [1, n − 1], there exists a graph G of
order n satisfying δ (G) = k and str (G) = n + k, where δ (G) denotes the minimum de-
gree of G. In [1306] Ichishima, Muntaner-Batle, and Oshima investigate minimum degree
conditions for the strength of graphs. They determine certain degree sequences of graphs
that naturally arise and proof that these degree sequences determine a unique graph re-
alization. In addition, they establish a parallel bandwidth result to the one on strength
of graphs and enlarge the class of k-stable properties known so far.

the electronic journal of combinatorics (2023), #DS6 169

 The following result Ichishima, Muntaner-Batle, and Oshima in [1294] shows the con-
nection between the alpha-number of a graph and its consecutively super edge-magic
deficiency. For every graph G of order p, α (G) = µc (G) + p − 1. This result shows
that the problems of determining the alpha-number and consecutively super edge-magic
deficiency are equivalent.
In [2297] Ngurah and Simanjuntak proved that if G is a cycle-free graph with minimum
degree one and µs (G + K1 ) = 0 then G is either a tree or a forest. They also prove: the
join product of some classes of trees and forests with an isolated vertex has zero super
edge-magic deficiency; for all but one tree of order at most 6, their join product with an
isolated vertex has zero super edge-magic deficiency. For trees T of order at least 7 they
proved that if µs (T + K1 ) = 0, then either 2K1,3 or K3 ∪ K1,3 is a subgraph of T + K1 .
For the super edge-magic deficiency of the join product of a tree T of order at least 2 with
m > 2 isolated vertices, they showed that µj s (T + mK1 ) = 0 kif and only if T = P2 . For
a tree T 6= P2 , they proved µs (T + mK1 ) > (m−1)(|V 2(T )−2|+1) .They also present results
for the super edge-magic deficiency of some chain graphs.
Z. Chen [696] has proved: the join of K1 with any subgraph of a star is super edge-
magic; the join of two nontrivial graphs is super edge-magic if and only if at least one of
them has exactly two vertices and their union has exactly one edge; and if a k-regular
graph is super edge-magic, then k 6 3. Chen also obtained the following: there is a
connected super edge-magic graph with p vertices and q edges if and only if p − 1 6 q 6
2p − 3; there is a connected 3-regular super edge-magic graph with p vertices if and only
if p ≡ 2 (mod 4); and if G is a k-regular edge-magic total graph with p vertices and q
edges then (p + q)(1 + p + q) ≡ 0 (mod 2d) where d = gcd(k − 1, q). As a corollary of the
last result, Chen observes that nK2 + nK2 is not edge-magic total.
Another labeling that has been called “edge-magic” was introduced by Lee, Seah, and
Tan in 1992 [1887]. They defined a graph G = (V, E) to be edge-magic if there exists
a bijection fP : E → {1, 2, . . . , |E|} such that the induced mapping f + : V → N defined
+
by f (u) = (u,v)∈E f (u, v) (mod |V |) is a constant map. Lee (see [1875]) conjectured
that a cubic graph with p vertices is edge-magic if and only if p ≡ 2 (mod 4). Lee,
Pigg, and Cox [1875] verified this conjecture for prisms and several other classes of cubic
graphs. They also show that Cn × K2 is edge-magic if and only if n is odd. Shiu and Lee
[2915] showed that the conjecture is not true for multigraphs and disconnected graphs. In
[2915] Lee’s conjecture was modified by restricting it to simple connected cubic graphs.
A computer search by Lee, Wang, and Wen [1912] showed that the new conjecture was
false for a graph of order 10. Using different methods, Shiu [2893] and Lee, Su, and Wang
[1898] gave proofs that it is was false.
Lee, Seah, and Tan [1887] establish that a necessary condition for a multigraph with
p vertices and q edges to be edge-magic is that p divides q(q + 1) and they exhibit several
new classes of cubic edge-magic graphs. They also proved: Kn,n (n > 3) is edge-magic
and Kn is edge-magic for n ≡ 1, 2 (mod 4) and for n ≡ 3 (mod 4) (n > 7). Lee, Seah,
and Tan further proved that following graphs are not edge-magic: all trees except P2 ; all
unicyclic graphs; and Kn where n ≡ 0 (mod 4). Schaffer and Lee [2725] have proved that
Cm × Cn is always edge-magic. Lee, Tong, and Seah [1904] have conjectured that the total

the electronic journal of combinatorics (2023), #DS6 170

graph of a (p, p)-graph is edge-magic if and only if p is odd. They prove this conjecture
for cycles. Lee, Kitagaki, Young, and Kocay [1844] proved that a maximal outerplanar
graph with p vertices is edge-magic if and only if p = 6. Shiu [2892] used matrices with
special properties to prove that the composition of Pn with Kn and the composition of
Pn with Kkn where kn is odd and n is at least 3 have edge-magic labelings. Boonklurb,
Narissayaporn, and Singhun [598] show that under some conditions the m-node k-uniform
hyperpaths and m-node k-uniform hypercycles are super edge-magic.
For a (p, q)-graph a bijection f from V (G) ∪ E(G) to {1, 2, . . . , p + q} such that for
each edge xy ∈ E(G) the value of f (x) + f (xy) + f (y) is either k1 , k2 or k3 is said to be
an edge trimagic total labeling . Regees and Jayasekaran [2613] prove that Cm × Pn , the
generalized web graph, and the generalized web graph without a center are super edge
trimagic total graphs. In [2612] proved that the star type graphs P3 Kn , Bm,n , hBm,n : 2i
and hK1,n 3i admits edge trimagic total labelings and super edge trimagic total labelings.
A triangular belt is obtained from Pn × P2 with vertices u1 , u2 , . . . un and v1 , v2 , . . . , vn1
by adding an edge {(uk vk+1 ) | k = 1, 2, . . . , n − 1}. The braid graph is obtained from a
pair of paths Pn and Pn0 with vetrtices u1 , u2 , . . . un and v1 , v2 , . . . un obtained by joining
the ith vertex of Pn and the (i + 1)th vertex with Pn0 and joining the ith vertex of Pn0
and the (i + 2)th vertex with Pn for 1 6 i 6 n − 2. A semi Jahangir graph is connected
graph with a vertex set {u, uk | 1 6 k 6 n} ∪ {sk | 1 6 k 6 n − 1} and edge set
{uk sk | 1 6 k 6 n − 1} ∪ {sk uk+1 | 1 6 k 6 n − 1} ∪ {uk ui | 1 6 k 6 n} A graph
obtained from a graph G replacing each edge ei by an H-graph in such a way that the
ends of ei are merged with a pendant vertex in P2 and pendant vertex in P20 is called H
super subdivision of G is denoted by HSS(G), where the H-graph is a tree on 6 vertices
in which exactly two vertices have degree 3. Vaghela and Parmar [3243] prove that the
H-graph of a path, alternate triangular belt graph, braid graph, semi Jahangir graph, F -
trees, (obtained from a path v1 , v2 , . . . , vn by appending an edge to vn−1 and vn ), H-super
subdivision of a path are edge magic total graphs, and an H-graph of a path, alternate
triangular belt graph, braid graphs, semi Jahangir graph, H-super subdivision of a path,
F -trees, the H K1 graph of a path are edge trimagic total graphs.
Amuthavalli and Sugapriya [185] defined a reverse edge-trimagic labeling on a graph
G(V, E) with p vertices and q edges as a one-to-one map that takes the vertices and
edges onto the integers 1, 2, . . . , p + q with the property that for every edge e, when the
sum of all vertex labels incident to e is subtracted from edge label f (e), the result is
one of three constants. A reverse edge-trimagic labeling is said to be a reverse super
edge-trimagic labeling if f (V ) = {1, 2, . . . , p} and f (E) = {p + 1, p + 2, . . . , p + q}. They
investigated the reverse super edge-trimagic labeling of barycentric subdivision of bistars,
degree splitting graphs of K1,n + K1,n and K1,n ∪ K1,n , and the splitting graphs of stars.
Chopra, Dios, and Lee [710] investigated the edge-magicness of joins of graphs. Among
their results are: K2,m is edge-magic if and only if m = 4 or 10; the only possible edge-
magic graphs of the form K3,m are those with m = 3, 5, 6, 15, 33, and 69; for any fixed m
there are only finitely many n such that Km,n is edge-magic; for any fixed m there are only
finitely many trees T such that T + Km is edge-magic; and wheels are not edge-magic.
Lee, Ho, Tan, and Su [1843] define the edge-magic index of a graph G to be the smallest

the electronic journal of combinatorics (2023), #DS6 171

positive integer k such that the graph kG is edge-magic. They completely determined
the edge-magic indices of graphs which are stars. In [2910] Shiu, Lam, and Lee give the
edge-magic index set of the second power of a path.
For any graph G and any positive integer k the graph G[k], called the k-fold G, is
the hypergraph obtained from G by replacing each edge of G with k parallel edges. Lee,
Seah, and Tan [1887] proved that for any graph G with p vertices, G[2p] is edge-magic
and, if p is odd, G[p] is edge-magic. Shiu, Lam, and Lee [2909] show that if G is an
(n + 1, n)-multigraph, then G is edge-magic if and only if n is odd and G is isomorphic
to the disjoint union of K2 and (n − 1)/2 copies of K2 [2]. They also prove that if G is a
(2m + 1, 2m)-multigraph and k > 2, then G[k] is edge-magic if and only if 2m + 1 divides
k(k − 1). For a (2m, 2m − 1)-multigraph G and k at least 2, they show that G[k] is edge-
magic if 4m divides (2m − 1)k((2m − 1)k + 1) or if 4m divides (2m + k − 1)k. In [2907]
Shiu, Lam, and Lee characterize the (p, p)-multigraphs that are edge-magic as mK2 [2]
or the disjoint union of mK2 [2] and two particular multigraphs or the disjoint union of
K2 , mK2 [2], and four particular multigraphs. They also show for every (2m + 1, 2m + 1)-
multigraph G, G[k] is edge-magic for all k at least 2. Lee, Seah, and Tan [1887] prove
that the multigraph Cn [k] is edge-magic for k > 2.
Tables 6 and 7 summarize what is known about edge-magic total labelings and super
edge-magic total labelings. We use SEMT to indicate the graphs have super edge-magic
total labelings and EMT to indicate the graphs have edge-magic total labelings. A
question mark following SEMT or EMT indicates that the graph is conjectured to have the
corresponding property. The tables were prepared by Petr Kovář and Tereza Kovářová.

the electronic journal of combinatorics (2023), #DS6 172

 Table 6: Summary of Edge-magic Total Labelings

Graph Types Notes

Pn EMT [3411]

trees EMT? [1744], [2626]

Cn EMT for n > 3 [1743], [1108], [2638], [542]

Kn EMT iff n = 1, 2, 3, 4, 5, or 6 [1744],

[755], [891]
enumeration of all EMT of
Kn [3411]

Km,n EMT [3411], [1743]

crowns Cn K1 EMT [3534], [3411]

Cn with a single edge EMT [3411]

attached to one vertex

wheels Wn EMT iff n 6≡ 3 (mod 4) [891], [995]

fans EMT [2996], [932], [933]

(p, q)-graph not EMT if q even, p + q ≡ 2 (mod 4) [2626]

nP2 EMT iff n odd [1743]

P n + K1 EMT [3534]

r-regular graph not EMT r odd and p ≡ 4 (mod 8) [755]

P3 ∪ nK2 and P5 ∪ nK2 EMT [932], [933]

P4 ∪ nK2 EMT n odd [932], [933]

nPi EMT n odd, i = 3, 4, 5 [3534], [932], [933]

nP3 EMT? [3534]

2Pn EMT [932], [933]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 173

 Table 6 – Continued from previous page
Graph Types Notes

P 1 ∪ P 2 ∪ · · · ∪ Pn EMT [932], [933]

mK1,n EMT [932], [933]

unicylic graphs EMT? [1847]

K1 nK2 EMT n even [932], [933]

K2 × K n EMT [932], [933]

nK3 EMT iff n 6= 2 odd [932], [933], [2114]

binary trees EMT [932], [933]

P (m, n) (generalized EMT [932], [933], [2288]

Petersen graph see §2.7)

ladders EMT [932], [933]

books EMT [932], [933]

odd cycle with pendent EMT [932], [933]

edges attached to
one vertex

P m × Cn EMT n odd n > 3 [3470]

P m × P2 EMT m odd m > 3 [3470]

K1,m ∪ K1,n EMT iff mn is even [936]

G Kn EMT if G is EMT 2-regular [934]

the electronic journal of combinatorics (2023), #DS6 174

 Table 7: Summary of Super Edge-magic Labelings

Graph Types Notes

Cn SEMT iff n is odd [891]

caterpillars SEMT [891], [1743], [1744]

Km,n SEMT iff m = 1 or n = 1 [891]

Kn SEMT iff n = 1, 2 or 3 [891]

trees SEMT? [891]

nK2 SEMT iff n odd [696]

nG SEMT if G is a bipartite or tripartite

SEM graph and n odd [936]

mB(n) SEMT if m is odd [2968]

m(P2 × Pn ) SEMT if m, n are odd [2968]

r(Pm × Pn ) SEMT if r is odd, (m, n) 6= (2, 2)

or (3,3) [2968]

r(P3 × mPn ) SEMT if r is odd [2968]

K1,m ∪ K1,n SEMT if m is a multiple of n + 1 [936]

K1,m ∪ K1,n SEMT? iff m is a multiple of n + 1 [936]

K1,2 ∪ K1,n SEMT iff n is a multiple of 3 [936]

K1,3 ∪ K1,n SEMT iff n is a multiple of 4 [936]

Pm ∪ K1,n SEMT if m > 4 is even [936]

2Pn SEMT iff n is not 2 or 3 [936]

2P4n SEMT for all n [936]

mPn SEMT if m ≡ 2 (mod 4), n 6= 2, 3 [2968]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 175

 Table 7 – Continued from previous page
Graph Types Notes

mP4n SEMT ifm ≡ 2 (mod 4), n > 1 [2968]

K1,m ∪ 2nK1,2 SEMT for all m and n [936]

C3 ∪ C n SEMT iff n > 6 even [939], [1149]

C4 ∪ C n SEMT iff n > 5 odd [939], [1149]

C5 ∪ C n SEMT iff n > 4 even [939]

Cm ∪ Cn SEMT if m > 6 even,

n odd n > m/2 + 2 [939]

Cm ∪ Cn SEMT? iff m + n > 9 and m + n odd [939]

C4 ∪ P n SEMT iff n 6= 3 [939]

C5 ∪ P n SEMT if n 6= 4 [939]

C m ∪ Pn SEMT if m > 6 even, n > m/2 + 2 [939]

Pm ∪ Pn SEMT iff (m, n) 6= (2, 2) or (3, 3) [939]

corona Cn Km SEMT n > 3 [939]

St(m, n) SEMT n ≡ 0 (mod m + 1) [1845]

St(1, k, n) SEMT k = 1, 2 or n [1845]

St(2, k, n) SEMT k = 2, 3 [1845]

St(1, 1, k, n) SEMT k = 2, 3 [1845]

St(k, 2, 2, n) SEMT k = 1, 2 [1845]

St(a1 , . . . , an ) SEMT? for n > 1 odd [1845]

t
C4m SEMT [2050]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 176

 Table 7 – Continued from previous page
Graph Types Notes
t
C4m+1 SEMT [2050]

friendship graph of SEMT iff n = 3, 4, 5, or 7 [2996]

n triangles

generalized Petersen SEMT if n > 3 odd [993]

graph P (n, 2) (see §2.7)

nP3 SEMT if n > 4 even [511]

Pn2 SEMT [932]

K2 × C2n+1 SEMT [932]

P3 ∪ kP2 SEMT for all k [933]

kPn SEMT if k is odd [933]

k(P2 ∪ Pn ) SEMT if k is odd and n = 3, 4 [933]

fans Fn SEMT iff n 6 6 [933]

books Bn SEMT if n even [3566]

books Bn SEMT? if n ≡ 5 (mod 8)[933]

trees with α-labelings SEMT [933]

P2m+1 × P2 SEMT [891], [932]

C2m+1 × Pm SEMT [932]

G Kn SEMT if G is SEM 2-regular graph [934]

Cm Kn SEMT [934]

join of K1 with any SEMT [696]

subgraph of a star

if G is k-regular SEMT then k 6 3 [696]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 177

 Table 7 – Continued from previous page
Graph Types Notes
graph

G is connected (p, q)-graph SEMT G exists iff p − 1 6 q 6 2p − 3 [696]

G is connected 3-regular SEMT iff p ≡ 2 (mod 4) [696]

graph on p vertices

nK2 + nK2 not SEMT [696]

5.3 Vertex-magic Total Labelings

MacDougall, Miller, Slamin, and Wallis [2047] introduced the notion of a vertex-magic
total labeling in 1999. For a graph G(V, E) an injective mapping f from V ∪ E to the
set {1, 2, . . . , |V | + |E|} is a vertex-magic total labelingPif there is a constant k, called the
magic constant, such that for every vertex v, f (v) + f (vu) = k where the sum is over
all vertices u adjacent to v (some authors use the term “vertex-magic” for this concept).
They prove that the following graphs have vertex-magic total labelings: Cn ; Pn (n >
2); Km,m (m > 1); Km,m − e (m > 2); and Kn for n odd. They also prove that when
n > m + 1, Km,n does not have a vertex-magic total labeling. They conjectured that
Km,m+1 has a vertex-magic total labeling for all m and that Kn has vertex-magic total
labeling for all n > 3. The latter conjecture was proved by Lin and Miller [1953] for
the case that n is divisible by 4 while the remaining cases were done by MacDougall,
Miller, Slamin, and Wallis [2047]. McQuillan [2113] provided many vertex-magic total
labelings for cycles Cnk for k > 3 and odd n > 3 using given vertex-magic labelings for
Ck . Gray, MacDougall, and Wallis [1159] then gave a simpler proof that all complete
graphs are vertex-magic total. Krishnappa, Kothapalli, and Venkaiah [1734] gave another
proof that all complete graphs are vertex-magic total. Senthil Amutha and Murugesan
[2755] characterized connected vertex magic total labeling graphs through their ideals in
topological spaces. Among other results, Wang and Zhang [3450] settle a 2006 conjecture
raised by Slamin et al., which claims the existence of the vertex magic total labeling of
disjoint union of multiple copies of Cn K1 . Vimal Kumar and Vijayalakshmi [3369]
investigated vertex magic total labelings of the middle and total graphs of cycles.
In [2047] MacDougall, Miller, Slamin, and Wallis conjectured that for n > 5, Kn
has a vertex-magic total labeling with magic constant h if and only if h is an integer
satisfying n3 + 3n 6 4h 6 n3 + 2n2 + n. In [2116] McQuillan and Smith proved that this
conjecture is true when n is odd. Armstrong and McQuillan [223] proved that if n ≡ 2
(mod 4) (n > 6) then Kn has a vertex-magic total labeling with magic constant h for
each integer h satisfying n3 + 6n 6 4h 6 n3 + 2n2 − 2n. If, in addition, n ≡ 2 (mod
8), then Kn has a vertex-magic total labeling with magic constant h for each integer h
satisfying n3 + 4n 6 4h 6 n3 + 2n2 . They further showed that for each odd integer

the electronic journal of combinatorics (2023), #DS6 178

n > 5, 2Kn has a vertex-magic total labeling with magic constant h for each integer
h such that n3 + 5n 6 2h 6 n3 + 2n2 − 3n. If, in addition, n ≡ 1(mod 4), then 2Kn
has a vertex-magic total labeling with magic constant h for each integer h such that
n3 + 3n 6 2h 6 n3 + 2n2 − n.
In [2114] McQuillan and McQuillan investigate the existence of vertex-magic labelings
of nC3 . They prove: for every even integer n > 4, nC3 is vertex-magic (and therefore
also edge-magic); for each even integer n > 6, nC3 has vertex-magic total labelings
with at least 2n − 2 different magic constants; if n ≡ 2 mod 4, two extra vertex-magic
total labelings with the highest possible and lowest possible magic constants exist; if
n = 2 · 3k , k > 1, nC3 has a vertex-magic total labeling with magic constant k if and only
if (1/2)(15n + 4) 6 k 6 (1/2)(21n + 2); if n is odd, there are vertex-magic total labelings
for nC3 with n + 1 different magic constants. In [2112] McQuillan provides a technique
for constructing vertex-magic total labelings of 2-regular graphs. In particular, if m is an
odd positive integer, G = Cn1 ∪ Cn2 ∪ · · · ∪ Cnk has a vertex-magic total labeling, and J
is any subset of I = {1, 2, . . . , k} then (∪i∈J mCni ) ∪ (∪i∈I−J mCni ) has a vertex-magic
total labeling.
In [741] Cichacz, Fronček and Singgih introduced a new method to expand some known
vertex magic total labelings of 2-regular graphs. The also proved that for odd values of
m, if (2r + 1) 6≡ 0 (mod 3) and n 6≡ 0 (mod (2r + 1)), then 2mCrn ∪ mCn has a vetex
magic total labeling.
Lin and Miller [1953] have shown that Km,m is vertex-magic total for all m > 1 and
that Kn is vertex-magic total for all n ≡ 0 (mod 4). Phillips, Rees, and Wallis [2394]
generalized the Lin and Miller result by proving that Km,n is vertex-magic total if and
only if m and n differ by at most 1. Cattell [661] has shown that a necessary condition for
a graph of the form H + Kn to be vertex-magic total is that the number of vertices of H is
at least n − 1. As a corollary he gets that a necessary condition for Km1 ,m2 ,...,mr ,n where n
is the largest size of any partite set to be vertex-magic total is that m1 +m2 +· · ·+mr > n.
He poses as an open question whether graphs that meet the conditions of the theorem
are vertex-magic total. Cattell also proves that K1,n,n has a vertex-magic total labeling
when n is odd and K2,n,n has a vertex-magic total labeling when n ≡ 3 (mod 4). In [2548]
Rahim and Slamin proved the disjoint union of coronas CP t1 K1 ∪Ct2 K1 ∪· · ·∪Ctn K1
has a vertex-magic total labeling with magic constant 6 nk=1 tk + 1.
Miller, Bača, and MacDougall [2141] have proved that the generalized Petersen graphs
P (n, k) (see §2.7) for the definition) are vertex-magic total when n is even and k 6 n/2−1.
They conjecture that all P (n, k) are vertex-magic total when k 6 (n − 1)/2 and all
prisms Cn × P2 are vertex-magic total. Bača, Miller, and Slamin [372] proved the first
of these conjectures (see also [2998] for partial results) while Slamin and Miller prove
the second. Slamin, Prihandoko, Setiawan, Rosita and Shaleh [2999] constructed vertex-
magic total labelings for the disjoint union of two copies of P (n, k) and Silaban, Parestu,
Herawati, Sugeng, and Slamin [2955] extended this to any number of copies of P (n, k).
More generally, they proved that for nj > 3 and 1 6 kj 6 b(nj − 1)/2c, the union
P (n1 , k1 ) ∪ P (n2 , k2 ) ∪ · · · ∪ P (nt , kt ) has a vertex-magic total labeling with vertex magic
constant 10(n1 + n2 + · · · + nt ) + 2. In the same article Silaban et al. define the union of t

the electronic journal of combinatorics (2023), #DS6 179

special circulant graphs ∪tj=1 Cn (1, mj ) as the graph with vertex set {vij | 0 6 i 6 n−1, 1 6
j 6 t} and edge set {vij vi+1
j
| 0 6 i 6 n−1, 1 6 j 6 t}∪{vij vi+m
j
j
| 0 6 i 6 n−1, 1 6 j 6 t}.
They prove that for odd n at least 5 and mj ∈ {2, 3, . . . , (n − 1)/2}, the disjoint union
∪tj=1 Cn (1, mj ) has a vertex-magic total labeling with constant 8tn + (n − 10/2 + 3.
MacDougall et al. ([2047], [2049] and [1157]) have shown: Wn has a vertex-magic total
labeling if and only if n 6 11; fans Fn have a vertex-magic total labelings if and only if
n 6 10; friendship graphs have vertex-magic total labelings if and only if the number of
triangles is at most 3; Km,n (m > 1) has a vertex-magic total labeling if and only if m
and n differ by at most 1. Wallis [3407] proved: if G and H have the same order and
G ∪ H is vertex-magic total then so is G + H; if the disjoint union of stars is vertex-magic
total, then the average size of the stars is less than 3; if a tree has n internal vertices and
more than 2n leaves then it does not have a vertex-magic total labeling. Wallis [3408] has
shown that if G is a regular graph of even degree that has a vertex-magic total labeling
then the graph consisting of an odd number of copies of G is vertex-magic total. He also
proved that if G is a regular graph of odd degree (not K1 ) that has a vertex-magic total
labeling then the graph consisting of any number of copies of G is vertex-magic total.
Gray, MacDougall, McSorley, and Wallis [1158] investigated vertex-magic total label-
ings of forests. They provide sufficient conditions for the nonexistence of a vertex-magic
total labeling of forests based on the maximum degree and the number of internal vertices,
and leaves or the number of components. They also use Skolem sequences to prove a star
forest with each component a K1,2 has a vertex-magic total labeling.
Recall a helm Hn is obtained from a wheel Wn by attaching a pendent edge at each
vertex of the n-cycle of the wheel. A generalized helm H(n, t) is a graph obtained from a
wheel Wn by attaching a path on t vertices at each vertex of the n-cycle. A generalized web
W(n, t) is a graph obtained from a generalized helm H(n, t) by joining the corresponding
vertices of each path to form an n-cycle. Thus W(n, t) has (t + 1)n + 1 vertices and
2(t + 1)n edges. A generalized Jahangir graph Jk,s is a graph on ks + 1 vertices consisting
of a cycle Cks and one additional vertex that is adjacent to k vertices of Cks at distance s
to each other on Cks . Rahim, Tomescu, and Slamin [2549] prove: Hn has no vertex-magic
total labeling for any n > 3; W(n, t) has a vertex-magic total labeling for n = 3 or n = 4
and t = 1, but it is not vertex-magic total for n > 17t + 12 and t > 0; and Jn,t+1 is
vertex-magic total for n = 3 and t = 1, but it does not have this property for n > 7t + 11
and t > 1. Recall a flower is the graph obtained from a helm by joining each pendent
vertex to the central vertex of the helm. Ahmad and Tomescu [118] proved that flower
graph is vertex-magic if and only if the underlying cycle is C3 .
Fronček, Kovář, and Kovářová [974] proved that Cn ×C2m+1 and K5 ×C2n+1 are vertex-
magic total. Kovář [1746] furthermore proved some general results about products of
certain regular vertex-magic total graphs. In particular, if G is a (2r + 1)-regular vertex-
magic total graph that can be factored into an (r + 1)-regular graph and an r-regular
graph, then G × K5 and G × Cn for n even are vertex-magic total. He also proved that if
G an r-regular vertex-magic total graph and H is a 2s-regular supermagic graph that can
be factored into two s-regular factors, then their Cartesian product G × H is vertex-magic
total if either r is odd, or r is even and |H| is odd.

the electronic journal of combinatorics (2023), #DS6 180

 Ivančo and Polláková [1347] consider supermagic graphs having a saturated vertex
(i.e., a vertex that is adjacent to every other vertex). They characterize supermagic
graphs G + K1 , where G is a regular graph, using a connection to vertex-magic total
graphs. They prove that if G is a d-regular graph of order n then the join G + K1 is
supermagic if and only if G has a VMT labeling with constant h such that (n − d − 1) is
a divisor of the non-negative integer (n + 1)h − n((d + 2)/2)(n(d + 2)/2) + 1). They also
prove K1,n,n is supermagic if and only if n > 2; K1,2,2,...,2 is supermagic except for K1,2 ;
and the graph obtained from Kn,n (n > 5) by removing all edges in a Hamilton cycle is
supermagic. They also consider circulant graphs and prove that the complement of the
circulant graph C2n (1, n), n > 4, is supermagic.
In [2534] a novel algorithm is proposed based on the calculation of vertex magic total
labelling value for every node in the network. Upon receiving the message from the sender
node, the receiver node will quickly detect the faulty node by comparing the vertex magic
total labeling pivot value. Experimental results show that the proposed approach leads
to high true fault rate detection accuracy compared to the false fault rate detection.
MacDougall, Miller, and Sugeng [2048] define a super vertex-magic total labeling of a
graph G(V, E) as a vertex-magic total labeling f of G with the additional property that
f (V ) = {1, 2, . . . , |V |} and f (E) = {|V | + 1, |V | + 2, . . . , |V | + |E|} (some authors use the
term “super vertex-magic” for this concept). They show that a (p, q)-graph that has a
super vertex-magic total labeling with magic constant k satisfies the following conditions:
k = (p + q)(p + q + 1)/v − (v + 1)/2; k > (41p + 21)/18; if G is connected, k > (7p − 5)/2;
p divides q(q + 1) if p is odd, and p divides 2q(q + 1) if p is even; if G has even order either
p ≡ 0 (mod 8) and q ≡ 0 or 3 (mod 4) or p ≡ 4 (mod 8) and q ≡ 1 or 2 (mod 4); if G
is r-regular and p and r have opposite parity then p ≡ 0 (mod 8) implies q ≡ 0 (mod 4)
and p ≡ 4 (mod 8) implies q ≡ 2 (mod 4). They also show: Cn has a super vertex-magic
total labeling if and only if n is odd; and no wheel, ladder, fan, friendship graph, complete
bipartite graph or graph with a vertex of degree 1 has a super vertex-magic total labeling.
They conjecture that no tree has a super vertex-magic total labeling and that K4n has a
super vertex-magic total labeling when n > 1. The latter conjecture was proved by Gómez
in [1121]. In [1122] Gómez proved that if G is a d-regular graph that has a vertex-magic
total labeling and k is a positive integer such that (k − 1)(d + 1) is even, then kG has a
super vertex-magic total labeling. As a corollary, we have that if n and k are odd or if
n ≡ 0 (mod 4) and n > 4, then kKn has a super vertex-magic total labeling. Gómez also
shows how graphs with super vertex-magic total labeling can be constructed from a given
graph G with super vertex-magic total labeling by adding edges to G in various ways.
Gray and MacDougall [1156] establish the existence of vertex-magic total labelings
for several infinite classes of regular graphs. Their method enables them to begin with
any even-regular graph and from it construct a cubic graph possessing a vertex-magic
total labeling. A feature of the construction is that it produces strong vertex-magic
total labelings many even order regular graphs. The construction also extends to certain
families of non-regular graphs. MacDougall has conjectured (see [1747]) that every r-
regular (r > 1) graph with the exception of 2K3 has a vertex-magic total labeling. As a
corollary of a general result Kovář [1747] has shown that every 2r-regular graph with an

the electronic journal of combinatorics (2023), #DS6 181

odd number of vertices and a Hamiltonian cycle has a vertex-magic total labeling.
Gómez and Kovář [1123] proved that a super vertex-magic total labeling of kKn exists
for n odd and any k, for 4 < n ≡ 0 (mod 4) and any k, and for n = 4 and k even. They
also showed kK4t+2 does not admit a super vertex-magic total labeling for k odd and
provide a large number of super vertex-magic total labelings of kK4t+2 for any k based
on a super vertex-magic total labeling of kK4t+1 .
Beardon [517] has shown that a necessary condition for a graph with c components, p
vertices, q edges and a vertex of degree d to be vertex-magic total is (d+2)2 6 (7q 2 +(6c+
5)q + c2 + 3c)/p. When the graph is connected this reduces to (d + 2)2 6 (7q 2 + 11q + 4)/p.
As a corollary, the following are not vertex-magic total: wheels Wn when n > 12; fans Fn
(n)
when n > 11; and friendship graphs C3 when n > 4.
Beardon [519] has investigated how vertices of small degree effect vertex-magic total
labelings. Let G(p, q) be a graph with a vertex-magic total labeling with magic constant
k and let d0 be the minimum degree of any vertex. He proves k 6 (1 + d0 )(p + q − d0 /2)
and q < (1 + d0 )q. He also shows that if G(p, q) is a vertex-magic graph with a vertex of
degree one and t is the number of vertices of degree at least two, then t > q/3 > (p − 1)/3.
Beardon [519] has shown that the graph obtained by attaching a pendent edge to Kn is
vertex-magic total if and only if n = 2, 3, or 4.
Meissner and Zwierzyński [2131] used finding vertex-magic total labelings of graphs
as a way to compare the efficiency of parallel execution of a program versus sequential
processing.
Swaminathan and Jeyanthi [3170] prove the following graphs are super vertex-magic
total: Pn if and only if n is odd and n > 3; Cn if and only if n is odd; the star graph
if and only if it is P2 ; and mCn if and only if m and n are odd. In [3171] they prove
the following: no super vertex-magic total graph has two or more isolated vertices or an
isolated edge; a tree with n internal edges and tn leaves is not super vertex-magic total
if t > (n + √ 1)/n; if ∆ is the largest degree of any vertex in a tree T with p vertices and
∆ > (−3 + 1 + 16p)/2, then T is not super vertex-magic total; the graph obtained from
a comb by appending a pendent edge to each vertex of degree 2 is super vertex-magic
total; the graph obtained by attaching a path with t edges to a vertex of an n-cycle is
super vertex-magic total if and only if n + t is odd. Ali, Bača, and Bashir [150] proved
that mP3 and mP4 have no super vertex-magic total labeling
For n > 1 and distinct odd integers x, y and z in [1,n − 1] Javaid, Ismail, and Salman
[1355] define the chordal ring of order n CRn (x, y, z), as the graph with vertex set Zn , the
additive group of integers modulo n, and edges (i, i + x), (i, i + y), (i, i + z) for all even
i. They prove that CRn (1, 3, n − 1) has a super vertex-magic total labeling when n ≡ 0
mod 4 and n > 8 and conjecture that for an odd integer ∆, 3 6 ∆ 6 n − 3, n ≡ 0 mod 4,
CRn (1, ∆, n − 1) has a super vertex-magic total labeling with magic constant 23n/4 + 2.
The Knödel graphs W∆,n with n even and degree ∆, where 1 6 ∆ 6 b log2 nc have
vertices pairs (i, j) with i = 1, 2 and 0 6 j 6 n/2 − 1 where for every 0 6 j 6 n/2 − 1
and there is an edge between vertex (1, j) and every vertex (2, (j + 2k − 1) mod n/2), for
k = 0, 1, . . . , ∆ − 1. Xi, Yang, Mominul, and Wong [3495] have shown that W3,n is super
vertex-magic total when n ≡ 0 mod 4.

the electronic journal of combinatorics (2023), #DS6 182

 Marimuthu and Balakrishnan [2079] called a vertex magic total labeling of G(V, E)
E-super vertex magic if f (E(G)) = {1, 2, 3, . . . , |E(G)|}. The cocktail party graph,
Hm,n (m, n > 2), is the graph with a vertex set V = {v1 , v2 , . . . , vmn } partitioned
into n independent sets V = {I1 , I2 , . . . , In } each of size m such that vi vj ∈ E for all
i, j ∈ {1, 2, . . . , mn} where i ∈ Ip , j ∈ Iq , p 6= q. (The graph Hn,n is the complement
of the ladder graph and the dual graph of the n-cube.) Marimuthu and Balakrishnan
[2079] gave some basic properties of such labelings and proved that Hm,n is E-super ver-
tex magic. Wang and Zhang [3448] show the following: Hamiltonian even regular graphs
of odd order are E-super magic; even-regular graphs of odd order that contains a 2-factor
consisting of an odd number of odd cycles with the same size are E-super vertex magic;
graphs that can be decomposed into the sum of two spanning graphs where one is E-super
magic and one is regular of even degree are E-supermagic; even-regular graphs of odd or-
der that contain a 2-factor consisting of an odd number of odd cycles with the same size
are E-super vertex magic; and circulant graphs with odd order are E-super vertex magic.
Swaminathan and Jeyanthi [3170] proved that mCn is E-super magic if and only if both
m and n are odd.
Samarathunge, Athapattu, and Perera [2690] proved that an E-super vertex labeling [2690] new
of edges adjacent to a leaf vertex must be greater than or equal to k − (p + q) and sum
of the parent edge labelings must be greater than or equal to k − (p + q), which k is
the magic constant. This implies that an E-super vertex labeling does not been proved
that E-super vertex magic labeling does not exist for the perfect binary trees. A broom
Bn,d is ontained by attaching n − d pendent edges to one of the pendent vertices of Pd .
Marimuthu, Suganya, Kalaivani, and Balakrishnan [2085] proved the following: Bn,n−2 [2085] new
is E-super vertex magic if and only if n is odd; a graph obtained by subdividing all the
edges of K1,n is super E-super vertex magic if and only if n 6 4, and K1,n is E-super
vertex magic if and only if n = 2.
In [2084] Marimuthu and Kumar investigate E-super vertex magic labelings of discon-
nected graphs. They prove: if a graph with p vertices and q edges and even order has an
E-super vertex magic labeling, then either (i) p ≡ 0 (mod 8) and q ≡ 0 or 3 (mod 4),
or (ii) p ≡ 4 (mod 8) and q ≡ 1 or 2 (mod 4); if an r-regular graph G of order p has an
E-super vertex magic labeling, then p and r have opposite parity and (i) if p ≡ 0 (mod
8), then q ≡ 0 (mod 4) (ii) if p ≡ 4 (mod 8), then q ≡ 2 (mod 4); mCn is E-super vertex
magic if and only if Pn ∪ (m − 1)Cn is E-super vertex magic; Pm ∪ K1,m is not E-super
vertex magic; Cm ∪ Pn is not E-super vertex magic if both m and n have the same parity;
the disjoint union of two non-isomorphic suns is not E-super vertex magic; the disjoint
union of any number of isomorphic suns is not E-super vertex magic; and mP3 is not
E-super vertex magic for any integer m > 1. They conjecture that Km ∪ Pm is E-super
vertex magic if m = 8t + 2.
In [2229] Mutharasu and Kumar generalized the notion of super vertex-magic total
labelings as follows. Let G(V, E) be a graph and k be an integer with 1 6 k 6 diam(G).
For e ∈ E(G), let Ek (e) be the set of all vertices that are at a distance at most k from
e and let Ek (v) be the set of all edges that are at a distance at most k from v (u and v
are at distance 1 from the edge uv). A graph G is said to be Ek -regular with regularity

the electronic journal of combinatorics (2023), #DS6 183

r if, for all edges e, |Ek (e)| = r for some positive integer r. Note that all nontrivial
graphs are E1 -regular. Let G be a simple graph with p vertices and q edges. A V -
super vertex magic labeling is a bijection f : V (G) ∪ E(G) → {1, 2,P. . . , p + q} such that
f (V (G)) = {1, 2, . . . , p} and for each vertex v ∈ V (G), f (v) + u∈N (v) f (uv) = M
for some positive integer M . A Vk -super vertex magic labeling (Vk -SVML) is a bijection
f : V (G) ∪ E(G) → {1, 2, . . .P , p + q} with the property that f (V (G)) = {1, 2, . . . , p} and
for each v ∈ V (G), f (v) + e∈Ek (v) f (e) = M for some positive integer M . A graph
that admits a Vk -SVML is called Vk -super vertex magic. Mutharasu and Kumar gave a
necessary and sufficient condition for the existence of Vk -SVML in graphs, determined the
magic constant for Ek -regular graphs, and obtained results about V2 -SVML labelings for
cycles, complement of cycles, prisms, and a family of circulant graphs.
Balbuena, Barker, Das, Lin, Miller, Ryan, and Slamin [409] call a vertex-magic to-
tal labeling of G(V, E) a strongly vertex-magic total labeling if the vertex labels are
{1, 2, . . . , |V |}. They prove: the minimum degree of a strongly vertex-magic total graph
is at least
√ 2; for a strongly vertex-magic total graph G with n vertices and e edges, if
2e > 10n2 − 6n + 1 then the minimum degree of G is at least √ 3; and for a strongly
vertex-magic total graph G with n vertices and e edges if 2e < 10n2 − 6n + 1 then the
minimum degree of G is at most 6. They also provide strongly vertex-magic total label-
ings for certain families of circulant graphs. In [2112] McQuillan provides a technique for
constructing vertex-magic total labelings of 2-regular graphs. In particular, if m is an
odd positive integer, G = Cn1 ∪ Cn2 ∪ · · · ∪ Cnk has a strongly vertex-magic total labeling,
and J is any subset of I = {1, 2, . . . , k} then (∪i∈J mCni ) ∪ (∪i∈I−J mCni ) has a strongly
vertex-magic total labeling.
Gray [1150] proved that if G is a graph with a spanning subgraph H that possesses a
strongly vertex-magic total labeling and G − E(H) is even regular, then G also possesses
a strongly vertex-magic total labeling. As a corollary one has that regular Hamiltonian
graphs of odd order have a strongly vertex-magic total labelings.
In a series of papers Gray and MacDougall expand on McQuillan’s technique to obtain
a variety of results. In [1153] Gray and MacDougall show that for any r > 4, every r-
regular graph of odd order at most 17 has a strong vertex-magic total labeling. They also
showthat several large classes of r-regular graphs of even order, including some Hamil-
tonian graphs, have vertex-magic total labelings. They conjecture that every 2-regular
graph of odd order possesses a strong vertex-magic total labeling if and only if it is not
of the form (2t − 1)C3 ∪ C4 or 2tC3 ∪ C5 . They include five open problems.
In [1155] Gray and MacDougall introduce a procedure called a mutation that trans-
forms one vertex-magic totaling labeling into another one by swapping sets of edges among
vertices that may result in different labeling of the same graph or a labeling of a different
graph. Among their results are: a description of all possible mutations of a labeling of
the path and the cycle; for all n > 2 and all i from 1 to n − 1 the graphs obtained by
identifying an end points of paths of lengths i, i + 1, and 2n − 2i − 1 have a vertex-magic
total labeling; for odd n, the graph obtained by attaching a path of length n − m to an m
cycle, (such graphs are called (m; n − m)-kites ) have strong vertex-magic total labelings
for m = 3, . . . , n − 2; C2n+1 ∪ C4n+4 and 3C2n+1 have a strong vertex-magic total labeling;

the electronic journal of combinatorics (2023), #DS6 184

and for n > 2, C4n ∪ C6n−1 has a strong vertex-magic total labeling. They conclude with
three open problems.
Kimberley and MacDougall [1701] studied mutations that involve labelings of regular
graphs into labelings of other regular graphs. They present results of extensive compu-
tations which confirm how prolific this procedure is. These computations add weight to
MacDougall’s conjecture that all nontrivial regular graphs are vertex-magic.
Gray and MacDougall [1154] show how to construct vertex-magic total labelings for
several families of non-regular graphs, including the disjoint union of two other graphs
already possessing vertex-magic total labelings. They prove that if G is a d-regular graph
of order v and H a t-regular graph of order u with each having a strong vertex magic
total labeling and vd2 + 2d + 2v + 2u = 2tvd + 2t + ut2 then G ∪ H possesses a strong
vertex-magic total labeling. They also provide bounds on the minimum degree of a graph
with a vertex-magic total labeling.
In [1156] Gray and MacDougall establish the existence of vertex-magic total labelings
for several infinite classes of regular graphs. Their method enables them to begin with any
even-regular graph and construct a cubic graph possessing a vertex-magic total labeling
that produces strong vertex-magic total labelings for many even order regular graphs.
The construction also extends to certain families of non-regular graphs.
In [2245] Nagaraj, Ponnappan, and Prabakaran define a vertex-magic total la-
beling of G to be an even vertex magic total labeling if the set of vertex labels is
{2, 4, 6, . . . , 2|V (G)|}. They prove the following: Cn is even vertex magic total if and
only if n is odd; rCs is even vertex magic total if and only if r and s are odd; Cn K1 is
even vertex magic total; wheels are not even vertex magic total; fans (excluding C3 ) are
not even vertex magic total; kites are not even vertex magic total; and K4n is not even
vertex magic total. In [2248] they prove that C3 ∪ C2t (t > 2) and C4 ∪ C2t+1 (t > 2) have
even vertex magic total labelings. In [2247] Nagaraj, Ponnappan, and Prabakan prove
that the union of any finite numbers of graphs of the form Cn K1 (the sizes may vary)
has an even vertex magic total labeling.
Rahim and Slamin [2547] give the bounds for the number of vertices for Jahangir
graphs, helms, webs, flower graphs and sunflower graphs when the graphs considered
are not vertex-magic total. Thirusangu, Nagar, and Rajeswari [3212] show that certain
Cayley digraphs of cyclic groups have vertex-magic total labelings.
Balbuena, Barker, Lin, Miller, and Sugeng [410] call vertex-magic total labeling an
a-vertex consecutive magic labeling if the vertex labels are {a, a + 1, . . . , a + |V |}. For an
a-vertex consecutive magic labeling of a graph G with p vertices and q edges they prove:
if G has one isolated vertex, then a = q and (p − 1)2 + p2 = (2q + 1)2 ; if q = p − 1, then
p is odd and a = p − 1; if p = q, then p is odd and if G has minimum degree 1, then
a = (p+1)/2 or a = p; if G is 2-regular, then p is odd and a = 0 or p; and if G is r-regular,
then p and r have opposite parities. They also define an b-edge consecutive magic labeling
analogously and state some results for these labelings. Marimuthu and Kumar [2087] gave [2087] new
some results related to a-vertex consecutive magic graphs. In [2807] Setiawan, Sugeng, [2807] new
Silaban, and Riama provided sufficient conditions for a graph to admit a super edge magic
total labeling and to have a b-edge consecutive edge magic total labeling. They alos gave

the electronic journal of combinatorics (2023), #DS6 185

the super edge magic total labelings for banana trees, firecrackers, and identified several
classes of connected graphs that have both labelings.
Wood [3485] generalizes vertex-magic total and edge-magic total labelings by requiring
only that the labels be positive integers rather than consecutive positive integers. He
gives upper bounds for the minimum values of the magic constant and the largest label
for complete graphs, forests, and arbitrary graphs.
Exoo, Ling, McSorley, Phillips, and Wallis [911] call a function λ a totally magic
labeling of a graph G if λ is both an edge-magic total and a vertex-magic total labeling
of G. A graph with such a labeling is called totally magic. Among their results are: P3
is the only connected totally magic graph that has a vertex of degree 1; the only totally
magic graphs with a component K1 are K1 and K1 ∪ P3 ; the only totally magic complete
graphs are K1 and K3 ; the only totally magic complete bipartite graph is K1,2 ; nK3 is
totally magic if and only if n is odd; P3 ∪ nK3 is totally magic if and only if n is even.
In [3410] Wallis asks: Is the graph K1,m ∪ nK3 ever totally magic? That question was
answered by Calhoun, Ferland, Lister, and Polhill [652] who proved that if K1,m ∪ nK3 is
totally magic then m = 2 and K1,2 ∪ nK3 is totally magic if and only if n is even.
McSorley and Wallis [2118] examine the possible totally magic labelings of a union of
an odd number of triangles and determine the spectrum of possible values for the sum of
the label on a vertex and the labels on its incident edges and the sum of an edge label
and the labels of the endpoints of the edge for all known totally magic graphs.
Gray and MacDougall [1151] define an order n sparse semi-magic square to be an n×n
array containing the entries 1, 2, . . . , m once (for some m < n2 ), has its remaining entries
equal to 0, and whose rows and columns have a constant sum of k. They prove some
basic properties of such squares and provide constructions for several infinite families of
squares, including squares of all orders n > 3. Moreover, they show how such arrays can
be used to construct vertex-magic total labelings for certain families of graphs.
In Tables 8, 9, and 10, VMT means vertex-magic total labeling, SVMT means super
vertex magic total, and TM means totally magic labeling. A question mark following an
abbreviation indicates that the graph is conjectured to have the corresponding property.
The tables were prepared by Petr Kovář and Tereza Kovářová and updated by J. Gallian
in 2007.

Table 8: Summary of Vertex-magic Total Labelings

Graph Types Notes

Cn VMT [2047]

Pn VMT n > 2 [2047]

Km,m − e VMT m > 2 [2047]

Km,n VMT iff |m − n| 6 1 [2394], [2047], [2049]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 186

 Table 8 – Continued from previous page
Graph Types Notes

Kn VMT for n odd [2047]

for n ≡ 2 (mod 4),n > 2 [1953]
nK3 VMT iff n 6= 2 [932], [933], [2114]

mKn VMT m > 1, n > 4 [2117]

Petersen P (n, k) VMT [372]

prisms Cn × P2 VMT [2998]

Wn VMT iff n 6 11 [2047], [2049]

Fn VMT iff n 6 10 [2047], [2049]

friendship graphs VMT iff # of triangles 6 3 [2047], [2049]

G+H VMT |V (G)| = |V (H)|

and G ∪ H is VMT [3407]

unions of stars VMT [3407]

tree with n internal vertices not VMT [3407]

and more than 2n leaves
nG VMT n odd, G regular of even
degree, VMT [3408]
G is regular of odd
degree, VMT, but not K1 [3408]
Cn × C2m+1 VMT [974]

K5 × C2n+1 VMT [974]

G × C2n VMT G 2r + 1-regular VMT [1746]

G × K5 VMT G 2r + 1-regular VMT [1746]

G×H VMT G r-regular VMT, r odd

or r even and |H| odd,
H 2s-regular supermagic [1746]

the electronic journal of combinatorics (2023), #DS6 187

 Table 9: Summary of Super Vertex-magic Total
Labelings

Graph Types Notes

Pn SVMT iff n > 1 is odd [3170]

Cn SVMT iff n is odd [3170] and [2048]

K1,n SVMT iff n = 1 [3170]

mCn SVMT iff m and n are odd [3170]

Wn not SVMT [2048]

ladders not SVMT [2048]

friendship graphs not SVMT [2048]

Km,n not SVMT [2048]

dragons (see §2.2) SVMT iff order is even [3171], [3171]

Knödel graphs W3,n SVMT n ≡ 0 (mod 4) [3495]

graphs with min. deg. 1 not SVMT [2048]

K4n SVMT n > 1 [1121]

Table 10: Summary of Totally Magic Labelings

Graph Types Notes

P3 TM the only connected
TM graph with vertex
of deg 1 [911]

Kn TM iff n = 1, 3 [911]

Km,n TM iff Km,n = K1,2 [911]

nK3 TM iff n is odd [911]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 188

 Table 10 – Continued from previous page
Graph Types Notes

P3 ∪ nK3 TM iff n is even [911]

K1,m ∪ nK3 TM iff m = 2 and n is even [652]

5.4 H-Magic Labelings

In 2005 Gutiérrez and Lladó [1167] introduced the notion of an H-magic labeling of
a graph, which generalizes the concept of a magic valuation. Let H and G = (V, E)
be finite simple graphs with the property that every edge of G belongs to at least one
subgraph isomorphic to H. A bijection f : V ∪ E → {1, . . . , |V | + |E|} is an H-magic
labeling of G if there exists a positive integer m(f ), called
P the magic P sum, such that for
any subgraph H 0 (V 0 , E 0 ) of G isomorphic to H, the sum v∈V 0 f (v) + e∈E 0 f (e) is equal
to the magic sum, m(f ). A graph is H-magic if it admits an H-magic labeling. If, in
addition, the H-magic labeling f has the property that {f (v)}v∈V = {1, . . . , |V |}, then
the graph is H-supermagic. A K2 -magic labeling is also known as an edge-magic total
labeling. Gutiérrez and Lladó investigate the cases where G = Kn or G = Km,n and
H is a star or a path. Among their results are: a d-regular graph is not K1,h for any
1 < h < d; Kn,n is K1,n -magic for all n; Kn,n is not K1,n -supermagic for n > 1; for any
integers 1 < r < s, Kr,s is K1,h -supermagic if and only if h = s; Pn is Ph -supermagic for
all 2 6 h 6 n; Kn is not Ph -magic for any 2 < h 6 n; Cn is Ph -magic for any 2 6 h < n
such that gcd(n, h(h − 1)) = 1. They also show that by uniformly gluing copies of H
along edges of another graph G, one can construct connected H-magic graphs from a
given 2-connected graph H and an H-free supermagic graph G.
Lladó and Moragas [1982] studied cycle-magic graphs. They proved: wheels Wn are
(k)
C3 -magic for odd n at least 5; for r > 3 and k > 2 the windmill graphs Cr (the one-point
union of k copies of Cr ) are Cr -supermagic; and if G is C4 -free supermagic graph of odd
size, then G × K2 is C4 -supermagic. As corollaries of the latter result, they have that
for n odd, prisms Cn × K2 and books K1,n × K2 are C4 -magic. They define a subdivided
wheel Wn (r, k) as the graph obtained from a wheel Wn by replacing each radial edge
vvi , 1 6 i 6 n by a vvi -path of size r > 1, and every external edge vi vi+1 by a vi vi+1 -path
of size k > 1. They prove that Wn (r, k) is C2r+k -magic for any odd n 6= 2r/k + 1 and that
Wn (r, 1) is C2r+1 -supermagic. They also prove that the graph obtained by joining the
end points of any number of internally disjoint paths of length p > 2 is C2p -supermagic.
Asif, Ali, Numan, and Semaničová-Feňovčı́ková [259] proved that if G is Cr -(super)magic,
then so is nG and that Pm × Pn (m, n > 4) is C4 -supermagic. In [2483] Pradipta and
Salman define a calendula graph, denoted by Clm,n , as the graph constructed from Cm
and m copies of Cn , Cn1 , Cn2 , . . . , Cnm , and grafting the i-th edge of Cm to an edge
of Cni for each i. They provide some cycle-supermagic labelings of calendula graphs.
Chithra, Marimuthu, and Kumar [703] provided some basic results on the magic constant

the electronic journal of combinatorics (2023), #DS6 189

of graphs, on cycle-supermagic labelings of generalized splitting graphs, and proved that
mCn is cycle -supermagic for m > 2 and n > 3. Yang, Rashid, Siddiqui, and Hanif [3516]
have provided explicit formulas for various Cn -super magic labelings of pumpkin graphs
(graphs with exactly two vertices with multiple edges joining them) and two classes of
planar graphs containing 8-sided and 4-sided faces or 6-sided and 4-sided faces.
A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there
is a bijection f from V (G)∪E(G) onto {0, 1, . . . , |V (G)|+|E(G)|−1} such that the sum of
labels of edges and vertices of each copy of H in the decomposition is constant. By using
the results on the sumset partition problem, Inayah, Lladó, and Moragas [1322] show that
K2m+1 admits T -magic decompositions by any graceful tree with m edges. They address
analogous problems for complete bipartite graphs and for antimagic and (a, d)-antimagic
decompositions.
An edge of H-magic graph G is said to be a good edge if it belongs to only one subgraph
isomorphic to H. For s > 1, B is the collection of good edges obtained by choosing exactly
s good edges from each subgraph isomorphic to H in G. A uniform subdivided graph G of
the graph G is obtained by subdividing all edges of B with k > 1 vertices. A nonuniform
subdivided graph is obtained by subdividing the edges of E(G) \ B. Rizvi, Khalid, Ali,
Miller, and Ryan [2635] prove that if a graph G is a Cn -supermagic graph then its uniform
subdivided graph G is Cn+sk -(super)magic for positive integers n, s, and k. Using known
results on the cycle-supermagicness they immediately obtain that uniform subdivided
graphs of fans, antiprisms, triangular ladders, ladders and grids are cycle-(super)magic.
They also prove that some special nonuniform subdivisions of fans and triangular ladders
are cycle-supermagic.
Jeyanthi and Muthuraja [1482] established that Pm,n is C2m -supermagic for all
m, n > 2 and the splitting graph of Cn is C4 -supermagic for n 6= 4. Nirmalasari Wi-
jaya, Ryan, and Kalinowski [2303] show that for odd n and arbitrary k, the firecracker
Fk,n is F2,n -supermagic, the banana tree Bk,n is B1,n -supermagic, and flower graphs are C3 -
supermagic. Kojima [1725] proved that for two positive integers m and t with m > t > 2,
if Cm is Pt -supermagic, then C3m is also Pt -supermagic and for t = 2, 3, 4, or 9 and
Cn is Pt -supermagic if and only if n is odd with n > t. Nirmalasari Wijaya, Ryan, and
Kalinowski [2279] proved that every d-dimensional grid graph (d > 2) is Qd -supermagic
where Qd is the d-cube. Pu, Numan, Butt, Asif, Rafique, and Shao [2528] showed that
toroidal fullerenes, Klein-bottle fullerenes, and the disjoint union of toroidal and Klein-
bottle fullerenes are C6 -supermagic and the subdivision of toroidal fullerenes, Klein-bottle
fullerenes, and any graph homeomorphic to a toroidal fullerene or Klein-bottle fullerene
are cyclic-supermagic. Ulfatimah, Roswitha, and Kusmayadi [3237] proved that a star
with one or more appended edges at each end-point admits a double star S2,2 -supermagic
labeling and Lm Pn admits supermagic labeling of the one-point union of C3 and C4
for m, n > 2. Martini, Roswitha, and Lestari [2092] provided a C4 -supermagic labeling of [2092] new
Pn × Pm and a C3 supermagic labeling of K1 + K2 .
Öner and Erol [2321] showed that the triangular book-snake graph S(3, n, s) admits a
C3 -supermagic labeling. Using these labelings and supermagicness of subdivisions given
by Taimur, Numan, Mumtaz, and Semanic̆ová-Fen̆ovc̆ı́ková in [3184] and the fact that

the electronic journal of combinatorics (2023), #DS6 190

S(m, n, s) can be thought of as a subdivision of S(3, n, s), Öner and Erol showed the
Cm -supermagicness of polygonal book-snake graph S(m, n, s).
The edge corona path graph Gm  Pn is the graph obtained from one copy of the
gear graph Gm and 3m copies of Pn , Pni , by joining two end vertices of ei ∈ E(Gm ) to
every vertex vj inV (Pn ) in the i-th copy of Gm with i = 1, 2, . . . , 3m and j = 1, 2, . . . , n.
Noviati, Martini, and Indriati [2306] provided a C3  Pn -supermagic labeling for fn  Pn
and a P3  Pn -supermagic labeling for Sn  Pn for odd n > 3.
Rizvi, Ali, and Hussian [2633] proved: the disjoint union of two or more copies of G is
C3 -supermagic when G is a fan, triangular ladder, wheel, or a generalized antiprism; the
disjoint union of two or more copies of G is C3 -supermagic when G is a ladder or a book;
sFn+1 ∪ kFn is C3 -supermagic; and sLn+1 ∪ kLn is C4 -supermagic. Khalid, Rizvi, and Ali
[1682] investigated whether the disjoint union of isomorphic copies of a connected cycle-
supermagic graph is cycle-supermagic or not. They also study cycle-supermagic labelings
for the disjoint union of isomorphic copies of fans, ladders, triangular ladders, wheels,
books, and generalized antiprisms as well as disjoint unions of non-isomorphic copies of
ladders and fans. Ali, Rizvi, Semaničová-Feňovčı́ková [157] proved that the disjoint union
of an arbitrary number of isomorphic copies of prisms Cn × Pm , m > 2 and n > 3, n 6= 4,
is C4 -supermagic. They propose an open problem to find a C4 -supermagic labeling of the
graph t(C4 × Pm ) for m > 2 and t > 1.
Liang [1937] proved the following: if there exist an even integer k and mi ≡ 0 (mod k)
for every i in [1,n], then there exist Kk,k - and C2k -supermagic decompositions of Km1 ,...,mn ;
if k and tn > k are even integers, then for any positive integers ti ≡ 0 (mod k), i in [1, n−1],
there exists a C2k -supermagic decomposition of Kt1 ,...,tn−1 ,tn ; if there exists an even integer
k and Km,n is C2k -decomposable, then there exists a C2k -supermagic decomposition of
Km,n ; and if G is a graph with p vertices and p edges, H is a graph with q vertices
and q edges, and there is an H-supermagic decomposition of G, then there exists an H-
supermagic decomposition of nG. In [3469] Wichianpaisarn and Mato gave necessary and
sufficient conditions for the existence of K1,n−1 -supermagic decomposition of Kn,n minus
a one-factor.
In [2100] Maryati, Baskoro, and Salman provided Pn -(super) magic labelings of subdi-
visions of stars, shrubs and banana trees. Ngurah, Salman, and Sudarsana [2294] construct
Cn -(super) magic labelings for some fans and ladders. For any connected graph H, Mary-
ati, Salman, Baskoro, and Irawati [2103] proved that the disjoint union of k isomorphic
copies of a connected graph H is a H-supermagic graph if and only if |V (H)| + |E(H)|
is even or k is odd. In [2101] Maryati, Baskoro, Salman, and Irawati give some necessary
conditions for any Pn -magic graph and provide some Pn -supermagic labelings of a cycle
with some pendent edges and its subdivisions.
The m-shadow of graph G, Dm (G), is a graph obtained by taking m copies of G,
namely, G1 , G2 , . . . , Gm , and then joining every vertex u in Gi , i ∈ {1, 2, . . . , m − 1}, to
the neighbors of the corresponding vertex v in Gi+1 . Agustin, Susanto, Dafik, Prihandini,
Alfarisi, and Sudarsana [73] studied the H-supermagic labelings of Dm (G) where G are
paths and cycles.
Kojima [1725] proved the following. Let G be a C4 -free super edge-magic (p, q)-graph

the electronic journal of combinatorics (2023), #DS6 191

with the minimum degree at least one and m > 2. If q odd and m = 2 or |p − q| > 2, then
Pm × G is C4 -supermagic; if p is odd and m = 2 or |p − q| = 1 and m 6 5, then Pm × G
is C4 -supermagic; if n > 3 is odd and m is even, then P2 × (Cn Km ) is C4 -supermagic;
if n > 3 is odd and m is odd, then P2 × (Cn Km ) is not C4 -supermagic; if G is a
caterpillar, then Pm × G is C4 -supermagic for m > 2; and Pm × Cn is C4 -supermagic for
m > 2 and n > 3. The latter result solved an open problem in [2295] by Ngurah, Salman,
and Susilowati. Kojma also proved that if a C4 -free bipartite (p, p − 1)-graph G with the
minimum degree at least one and partite sets U and V has a super edge-magic labeling
f of G such that f (U ) = {1, 2, . . . , |U |}, then Pm × (2G) is C4 -supermagic.
Maryati, Salman, Baskoro, Ryan, and Miller [2104] define a shackle as a graph obtained
from nontrivial connected graphs G1 , G2 , . . . , Gk (k > 2) such that Gs and Gt have no
common vertex for every s and t in [1, k] with |s − t| > 2, and for every i in [1, k −
1], Gi and Gi+1 share exactly one common vertex that are all distinct. They prove
that shackles and amalgamations constructed from copies of a connected graph H is H-
supermagic. (Recall for finite collection of graph G1 , G2 , . . . , Gk with a fixed vertex vi
from each Gi , an amalgamation, AmalGi , vi ), is the graph obtained by identifying the vi .)
Ashari and Salman [252] gave sufficient conditions for (H1 , H2 )-supermagic labelings for
shackles involving cycles, flowers, and prisms.
Ngurah, Salman, and Susilowati [2295] proved the following: chain graphs with identi-
cal blocks each isomorphic to Cn are Cn -supermagic; fans are C3 -supermagic; ladders and
books are C4 -supermagic; K1,n + K1 are C3 -supermagic; grids Pm × Pn are C4 -supermagic
for m > 3 and n = 3, 4, and 5. They pose the case that Pm × Pn are C4 -supermagic for
n > 5 as an open problem. They also have some results on Pt -(super) magic labelings of
cycles. Kathiresan, Marimuthu, and Chithra investagated the existence of Cm -supermagic
labelings generalized fans, generalization of a graph obtained by joining of a star K1,n
with one isolated vertex, grids, and generalized books. The results given in this article
are the generalizations of some results given by Ngurah, Salman, and Susilowati in [2295].
Roswitha, Baskoro, Maryati, Kurdhi, and Susanti [2653] proved: the generalized Ja-
hangir graph Jk,s is Cs+2 -supermagic; K2,n is C4 -supermagic; and Wn for n even and n > 4
is C3 -supermagic. As an open problem they asked if Km,n , 2 < m 6 n, admits a C2m -
supermagic labeling. Roswitha and Baskoro [2654] proved that double stars, caterpillars,
firecrackers, and banana trees admit star-supermagic labelings.
Maryati, Salman, and Baskoro [2102] characterized all graphs G such that the disjoint
union of copies of G is G-supermagic. They also showed: the disjoint union of any paths is
mPn -supermagic for certain values of m and n; some subgraph amalgamations of graphs
G are G-supermagic; and for any subgraph H of G Amal(G, H, k) is G-supermagic.
Salman and Maryati [2687] proved that Amal(G, Pn , k) is G-supermagic.
Selvagopal and Jeyanthi proved: for any positive integer n, a the k-polygonal snake of
length n is Ck -supermagic [2741]; for m > 2, n = 3, or n > 4, Cn × Pm is C4 -supermagic
[1523]; P2 × Pn and P3 × Pn are C4 -supermagic for all n > 2 [1523]; the one-point union
of any number of copies of a 2-connected H is H-magic [1521]; graphs obtained by taking
copies H1 , H2 , . . . , Hn of a 2-connected graph H and two distinct edges ei , e0i from each Hi
and identifying e0i of Hi with ei+1 of Hi+1 where |V (H)| > 4, |E(H)| > 4 and n is odd or

the electronic journal of combinatorics (2023), #DS6 192

both n and |V (H)| + |E(H)| are even are H-supermagic [1521]. For simple graphs H and
G the H-supermagic strength of G is the minimum constant value of all H-magic total
labelings of G for which the vertex labels are {1, 2, . . . , |V |}. Jeyanthi and Selvagopal
[1522] found the Cn -supermagic strength of n-polygonal snakes of any length and the
H-supermagic strength of a chain of an arbitrary 2-connected simple graph.
Let H1 , H2 , . . . , Hn be copies of a graph H. Let ui and vi be two distinct vertices
of Hi for i = 1, 2, . . . , n. The chain graph Hn of H of length n is the graph obtained
by identifying the vertices ui and vi+1 for i = 1, 2, . . . , n − 1. In [1520] Jayanthi and
Selvagopal show that a chain graph of any 2-connected simple graph H is H-supermagic
and if H is a 2-connected (p, q) simple graph, then Hn is H-supermagic if p + q is even or
p + q + n is even.
The antiprism on 2n vertices has vertex set {x1,1 , . . . , x1,n , x2,1 , . . . , x2,n } and edge set
{xj,i , xj,i+1 } ∪ {x1,i , x2,i } ∪ {x1,i , x2,i−1 } (subscripts are taken modulo n). Jeyanthi, Sel-
vagopal, and Sundaram [1525] proved the following graphs are C3 -supermagic: antiprisms,
fans, and graphs obtained from the ladders P2 × Pn with the two paths v1,1 , . . . , v1,n and
v2,1 , . . . , v2,n by adding the edges v1,j v2,j+1 .
Jeyanthi and Selvagopal [1524] show that for any 2-connected simple graph H the
edge amalgamation of a finite number of copies of H is H-supermagic. They also show
that the graph obtained by picking one endpoint vi from each of k copies of K1,k then
creating a new graph by joining each vi to a fixed new vertex v is K1,k -supermagic.
An H-magic labeling in an H-decomposable of a graph G is a bijection f : V (G)∪E(G)
onto {1, 2, . . . , p + q} such that for every copy of H in the decomposition, the sum of
f (v) + f (e) over all v in V (H) and e in E(H) is constant. The labeling f is said to
be H − V -super magic if f (V (G)) = {1, 2, . . . , p}. Marimuthu and Kumar [2088] prove
that Kn,n (n > 2) is H-V -super magic decomposable when H is K1,n . Marimuthu and
Kumar [2086] provide a necessary and sufficient condition for the existence of V -super
vertex-magic labeling and give E-super and V -super vertex-magic total labeling of certain
families of generalized Petersen graphs. They also prove that no wheel is E-super vertex-
magic, C3 is the only friendship graph that is V -super vertex-magic, and C3 is the only
friendship graph that is E-super vertex-magic.
An H-magic labeling f is said to be an H-E-super magic labeling if f (E(G)) =
{1, 2, . . . , q}. A graph that admits an H-E-super magic labeling is called an H-E-super
magic decomposable graph. Subbiah and Pandimadevi [3061] study some elementary
properties of H-E-super magic labelings with H an m-factor and provide a necessary and
sufficient condition for an even regular graph to be H-E-super magic decomposable where
H is a 2-factor.

5.5 Magic Labelings of Type (a, b, c)

A magic-type method for labeling the vertices, edges, and faces of a planar graph was
introduced by Lih [1949] in 1983. Lih defines a magic labeling of type (1,1,0) of a planar
graph G(V, E) as an injective function from {1, 2, . . . , |V |+|E|} to V ∪E with the property
that for each interior face the sum of the labels of the vertices and the edges surrounding
that face is some fixed value. Similarly, Lih defines a magic labeling of type (1, 1, 1) of a

the electronic journal of combinatorics (2023), #DS6 193

planar graph G(V, E) with face set F as an injective function from {1, 2, . . . , |V |+|E|+|F |}
to V ∪ E ∪ F with the property that for each interior face the sum of the labels of the
face and the vertices and the edges surrounding that face is some fixed value. Lih calls a
labeling involving the faces of a plane graph consecutive if for every integer s the weights
of all s-sided faces constitute a set of consecutive integers. Lih gave consecutive magic
labelings of type (1, 1, 0) for wheels, friendship graphs, prisms, and some members of the
Platonic family. In [297] Bača shows that the cylinders Cn × Pm have magic labelings
of type (1, 1, 0) when m > 2, n > 3, n 6= 4. In [307] Bača proves that the generalized
Petersen graph P (n, k) (see §2.7 for the definition) has a consecutive magic labeling if
and only if n is even and at least 4 and k 6 n/2 − 1. In [101] Ahmed and Babujee provide [101] new
face bimagic labelings of type (1,1,0) for certain wheels, cylinders, and disjoint unions of
m copies of prism graphs.
Bača gave magic labelings of type (1, 1, 1) for fans [291], ladders [291], planar bipyra-
mids (that is, 2-point suspensions of paths) [291], grids [300], hexagonal lattices [299],
Möbius ladders [294], and Pn × P3 [295]. Kathiresan and Ganesan [1669] show that the
graph Pa,b consisting of b > 2 internally disjoint paths of length a > 2 with common end
points has a magic labeling of type (1, 1, 1) when b is odd, and when a = 2 and b ≡ 0 (mod
4). They also show that Pa,b has a consecutive labeling of type (1, 1, 1) when b is even
and a 6= 2. Ali, Hussain, Ahmad, and Miller [154] study magic labeling of type (1, 1, 1)
for wheels and subdivided wheels. They prove: wheels admits a magic labeling of type
and (1, 1, 1) and (0, 1, 1), for odd n wheels Wn n admit a magic labeling of type (0, 1, 0),
and subdivided wheels admit a magic labeling of type (1, 1, 0). As an open problem they
ask for a magic labeling of type (1, 1, 0) for Wn and n even. Ahmad [80] proves that
subdivided ladders admit magic labelings of type (1,1,1) and admit consecutive magic
labelings of type (1,1,0).
Bača [293], [292], [303], [301], [295], [302] and Bača and Holländer [332] gave magic
labelings of type (1, 1, 1) and type (1, 1, 0) for certain classes of convex polytopes. Kathire-
san and Gokulakrishnan [1671] provided magic labelings of type (1, 1, 1) for the families
of planar graphs with 3-sided faces, 5-sided faces, 6-sided faces, and one external infinite
face. Bača [298] also provides consecutive and magic labelings of type (0, 1, 1) (that is,
an injective function from {1, 2, . . . , |E| + |F |} to E ∪ F with the property that for each
interior face the sum of the labels of the face and the edges surrounding that face is some
fixed value) and a consecutive labeling of type (1, 1, 1) for a kind of planar graph with
hexagonal faces. Tabraiz and Hussain [3181] provide a super magic labeling of type (1, 0,
0) for ladders and a super magic labeling of type (1, 0, 0) for subdivided ladders.
A magic labeling of type (1,0,0) of a planar graph G with vertex set V is an injective
function from {1, 2, . . . , |V |} to V with the property that for each interior face the sum of
the labels of the vertices surrounding that face is some fixed value. Kathiresan, Muthuvel,
and Nagasubbu [1674] define a lotus inside a circle as the graph obtained from the cycle
with consecutive vertices a1 , a2 , . . . , an and the star with central vertex b0 and end vertices
b1 , b2 , . . . , bn by joining each bi to ai and ai+1 (an+1 = a1 ). They prove that these graphs
(n > 5) and subdivisions of ladders have consecutive labelings of type (1, 0, 0). Devaraj
[809] proves that graphs obtained by subdividing each edge of a ladder exactly the same

the electronic journal of combinatorics (2023), #DS6 194

number of times has a magic labeling of type (1, 0, 0).
In Table 11 we use following abbreviations

M(a, b, c) magic labeling of type (a, b, c)

CM(a, b, c) consecutive magic labeling of type (a, b, c).

A question mark following an abbreviation indicates that the graph is conjectured to have
the corresponding property. The table was prepared by Petr Kovář and Tereza Kovářová.

the electronic journal of combinatorics (2023), #DS6 195

 Table 11: Summary of Magic Labelings of Type (a, b, c)

Graph Labeling Notes

Wn CM(1,1,0) [1949]

friendship graphs CM(1,1,0) [1949]

prisms CM(1,1,0) [1949]

cylinders Cn × Pm M(1,1,0) m > 2, n > 3, n 6= 4 [297]

fans Fn M(1,1,1) [291]

ladders M(1,1,1) [291]

planar bipyramids (see §5.3) M(1,1,1) [291]

grids M(1,1,1) [300]

hexagonal lattices M(1,1,1) [299]

Möbius ladders M(1,1,1) [294]

P n × P3 M(1,1,1) [295]

certain classes of M(1,1,1) [293], [303], [301], [295]

convex polytopes M(1,1,0) [302], [332]

certain classes of planar graphs M(0,1,1) [298]

with hexagonal faces CM(0,1,1)
CM(1,1,1)

lotus inside a circle (see §5.3) CM(1,0,0) n > 5 [1674]

subdivisions of ladders M(1,0,0) [809]

CM(1,0,0) [1674]

the electronic journal of combinatorics (2023), #DS6 196

5.6 Sigma Labelings/1-vertex magic labelings/Distance Magic
In 1987 Vilfred [3388] (see also [3389]) defined a sigma-labeling of a graph G with n vertices
as a bijection f from the vertices of G to {1, 2,P . . . , n} such that there is a constant k with
the property that, at any vertex v the sum f (u) taken over all neighbors u of v is
k. The concept of sigma labeling was independently studied in 2003 by Miller, Rodger,
and Simanjuntak in [2148] under the name 1-vertex magic. In a 2009 article Sugeng,
Fronček, Miller, Ryan, and Walker [3081] used the term distance magic labeling. For
convenience, we will use the term distance magic. In [3391] Vilfred and Jinnah give a
number of necessary conditions for a graph to have a distance magic labeling. One of
them is that if u and v are vertices of a graph with a distance labeling, then the order
of the symmetric difference of N (u) and N (v) (neighborhoods of u and v) is not 1 or
2. This condition rules out a large class of graphs as having distance magic labelings.
Rao, Singh, and Parameswaran [2594] have shown Cm × Cn has a distance magic labeling
if and only if m = n ≡ 2 (mod 4) and Km × Kn , m > 2, n > 3 does not have a
distance magic labeling. In [525] Benna gives necessary and sufficient condition for Km,n
to be a distance magic graph and proves that if G1 and G2 are connected graphs with
minimum degree 1 and at least three vertices, then G1 × G2 does not have a distance
magic labeling. Rao, Sighn, and Parameswaran [49] prove that every graph is an induced
subgraph of a regular graph that has a distance magic labeling. As open problems, Rao
[2592] asks for a characterize 4-regular graphs that have distance magic labelings and
which graphs of the form Cm × Cn , m = n ≡ 2 (mod 4) have distance magic labelings.
Kovář, Fronček, and Kovářová [1749] classified all orders n for which a 4-regular distance
magic graph exists and also showed that there exists a distance magic graph with k = 2t
for every integer t > 6. Acharaya, Rao, Signh, and Parameswaran [48] proved Pm × Cn
does not have a distance magic labeling when m is at least 3 and provide necessary and
sufficient conditions for Km,n to have a distance magic labeling. Kovár and Silber [1751]
proved that an (n − 3)-regular distance magic graph with n vertices exists if and only
if n ≡ 3 (mod 6) and that its structure is determined uniquely. Moreover, they reduce
constructions of Fronček to a single construction and provide another sufficient condition
for the existence a distance magic graph with an odd number of vertices. Fronček, Kovář,
and Kovářová [975] provide a construction for distance magic graphs arising from arbitrary
regular graphs based on an application of magic rectangles. They also solve a problem
posed by Shafiq, Ali, and Simanjuntak [2845]. Godinho and Singh [1111] investigate the
distance magic labelings for neighborhood expansions of graphs and present a method for
embedding regular graphs into distance magic graphs.
Among the results of Miller, Rodger, and Simanjuntak in [2148]: the only trees that
have a distance magic labeling are P1 and P3 ; Cn has a distance magic labeling if and only
if n = 4; Kn has a distance magic labeling if and only if n = 1; the wheel Wn = Cn + P1
has a distance magic labeling if and only if n = 4; the complete graph Kn,n,...,n with p
partite sets has a distance magic labeling if and only if n is even or both n and p are odd;
an r-regular graph where n is odd does not have a distance magic labeling; and G × K2n
has a distance magic labeling for any regular graph G. They also give necessary and
sufficient conditions for complete tripartite graphs to have a distance magic labeling.

the electronic journal of combinatorics (2023), #DS6 197

 For a given a graph G = (V, E) and a positive integer t, the generalised Mycielskian
graph Mt (G) is the graph with vertex set {V ×{0, 1, . . . , t−1}}∪{u}, with edges (x, 0)(y, 0)
and (x, i)(y, i + 1) where there is an edge xy ∈ E, and an edge (x, t − 1)u for all x ∈ V .
In [2374] Pawar and Singh gave some results on distance magic labeling of generalised [2374] new
Mycielskian graphs.
Generalizing defintions given by Vilfred in [3388] and [3389], Vilfred Kamalappan
[3390] defines a labeling f : V (G) → P {1, 2, . . . , n} on a graph G of order n > 3 as a [3390] new
k-distance magic labeling (k-DML ) if w∈∂Nk (u) f (w) is a constant and independent of
u ∈ V (G) where ∂Nk (u) = {v ∈ V (G) : d(u, v) = k}, k ∈ N. A graph G is called a
k-distance magic (k-DM) if it has a k-DML. A long brush, denoted by LPn,m , is a graph
with vertex set {u1 , u2 , . . . , un , v1 , v2 , . . . , vm }, a path Pn = u1 u2 · · · un and edge set
E(Pn ) ∪ {u1 vi : i = 1 to m} ∪ E(< v1 , v2 , . . . , vm >), m + n > 3 and m, n ∈ N. Using
partition techniques, he obtain families of k-DM graphs and prove that (i) For k, n > 3,
m > 2 and k, m, n ∈ N, LPn,m is k-DM if and only if m(m − 1) 6 2n and k = n; (ii) For
a given m > 2 and for every k ∈ N0 , LP m(m−1) +k,m is a ( m(m−1) 2
+ k)-DM graph, and (iii)
2
For m > 3, x > 2, LP1,m = K1 (u1 ) + (Km1 ∪ Km2 ∪ ... ∪ Kmx ), 1 6 m1 6 m2 6 ... 6 mx ,
m1 + m2 + ... + mx = m, m1 + m2 > 3 and m1 , m2 , ..., mx , x ∈ N, LP1,m is 2-DM if and
only if u1 is assigned with a suitable j and Jm+1 \ {j} is partitioned into x constant sum
partites of orders m1 , m2 , ..., mx , 1 6 j 6 m + 1.
An orientable Γ-distance magic labeling of a graph, was introduced by Cichacz, Frey-
berg and Fronček [738] as a generalization of group distance magic labeling for oriented
graphs. They showed that an even regular circulant graph of order n is orientable Zn -
distance magic, the direct product Cn × Cm is orientable Znm -distance magic. They
also considered some products of circulant graphs. Moreover they proved that if G has
order n ≡ 2 (mod 4) and all vertices of odd degree, then there does not exist an ori-
entable Γ-distance magic labeling of G for any Abelian group Γ of order n. Dyrlaga
and Szopa in [863] gave necessary and sufficient conditions for lexicographic product
Km ◦ Kn ∼ = Km, m, . . . , m to be oriantable ζmn -distance magic. As a consequence, they
| {z }
n
provide an infinite family of odd regular graphs possessing orientable ζn -distance magic
labeling. In [958] and [959] Freyberg and Keranen found orientable Zn -distance magic
labelings of the Cartesian product of cycles. In [960] they studied Zn -distance magic
labelings for the strong product of cycles.
In [2194] Mukherjee and Pawa use L = {1, 2, . . . , np } to denote the multiset obtained [2194] new
by reducing 1, 2, . . . , n modulo p and replacing 0’s, if any, by p. They call a graph G
p-distance magic if there is a bijective map f from the vertex set V to the multiset L
such thatPthe weight of each vertex w(x) is equal to the same element µ (mod p), where
w(x) = f (y) is taken over all y ∈ N (x). They proved that a graph G is distance magic if
and only if it is p-distance magic for all p > 1. They also proved that for p = n, p-distance
magic labeling becomes a Zn -distance magic labeling. In some cases, they provide ways
to construct different magic constants in for Zn -distance magic labelings. In some cases,
they prove the uniqueness of the magic constant for Zn -distance magic labeling.
Anholcer, Cichacz, Peterin, and Tepeh [205] proved that the direct product of two

the electronic journal of combinatorics (2023), #DS6 198

cycles Cm and Cn is distance magic if and only if m = 4 or n = 4, or m, n ≡ 0 (mod
4) (the direct product of graphs G and H has the vertex set V (G) × V (H) and (g, h)
is adjacent to (g 0 , h0 ) if g is adjacent to g 0 in G and h is adjacent to h0 in H). In [732]
Cichacz gave necessary and sufficient conditions for circulant graph Cn (1, 2, . . . , p) to be
distance magic for p odd. In [739] Cichacz and Fronček characterized all distance magic
circulant graphs Cn (1, p) for p odd. Cichacz, Fronček, Krop, and Raridan [740] proved
that r-partite graph Kn,n,...,n × C4 is distance magic if and only if r > 1 and n > 2 is
even. Anholcer and Cichacz [201] gave necessary and sufficient conditions for lexicographic
product of an r-regular graph G and Km,n to be distance magic. Cichacz and Görlich
[744] gave necessary and sufficient conditions for the direct product of an r-regular graph
G and Km,n to be distance magic. Kamatchi, Ramalakshmi, and Nilavarasi [1570] proved [1570] new
that Pn2 and the graphs obtained from Pn (n 6= 5) by joining each internal vertex v with
an end vertex at even distance from v are distance antimagic. In [2943] Shrimali and
Parmar discuss the existence of distance magic labelings for the product, direct product,
strong product, and carona product of graphs involing C3t and C4 . In [734] necessary and
sufficient conditions for complete tripartite graphs to be group distance magic was given
by Cichacz. In [245] Arumugam, Kamatchi, and Kovář give several results on distance
magic graphs and open problems.
A graph Γ(V, E) of order n is said to be a closed distance magic labeling of Γ is
aPbijection f : V → {1, 2, . . . , n} for which there exists a positive integer r such that
x∈N [u] f (x) = r for all vertices u ∈ V , where N [u] is the closed neighborhood of u. A
graph is said to be closed distance magic if it admits a closed distance magic labeling.
Fernández, Maleki, Miklavič, and Razafimahatratra [925] classified all connected closed [925] new
distance magic circulants with valency at most 5, that is, Cayley graphs Cay(Zn ; S), where
|S| 6 5 and S generates Zn .
A finite r-regular graph G has a p-partition (resp. closed p-partition) (p > 2) if there
exists a partition of the set V (G) into V1 , V2 , . . . , Vp such that for every x ∈ V (G), all
V (x) ∩ Vi (respectively, V [x] ∩ V1 ) have the same size. In [747] Cichacz and Nikodem
proved the following for finite r-regular graphs G. If G is distance magic (resp. closed
distance magic) graph with a p-partition and p(t − 1) even then tG is also distance (resp.
closed distance) magic. If G has order t and H is p-regular such that tH is distance (resp.
closed distance) magic, then the lexicographic product of G and H is distance (resp.
closed distance) magic. If G has order t and H is such that tH is distance magic, then the
lexicographic product of G and H and the direct product of G and H are distance (resp.
closed distance) magic. If H is a p-regular distance magic graph with a 2-partition, then
the lexicographic product of G and H and the direct product of G and H are distance
magic. They further proved that if G = C3 or G is the strong product of Cn and Cm for
n = 3 and m odd, or m, n ≡ 3 (mod 6), then tG is closed distance magic if and only if t
is odd. (The strong direct product of G and H has vertex set V (G) × V (H) and (g, h) is
adjacent to (g 0 , h0 ) if g = g 0 and h is adjacent to h0 in H, or h = h0 and g is adjacent to
g 0 in G.)
In [2761] Seoud, Maqsoud, and Aldiban determined whether or not the following fami-
lies of graphs have a distance magic vertex labeling: Kn − {e}; Kn − {2e}; Pnk ; Cn2 ; Km ×

the electronic journal of combinatorics (2023), #DS6 199

Cn ; Cm + Pn ; Cm + Cn ; Pm + Pn ; K1,r,s ; K1,r,m,n ; K2,r,m,n ; Km,n + Pk ; Km,n +
Ck ; Cm + Kn ; Pm + Kn ; Pm × Pn ; Km,n × Pk ; Km × Pn ; the splitting graph of
Km,n ; Kn + G; Km + Kn ; Km + Cn ; Km + Pn ; Km,n + Kr ; Cm × Pn ; Cm × K1,n ; Cm ×
Kn,n ; Cm × Kn,n+1 ; Km × Kn,r ; and Km × Kn . Typically, distance magic labelings exist
only a few low parameter cases.
Miklavic and Sparl [2137] provided a sufficient condition for a Hamming graph to be
distance magic and as a they corollary provide an infinite number of pairs (D, q) for which
the corresponding Hamming graph with words of length D and over an alphabet of size
q is distance magic. They classify distance magic folded hypercubes (a graph obtained
from a hypercube by identifying pairs of vertices at maximal distance) by showing that
the dimension-D folded hypercube is distance magic if and only if is divisible by 4.
In [965] Fronček defined the notion of a Γ-distance magic graph as one that has a
bijective labeling of vertices with elements of an Abelian group Γ resulting in constant
sums of neighbor labels. A graph that is Γ-distance magic for an Abelian group Γ is called
group distance magic. Cichacz and Fronček [739] showed that for an r-regular distance
magic graph G on n vertices, where r is odd there does not exist an Abelian group Γ
of order n having exactly one involution (i.e., an element that is its own inverse) that is
Γ-distance magic. Fronček [965] proved that Cm × Cn is a Zmn -distance magic graph if
and only if mn is even. He also showed that C2n × C2n has a Z22n -distance magic labeling.
In [728] Cichacz showed some Γ-distance magic labelings for Cm × Cn where Γ 6≈ Zmn and
Γ 6≈ Z22n . Anholcer, Cichacz, Peterin, and Tepeh [207] proved that if an r1 -regular graph
G1 is Γ1 -distance magic and an r2 -regular graph G2 is Γ2 -distance magic, then the direct
product of graphs G1 and G2 is Γ1 × Γ2 -distance magic. Moreover they showed that if
G is an r-regular graph of order n and m = 4 or m = 8 and r is even, then Cm × G is
group distance magic. They proved that Cm × Cn is Zmn -distance magic if and only if
m ∈ {4, 8} or n ∈ {4, 8} or m, n ≡ 0 (mod 4). They also showed that if m, n 6≡ 0 (mod
4) then Cm × Cn is not Γ-distance magic for any Abelian group Γ of order mn. Cichacz
[729] gave necessary and sufficient conditions for complete k-partite graphs of odd order p
to be Zp -distance magic. Moreover she showed that if p ≡ 2 (mod 4) and k is even, then
there does not exist a group Γ of order p that has a Γ-distance labeling for a k-partite
complete graph of order p. She also proved that Km,n is a group distance magic graph if
and only if n + m 6≡ 2 (mod 4). In [730] Cichacz proved that if G is an Eulerian graph,
then the lexicographic product of G and C4 is group distance magic. In the same paper
she also showed that if m + n is odd, then the lexicographic product of Km,n and C4 is
group distance magic. In [731] Cichacz gave necessary and sufficient conditions for direct
product of Km,n and C4 for m + n odd and for Km,n × C8 to be group distance magic.
In [733] Cichacz proved that for n even and r > 1 the Cartesian product the complete r-
partitie graph Kn,n,...,n and C4 is group distance magic. Godinho and Singh [1110] obtain
group distance magic labelings of Cnr for certain classes of abelian groups and provide
necessary conditions for existence of such labelings.
Anholcer, Cichacz, Froncek, Simanjuntak, and Qiu [202] proved that for n odd, there
does not exist a Γ-distance magic labeling of Qn for any abelian group Γ of order |V (Qn )|,
whereas for n even there exists a Γ-distance magic labeling of Qn for every abelian group

the electronic journal of combinatorics (2023), #DS6 200

Γ of order |V (Qn )|. They also study similar distance antimagic and Γ-distance antimagic
labelings where one finds a bijection such that the sums of labels are pairwises distinct
for all the vertices. They show that there exists a Γ-distance antimagic labeling of Qn
for any abelian group Γ of order 2n where n is odd for these labelings and give some
relationships between Γ-closed distance magic and antimagic labelings and Γ-distance
antimagic labelings.
Cichacz [735] showed there exists an infinite family of odd regular graphs possessing
Γ-distance magic labeling for groups Γ with more than one involution. In [732] Cichacz
using a notion of a Γ-magic rectangle set M RSΓ (a, b; c) showed group distance labeling
for Cartesian and direct product of complete r-partite graphs. These results supported a
conjecture in [739] that says that if G is a distance magic graph, then G is group distance
magic.
→
−
A directed Γ-distance magic labeling of an oriented graph G = (V, A) of order n is
a bijective mapping f from the vertex set of G to an abelian group Γ of order n with
→
−
the property P that there exists P a constant c ∈ Γ such that, for every vertex v ∈ V ( G ),
w(v) = u∈N in (v) f (u) − u∈N out (v) f (u) = c, where NGin (v) is the open in-neighborhood
G G
and NGout (v) is the open out-neighborhood of vertex v, that is NGin (v) = {u : uv ∈ A} and
→
−
NGout (v) = {u : vu ∈ A}. If for a graph G there exists an orientation G such that there is
→
−
a directed Γ-distance magic labeling f for G the graph G is called orientable Γ-distance
magic. Freyberg and Keranen [959] proved that Cm × Cn is orientable Zmn -distance
magic for all m, n > 3.
In [206] Anholcer, Cichacz, Peterin, and Tepeh introduce the notion of balanced dis-
tance magic graphs. They say that a distance magic graph G with an even number
of vertices is balanced if there exists a bijection f from V (G) to {1, 2, . . . , |V (G)|} such
that for every vertex w the following holds: If u ∈ N (w) with f (u) = i, then there
exists v ∈ N (w), u 6= v with f (v) = |V (G)| − i + 1. They prove that a graph G is
balanced distance magic if and only if G is regular and V (G) can be partitioned in pairs
(ui , vi ), i ∈ {1, 2, . . . , |V (G)|/2, such that N (ui ) = N (vi ) for all i. Using this characteri-
zation, the following theorems are proved: if G is a regular graph and H is a graph not
isomorphic to Kn where n is odd, then G H is a balanced distance magic graph if and
only if H is a balanced distance magic graph; G×H is balanced distance magic if and only
if one of G and H is balanced distance magic and the other one is regular; and Cm × Cn
is distance magic if and only if n = 4 or m = 4 or m, n ≡ 0 (mod 4) and Cm × Cn is
balanced distance magic if and only if n = 4 or m = 4. In [209] they prove that every
balanced distance magic graph is also group distance magic; the Cartesian product of a
balanced distance magic graph and a regular graph is group distance magic; the direct
product of C4 or C8 and a regular graph is group distance magic; and they show that
C8 × G is also group distance magic for any even-regular graph G. They also prove that
C4s × C4t is A × B-distance magic for any Abelian groups A and B of order 4s and 4t,
respectively. Moreover, they conjecture that C4m × C4n is a group distance magic graph.
They prove that Cm × Cn is Zmn -distance magic if and only if m ∈ {4, 8} or n ∈ {4, 8} or
both n and m are divisible by 4, and that Cm × Cn with orders not divisible by 4 is not

the electronic journal of combinatorics (2023), #DS6 201

Γ-distance magic for any Abelian group Γ of order mn.
Let G = (V, E) be a graph on n vertices. A bijection f from the vertices of graph G to
{1, 2, . . . , |V (G)|} is P
called a nearly distance magic labeling of G if there exists a positive
integer k such that f (x) over all x ∈ N (v) = k or k + 1 for all v . The constant k is
called a magic constant of the graph and any graph which admits such a labeling is called
a nearly distance magic graph. Godinho, Singh, and Arumugam [1113] give several basic
results on nearly distance magic graphs and compute the magic constant k in terms of
the fractional total domination number of the graph.
In [2098] Marr and Simanjunak defined D-magic labelings for oriented graphs where
D is a distance set as follows. The vertices of a graph G are distinct integers in
{1, 2, . . . , |V (G)|} such that the sum of all the vertex labels that are a distance in D
from a given vertex is the same across all vertices. They gave some results related to the
magic constant, constructd a few infinite families of D-magic graphs, and examined trees,
cycles, and multipartite graphs.
In [1629] Kang, Chen, Li, and Hou investigated D-magic labelings of the halved n-
cube (n > 2) (that is, all binary strings of length n with even number of 1’s as vertices
and edges between any two strings of Hamming distance 2). They show that the folded n-
cube has a {1}-magic labeling (resp., a {0, 1}-magic labeling) if and only if n = 0 (mod 4)
(resp., n = 3 (mod 4)).
A survey of results on distance magic (sigma, 1-vertex) labelings through 2009 is given
in [241].

5.7 Other Types of Magic Labelings

For a graph G = (V, E) naturally embedded in the torus, let F(G) denote the set of
faces of G. Then, G is called a Cn -face-magic toroidal graph if there exists a bijection
f : V (G) → {1, 2, . . . , |V (G)|} such that for every F ∈ F(G) with F ∼= Cn , the sum of
all the vertex labels along Cn is a constant S. Let xv = f (v) for all v ∈ V (G). Then
{xv | v ∈ V (G)} is called a Cn -face-magic toroidal labeling on G. Curran, Low, and Locke
[765] show that, for all m, n > 2, Cm × Cn admits a C4 -face-magic toroidal labeling if
and only if either m = 2 or n = 2, or both m and n are even. They say that a C4 -face-
magic toroidal labeling {xi,j | (i, j) ∈ V (C2m × C2n )} on C2m × C2n is antipodal balanced
if xi,j + xi+m,j+n = S/2, for all (i, j) ∈ V (C2m × C2n ). They show that there exists an
antipodal balanced C4 -face-magic toroidal labeling on C2m ×C2n if and only if the parity of
m and n are the same. Furthermore, when both m and n are even, an antipodal balanced
C4 -face-magic toroidal labeling on C2m × C2n is both row-sum balanced and column-sum
balanced. In addition, when m = n is even, an antipodal balanced C4 -face-magic toroidal
labeling on C2n × C2n is diagonal-sum balanced. In [761] Curran and Locke proved that
there are 144 distinct C4 -face-magic labelings on the 4 × 4 projective grid graph P4,4 (up
to symmetries on the projective plane).
Curran [759] showed that an m × n projective grid graph admits a C4 -face-magic
labeling if and only if both m and n have the same parity. When m and n are even, the
C4 -face-magic value of a C4 -face-magic labeling on an m × n projective grid graph must
be 2mn + 2. Also, when m and n are odd, he proved that the C4 -face-magic value of a

the electronic journal of combinatorics (2023), #DS6 202

C4 -face-magic labeling on an m × n projective grid graph is either 2mn + 1, 2mn + 2, or
2mn + 3. In [760] Curran determined a category of the C4 -face-magic labelings on Pm,n
having C4 -face-magic value 2mn + 1 or 2mn + 3. He conjectured that these are the only
C4 -face-magic labelings on Pm,n having C4 -face-magic value 2mn + 1 or 2mn + 3.
In 2004 Baskar Babujee [482] and [483] introduced the notion of vertex-bimagic labeling
in which there exist two constants k1 and k2 such that the sums involved in a specified
type of magic labeling is k1 or k2 . Thus a vertex-bimagic total labeling with bimagic
constants k1 and k2 is the same as a vertex-magic total labeling except for each vertex
v the sum of the label of v and all edges adjacent to v may be k1 or k2 . Murugesan
and Senthil Amutha [2225] proved that the bistar Bn,n is vertex-bimagic total labeling
for n > 2. An edge bimagic total labeling edge bimagic total of a graph G(V, E) with p
vertices and q edges is a bijection f from the set of vertices and edges to such that for
every edge uv ∈ E, f (u) + f (uv) + f (v) is one of two oconstants k1 or k2 , independent
of the choice of the edge. A bimagic labeling is of interest for graphs that do not have
a magic labeling of a particular type. Bimagic labelings for which the number of sums
equal to k1 and the number of sums equal to k2 differ by at most 1 are called equitable.
When all sums except one are the same the labeling is called almost magic. Although
the wheel Wn does not have an edge-magic total labeling when when n ≡ 3 (mod 4),
Marr, Phillips and Wallis [2095] showed that these wheels have both equitable bimagic
and almost magic labelings. They also show that whereas nK2 has an edge-magic total
labeling if and only if n is odd, nK2 has an edge-bimagic total labeling when n is even and
although even cycles do not have super edge-magic total labelings all cycles have super
edge-bimagic total labelings. They conjecture that there is a constant N such that Kn
has a edge-bimagic total labeling if and only if n is at most N . They show that such
an N must be at least 8. They also prove that if G has an edge-magic total labeling
then 2G has an edge-bimagic total equitable labeling. Amara Jothi, David, and Baskar
Babujee [174] provide edge-bimagic labelings for switching of paths, cycles, stars, crowns
and helms. They also examine whether operations on edge magic graphs results in edge
bimagic graphs or not.
Baskar Babujee and Babitha [487] call a graph with p vertices 1-vertex bimagic if there
is a bijective labeling f from the vertices to {1, 2, . . . , p} such that for each vertex u the
sum of all f (v) where v is adjacent to u is either a constant k1 or a constant k2 and
k1 6= k2 . A graph with p vertices is called odd 1-vertex bimagic if there is a bijective
labeling f from the vertices to {1, 3, . . . , 2p − 1} such that for each vertex u the sum of
all f (v) where v is adjacent to u is either a constant k1 or a constant k2 and k1 6= k2 . A
graph with p vertices is called even 1-vertex bimagic if there is a bijective labeling f from
the vertices to {0, 2, . . . , 2(p − 1)} such that for each vertex u the sum of all f (v) where
v is adjacent to u is either a constant k1 or a constant k2 and k1 6= k2 .
Baskar Babujee and Babitha [487] prove that a necessary P condition for the existence
of a 1-vertex bimagic vertex labeling f of a graph G is x∈V (G) d(x)f (x) = k1 p1 + k2 p2
where d(x) is the degree of vertex x and p1 and p2 are the number of vertices with common
count k1 and k2 , respectively. Among their results are: if G has a 1-vertex bimagic vertex
labeling and G 6= C4 , then G+K1 admits a 1- vertex bimagic vertex labeling; Cn a 1-vertex

the electronic journal of combinatorics (2023), #DS6 203

bimagic if and only if n = 4; Km,n is 1-vertex bimagic; graphs obtained from Pn (n > 3)
by adding edges joining every pair of vertices an odd distance apart are 1-vertex bimagic;
n-partite graphs of the form Kp,p,...,p are 1-vertex bimagic for all p > 1 when n is even
and 1-vertex bimagic for all even p when n is odd; a regular or biregular graph admits
a 1-vertex bimagic labeling if and only if it the admits an odd 1-vertex bimagic labeling
and if and only it admits an even 1-vertex bimagic labeling.
In [2753] Semenyuta, Nedilko, and Nedilko introduce the notion of the equivalence of
vertex labelings on a given graph. They prove the equivalence of three bimagic labelings
for regular graphs and obtain a particular solution for the problem of the existence a
1-vertex bimagic vertex labeling for graphs of isomorphic Kn,n,m . They prove that the
sequence of biregular graphs Kn(ij) = ((Kn−1 − M ) + K1 ) − (un ui ) − (un uj ) admits a
1-vertex bimagic vertex labeling, where ui , uj is any pair of nonadjacent vertices in the
graph Kn−1 − M , un is the vertex of K1 , and M is the perfect matching of the complete
graph Kn−1 . They show that if an r-regular graph G of order n is a distance magic
graph, then the graph G + G has a 1-vertex bimagic vertex labeling with magic constants
(n + 1)(n + r)/2 + n2 and (n + 1)(n + r)/2 + nr. They also define two new types of graphs
that do not admit 1-vertex bimagic vertex labeling.
Baskar Babujee and Jagadesh [483], [491], [492], and [490] proved the following graphs
have super edge bimagic labelings: cycles of length 3 with a nontrivial path attached;
P3 K1,n n even; Pn + K2 (n odd); P2 + mK1 (m > 2); 2Pn (n > 2); the disjoint union
of two stars; 3K1,n (n > 2); Pn ∪ Pn+1 (n > 2); C3 ∪ K1,n ; Pn ; K1,n ; K1,n,n ; the graphs
obtained by joining the centers of any two stars with an edge or a path of length 2; the
graphs obtained by joining the centers of two copies of K1,n (n > 3) with a path of length
2 then joining the center one of copies of K1,n to the center of a third copy of K1,n with
a path of length 2; combs Pn K1 ; cycles; wheels; fans; gears; Kn if and only if n 6 5.
Given positive integers k and λ, Yao, Chen, Yao, and Cheng [3528] say that a total
labeling f of a connected graph G(V, E) from V ∪ E to {1, 2, . . . , |V | + |E|} such that
f (x) 6= f (y) for distinct x, y ∈ V ∪E and f (u)+f (v) = k +λf (uv) for each edge uv in E is
a (k, λ)-magically total labeling of G. They provide necessary and sufficient conditions for
graphs with (k, λ) )-magically total labelings to also have graceful, odd-graceful, felicitous,
and (a, d)-edge antimagic total labelings (see §6.2).
In [1993] López, Muntaner-Batle, and Rius-Font give a necessary condition for a com-
plete graph to be edge bimagic in the case that the two constants have the same parity.
In [488] Baskar Babujee, Babitha, and Vishnupriya make the following definitions. For
any natural number a, a graph G(p, q) is said to be a-additive super edge bimagic if there
exists a bijective function f from V (G) ∪ E(G) to {a + 1, a + 2, . . . , a + p + q} such that for
every edge uv, f (u)+f (v)+f (uv) = k1 or k2 . For any natural number a, a graph G(p, q) is
said to be a-multiplicative super edge bimagic if there exists a bijective f from V (G)∪E(G)
to {a, 2a, . . . , (p+q)a} such that for every edge uv, f (u)+f (v)+f (uv) = k1 or k2 . A graph
G(p, q) is said to be super edge-odd bimagic if there exists a bijection f from V (G) ∪ E(G)
to {1, 3, 5, . . . , 2(p + q) − 1} such that for every edge uv f (u) + f (v) + f (uv) = k1 or k2 .
If f is a super edge bimagic labeling, then a function g from E(G) to {0, 1} with the
property that for every edge uv, g(uv) = 0 if f (u) + f (v) + f (uv) = k1 and g(uv) = 1 if

the electronic journal of combinatorics (2023), #DS6 204

f (u) + f (v) + f (uv) = k2 is called a super edge bimagic cordial labeling if the number of
edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. They
prove: super edge bimagic graphs are a-additive super edge bimagic; super edge bimagic
graphs are a-multiplicative super edge bimagic; if G is super edge-magic, then G + K1
is super edge bimagic labeling; the union of two super edge magic graphs is super edge
bimagic; and Pn , C2n and K1,n are super edge bimagic cordial.
For any nontrivial Abelian group A under addition a graph G is said to be A-magic if
there exists a labeling f of the edges of G with the nonzero elements of A such that the
vertex labeling f + defined by f + (v) = Σf (vu) over all edges vu is a constant. In [3049]
and [3050] Stanley noted that Z-magic graphs can be viewed in the more general context
of linear homogeneous diophantine equations. Shiu, Lam, and Sun [2911] have shown
the following: the union of two edge-disjoint A-magic graphs with the same vertex set
is A-magic; the Cartesian product of two A-magic graphs is A-magic; the lexicographic
product of two A-magic connected graphs is A-magic; for an Abelian group A of even
order a graph is A-magic if and only if the degrees of all of its vertices have the same
parity; if G and H are connected and A-magic, G composed with H is A-magic; Km,n is
A-magic when m, n > 2 and A has order at least 4; Kn with an edge deleted is A-magic
when n > 4 and A has order at least 4; all generalized theta graphs (§4.4 for the definition)
are A-magic when A has order at least 4; Cn + Km is A-magic when n > 3, m > 2 and
A has order at least 2; wheels are A-magic when A has order at least 4; flower graphs
Cm @Cn are A-magic when m, n > 2 and A has order at least 4 (Cm @Cn is obtained from
Cn by joining the end points of a path of length m − 1 to each pair of consecutive vertices
of Cn ).
When the constant sum of an A-magic graph is zero the graph is called zero-sum
A-magic. The null set N (G) of a graph G is the set of all positive integers h such that
G is zero-sum Zh -magic. Akbari, Ghareghani, Khosrovshahi, and Zare [129] and Akbari,
Kano, and Zare [130] proved that the null set N (G) of an r-regular graph G, r > 3, does
not contain the numbers 2, 3 and 4. Akbari, Rahmati, and Zare [131] proved the following:
if G is an even regular graph then G is zero-sum Zh -magic for all h; if G is an odd r-
regular graph, r > 3 and r 6= 5 then N (G) contains all positive integers except 2 and 4;
if an odd regular graph is also 2-edge connected then N (G) contains all positive integers
except 2; and a 2-edge connected bipartite graph is zero-sum Zh -magic for h > 6. They
also determine the null set of 2-edge connected bipartite graphs, describe the structure of
some odd regular graphs, r > 3, that are not zero-sum 4-magic, and describe the structure
of some 2-edge connected bipartite graphs that are not zero-sum Zh -magic for h = 2, 3,
and 4. They conjecture that every 5-regular graph admits a zero-sum 3-magic labeling.
In [1877] Lee, Saba, Salehi, and Sun investigate graphs that are A-magic where A =
V4 ≈ Z2 ⊕ Z2 is the Klein four-group. Many of theorems are special cases of the results of
Shiu, Lam, and Sun [2911] given in the previous paragraph. They also prove the following
are V4 -magic: a tree if and only if every vertex has odd degree; the star K1,n if and only if
n is odd; Km,n for all m, n > 2; Kn − e (edge deleted Kn ) when n > 3; even cycles with k
pendent edges if and only if k is even; odd cycles with k pendent edges if and only if k is
odd; wheels; Cn + K2 ; generalized theta graphs; graphs that are copies of Cn that share

the electronic journal of combinatorics (2023), #DS6 205

a common edge; and G + K2 whenever G is V4 -magic. In [1947] Libeeshkumar and Anil
Kumar discussed induced V4 -magic labelings of some cycle related graphs.
In [709] Choi, Georges, and Mauro explore Z2k -magic graphs in terms of even edge-
coverings, graph parity, factorability, and nowhere-zero 4-flows. They prove that the
minimum k such that bridgeless G is zero-sum Z2k -magic is equal to the minimum number
of even subgraphs that cover the edges of G, known to be at most 3. They also show
that bridgeless G is zero-sum Z2k -magic for all k > 2 if and only if G has a nowhere-zero
4-flow, and that G is zero-sum Z2k -magic for all k > 2 if G is Hamiltonian, bridgeless
planar, or isomorphic to a bridgeless complete multipartite graph, and establish equiv-
alent conditions for graphs of even order with bridges to be Z2k -magic for all k > 4. In
[1067] Georges, Mauro, and Wang utilized well-known results on edge-colorings in order
to construct infinite families that are V4 -magic but not Z4 -magic. In [1948] Libeeshkumar
and Kumar discussed some induced V4 -magic labelings of some subdivision graphs.
Low and Roberts [2032] use the combinatorial nullstellensatz to show the existence of
Zp -magic labelings (prime p > 3) for various graphs, without having to construct the Zp -
magic labelings. They give examples illustrating the usefulness and limitations in applying
the combinatorial nullstellensatz to the integer-magic labeling problem. They show vari-
ous classes of graphs have Z3 -magic labelings. Baskar Babujee and Shobana [505] prove
that the following graphs have Z3 -magic labelings: C2n ; Kn (n > 4); Km,2m (m > 3);
ladders Pn × P2 (n > 4); bistars B3n−1,3n−1 ; and cyclic, dihedral, and symmetric Cayley
digraphs for certain generating sets. Siddiqui [2951] proved that generalized prisms, gen-
eralized antiprisms, fans and friendship graphs are Z3k -magic for k > 1. In [715] Chou
and Lee investigated Z3 -magic graphs.
Chou and Lee [715] showed that every graph is an induced subgraph of an A-magic
graph for any nontrivial Abelian group A. Thus it is impossible to find a Kuratowski
type characterization of A-magic graphs. Low and Lee [2030] have shown that if a graph
is A1 -magic then it is A2 -magic for any subgroup A2 of A1 and for any nontrivial Abelian
group A every Eulerian graph of even size is A-magic. For a connected graph G, Low and
Lee define T (G) to be the graph obtained from G by adding a disjoint uv path of length
2 for every pair of adjacent vertices u and v. They prove that for every finite nontrivial
Abelian group A the graphs T (P2k ) and T (K1,2n+1 ) are A-magic. Shiu and Low [2921]
show that Kk1 ,k2 ,...,kn (ki > 2) is A-magic, for all A where |A| > 3. In [2926] Shiu and Low
analyze the A-magic property for complete n-partite graphs and composition graphs with
deleted edges. Lee, Salehi and Sun [1880] have shown that for m, n > 3 the double star
DS(m, n) is Z-magic if and only if m = n.
S. M. Lee [1839] calls a graph G fully magic if it is A-magic for all nontrivial abelian
groups A. Low and Lee [2030] showed that if G is an Eulerian graph of even size, then G
is fully magic. In [1839] Lee gives several constructions that produce infinite families of
fully magic graphs and proves that every graph is an induced subgraph of a fully magic
graph.
In [1783] Kwong and Lee call the set of all k for which a graph is Zk -magic the integer-
magic spectrum of the graph. They investigate the integer-magic spectra of the coronas
of some specific graphs including paths, cycles, complete graphs, and stars. Low and Sue

the electronic journal of combinatorics (2023), #DS6 206

[2034] have obtained some results on the integer-magic spectra of tessellation graphs. Shiu
and Low [2922] provide the integer-magic spectra of sun graphs. Chopra and Lee [713]
determined the integer-magic spectra of all graphs consisting of any number of pairwise
disjoint paths with common end vertices (that is, generalized theta graphs). Low and
Lee [2030] show that Eulerian graphs of even size are A-magic for every finite nontrivial
Abelian group A whereas Wen and Lee [3465] provide two families of Eularian graphs that
are not A-magic for every finite nontrivial Abelian group A and eight infinite families of
Eulerian graphs of odd sizes that are A-magic for every finite nontrivial Abelian group A.
Low and Lee [2030] also prove that if A is an Abelian group and G and H are A-magic,
then so are G × H and the lexicographic product of G and H. Low and Shiu [2033] prove:
K1,n × K1,n has a Zn+1 -magic labeling with magic constant 0; if G × H is Z2 -magic, then
so are G and H; if G is Zm -magic and H is Zn -magic, then the integer-magic spectra
of G × H contains all common multiples of m and n; if n is even and ki > 3 then the
integer-magic spectra of Pk1 × Pk2 × · · · × Pkn = {3, 4, 5, . . .}. In [2924] Shiu and Low
determine all positive integers k for which fans and wheels have a Zk -magic labeling with
magic constant 0. Shiu and Low [2925] determined for which k > 2 a connected bicyclic
graph without a pendent has a Zk -magic labeling.
Jeyanthi and Jeya Daisy [1442] prove that Pn2 (n > 4), Cn2 , the total graph of Cn , and
the splitting graph of C2n are Zk -magic graphs. They also prove: the splitting graph of
Cn is Zk -magic when n is even and n is odd and k is even, the middle graph of Cn is Zk -
magic when n and k are odd, the m∆2n -snake graph is Zk -magic when k > m, the graph
obtained by joining the vertices ui and ui+1 of Cn by a path of length mi for 1 6 i 6 n − 1,
and u1 and un by a path of length mn is Zk -magic if either all m1 , m2 , . . . , mn are even
or all are odd. In [1443] Jeyanthi and Jeya Daisy prove total graphs of the paths, flower
graphs, and Cm × Pn are Zk -magic. They also prove closed helms are Zk -magic when
k > 4 is even, lotuses inside a circle are Z4k -magic, and graphs consisting of two cycles
with a common edge are Zk -magic when at least one cycle is even. In [1448] Jeyanthi
prove the following graphs are Zk -magic: two odd cycles connected by a path; the graph
obtained by identifying a vertex of Cn with a pendent vertex of a star, m-splitting graphs
of paths, and m-middle graphs of paths. They prove that if G is Zm -magic with magic
constant a then G Km is Zm -magic.
Jeyanthi and Jeya Daisy [1441] prove that the subdivision graphs of the following
families of graphs are Zk -magic: ladders, triangular ladders, the shadow graph of paths,
the total graph of paths, flowers, generalized prisms Cm × Pn for m even, m∆n -snakes,
lotuses inside a circle, the square graph of paths, gears of even cycles, closed helms of
even cycles, and antiprisms Am n for m even.
Let G be a graph and let G1 , G2 , . . . , Gn be n > 2 copies of G. The graph obtained
by replacing each endpoint vertex of K1,n by the graphs G1 , G2 , . . . , Gn is called the open
star of G. Jeyanthi and Jeya Daisy [1445] proved that the open star graphs of shells,
flowers, double wheels, cylinders, wheels, generalised Peterson graphs, lotuses inside a
circle, and closed helms are Zk -magic graphs. They also prove that the super subdivision
of any graph is Zk -magic.
Jeyanthi and Jeya Daisy [1446] proved that the path union of n > 2 copies of the

the electronic journal of combinatorics (2023), #DS6 207

following families of graphs are Zk -magic: odd cycles; generalised Peterson graphs P (r, m)
when r is odd and 1 6 m 6 2r ; shell graphs Sr when r > 3; wheels Wr when r > 3; closed
helms CHr when (i) r > 3 is odd and (ii) r is even and k is even; double wheels DWr
when r > 3 is odd; flowers F lr when r > 2; Cr × P2 when r is odd; total graphs of paths
T (Pr ) for all n, r > 4; lotuses inside a circle LCr when r > 3; and Cr K1 for odd r.
Jeyanthi and Jeya Daisy [1447] proved that the following graphs are k-magic: shell
graphs Sn when n is odd or n is even and k is even; generalised Jahangir graphs Jn,s
when n and s have the same parity or n is even, s is odd, and k is even; (Pn + P1 ) × P2
when n is odd; double wheels 2Cn + K1 ; mongolian tents M (m, n) when m is even; flower
snark graphs; slanting ladders (that is, graphs obtained from two paths u1 , u2 , . . . , un and
v1 , v2 , . . . , vn by joining each ui with vi+1 , 1 6 i 6 n − 1) when n is even; double step grid
graphs; double arrow graphs obtained from Pm × Pn by joining a new vertex with the m
vertices of the first copy of Pm and another new vertex with the m vertices of the last
copy of Pm when m is even; semi Jahangir graphs (the connected graph with vertex set
{p, xi , yk : 1 6 i 6 n + 1, 1 6 k 6 n} and the edge set {pxi : 1 6 i 6 n + 1} ∪ {xi yi : 1 6
i 6 n} ∪ {yi xi+1 : 1 6 i 6 n}); graphs obtained by connecting double wheels DWn1 and
DWn2 by a path when n1 and n2 are odd; graphs obtained by joining two copies of shell
graphs by a path; and the splitting graph of a Zk magic graph with magic constant 0.
Let G be a graph with n vertices {u1 , u2 , . . . , un } and consider n copies of
G, G1 , G2 , . . . , Gn , with vertex sets V (Gi ) = {uji : 1 6 i 6 n, 1 6 j 6 n}. The cycle
of a graph G, denoted by C(n.G), is obtained by identifying the vertex uj1 of Gj with ui
of G for 1 6 i 6 n, 1 6 j 6 n. Jeyanthi and Jeya Daisy [1448] prove that the following
graphs are Zk -magic: C(n.Cr ) except r is even, n is odd, and k is odd; generalised Peter-
son graphs C(n.P (r, m)) except r is even, n is odd, and k is odd; cycles of shell graphs;
cycles of wheel graphs; cycles of closed helms; cycles of double wheels C(n.DWr ) except r
is even, n is odd, and k is odd; cycles of triangular ladder graphs; cycles of flower graphs;
and cycles of lotus inside a circle graphs. Jeyanthi and Jeya Daisy [1448] also prove that
if G is Zk -magic then C(n.G) is Zk -magic if n or k are even.
Shiu and Low [2923] have introduced the notion of ring-magic as follows. Given a
commutative ring R with unity, a graph G is called R-ring-magic if there exists a labeling
f of the edges of G with the nonzero elements of R such that the vertex labeling f + defined
by f + (v) = Σf (vu) over all edges vu and vertex labeling f × defined by f × (v) = Πf (vu)
over all edges vu are constant. They give some results about R-ring-magic graphs.
In [647] Cahit says that a graph G(p, q) is total magic cordial (TMC) provided there
is a mapping f from V (G) ∪ E(G) to {0, 1} such that (f (a) + f (b) + f (ab)) mod 2 is a
constant modulo 2 for all edges ab ∈ E(G) and |f (0) − f (1)| 6 1 where f (0) denotes the
sum of the number of vertices labeled with 0 and the number of edges labeled with 0 and
f (1) denotes the sum of the number of vertices labeled with 1 and the number of edges
labeled with 1. He says a graph G is total sequential cordial (TSC) if there is a mapping
f from V (G) ∪ E(G) to {0, 1} such that for each edge e = ab with f (e) = |f (a) − f (b)|
it is true that |f (0) − f (1)| 6 1 where f (0) denotes the sum of the number of vertices
labeled with 0 and the number of edges labeled with 0 and f (1) denotes the sum of the
number of vertices labeled with 1 and the number of edges labeled with 1. He proves

the electronic journal of combinatorics (2023), #DS6 208

that the following graphs have a TMC labeling: Km,n (m, n > 1), trees, cordial graphs,
and Kn if and only if n = 2, 3, 5, or 6. He also proves that the following graphs have a
TSC labeling: trees; cycles; complete bipartite graphs; friendship graphs; cordial graphs; √
cubic graphs other than K4 ; wheels √ W n (n > 3); K 4k+1 if and only if k >√1 and k is
an integer; K4k+2 if and only if √ 4k + 1 is an integer; K4k if and only if 4k + 1 is an
integer; and K4k+3 if and only if k + 1 is an integer. In [1429] Jeyanthi, Angel Benseera,
and Cahit prove mP2 is TMC if m 6≡ 2 ( mod 4), mPn is TMC for all m > 1 and n > 3,
and obtain partial results about TMC labelings of mKn . Neela and Selvaraj proved that
the complete tripartite graphs are TMC and complete multipartite graphs are TMC when
the partite sets have even sizes
Parameswari and Jayalakshmi e [2337] proved that octopus graphs (the join of a fan [2337] new
Fn and K1,n (n > 1)), vanessa graphs 2Fn + K1,n , lilly graphs 2K1,n + 2Pn , and lotus
graphs admit cordial totally magic labelings. Parameswari [2336] proved that the square [2336] new
graphs and shadow graphs of bistars admit cordial totally magic labelings. In [2339] and [2339] new
[2340] Parameswari and Rajeswari proved that Paley digraphs, fans, gears, and shadow
graphs of paths and stars are total magic cordial. Neela and Selvaraj [2267] showed that [2340] new
complete tripartite graphs and complete multipartite graphs are total magic cordial when [2267] new
the partite sets are of even sizes.
Vaidya and Barasara [3251] proved that every graph can be embedded as an induced
subgraph of a totally magic cordial graph thereby ruling out any possibility of obtaining
any forbidden subgraph characterization for totally magic cordial graphs. They also
proved that every connected graph can be embedded as an induced subgraph of a totally
magic cordial connected graph and every planar graph can be embedded as an induced
subgraph of a totally magic cordial planner graph. Similar results were also obtained for
total sequential cordial labeling.
Jeyanthi and Angel Benseera [1427] investigated the existence of TMC labelings of the
one-point unions of copies of cycles, complete graphs and wheels. In [1428] Jeyanthi and
Angel Benseera prove that if Gi (pi , qi ), i = 1, 2, 3, . . . , n are totally magic cordial graphs
with C = 0 such that pi + qi , i = 1, 2, 3, ..., n are even, and |pi − 2mi | 6 1, where mi is the
number of vertices labeled with 0 in Gi , i = 1, 2, . . . , n, then G1 + G2 + · · · + Gn is TMC;
if G is an odd graph with p + q ≡ 2 ( mod 4), then G is not TMC; fans Fn are TMC for
n > 2; wheels Wn (n > 3) are TMC if and only if n 6≡ 3 (mod 4); mW4t+3 is TMC if
and only if m is even; mWn is TMC if n 6≡ 3 (mod 4); Cn + K 2m+1 is TMC if and only if
n 6≡ 3 (mod 4); C2n+1 K m is TMC if and only if m is odd; the disjoint union of K1,m
and K1,n is TMC if and only if m or n is even.
For a bijection f : V (G) ∪ E(G) → Zk such that for each edge uv ∈ E(G), f (u) +
f (v) + f (uv) is constant (mod k) nf (i) denotes the number vertices and edges labeled
by i under f . If |nf (i) − nf (j)| 6 1 for all 0 6 i < j 6 k − 1, f is called a k-totally magic
cordial labeling of G. A graph is said to be k-totally magic cordial if it admits a k-totally
magic cordial labeling. In [1430] Jeyanthi, Angel Benseera, and Lau provide some ways to
construct new families of k-totally magic cordial (k-TMC) graphs from a known k-totally
magic cordial graph. Let G (respectively, H) be a (p, q)-graph (respectively, an (n, m)-
graph) that admits a k-TMC labeling f (respectively, g) with constant C such that nf (i)

the electronic journal of combinatorics (2023), #DS6 209

and vf (i) = kp (or ng (i) and vg (i) = nk ) are constants for all 0 6 i 6 k − 1, they show
that G + H also admits a k-TMC labeling with constant C. They prove the following.
If G is an edge magic total graph, then G is k-TMC for k > 2; if G is an odd graph
with p + q ≡ k (mod 2k) and k ≡ 2 (mod 4), then G is not k-TMC; if n ≡ 7 (mod 8),
Kn K1 is not 2n-TMC; if n ≡ 2 (mod 4), Cn C3 is not n-TMC; if n ≡ 1 (mod 2),
Cn K5 is not 2n-TMC; if n ≡ 2 (mod 4), Cn × P2 is not n-TMC; Kn (n > 3) is n-TMC;
Kn K1 (n > 3) is n-TMC; Sn is n-TMC for all n > 1; Km,n (m > n > 2) is both
m-TMC and n-TMC; Wn is n-TMC for all odd n > 3 and is 3-TMC for n ≡ 0 (mod 6);
mKn (n > 2) is n-TMC if n > 3 is odd; Kn + Kn is n-TMC if n > 3 is odd; Sn + Sn
(n > 1) is (n + 1)-TMC; and if m > 3 and n is odd, Cn × Pm (n > 3) is n-TMC. In [1432]
Jeyanthi, Angel Benseera, and Lau call a graph G hypo-k-TMC if G − {v} is k-TMC for
each vertex v in V (G) and establish that some families of graphs admit and do not admit
hypo-k-TMC labeling.
A graph G(V, E) where V = {vi , 1 6 i 6 n} and E = {vi vi+1 , 1 6 i 6 n} is 0-edge
magic if there exists a bijection f : V (G) → {1, −1} such that the induced edge labeling
defined by f ∗ (uv) = f (u) + f (v) is 0 for all uv ∈ E. Paths, cycles, complete n-ary pseudo
trees, Pm × Cn where n ≡ 0 (mod 2), Qn , the graph Cm attached to mK1 , m ≡ 0 (mod 2),
(m)
friendship graphs Cn , and the graph Pm × Pm × Pm are 0-edge magic graphs [1747],
[1369], [2265]. Jayapriya [1367] proved the splitting graphs spl(Pn ), spl(Cn ), spl(K1 ,n ),
spl(Bm ,n ), and splitting graph of any tree admits 0-edge magic labelings. Laurejas and
Pedrano [1819] determine the 0-edge magic labeling of Pm × Pn , Cm × Cn , and the gen-
eralized Petersen graph. They also prove that odd cycles are not 0-edge magic.
A binary magic total labeling of a graph G is a function f : V (G) ∪ E(G) → {0, 1}
such that f (a) + f (b) + f (ab) ≡ C (mod 2) for all ab ∈ E(G). Jeyanthi and Angel
Benseera [1431] define the totally magic cordial deficiency of G as the minimum number
of vertices taken over all binary magic total labeling of G that is necessary to add so that
that the resulting graph is totally magic cordial. The totally magic cordial deficiency of
G is denoted by µT (G). They provide µT (Kn ) for some cases.
Let G be a graph rooted at a vertex u and fi be a binary magic total labeling of G
and fi (u) = 0 for i = 1, 2, . . . , k and nfi (0) = αi , nfi (1) = βi for i = 1, 2, . . . , k. Jeyanthi
and Angel Benseera [1431] determine the totally magic cordial deficiency of the one-point
union G(n) of n copies of G. They show that for n ≡ 3 (mod 4) the totally magic cordial
(4t+1) (n)
deficiency of Wn , Wn , W4t+1 and Cn + K 2m+1 is 1; for m odd, µT (mW4t+3 ) = 1; and
(n)
for n ≡ 1 (mod 4), µT (K4 ) = 1.
In 2001, Simanjuntak, Rodgers, and Miller [2148] defined a 1-vertex magic (also
known as distance magic labeling vertex labeling of G(V, E) as a bijection from V to
{1, 2, . . . ,P
|V |} with the property that there is a constant k such that at any vertex v
the sum f (u) taken over all neighbors of v is k. Among their results are: H × K 2k
has a 1-vertex-magic vertex labeling for any regular graph H; the symmetric complete
multipartite graph with p parts, each of which contains n vertices, has a 1-vertex-magic
vertex labeling if and only if whenever n is odd, p is also odd; Pn has a 1-vertex-magic
vertex labeling if and only if n = 1 or 3; Cn has a 1-vertex-magic vertex labeling if and
only if n = 4; Kn has a 1-vertex-magic vertex labeling if and only if n = 1; Wn has a

the electronic journal of combinatorics (2023), #DS6 210

1-vertex-magic vertex labeling if and only if n = 4; a tree has a 1-vertex-magic vertex
labeling if and only if it is P1 or P3 ; and r-regular graphs with r odd do not have a
1-vertex-magic vertex labeling.
Miller, Rogers, and Simanjuntak [2148] the complete p-partite (p > 1) graph
Kn,n,...,n (n > 1) has a 1-vertex-magic vertex labeling if and only if either n is even
or np is odd. Shafiq, Ali, Simanjuntak [2845] proved mKn,n,...,n has a 1-vertex-magic ver-
tex labeling if n is even or mnp is odd and m > 1, n > 1, p > 1; and mKn,n,...,n does not
have a 1-vertex-magic vertex labeling if np is odd, p ≡ 3 (mod 4), and m is even.
Recall if V (G) = {v1 , v2 , . . . , vp } is the vertex set of a graph G and H1 , H2 , . . . , Hp are
isomorphic copies of a graph H, then G[H] is the graph obtained from G by replacing
each vertex vi of G by Hi and joining every vertex in Hi to every neighbor of vi . Shafiq,
Ali, Simanjuntak [2845] proved if G is an r-regular graph (r > 1) then G[Cn ] has a 1-
vertex-magic vertex labeling if and only if n = 4. They also prove that for m > 1 and
n > 1, mCp [Kn ] has 1-vertex-magic vertex labeling if and only if either n is even or mnp
is odd or n is odd and p ≡ 3 (mod 4).
For a graph G Jeyanthi and Angel Benseera [1426] define a function f from V (G) ∪
E(G) to P{0, 1} to be a totally vertex-magic cordial labeling (TVMC) with a constant C if
f (a)+ b∈N (a) f (ab) ≡ C (mod 2) for all vertices a ∈ V (G) and |nf (0)−nf (1)| 6 1, where
N (a) is the set of vertices adjacent to the vertex a and nf (i) is the sum of the number
of vertices and edges with label i. They prove the following graphs have totally vertex-
magic cordial labelings: vertex-magic total graphs; trees; Kn ; Km,n whenever |m − n| 6 1;
Pn + P2 ; friendship graphs with C = 0; and flower graphs F ln for n > 3 with C= 0. They
also proved that if G is TVMC with C = 1, then the graph obtained by identifying any
vertex of G with any vertex of a tree is TVMC with C = 1; if G is a (p, q) graph with
|p − q| 6 1, then G is TVMC with C = 1; and if G(p, q) is a TVMC graph with constant
C = 0 where p is odd, then G + K2m is TVMC with C = 1 if m is odd and with C = 0 if
m is even.
Jeyanthi, Angel Benseera, and Immaculate Mary [1425] showed that the following
graphs have totally magic cordial labelings: (p, q) graphs with |p − q| 6 1; flower graphs
F ln for n > 3; ladders; and graphs obtained by identifying a vertex of Cm with each vertex
of Cn . They also proved that if G1 (p1 , q1 ) and G2 (p2 , q2 ) are two disjoint totally magic
cordial graphs with p1 = q1 or p2 = q2 then G1 ∪ G2 is totally magic cordial. In Theorem
10 in [647] Cahit stated that Kn is totally magic cordial if and only if n ∈ {2, 3, 5, 6}.
Jeyanthi
√ and Angel Benseera [1431] proved that √ Kn is totally
√ magic cordial if and only
if 4k + 1 has √ an integer√value when n = 4k; k + 1 or k have an integer √ value when
n = 4k + 1; 4k + 5 or 4k + 1 have an integer value when n = 4k + 2; or k + 1 has
an integer value when n = 4k + 3.
A graph G is said to have a totally magic cordial TMC labeling with constant C if there
exists a mapping f : V (G) ∪ E(G) → {0, 1} such that f (a) + f (b) + f (ab) ≡ C (mod 2)
for all ab ∈ E(G) and |nf (0) − nf (1)| 6 1, where nf (i) (i = 0, 1) is the sum of the number
of vertices and edges with label i. In [1428] Jeyanthi and Angel Benseera prove that if
Gi (pi , qi ), i = 1, 2, 3, . . . , n are totally magic cordial graphs with C = 0 such that pi + qi ,
i = 1, 2, 3, . . . , n are even, and |pi − 2mi | 6 1, where mi is the number of vertices labeled

the electronic journal of combinatorics (2023), #DS6 211

with 0 in Gi , i = 1, 2, . . . , n, then G1 + G2 + · · · + Gn is TMC. They also prove the
following. If G be an odd graph with p + q ≡ 2 (mod 4), then G is not TMC; fan graph
Fn is TMC for n > 2; the wheel graph Wn (n > 3) is TMC if and only if n 6≡ 3(mod 4);
mW4t+3 is TMC if and only if m is even; mWn is TMC if n 6≡ 3 (mod 4) and m > 1;
Cn + K 2m+1 is TMC if and only if n 6≡ 3 (mod 4); C2n+1 K m is TMC if and only if m
is odd; and the disjoint union of K1,m and K1,n is TMC if and only if m or n is even.
Balbuena, Barker, Lin, Miller, and Sugeng [417] call a vertex-magic total labeling of a
graph G(V, E) an a-vertex consecutive magic labeling if the vertex labels are {a + 1, a +
2, . . . , a + |V |} where 0 6 a 6 |E|. They prove: if a tree of order n has an a-vertex
consecutive magic labeling then n is odd and a = n − 1; if G has an a-vertex consecutive
magic labeling with n vertices and e = n edges, then n is odd and if G has minimum
degree 1, then a = (n + 1)/2 or a = n; if G has an a-vertex √ consecutive magic labeling
with n vertices and e edges such that 2a 6 e and 2e > 6n − 1, then the minimum
degree of G is at least 2; if a 2-regular graph of order n has an a-vertex consecutive magic
labeling, then n is odd and a = 0 or n; and if a r-regular graph of order n has an a-vertex
consecutive magic labeling, then n and r have opposite parities.
Balbuena et al. also call a vertex-magic total labeling of a graph G(V, E) a b-edge
consecutive magic labeling if the edge labels are {b+1, b+2, . . . , b+|E|} where 0 6 b 6 |V |.
They prove: if G has n vertices and e edges and has a b-edge consecutive magic labeling
and one isolated vertex, then b = 0 and (n − 1)2 + n2 = (2e + 1)2 ; if a tree with odd
order has a b-edge consecutive magic labeling then b = 0; if a tree with even order has a
b-edge consecutive magic labeling then it is P4 ; a graph with n vertices and e edges such
that e > 7n/4 and b > n/4 and a b-edge consecutive magic labeling has minimum degree
2; if a 2-regular graph of order n has a b-edge consecutive magic labeling, then n is odd
and b = 0 or b = n; and if a r-regular graph of order n has an b-edge consecutive magic
labeling, then n and r have opposite parities.
Sugeng and Miller [3084] prove: If (V, E) has an a-vertex consecutive edge magic
labeling, where a 6= 0 and a 6= |E|, then G is disconnected; if (V, E) has an a-vertex
consecutive edge magic labeling, where a 6= 0 and a 6= |E|, then G cannot be the union of
three trees with more than one vertex each; for each nonnegative a and each positive n,
there is an a-vertex consecutive edge magic labeling with n vertices; the union of r stars
and a set of r − 1 isolated vertices has an s-vertex consecutive edge magic labeling, where
s is the minimum order of the stars; for every b every caterpillar has a b-edge consecutive
edge magic labeling; if a connected graph G with n vertices has a b-edge consecutive edge
magic labeling where 1 6 b 6 n − 1, then G is a tree; the union of r stars and a set of
r − 1 isolated vertices has an r-edge consecutive edge magic labeling.
Baskar Babujee, Vishnupriya, and Jagadesh [508] introduced a labeling called a-vertex
consecutive edge bimagic total as a graph G(V, E) for which there are two positive integers
k1 and k2 and a bijection f from V ∪ E to {1, 2, . . . , |V | + |E|} such that f (u) + f (v) +
f (uv) = k1 or k2 for all edges uv and f (V ) = {a + 1, a + 2, . . . , a + |V |}, 0 6 a 6 |V |.
They proved the following graphs have such labelings: Pn , K1,n , combs, bistars Bm,n ,
trees obtained by adding a pendent edge to a vertex adjacent to the end point of a path,
trees obtained by joining the centers of two stars with a path of length 2, trees obtained

the electronic journal of combinatorics (2023), #DS6 212

from P5 by identifying the center of a copy K1,n with the two end vertices and the middle
vertex. In [496] Baskar Babujee and Jagadesh proved that cycles, fans, wheels, and gear
graphs have a-vertex consecutive edge bimagic total labelings. Baskar Babujee, Jagadesh,
Vishnupriya [499] study the properties of a-vertex consecutive edge bimagic total labeling
for P3 K1,2n , Pn + K2 (n is odd and n > 3), (P2 ∪ mK1 ) + K2 , (P2 + mK1 ) (m > 2), Cn ,
fans Pn + K1 , double fans Pn + 2K1 , and graphs obtained by appending a path of length
at least 2 to a vertex of C3 . Baskar Babujee and Jagadesh [497] prove the following graphs
have a-vertex consecutive edge bimagic total labelings: 2Pn (n > 2), Pn ∪ Pn+1 (n > 2),
K2,n , Cn K1 , and that C3 ∪ K1,n an a-vertex consecutive edge bimagic labeling for
a = n + 3.
Vishnupriya, Manimekalai, and Baskar Babujee [3405] define a labeling f of a graph
G(p, q) to be a edge bimagic total labeling if there exists a bijection f from V (G)∪E(G) →
{1, 2, . . . , p + q} such that for each edge e = (u, v) ∈ E(G) we have f (u) + f (e) + f (v) = k1
or k2 , where k1 and k2 are two constants. They provide edge bimagic total labelings for
Bm,n , K1,n,n , and trees obtained from a path by appending an edge to one of the vertices
adjacent to an endpoint of the path. An edge bimagic total labeling is G(V, E) is called an
a-vertex consecutive edge bimagic total labeling if the vertex labels are {a+1, a+2, . . . , a+
|V |} where 0 6 a 6 |E|. Baskar Babujee and Jagadesh [494] prove the following graphs
a-vertex consecutive edge-bimagic total labelings: the trees obtained from K1,n by adding
a new pendent edge to each of the existing n pendent vertices; the trees obtained by
adding a pendent path of length 2 to each of the n pendent vertices of K1,n ; the graphs
obtained by joining the centers of two copies of identical stars by a path of length 2; and
the trees obtained from a path by adding new pendent edges to one pendent vertex of the
path. Baskar Babujee, Vishnupriya, and Jagadesh [508] proved the following graphs have
such labelings: Pn , K1,n , combs, bistars Bm,n , trees obtained by adding a pendent edge
to a vertex adjacent to the end point of a path, trees obtained by joining the centers of
two stars with a path of length 2, trees obtained from P5 by identifying the center of a
copy K1,n with the two end vertices and the middle vertex. In [496] Baskar Babujee and
Jagadesh proved that cycles, fans, wheels, and gear graphs have a-vertex consecutive edge
bimagic total labelings. Baskar Babujee, Jagadesh, Vishnupriya [499] study the properties
of a-vertex consecutive edge bimagic total labeling for P3 K1,2n , Pn + K2 (n is odd and
n > 3), (P2 ∪ mK1 ) + K2 , (P2 + mK1 ) (m > 2), Cn , fans Pn + K1 , double fans Pn + 2K1 ,
and graphs obtained by appending a path of length at least 2 to a vertex of C3 .
Vishnupriya, Manimekalai, and Baskar Babujee [3405] prove that bistars, trees ob-
tained by adding a pendent edge to a vertex adjacent to the end point of a path, and
trees obtained subdividing each edge of a star have edge bimagic total labelings. Prathap
and Baskar Babujee [2517] obtain all possible edge magic total labelings and edge bimagic
total labelings for the star K1,n . Jayasekaran1 and Flower [1371] proved that the shadow
graph and the splitting graph of paths stars and cycles are edge trimagic total and super
edge trimagic total.
Let D be P a digraph of order p and size q. For an integer k > 1 and v ∈ V (D),
let wk (v) = f (e) over the set of all in-arcs that are at distance at most k from v.
A Vk -super vertex in-magic labeling (Vk -SVIML) of D is an one-to-one onto function f

the electronic journal of combinatorics (2023), #DS6 213

from V (D) ∪ A(D) to {1, 2, . . . , p + q} such that f (V (D)) = {1, 2, . . . , p} and for every
v ∈ V (D), f (v) + wk (v) = M for some positive integer M . A digraph that admits a Vk -
SVIML is called Vk -super vertex in-magic (Vk -SVIM). In [2230] Mutharasu, Mary Bernard,
Duraisamy kumar study some properties of Vk -SVIML in digraphs. They characterized the
digraphs that are Vk -SVIM and find the magic constant for Ek -regular digraphs. They
furthermore characterized the unidirectional cycles and union of unidirectional cycles
which are V2 -SVIML.
More about magic labelings of directed graphs can be found in [2093] and [580].

the electronic journal of combinatorics (2023), #DS6 214

6 Antimagic-type Labelings
6.1 Antimagic Labelings
Hartsfield and Ringel [1191] introduced antimagic graphs in 1990. A graph with q edges
is called antimagic if its edges can be labeled with 1, 2, . . . , q without repetition such that
the sums of the labels of the edges incident to each vertex are distinct.3 Among the graphs
they prove are antimagic are: Pn (n > 3), cycles, wheels, and Kn (n > 3). T. Wang [3431]
has shown that the toroidal grids Cn1 × Cn2 × · · · × Cnk are antimagic and, more generally,
graphs of the form G × Cn are antimagic if G is an r-regular antimagic graph with r > 1.
Cheng [701] proved that all Cartesian products or two or more regular graphs of positive
degree are antimagic and that if G is j-regular and H has maximum degree at most k,
minimum degree at least one (G and H need not be connected), then G × H is antimagic
provided that j is odd and j 2 − j > 2k, or j is even and j 2 > 2k. Wang and Hsiao [3432]
prove the following graphs are antimagic: G × Pn (n > 1) where G is regular; G × K1,n
where G is regular; compositions G[H] (see §2.3 for the definition) where H is d-regular
with d > 1; and the Cartesian product of any double star (two stars with an edge joining
their centers) and a regular graph. In [700] Cheng proved that Pn1 ×Pn2 ×· · ·×Pnt (t > 2)
and Cm × Pn are antimagic. In [3014] Solairaju and Arockiasamy prove that various
families of subgraphs of grids Pm × Pn are antimagic. Liang and Zhu [1932] proved that if
G is k-regular (k > 2), then for any graph H with |E(H)| > |V (H)|−1 > 1, the Cartesian
product H × G is antimagic. They also showed that if |E(H)| > |V (H)| − 1 and each
connected component of H has a vertex of odd degree, or H has at least 2|V (H)|−2 edges,
then the prism of H is antimagic. Shang [2862] showed that all spiders are antimagic.
Lee, Lin, and Tsai [1833] proved that Cn2 is antimagic and the vertex sums form a set of
successive integers when n is odd. Shang, Lin, and Liaw [2865] show that a star forest
containing no S1 and at most one S2 as components is antimagic. They also prove that
√ m = 1 and mS2 ∪ Sn (n > 3) is antimagic if and
if a star forest mS2 is antimagic then
only if m 6 min{2n + 1, 2n − 5 + 8n2 − 24n + 17/2}. Wang, Miao, and Li [3443] show
that certain graphs with even factors are antimagic. Li [1924] gives antimagic labelings
for Cnk for k = 2, 3, and 4. In [3449] Wang and Zhang showed that certain classes of
regular graphs of odd degree with particular type of perfect matchings are antimagic. As
a by-product, they get that generalized Petersen graphs and a subclass of Cayley graphs
of Zn are antimagic. Deng and Li [799] proved that caterpillars with maximum degree 3
are antimagic.
Let τ (G) to denote the maximum integer such that G∪tP3 is antimagic for all t 6 τ (G).
The existence of such an integer was proved by Chang, Chen, Li, and Pan in [669].
Shang, Lin, Liaw [2865] and Li [1923] gave tight bounds of τ (G) for star forests and
balanced double stars. Their general bound is also tight for many other families of graphs,
including cycles Cn (3 6 9) and 2C3 . Moreover, they discuss properties of τ (G) and pose
open questions, including whether their bound is always tight. Chavez, Le, Der-Fen Liu,
3
A comprehensive expository treatment of antimagic labelings is given by Bača, Miller, Ryan, and
Semaničová-Feňovčı́kováin [370].

the electronic journal of combinatorics (2023), #DS6 215

Shurman [687] generalized the results of Shang et al by providing an upper bound of τ (G)
for all graphs without isolated vertices and P2 as components.
For a graph G and a vertex v of G, the vertex switching graph Gv is the graph obtained
from G by removing all edges incident to v and adding edges joining v to every vertex
not adjacent to v in G. Vaidya and Vyas [3327] proved that the graphs obtained by the
switching of a pendent vertex of a path, a vertex of a cycle, a rim vertex of a wheel, the
center vertex of a helm, or a vertex of degree 2 of a fan are antimagic graphs.
Phanalasy, Miller, Rylands, and Lieby [2392] in 2011 showed that there is a relation-
ship between completely separating systems and labeling of regular graphs. Based on
this relationship they proved that some regular graphs are antimagic. Phanalasy, Miller,
Iliopoulos, Pissis, and Vaezpour [2390] proved the Cartesian product of regular graphs
obtained from [2392] is antimagic. Ryan, Phanalasy, Miller, and Rylands introduced the
generalized web and flower graphs in [2661] and proved that these families of graphs are
antimagic. Rylands, Phanalasy, Ryan, and Miller extended the concept of generalized
web graphs to the single apex multi-generalized web graphs and they proved these graphs
to be antimagic in [2663]. Ryan, Phanalasy, Rylands and Miller extended the concept
of generalized flower to the single apex multi-(complete) generalized flower graphs and
constructed antimagic labeling for this family of graphs in [2662]. For more about an-
timagicness of generalized web and flower graphs see [2144]. Phanalasy, Ryan, Miller and
Arumugam [2391] introduced the concept of generalized pyramid graphs and they con-
structed antimagic labeling for these graphs. Bača, Miller, Phanalasy, and Feňovčı́ková
proved that some join graphs and incomplete join graphs are antimagic in [367]. More-
over, in [366] they proved that the complete bipartite graph Km,m and complete 3-partite
graph Km,m,m are antimagic and if G is a k-regular (connected or disconnected) graph
with p vertices and k > 2, then the join of G and (p − k)K1 , G + (p − k)K1 is antimagic.
Arumugam, Miller, Phanalasy, and Ryan [247] provided antimagic labelings for a family
of generalized pyramid graphs. Daykin, Iliopoulas. Miller, and Phanalasy [790] show
several families of graphs recursively defined from a sequence of graphs that are gener-
alizations of corona graphs are antimagic. Lozano, Mora, Seara, and Tey [2035] proved
that caterpillars are antimagic.
Let G be a k-regular graph with p vertices and q edges. The generalized sausage graph,
denoted by S(G; m), is the graph obtained from G × Pm (G × P1 = G), by joining each
end vertex of the Pm to a new vertex (which we call apexes) with an edge. In particular,
when m = 1, each vertex of the graph G joins to two vertices with two edges. The
mixed generalized sausage graph, denoted by M S(G; m), is the graph obtained from the
generalized sausage graph S(G; m), m > 3, by joining each vertex of each copy of the
dm/2e copies of G on the left hand side to the left hand side apex, except the nearest copy
to the apex, and similarly for the right hand side apex. The complete mixed generalized
sausage graph, denoted by CM S(G; m) is the graph obtained from the generalized sausage
graph by joining each vertex of each copy of G, except the two nearest copies of G to
the apexes, to each apex with an edge, and each corresponding pair of vertices of the
two nearest copies of G to the apexes with an edge. The complete mixed generalized
sausage graph CM S − (G; m) is the graph obtained from CM S(G; m) by deleting the edge

the electronic journal of combinatorics (2023), #DS6 216

connecting each corresponding pair of vertices of the two nearest copies of G to the apexes.
In [2389] Phanalasy proved a families of generalized sausage graphs, mixed generalized
sausage graphs, and complete mixed generalized sausage graphs are antimagic.
A split graph is a graph that has a vertex set that can be partitioned into a clique and
an independent set. Tyshkevich (see [476]) defines a canonically decomposable graph as
follows. For a split graph S with a given partition of its vertex set into an independent
set A and a clique B (denoted by S(A, B)), and an arbitrary graph H the composition
S(A, B) ◦ H is the graph obtained by taking the disjoint union of S(A, B) and H and
adding to it all edges having an endpoint in each of B and V (H). If G contains nonempty
induced subgraphs H and S and vertex subsets A and B such that G = S(A, B) ◦ H,
then G is canonically decomposable; otherwise G is canonically indecomposable. Barrus
[476] proved that every connected graph on at least 3 vertices that is split or canonically
decomposable is antimagic.
Hartsfield and Ringel [1191] conjecture that every tree except P2 is antimagic and,
moreover, every connected graph except P2 is antimagic. In 2004 Alon, Kaplan, Lev,
Roditty, and Yuster [167] use probabilistic methods and analytic number theory to show
that this conjecture is true for all graphs with n vertices and minimum degree Ω(log n).
They also prove that if G is a graph with n > 4 vertices and ∆(G) > n − 2, then G is
antimagic and all complete partite graphs except K2 are antimagic. Slı́va [3005] proved the
conjecture for graphs with a regular dominating subgraph. In 2016 Eccles [864] improved
the result of Alon et al. by proving that there exists an absolute constant d0 such that if
G is a graph with average degree at least d0 and G contains no isolated edge and at most
one isolated vertex, then G is antimagic.
Chawathe and Krishna [689] proved that every complete m-ary tree is antimagic.
Yilma [3536] extended results on antimagic graphs that contain vertices of large degree
by proving that a connected graph with ∆(G) > |V (G)| − 3, |V (G)| > 9 is antimagic
and that if G is a graph with ∆(G) =deg(u) = |V (G)| − k, where k 6 |V (G)|/3 and
there exists a vertex v in G such that the union of neighborhoods of the vertices u and v
forms the whole vertex set V (G), then G is antimagic. Sethuraman and Shermily [2842]
proved that binomial trees and Fibonacci trees are antimagic. Vasuki, Shobana, and
Ahmed [3364] proved the existence of face antimagic labelings for double duplication of [3364] new
barycentric subdivisions of cycles and some other graphs. Vasuki ·and Shobana [3365] [3365] new
proved the existence of face antimagic labeling of types (0, 1, 0) and (0, 1, 1) for crown
related graphs.
In [122] Ahmed and Babujee defined a strong face plane graph as one that is obtained [122] new
from a plane graph by adding a new vertex to every face, in such way that the faces
of the resulting graph are three-sided. If the faces of original plane graphs are three
sided faces, then the number of faces increase. They investigated the existence of (super)
d-antimagic labeling of type (1, 1, 1) for some strong face plane graphs. Shawkat and
Ahmed [2872] investgated the existence of vertex antimagic edge labelings for strong face [2872] new
ladders, strong face wheels, strong face fans, strong face prisms Cm × P2 , and strong face
friendship graphs. Kuppan and Shobana [1777] proved the existence of face antimagic [1777] new
labelings for the double duplication of all vertices by the edges of gear graphs Gn for

the electronic journal of combinatorics (2023), #DS6 217

n > 3, P3 × P2n (n > 2), Cn × P2 (n > 5), and the double duplication of all vertices
by the edges of a strong face of the triangular snake graph Tn (n > 3). They noted
that an (a, d)-face antimagic labeling for double duplication of special graphs can be used
to encrypt and decrypt the messages in real time. Jesintha, Vinodhini, Lakshmi [1414] [1414] new
proved that triangular books and double fans graph admit antimagic labelings.
Let G = (V, E) be a graph of order n. Let f : V → {1, 2, . . . , n} be a bijection.
P The
weight w(v) of a vertex v with respect to the labeling f is defined by w(v) = u∈N (v) f (u),
where N (v) is the open neighborhood of v. The labeling f is called a distance antimagic
labeling if w(v1 ) 6= w(v2 ) for any two distinct vertices v1 , v2 in V . Cutinho, Sudha, and
Arumugam [767] proved that Kn × Kn is distance antimagic if and only if n 6= 2 and
K3 × Cn is distance antimagic when n > 3 is odd. They included the case K3 × Cn when
n is even as a problem.
Fronček [966] defines a handicap incomplete tournament of n teams with r rounds,
HIT(n, r), as a tournament in which every team plays r other teams and the total strength
of the opponents that team i plays is S ~n,r (i) = t − i for every i and some fixed constant
t. (This means that the strongest team plays strongest opponents, and the lowest ranked
team plays weakest opponents.) In terms of distance magic graphs this restriction cor-
responds to finding a distance antimagic graph with the additional property that the
sequence w(1), w(2), . . . , w(n) (where team i is again the i-th ranked team) is an increas-
ing arithmetic progression with difference one. These graphs are called handicap distance
antimagic graphs. A handicap distance d-antimagic labeling of a graph G(V, E) with n
vertices is a bijection f~ : V → {1, 2, . . . , n} with the property that f~(xi ) = i and the se-
quence of the weights w(x1 ), w(x2 ), . . . , w(xn ) forms an increasing arithmetic progression
with difference d. A graph G is a handicap distance d-antimagic graph if it admits a hand-
icap distance d-antimagic labeling, and handicap distance antimagic graph when d = 1.
In [966] Fronček establishes a relationship between handicap incomplete tournaments and
distance antimagic graphs and construct some new infinite classes of distance antimagic
graphs and infinite classes of handicap incomplete round robin tournaments. Fronček and
Shepanik [979] construct r-regular handicap distance antimagic graphs of order n ≡ 0
(mod 8) for all feasible values of r. Fronček [970] proved that regular handicap distance
antimagic graphs exist for every feasible odd order by proving that there exists a regular
handicap graph of an odd order n if and only if n = 9 or n > 13. In [969] Fronček
constructed a class of regular 2-handicap distance antimagic graphs for every order n ≡ 0
(mod 16). In [971] he proved that a k-regular 2-handicap distance antimagic graph of or-
der n ≡ 0 (mod 16) exists if and only if n > 16 and 4 6 k 6 n − 6. Fronček and Shepanik
[980] constructed k-regular handicap distance antimagic graphs of order n = 4 (mod 8)
for all feasible values of k. In [2943] Shrimali and Parmar discuss the existence distance
antimagic labelings for the product, direct product, strong product, and carona product
of graphs involving C3 t and C4 .
Cranston [756] proved that for k > 2, every k-regular bipartite graph is antimagic.
For non-bipartite regular graphs, Liang and Zhu [1933] proved that every cubic graph is
antimagic. That result was generalized by Cranston, Liang, and Zhu [757], who proved
that odd degree regular graphs are antimagic. Hartsfield and Ringel [1191] proved that

the electronic journal of combinatorics (2023), #DS6 218

every 2-regular graph is antimagic. Bérczi, Bernäth, and Vizer [537] use a slight modifica-
tion of an argument of Cranston et al. [757] to prove that k-regular graphs are antimagic
for k > 2. The same was done by Chang, Liang, Pan, and Zhu [672] proved that every
even degree regular graph is antimagic.
Tai, Chia, and Ong [3182] proved that the graphs obtained by starting with two
verticies and joining them with at least r > 3 edges then subdividing the edges of this
graph arbitrarily so that at most one edge (multi-bridge graphs) is not subdivided are
antimagic. For a connected, undirected, simple graph G(V, E) a bijection f from V to
{1, 2, . . . , |V |} is called a rainbow antimagic vertex labeling if, for any two edges uv and u0 v 0
in the same path, w(uv) 6= w(u0 v 0 ), where w(uv) = f (u) + f (v). The rainbow antimagic
connection number of G is the smallest number of colors taken over all rainbow colorings
induced by a rainbow antimagic labeling of G. In [2805] Septory, Utoyo, Dafik, Sulistiyono, [2805] new
and Agustin determined the exact value of the rainbow antimagic connection numbers of
Jahangir graphs, firecrackers, K2,m , and double stars. A rainbow antimagic labeling f of
a graph G is called a strong rainbow antimagic labeling of G if for every two vertices u and
v there exists path from u to v in which no two edges of the path have the same weight.
The strong rainbow antimagic connection number of G is the smallest number of colors
taken over all strong rainbow colorings induced by strong rainbow antimagic labelings of
G. In [1958] Lestari1, Dafik, Susanto, and Wahab determined the connection number of [1958] new
strong rainbow antimagic coloring for Jahangir graphs, Jahangir semi graphs, friendship
graphs, fans, stars, and paths.
A graph G(V, E) is k-shifted antimagic if there exists a bijection f from E to {k +
1, . . . , k + |E|} such that the vertex sums of all verticies are distinct; G(V, E) is absolutely
antimagic if it is k-shifted antimagic for every integer k. In [671] Chang, Li, Daphne Liu,
and Pan proved that certain spider forests (a graph where each component is a spider) are
k-shifted antimagic for all k > 0. In addition, they showed that for a spider forest G with
m edges, there exists a positive integer k0 6 m such that G is k-shifted antimagic for all
k > k0 and k 6 −(m + k0 + 11). Li and Wang [1928] proved that every tree of diameter [1928] new
four or five, except for two casess, is k-shifted antimagic for every integer k. Chang, Chen,
Li, and Pan [669] proved: forest without a component isomorphic to K2 are k-shifted-
antimagic, graphs consisting of vertices of odd degrees and containing no component
isomorphic to K2 are k-shifted-antimagic for sufficiently large k, and Pn (n > 6) are
k-shifted for all k. They also gave necessary and sufficiant conditions for stars, double
stars, kP3 , and 2K1,3 to be k-shifted-antimagic. Dhananjaya and Li [823] proved that
P2 , P3 , P4 -free linear forests and K1,2 -free forests are k-shifted-anntimagic with a few
exceptions. This extended the results by Shang et al. in [2862] and [2863]. Moreover,
they prove that the odd tree forests are k-shifted-antimagic for all k.
Chang, Chen, Li, and Pan [668] established connections among various concepts pro-
posed in the literature of antimagic labelings and extend previous results in three ways:
some classes of graphs, including trees and graphs whose vertices are of odd degrees, that
have not been verified to be antimagic are shown to be k-shifted-antimagic for sufficiently
large k; some graphs are proved k-shifted-antimagic for all k, whereas some are proved
not for some particular k; and disconnected graphs are also considered.

the electronic journal of combinatorics (2023), #DS6 219

 Beck and Jackanich [524] showed that every connected bipartite graph except P2 with
|E| edges admits an edge labeling with labels from {1, 2, . . . , |E|}, with repetition allowed,
such that the sums of the labels of the edges incident to each vertex are distinct. They
call such a graph weak antimagic.
Wang, Liu, and Li [3441] proved: mP3 (m > 2) is not antimagic; Pn ∪ Pn (n > 4)
is antimagic;
√ Sn ∪ Pn is antimagic; Sn ∪ Pn+1 is antimagic; Cn ∪ Sm is antimagic for
m > 2 n + 2; mSn is antimagic; if G and H are graphs of the same order and G ∪ H
is antimagic, then so is G + H; and if G and H are r-regular graphs of even order, then
G+H is antimagic. In [3442] Wang, Liu, and Li proved that if G is an n-vertex graph with
minimum degree at least r and H is an m-vertex graph with maximum degree at most
2r − 1 (m > n), then G + H is antimagic. Bača, Kimáková, Semaničová-Feňovčikovǎ, and
Umar [344] prove the disjoint union of multiple copies of a (a, 1)-(super)-tree-antimagic
graph is also a (b, 1)-(super)-tree-antimagic for certain a and b.
For any given degree sequence pertaining to a tree, Miller, Phanalasy, Ryan, and
Rylands [2146] gave a construction for two vertex antimagic edge trees with the given
degree sequence and provided a construction to obtain an antimagic unicyclic graph with
a given degree sequence pertaining to a unicyclic graph.
Kaplan, Lev, and Roditty [1652] prove that every non-trivial rooted tree for which
every vertex that is a not a leaf has at least two children is antimagic (see [1931]) for
a correction of a minor error in the the proof). For a graph G with m vertices and an
Abelian group A they define G to be A-antimagic if there is a one-to-one mapping from
the edges of G to the nonzero elements of A such that the sums of the labels of the edges
incident to v, taken over all vertices v of G, are distinct. For any n > 2 they show that
a non-trivial rooted tree with n vertices for which every vertex that is a not a leaf has at
least two children is Zn -antimagic if and only if n is odd. They also show that these same
trees are A-antimagic for elementary Abelian groups G with prime exponent congruent
to 1 (mod 3).
In [665] Chan, Low, and Shiu use [G, A] to denote the class of distinct A-antimagic
labelings of G. They prove: for a non-trivial Abelian group A that underlies some com-
mutative ring R with unity, if d is a unit in R and f ∈ [G, A], then df ∈ [G, A]; if A is an
Abelian group that contains a subgroup isomorphic to B and a graph G is B-antimagic,
then G is A-antimagic; P4m+r and C4m+r are Zk -antimagic for k > 4m + r and r = 0, 1, 3;
P4m+2 is Zk -antimagic for k > 4m + 3; regular Hamiltonian graphs of order 4m + r are
Zk -antimagic for k > 4m + r and r = 0, 1, 3, and Zk -antimagic for k > 4m + 3 and
r = 2; for odd n, Sn is Zk -antimagic for k > n > 4; for even n, Sn is Zk -antimagic for
k > n + 2 > 6 but not Zn -antimagic or Zn+1 -antimagic; trees of order n with exactly
one vertex of even degree are Zk -antimagic for k > n; trees of order n with exactly two
vertices of even degree are Zk -antimagic for k > n + 1; and double stars of order are
Zk -antimagic for k > n + 1 when n ≡ 2 (mod 4) and Zk -antimagic for k > n when n 6≡ 2
(mod 4).
Chang and Liu [675] call a graph G R-antimagic if for each subset A of R with
|A| = |E(G)|, there is an edge labeling such that the sums of the labels assigned to edges
incident to distinct vertices are different. They proved that wheels, cycles, and complete

the electronic journal of combinatorics (2023), #DS6 220

graphs of order at least 3 are R-antimagic, and that Cartesian products with at least two
terms are R-antimagic when each term is a complete graph of order at least 2 or a cycle.
The integer-antimagic spectrum of a graph G is the set {k | G is Zk -antimagic (k > 2}.
Shiu, Sun, and Low [2931] determine the integer-antimagic spectra of tadpoles and lol-
lipops. Shiu and Low [2927] determine the integer-antimagic spectra of complete bipartite
graphs and complete bipartite graphs with a deleted edge. Shiu [2897] determined the
integer-antimagic spectra of disjoint unions of cycles. In [2317] Odabasi, Roberts, amd
Low determine the integer-antimagic spectra for all Hamiltonian graphs.
Liang, Wong, and Zhu [1931] study trees with many degree 2 vertices with a restriction
on the subgraph induced by degree 2 vertices and its complement. Denoting the set of
degree 2 vertices of a tree T by V2 (T ) Liang, Wong, and Zhu proved that if V2 (T ) and
V \ V2 (T ) are both independent sets, or V2 (T ) induces a path and every other vertex has
an odd degree, then T is antimagic. In [2037] Lozano, Mora, Seara, and Tey extended this
result by showing that trees whose vertices of even degree induce a path are antimagic.
In [3331] Vaidya and Vyas proved that the middle graphs, total graphs, and shadow
graphs of paths and cycles are antimagic. In [1755] and [1756] Krishnaa provided some
results for antimagic labelings for graphs derived from wheels and antimagic labelings of
helm related graphs.
Bertault, Miller, Pé-Rosés, Feria-Puron, and Vaezpour [549] approached labeling prob-
lems as combinatorial optimization problems. They developed a general algorithm to de-
termine whether a graph has a magic labeling, antimagic labeling, or an (a, d)-antimagic
labeling (see Section 6.3). They verified that all trees with fewer than 10 vertices are
super edge magic and all graphs of the form P2r × P3s with less than 50 vertices are an-
timagic. Kuppan, Shobana, and Cangul [1776] used an (a, d)-face antimagic labeling of a [1776] new
strong face of the duplication of all vertices by edges of a tree Tn (n > 2) to encrypt and
decrypt thirteen secret numbers that can be extended to the double duplication of graphs
to encode and decode the numbers that can be used in applications.
In [358] Bača, MacDougall, Miller, Slamin, and Wallis survey results on antimagic,
edge-magic total, and vertex-magic total labelings.
A total labeling of a graph G is a bijection f from V (G) ∪ E(G) to {1, 2, . . . , |V (G)| +
|E(G)|}. When f (V (G)) = {1, 2, . . . , |V (G)|}, we say the total labeling is super. For a
labeling f the associated edge-weight of an edge uv is defined by wtf (uv) P
= f (uv)+f (u)+
f (v). The associated vertex-weight of a vertex v is defined by wtf (v) = u∈N (v) f (uv) +
f (v), where N (v) is the set of the neighbors of v. A labeling f is called edge-antimagic
total (vertex-antimagic total) if all edge-weights (vertex-weights) are pairwise distinct.
A graph that admits an edge-antimagic total (vertex-antimagic total) labeling is called
an edge-antimagic total (vertex-antimagic total) graph. A labeling that is simultaneously
edge-antimagic total and vertex-antimagic total is called a totally antimagic total labeling.
A graph that admits a totally antimagic total labeling is called a totally antimagic total
graph. A labeling g is said to be ordered (sharp ordered) if wtg (u) 6 wtg (v) (wtg (u) <
wtg (v)) holds for every pair of vertices u, v ∈ V (G) such that g(u) < g(v). A graph that
admits a (sharp) ordered labeling is called a (sharp) ordered graph.
Miller, Phanalasy, and Ryan [2143] proved that all graphs have vertex-antimagic to-

the electronic journal of combinatorics (2023), #DS6 221

tal labelings. Bača, Miller, Phanalasy, Ryan, Semaničová-Feňovčı́ková, and Abildgaard
Sillasen [364] prove that mK1 , mK2 , Pn (n > 2), and Cn are sharp ordered super totally
antimagic total. They prove if G is an ordered super edge-antimagic total graph then
G + K1 is a totally antimagic total graph. As a corollary they get that stars, friendship
graphs nK2 +K1 , fans, and wheels are totally antimagic total. They also prove that if G is
a regular ordered super edge-antimagic total graph then G nK1 is totally antimagic to-
tal. As a corollary of this result, they have double-stars K2 nK1 and crowns Cm nK1
are totally antimagic total. They show that a union of regular totally antimagic total
graphs is a totally antimagic total graph.
Ahmed and Baskar Baskar [120] proved that complete bipartite graphs admit a totally
antimagic total labeling. The same result was proved by Akwu and Ajayi [140] who
also showed that the join of a complete bipartite graph and K1 is a totally antimagic
total graph. Ahmed, Baskar Babujee, Bača, Semaničová-Feňovčı́ková [119] proved that
complete graphs admit totally antimagic total labeling. They also considered the problem
of finding total labelings for prisms and for two special classes of graphs related to paths
that are simultaneously edge-magic and vertex-antimagic.
Miller, Phanalasy, Ryan, and Rylands [2145] provide a method whereby, given any
degree sequence pertaining to a tree, one can construct an antimagic tree based on this
sequence. By swapping the roles of edges and vertices with respect to a labeling, they
provide a method to construct an edge antimagic vertex labeling for any tree. Ahmad,
Semaničová-Feňovčı́ková, Siddiqui, and Kamran [115] construct α-labelings from graceful
labelings of smaller trees and transform this labeling to edge-antimagic vertex labeling
of trees. Shang [2863] shows that linear forests without either of the paths P2 or P3 as
components are antimagic. Shang [2864] proved that P2 , P3 , and P4 -free linear forests are
antimagic. In [2930] Shiu and Low analyzed various antimagic properties for Cartesian [2930] new
products, hexagonal nets and theta graphs.
A Fibonacci mean antimagic labeling of a graph G is an injective function g :
V (G) → {f2 , f3 , . . . , fn+1 }, where fn is nth Fibonacci number, and the induced a func-
tion g ∗ : E(G) → N defined by g ∗ (uv) = d(g(u) + g(v))/2e is injective. A graph is called
Fibonacci mean antimagic if it admits a Fibonacci mean antimagic labeling. Thirug-
nanasambandam and Chitra [3208] proved the following graphs have Fibonacci mean [3208] new
antimagic labelings: caterpillars, bistars, triangular snakes, quadrilateral snakes, ladders,
and the corona product of last three graphs and K1 .
In [1206] Hefetz, Mütze, and Schwartz investigate antimagic labelings of directed
graphs. An antimagic labeling of a directed graph D with n vertices and m arcs is a
bijection from the set of arcs of D to the integers {1, . . . , m} such that all n oriented
vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of
all edges entering that vertex minus the sum of labels of all edges leaving it. Hefetz et
al. raise the questions “Is every orientation of any simple connected undirected graph
antimagic? and “Given any undirected graph G, does there exist an orientation of G
which is antimagic?” They call such an orientation an antimagic orientation of G. Re-
garding the first question, they state that, except for K1,2 and K3 , they know of no other
counterexamples. They prove that there exists an absolute constant C such that for every

the electronic journal of combinatorics (2023), #DS6 222

undirected graph on n vertices with minimum degree at least C log n every orientation
is antimagic. They also show that every orientation of Sn , n 6= 2, is antimagic; every
orientation of Wn is antimagic; and every orientation of Kn , n 6= 3, is antimagic. For
the second question they prove: for odd r, every undirected r-regular graph has an an-
timagic orientation; for even r every connected undirected r-regular graph that admits a
matching that covers all but at most one vertex has an antimagic orientation; and if G
is a graph with 2n vertices that admits a perfect matching and has an independent set
of size n such that every vertex in the independent set has degree at least 3, then G has
an antimagic orientation. They conjecture that every connected undirected graph admits
an antimagic orientation and ask if it true that every connected directed graph with at
least 4 vertices is antimagic. Shan [2861] supported this conjecture by proving that every
bipartite graph with no vertex of degree 0 or 2 admits an antimagic orientation and every
graph with minimum degree at least 33 admits an antimagic orientation. In [3515] Yang,
Carlson, Owens, Perry, Singgih, Song, Zhang, and Zhang proved that a graph G admits
an antimagic orientation if ∆(G) > |G| − 3 or ∆(G) = |G| − t > 4 for each t = 4, 5.
Motivated by the Hartsfield and Ringel on antimagic labelings of graphs, in 2010
Hefetz, Mütze, and Schwartz [1206] initiated the study of antimagic orientations of graphs,
and conjectured that every connected graph admits an antimagic orientation. The con-
jecture has been verified to be true for regular graphs (see [[1206], [1926], [3514]]), and
biregular bipartite graphs with minimum degree at least two by Shan and Yu [2860]. Yang,
Carlson, Owens, Perry, Singgih, Song, Zhang, Zhang [3515] proved that every connected
graph G on n > 9 vertices with maximum degree at least n − 5 admits an antimagic
orientation. Li, Song, Wang, Yang, and Zhang [1926] proved that every 2-regular graph
has an antimagic orientation and for all integers d > 2, every connected 2d-regular graph
has an antimagic orientation. Gao, Yuping and Shan [1020] proved that every lobster
admits an antimagic orientation. Ferraro, Newkirk, and Shan [928] prove that subdivided
caterpillars in which all pendant edges are replaced by paths of the same length admit an
antimagic orientation.
Sonntag [3033] investigated antimagic labelings of hypergraphs. He shows that certain
classes of cacti, cycle, and wheel hypergraphs have antimagic labelings. Javaid and Bhatti
[1359] extended some of Sonntag’s results to disjoint unions of hypergraphs. In [2254]
Nalliah investigated the existence of antimagic labelings of some families of digraphs using
hooked Skolem sequences. Marimuthu, Raja Durga, and Durga Devi [2090] investigated
the existence of super vertex in-antimagic total labelings of generalized de Bruijn digraphs.
Hefetz [1205] calls a graph with q edges k-antimagic if its edges can be labeled with
1, 2, . . . , q + k such that the sums of the labels of the edges incident to each vertex are
distinct. In particular, antimagic is the same as 0-antimagic. More generally, given a
weight function ω from the vertices to the natural numbers Hefetz calls a graph with q
edges (ω, k)-antimagic if its edges can be labeled with 1, 2, . . . , q + k such that the sums of
the labels of the edges incident to each vertex and the weight assigned to each vertex by ω
are distinct. In particular, antimagic is the same as (ω, 0)-antimagic where ω is the zero
function. Using Alon’s combinatorial nullstellensatz [166] as his main tool, Hefetz has
proved the following: a graph with 3m vertices and a K3 factor is antimagic; a graph with

the electronic journal of combinatorics (2023), #DS6 223

q edges and at most one isolated vertex and no isolated edges is (ω, 2q − 4)-antimagic;
a graph with p > 2 vertices that admits a 1-factor is (p − 2)-antimagic; a graph with
p vertices and maximum degree n − k, where k > 3 is any function of p is (3k − 7)-
antimagic and, in the case that p > 6k 2 , is (k − 1)-antimagic. Hefetz, Saluz, and Tran
[1207] improved the first of Hefetz’s results by showing that a graph with pm vertices,
where p is an odd prime and m is positive, and a Cp factor is antimagic.
A graph G = (V, E) is strongly antimagic if there is a P Pf : E →
bijective mapping
1, 2, . . . , |E| such that for any two vertices u 6= v, not only e∈E(u) f (e) 6= e∈E(v) f (e)
P P
and also e∈E(u) f (e) < e∈E(v) f (e) whenever deg(u) < deg(v), where E(u) is the set
of edges incident to u. Chang, Chin, Li, and Pan [670] proved double spiders (the trees
contains exactly two vertices of degree at least 3) are strongly antimagic. They raise
the following two questions. Does there exist a strongly antimagic labellings for every
antimagic graph? Is there a k-antimagic graph but not (k + 1)-antimagic?
A strong edge antimagic total labeling of a simple graph G(V, E) is a labeling in which
the vertex labels are consecutive integers from 1 to |V | such that the total of the labels of
the vertices incident to an edge form an ascending arithmetic sequence. Prasetyo [2516]
proved that mK1,n has a strong edge antimagic total labeling.
For a graph G(V, E) of order p and size q having no isolated vertices, a bijection
f : V → {1, 2, 3, . . . , p} is called a local edge antimagic labeling if for any two adjacent
edges uv and vw of G, we have w(uv) 6= w(vw), where the edge weight w(uv) = f (u)+f (v)
and w(vw) = f (v) + f (w). A graph G is called a local edge antimagic if G has a local
edge antimagic labeling. The local edge antimagic chromatic number number of G is
the minimum number of colors taken over all colorings induced by local edge antimagic
labelings of G. Agustin, Hasan, Dafik, Alfarisi and Prihandini [72] found the local edge [72] new
antimagic chromatic numbers of paths, cycles, friendship graphs, ladders, stars, wheels,
complete graphs, prisms, Cm mK1 , and G mK1 , where G is any graph of size at
least 3. Moreover, they found a relation between local edge antimagic chromatic number
and local antimagic vertex chromatic number. Rajkumar and Nalliah [2566] determined [2566] new
the local edge antimagic chromatic numbers for a friendship graphs, wheels, fans, helms,
flower graphs, and closed helms. Ahmad, Bača, Lascsáková and Semaničová-Feňovčı́ková
[93] call a labeling of a plane graph d-antimagic if for every positive integer s, the set
of s-sided face weights is Ws = {as , as + d, as + 2d, . . . , as + (fs − 1)d} for some positive
integers as as and d, where fs is the number of the s-sided faces. (They allow different sets
Ws for different s). A d-antimagic labeling is called super if the smallest possible labels
appear on the vertices. In [153] they investigated the existence of super d-antimagic
labelings of type (1, 1, 0) for disjoint union of plane graphs for several values of difference
d. Bača, Numan, and Semaničová-Feňovčı́ková [375] invesitgate the existence of super d-
antimagic labelings of generalized prisms. Hussainn and Tabraiz [1278] investigated super
d-antimagic labeling of type (1,1,1) on the snakes kC5 ; subdivided kC5 ; and isomorphic
copies of kC5 for strings (1, 1, . . . , 1) and (2, 2, . . . , 2).
Bača, Baskoro, Jendroľ, and Miller [318] investigated various k-antimagic labelings for
graphs in the shape of hexagonal honeycombs. They use Hnm to denote the honeycomb
graph with m rows, n columns, and mn 6-sided faces. They prove: for n odd Hnm ,

the electronic journal of combinatorics (2023), #DS6 224

has a 0-antimagic vertex labeling and a 2-antimagic edge labeling, and if n is odd and
mn > 1, Hnm has a 1-antimagic face labeling. In [2928] Shiu and Low show how to
construct k-antimagic graphs from existing graphs G with particular labeling properties
by joining G to cycles and dumbell related graphs with an edge.
Huang, Wong, and Zhu [1272] say a graph G is weighted-k-antimagic if for any vertex
weight function w from the vertices of G to the natural numbers there is an injection
f from P the edges of G to {1, P 2, . . . , |E| + k} such that for any two distinct vertices u
and v, (f (e) + w(v)) 6= (f (e) + w(u)) over all edges incidence to v. They proved
that if G has odd prime power order pz and has total domination number 2 with the
degree of one vertex in the total dominating set not a multiple of p, then G is weighted-
1-antimagic, and if G has odd prime power order pz , p 6= 3 and has maximum degree at
least |V (G)| − 3, then G is weighted-1-antimagic. Wong and Zhu [3430] proved: graphs
that have a vertex that is adjacent to all other vertices are weighted-2-antimagic; graphs
with a prime number of vertices that have a Hamiltonian path are weighted-1-antimagic;
and connected graphs G 6= K2 on n vertices are weighted-b3n/2c-antimagic. Matamala
and Zamora [2106] proved that Km,n , 3 6 m 6 n, n > 3, is weighted-0-antimagic and
described a polynomial time algorithm that computes a (w, 0)-antimagic labeling of Km,n .
They also prove the following. Let H be an arbitrary complete partite graph with n > 5
vertices not isomorphic to K1,n . Then, any graph containing H as a spanning subgraph
is weighted-0-antimagic and given a weight function w, a (w, 0)-antimagic labeling can be
computed in polynomial time. They prove that each connected graph G on n > 3 vertices
having K1,n as a spanning subgraph is weighted-1-antimagic unless G is isomorphic to
K1,n and n is even.
A graph G is weighted k-list-antimagic if for any vertex weighting ω : V (G) → R
and any list assignment L : E(G) → 2R with |L(e)| > |E(G)| + k, there exists an edge
labeling f such that f (e) ∈ L(e) for all e ∈ E(G), labels of edges are pairwise distinct,
and the sum of the labels on edges incident to a vertex plus the weight of that vertex is
distinct from the sum at every other vertex. Berikkyzy, Brandt, Jahanbekam, Larsen, and
Rorabaugh [541] proved that every graph on n vertices having no K1 or K2 component is
weighted-b 4n 3
c-list-antimagic.
A distance k-antimagic labeling of a graph G(V, E) is a bijection ¯f from V to
{1, 2, . . . , |V |} with the property that there exists an ordering of the vertices of G such
that the sequence of the weights w(x1 ), w(x2 ), . . . , w(xn ) forms an arithmetic progression
with difference k. When k = 1, then ¯f is simply called a distance antimagic labeling.
A distance k-antimagic graph is a distance k-antimagic graph that admits a distance
k-antimagic labeling, and is called distance antimagic when k = 1. Cichacz, Froncek,
Sugeng and Zhou in [742] gave a necessary condition for a graph with an even number
of vertices to be distance antimagic with respect to an Abelian group with a unique in-
volution. They also gave sufficient conditions for a Cayley graph on an Abelian group
to be distance antimagic or magic with respect to the same group, and discussed the
consequences of these results to Cayley graphs on elementary Abelian groups. In [1175]
Handa, Godinho, and Singh investigate the existence of distance antimagic labelings of
ladders.

the electronic journal of combinatorics (2023), #DS6 225

 For a positive integer k, define fk : V (G) −→ {1 + k, 2 + k, . . . , n + k} by fk (x) =
f (x) + k. If wfk (u) 6= wfk (v) for every pair of vertices u, v ∈ V , for any k > 0 then f is
said to be an arbitrarily distance antimagic labeling and the graph which admits such a
labeling is said to be an arbitrarily distance antimagic graph. Handa, Godinho, and Singh
[1176] provide arbitrarily distance antimagic labelings for rPn , the generalized Petersen
graph P (n, k), n > 5, the Harary graph H4,n for n 6= 6 and prove that join of these graphs
is distance antimagic.
For an arbitrary set of distances D ⊆ {0, 1, . . . , diam(G)}, a D-weight of a vertex
P a graph G under a vertex labeling f : V → {1, 2, . . . , v} is defined as wD (x) =
x in
y∈ND (x) f (y), where ND (x) = {y ∈ V | d(x, y) ∈ D}. A graph G is said to be D-distance
magic if all vertices has the same D-vertex-weight, it is said to be D-distance antimagic if
all vertices have distinct D-vertex-weights. In [2959] Simanjuntak and Wijaya gave some
necessary conditions for the existence of D-distance antimagic graphs and conjectured
that those conditions are sufficient. They also gave {1}-distance antimagic labelings for
cycles, suns, prisms, complete graphs, wheels, fans, and friendship graphs.
In [244] Arumugam and Kamatchi introduced the notion of (a, d)-distance antimagic
graphs as follows. Let G be a graph with vertex P set V and f : V → {1, 2, . . . , |V |} be a
bijection. If for all v in G the set of sums f (u) taken over all neighbors u of v is the
arithmetic progression {a, a + d, a + 2d, . . . , a + (|V | − 1)d}, f is called an (a, d)-distance
antimagic labeling and G is called a (a, d)-distance antimagic graph. Arumugam and
Kamatchi [244] proved: Cn is (a, d)-distance antimagic if and only if n is odd and d = 1;
there is no (1, d)-distance antimagic labeling for Pn when n > 3; a graph G is (1, d)-
distance antimagic graph if and only if every component of G is K2 ; Cn × K2 is (n + 2, 1)-
distance antimagic; and the graph obtained from C2n = (v1 , v2 , . . . , v2n ) by adding the
edges v1 vn+1 and vi v2n+2−i for i = 2, 3, . . . , n is (2n+2, 1)-distance antimagic. In [966] and
[968] Froncek proved that disjoint copies of the Cartesian product of two complete graphs
and its complement are (a, 2)-distance antimagic and (a, 1)-distance antimagic. He also
proved that disjoint copies of the hypercube Q3 is (a, 1)-distance antimagic. Semeniuta
[2751] proved that the crown Pn P1 does not admit an (a, 1)-distance antimagic labeling
for n > 2 and a > 2 and determines the values of a for which Pn can be an (a, 1)-
distance antimagic graph. The circulant graph is also investigated. Semenyuta [2752]
proved that Pn P1 is not an (a, d)-distance antimagic graph for all a and d and that
Qn is a (2n + n − 1, n − 2)-distance antimagic graph. He found two types of graphs
that do not allow 1-vertex bimagic vertex labeling and established a relation between the
distance magic labeling of a regular graph G with 1-vertex bimagic vertex labeling G ∪ G.
Meganingtyas, Dafik, and Slamin [2129] investigated the existence of super (a, d)-vertex [2129] new
antimagic labeling of directed cycles.
Patel and Vasva [2368] use Circ(n, k) n > 3 to denote the graph Circ(n, {k}) defined
as follows: for a subset S ⊂ {1, 2, . . . , n}, the circulant graph Circ(n, S) is the graph
with vertex set {vS 1 , v2 , . . . , vn } and there is an edge between vertices vi and vj if and
only if |i − j| ∈ S {1, n − 1}). In [2368] they proved the existence or non-existence of
(a, d)-distance antimagic labelings for the following graphs: Circ(2n, {1, n}) is (2n + 2, 1)-
distance antimagic for all even n; mK2n is (n(2mn − 2m + 1), 1)-distance antimagic for

the electronic journal of combinatorics (2023), #DS6 226

all m and n; 3K2n+1 is (6n2 + n − 1, 1)-distance antimagic for all n; 2K2n+1 is not (a, d)-
distance antimagic for all n; helms Hn is not (a, d)-distance antimagic for any n; books
Bn = Sn × P2 of order 2n + 2 are not (a, d)-distance antimagic for any n; and Kn K1 is
not (a, d)-distance antimagic for n > 1.
Kamatchi, Vijayakumar, Ramalakshmi, Nilavarasi, and Arumugam [1572] prove that
the hypercube is (a, d)-distance antimagic and the bistar K2 (n, n) is distance antimagic.
They also show that if G is a regular distance antimagic graph, then 2G is also distance
antimagic and several families of disconnected graphs are distance antimagic graphs.
A connected graph G = (V, E) with m edges is called universal antimagic if for each
set B of m positive integers there is an bijective function f : E → B such that the
function f˜ : V → N defined at each vertex v as the sum of all labels of edges incident
to v is injective. Matamala and Zamora [2105] proved that paths, cycles, split graphs,
and graphs that contains the complete bipartite graph K2,n as a spanning subgraph are
universal antimagic. A universal antimagic graph is weight universal antimagic if, in
addition, for any weight function w on the vertices, all w(u)+f u are distinct. Generalizing
their previous result [2105], in [2107] the authors show constructively that if a graph has a
complete bipartite graph Km,n as a spanning subgraph with m, n > 3, then it is weighted
universal antimagic (hence universal antimagic). They also show that for all other values
of m and n, the graph is universal antimagic.
In 2019 [371] Bača, Miller, Ryan, and Semaničová-Feňovčı́ková published a mono-
graph that focuses on variations of magic and antimagic type lsbelings and includes new
results, techniques, constructions, and open problems and conjectures.
In Table 12 we use the abbreviation A to mean antimagic. A question mark following
an abbreviation indicates that the graph is conjectured to have the corresponding property.
The table was prepared by Petr Kovář and Tereza Kovářová and updated by J. Gallian
in 2014.

Table 12: Summary of Antimagic Labelings

Graph Labeling Notes

Pn A for n > 3 [1191]

Cn A [1191]

Wn A [1191]

Kn A for n > 3 [1191]

every tree except K2 A? [1191]

caterpillars A [2035]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 227

 Table 12 – Continued from previous page
Graph Labeling Notes
regular graphs A [1933], [1191], [672]

every connected graph A? [1191]

except K2

n > 4 vertices A [167]

∆(G) > n − 2

all complete partite A [167]

graphs except K2

Cm × P n A [700]

Pm1 × Pm2 × · · · × Pmk A [700]

Cm1 × Cm2 × · · · × Cmk A [3431]

Cn2 A [1833]

mP3 m > 2 not A [3441]

6.2 (a, d)-Antimagic Labelings

The concept of an (a, d)-antimagic labelings was introduced by Bodendiek and Walther
[584] in 1993. A connected graph G = (V, E) is said to be (a, d)-antimagic if there
exist positive integers a, d and a bijection Pf : E → {1, 2, . . . , |E|} such that the induced
mapping gf : V → N , defined by gf (v) = {f (uv)| uv ∈ E(G)}, is injective and gf (V ) =
{a, a + d, . . . , a + (|V | − 1)d}. (In [1954] Lin, Miller, Simanjuntak, and Slamim called
these (a, d)-vertex-antimagic edge labelings). Bodendick and Walther ([586] and [587])
prove the Herschel graph is not (a, d)-antimagic and obtain both positive and negative
results about (a, d)-antimagic labelings for various cases of graphs called parachutes Pg,p .
(Pg,p is the graph obtained from the wheel Wg+p by deleting p consecutive spokes.) In [333]
Bača and Holländer prove that necessary conditions for Cn × P2 to be (a, d)-antimagic are
d = 1, a = (7n + 4)/2 or d = 3, a = (3n + 6)/2 when n is even, and d = 2, a = (5n + 5)/2
or d = 4, a = (n + 7)/2 when n is odd. Bodendiek and Walther [585] conjectured
that Cn × P2 (n > 3) is ((7n + 4)/2, 1)-antimagic when n is even and is ((5n + 5)/2, 2)-
antimagic when n is odd. These conjectures were verified by Bača and Holländer [333]
who further proved that Cn × P2 (n > 3) is ((3n + 6)/2, 3)-antimagic when n is even.
Bača and Holländer [333] conjecture that Cn × P2 is ((n + 7)/2, 4)-antimagic when n is

the electronic journal of combinatorics (2023), #DS6 228

odd and at least 7. Bodendiek and Walther [585] also conjectured that Cn × P2 (n > 7) is
((n+7)/2, 4)-antimagic. Miller and Bača [2139] prove that the generalized Petersen graph
P (n, 2) is ((3n + 6)/2, 3)-antimagic for n ≡ 0 (mod 4), n > 8 and conjectured that P (n, k)
is ((3n + 6)/2, 3)-antimagic for even n and 2 6 k 6 n/2 − 1 (see §2.7 for the definition of
P (n, k)). This conjecture was proved for k = 3 by Xu, Yang, Xi, and Li [3507]. Jirimutu
and Wang proved that P (n, 2) is ((5n + 5)/2, 2)-antimagic for n ≡ 3 (mod 4) and n > 7.
Xu, Xu, Lü, Baosheng, and Nan [3503] proved that P (n, 2) is ((3n + 6)/2, 2)-antimagic
for n ≡ 2 (mod 4) and n > 10. Xu, Yang, Xi, and Li [3507] proved that P (n, 3) is
((3n + 6)/2, 3)-antimagic for even n > 10 and for n ≡ 0 (mod 4), n > 8. In [1957] Lingqi,
Linna, Yuan show that P (n, 3) is (5n + 5)/2, 2)-antimagic for odd n > 7. Feng, Hong,
Yang, and Jirimutu [922] show that P (n, 5) is (3n + 6)/2, 3)-antimagic for even n > 12.
Bao, Zhao, Yang, Feng, and Jirimutu [421] proved that P (n, 7) is ( 3n+62
, 3)-antimagic for
even n > 16. Ivančo [1341] investigated (a, 1)-antimagic labelings and their connection
with supermagic generalized double graphs. Bodendiek and Walther [588] proved that
the following graphs are not (a, d)-antimagic: even cycles; paths of even order; stars;
(k) (k)
C3 ; C4 ; trees of odd order at least 5 that have a vertex that is adjacent to three or
more end vertices; n-ary trees with at least two layers when d = 1; the Petersen graph;
K4 and K3,3 . They also prove: P2k+1 is (k, 1)-antimagic; C2k+1 is (k + 2, 1)-antimagic; if a
tree of odd order 2k + 1 (k > 1) is (a, d)-antimagic, then d = 1 and a = k; if K4k (k > 2)
is (a, d)-antimagic, then d is odd and d 6 2k(4k − 3) + 1; if K4k+2 is (a, d)-antimagic,
then d is even and d 6 (2k + 1)(4k − 1) + 1; and if K2k+1 (k > 2) is (a, d)-antimagic, then
d 6 (2k + 1)(k − 1). Lin, Miller, Simanjuntak, and Slamin [1954] show that no wheel
Wn (n > 3) has an (a, d)-antimagic labeling. In [3153] Susanto provided super (a, d)-Cn -
antimagic total labelings for various cases of mCn . In [1672], Kathiresan and Laurence
posed the problem of characterizing the super (a, 1) − P3 -antimagic total labeling of the
stars Sn , where n = 6, 7, 8, and 9. This problem was completely solved in [2568] by
Rajkumar, Nalliah, and Venkataraman.
The Hill cipher is a cryptographic algorithm that uses modulo arithmetic and a matrix
as a key to perform encryption and decryption. In [2520] Prihandini and Adawiyah1 [2520] new
discussed how to use a super (3n + 5, 2)- edge antimagic total labeling to construct the
Hill cipher algorithm. They stated that variations of the edge weight function and the
corresponding edge label on the graph will make the constructed lock more complicated
to hack.
In [1349] Ivančo, and Semaničová show that a 2-regular graph is super edge-magic if
and only if it is (a, 1)-antimagic. As a corollary we have that each of the following graphs
are (a, 1)-antimagic: kCn for n odd and at least 3; k(C3 ∪ Cn ) for n even and at least 6;
k(C4 ∪ Cn ) for n odd and at least 5; k(C5 ∪ Cn ) for n even and at least 4; k(Cm ∪ Cn ) for
m even and at least 6, n odd, and n > m/2 + 2. Extending a idea of Kovář they prove
if G is (a1 , 1)-antimagic and H is obtained from G by adding an arbitrary 2k-factor then
H is (a2 , 1)-antimagic for some a2 . As corollaries they observe that the following graphs
are (a, 1)-antimagic: circulant graphs of odd order; 2r-regular Hamiltonian graphs of odd
order; and 2r-regular graphs of odd order n < 4r. They further show that if G is an
(a, 1)-antimagic r-regular graph of order n and n − r − 1 is a divisor of the non-negative

the electronic journal of combinatorics (2023), #DS6 229

integer a + n(1 + r − (n + 1)/2), then G ⊕ K1 is supermagic. As a corollary of this result
they have if G is (n − 3)-regular for n odd and n > 7 or (n − 7)-regular for n odd and
n > 15, then G ⊕ K1 is supermagic.
Bertault, Miller, Feria-Purón, and Vaezpour [549] approached labeling problems as
combinatorial optimization problems. They developed a general algorithm to determine
whether a graph has a magic labeling, antimagic labeling, or an (a, d)-antimagic labeling.
They verified that all trees with fewer than 10 vertices are super edge magic and all graphs
of the form P2r × P3s with less than 50 vertices are antimagic. Javaid, Hussain, Ali, and
Dar [1363] and Javaid, Bhatti, and Hussain [1360] constructed super (a, d)-edge-antimagic
total labelings for w-trees and extended w-trees (see 5.2 for the definitions) as well as super
(a, d)-edge-antimagic total labelings for disjoint union of isomorphic and non-isomorphic
copies of extended w-trees. In [1361] Javaid and Bhatt defined a generalized w-tree and
proved that they admit a super (a, d)-edge-antimagic total labeling. In [3439] Wang, Li,
and Wang proved that some classes of graphs derived from regular or regular bipartite
graphs are antimagic. A subdivided star T (n1 , n2 , . . . , nr ) is a tree obtained by inserting
ni > 1, 1 6 i 6 r with r > 3 vertices. In [2542] Raheem, Javaid, and Baig study a
super (a, d)-edge-antimagic total labelings of the subdivided stars T (n, n + 1, n3 , . . . , nr )
when n is even and T (n, n, n + 1, n4 , . . . , nr ) when n is odd for all possible values of d. In
[2541] Raheem and Baig proved the super edge antimagicness of subdivided stars for all
possible values of d. Bhatti, Tahir, and Javaid [567] give super (a, d)-edge antimagic total
labelings of some wheel-like graphs. In [248] investigate the existence of super (a, d)-edge
antimagic total labeling for friendship graphs and generalized friendship graphs. Girija
and Karthikeyan [1103] proved that 3 copies of the jelly fish graphs are super (a, d)-edge
antimagic vertex graphs and super (a, d)-edge antimagic total graphs.
In [65] Afzal, Javaid, Alanazi, and Alshehri investigated the super (a, 0) edge-
antimagicness of the union of the networks of stars, paths, and copies of paths and the
rooted product of Cn with K2,n . They also provided super (a, 0) edge-antimagic labelings
of the rooted product of cycles and planar pancyclic networks, and give super (a, 0) edge-
antimagic labelings for a pancyclic network containing chains of C6 , and three different
symmetrically designed lattices.
For graphs G and F , if every edge of G belongs to a subgraph of G isomorphic to
F and there exists a total labeling λ of G such that for every subgraph F 0 of G that is
isomorphic to F , the set {Σλ(F 0 ) : F 0 ∼ = F, F 0 ⊆ G} forms an arithmetic progression
starting with a with common difference d, Lee, Tsai, and Lin [1832] say that G is (a, d)-
F -antimagic. Furthermore, if λ(V (G)) = {1, 2, . . . , |V (G)|} then G is said to be super
(a, d)-F -antimagic and λ is said to be a super (a, d)-F -antimagic labeling of G. Lee, Tsai,
and Lin [1832] proved that Pm × Pn (m, n > 2) is super (a, 1)-C4 -antimagic. In [2742]
Selvagopal, Jeyanthi, Muthuraja, and Semaničová-Feňovčiková investigated the existence
super (a, d)-star-antimagic labelings of a particular class of banana trees and construct a
star-antimagic graph. In [1531] Jeyanthi, Selvi, and Ramya proved the existence of super
(a, d)-Cn -antimagic labelings of fan graphs and ladders. Inayah [1321] proved the existence
of an (a, b) − P4 -antimagic decomposition of a generalized Petersen graph GPz (n, 3) for
several values of b. Taimur, Ali, Numan, Aslam, and Anoh Yannick [3183] provided super

the electronic journal of combinatorics (2023), #DS6 230

(a, d)-C3 -antimagic total labelings for the generalized antiprism for d = 0 and 1 and a
super (a, d)-C8 -antimagic total labeling for the toroidal octagonal map for d = 1, 2, . . . , 7.
The edge corona path graph Gm  Pn is the graph obtained from one copy of the gear
graph Gm and 3m copies of Pn , Pni , by joining two end vertices of ei ∈ E(Gm ) to every
vertex vj ∈ V (Pn ) in the i-th copy of Gm with i = 1, 2, . . . , 3m and j = 1, 2, . . . , n. The
graph Gm · Cn is the graph obtained from Gm and 2m + 1 copies of Cn namely Cni by
joined every vertex vi ∈ Gm to all vertices vi ∈ Cn for i ∈ {1, 2, . . . , 2m + 1}. Nistyawati
and Martini [2304] proved that for every odd m, the gear edge corona path graph Gm  Pn
is super C4  Pn -antimagic and for every odd m, the gear corona cycle graph Gm · Cn
is super C4 · Cn -antimagic. Roswitha, Martini, and S. A. Nugroho [2655] proved: for
n > 5 the double cone DCn = Cn + K2 is (14 + 7n + (n + 1)2, 1)-C3 -antimagic and (a, 1)-
C3 -antimagic; DCn is (a, d)-Wn -antimagic; DC2n is (a, 1)-W2n -antimagic; and DC2n+1 is
(a, 2)-W2n+1 -antimagic.
Yegnanarayanan [3534] introduced several variations of antimagic labelings and pro-
vides some results about them.
The antiprism on 2n vertices has vertex set {x1,1 , . . . , x1,n , x2,1 , . . . , x2,n } and edge set
{xj,i , xj,i+1 } ∪ {x1,i , x2,i } ∪ {x1,i , x2,i−1 } (subscripts are taken modulo n). For n > 3 and
n 6≡ 2 (mod 4) Bača [305] gives (6n + 3, 2)-antimagic labelings and (4n + 4, 4)-antimagic
labelings for the antiprism on 2n vertices. He conjectures that for n ≡ 2 (mod 4), n > 6,
the antiprism on 2n vertices has a (6n+3, 2)-antimagic labeling and a (4n+4, 4)-antimagic
labeling.
Nicholas, Somasundaram, and Vilfred [2301] prove the following: If Km,n where m 6 n
is (a, d)-antimagic, then d divides ((m − n)(2a + d(m + n − 1)))/4 + dmn/2; if m + n is
prime, then Km,n , where n > m > 1, is not (a, d)-antimagic; if Kn,n+2 is (a, d)-antimagic,
then d is even and n + 1 6 d < (n + 1)2 /2; if Kn,n+2 is (a, d)-antimagic and n is odd,
then a is even and d divides a; if Kn,n+2 is (a, d)-antimagic and n is even, then d divides
2a; if Kn,n is (a, d)-antimagic, then n and d are even and 0 < d < n2 /2; if G has order n
and is unicylic and (a, d)-antimagic, then (a, d) = (2, 2) when n is even and (a, d) = (2, 2)
or (a, d) = ((n + 3)/2, 1) when n is odd; a cycle with m pendent edges attached at each
vertex is (a, d)-antimagic if and only if m = 1; the graph obtained by joining an endpoint
of Pm with one vertex of the cycle Cn is (2, 2)-antimagic if m = n or m = n − 1; if m + n
is even the graph obtained by joining an endpoint of Pm with one vertex of the cycle Cn
is (a, d)-antimagic if and only if m = n or m = n − 1. They conjecture that for n odd and
at least 3, Kn,n+2 is ((n + 1)(n2 − 1)/2, n + 1)-antimagic and they have obtained several
results about (a, d)-antimagic labelings of caterpillars.
In [2036] Lozano, Mora, and Seara prove that any caterpillar of order n is (b(n −
1)/2, c − 2)-antimagic. Furthermore, if C is a caterpillar with a spine of order s, they
prove that when C has at least b(3s + 1)/2c leaves or b(s − 1)/2c consecutive vertices of
degree at most 2 at one end of a longest path, then C is antimagic. As a consequence of a
result of Wong and Zhu [3484], they also prove that if p is a prime number, any caterpillar
with a spine of order p, p − 1 or p − 2 is 1-antimagic.
In [3392] Vilfred and Florida proved the following: the one-sided infinite path is (1, 2)-
antimagic; P2n is not (a, d)-antimagic for any a and d; P2n+1 is (a, d)-antimagic if and

the electronic journal of combinatorics (2023), #DS6 231

only if (a, d) = (n, 1); C2n+1 has an (n + 2, 1)-antimagic labeling; and that a 2-regular
graph G is (a, d)-antimagic if and only if |V (G)| = 2n + 1 and (a, d) = (n + 2, 1). They
also prove that for a graph with an (a, d)-antimagic labeling, q edges, minimum degree δ
and maximum degree ∆, the vertex labels lie between δ(δ + 1)/2 and ∆(2q − ∆ + 1)/2.
Chelvam, Rilwan, and Kalaimurugan [690] proved that Cayley digraph of any finite
group admits a super vertex (a, d)-antimagic labeling depending on d and the size of the
generating set. They provide algorithms for constructing the labelings. Thirusangu and
Bhrathiraja [3210] proved the existence of super vertex (a, d)- antimagic labeling and
vertex magic total labeling for Cayley digraphs arising from the groups Zpn ⊕ Zpn and
Zm ⊕ Zn .
Irfan and Semaničová-Feňovčiková [1335] provide some classes of graphs that admit
a labeling that is simultaneously a super edge-magic total and a super vertex-antimagic
total and give some results for fans, sun graphs, caterpillars, and prisms.
For n > 1 and distinct odd integers x, y and z in [1,n − 1] Javaid, Ismail, and Salman
[1355] define the chordal ring of order n, CRn (x, y, z), as the graph with vertex set Zn ,
the additive group of integers modulo n, and edges (i, i + x), (i, i + y), (i, i + z) for all even
i. They prove that CRn (1, 3, 7) and CRn (1, 5, n − 1) have (a, d)-antimagic labelings when
n ≡ 0 mod 4 and conjecture that for an odd integer ∆, 3 6 ∆ 6 n − 3, n ≡ 0 mod 4,
CRn ((1, ∆, n − 1) has an ((7n + 8)/4, 1)-antimagic labeling.
For an arbitrary set of distances D ⊆ {0, 1, . . . , diam(G)}, a D-weight of a vertex
Pin a graph G under a vertex labeling f : V → {1, 2, . . . , v} is defined as wD (x) =
x
y∈ND (x) f (y), where ND (x) = {y ∈ V |d(x, y) ∈ D}. A graph G is said to be D-
distance magic if all vertices have the same D-vertex-weight, it is said to be D-distance
antimagic indexD-distance antimagic if all vertices have distinct D-vertex-weights, and
it is called (a, d) − D-distance antimagic if the D-vertex-weights constitute an arithmetic
progression with difference d and starting value a. In [2959] Simanjuntak and Wijaya
gave some necessary conditions for the existence of D-distance antimagic graphs and
conjectured that those conditions are sufficient. They also gave {1}-distance antimagic
labelings for cycles, suns, prisms, complete graphs, wheels, fans, and friendship graphs.
Arumugam and Kamatchi [244] characterized (a, d)-distance antimagic cycles and (a, d)-
distance antimagic labelings for paths and prisms. In [966] and [968] Fronček proved
that disjoint copies of the Cartesian product of two complete graphs and its complement
are (a, 2)-distance antimagic and (a, 1)-distance antimagic. He also proved that disjoint
copies of the hypercube Q3 is (a, 1)-distance antimagic. In [1175] Handa, Godinho and
Singh investigate the existence of distance antimagic labeling of ladders.
In [3393] Vilfred and Florida call a graph G = (V, E) odd antimagic if there exist
a bijection f : E →P {1, 3, 5, . . . , 2|E| − 1} such that the induced mapping gf : V → N ,
defined by gf (v) = {f (uv)| uv ∈ E(G)}, is injective and odd (a, d)-antimagic if there
exist positive integers a, d and a bijection f : E → P {1, 3, 5, . . . , 2|E| − 1} such that the
induced mapping gf : V → N , defined by gf (v) = {f (uv)| uv ∈ E(G)}, is injective
and gf (V ) = {a, a + d, a + 2d, . . . , a + (|V | − 1)d}. Although every (a, d)-antimagic
graph is antimagic, C4 has an antimagic labeling but does not have an (a, d)-antimagic
labeling. They prove: P2n+1 is not odd (a, d)-antimagic for any a and d; C2n+1 has an odd

the electronic journal of combinatorics (2023), #DS6 232

(2n + 2, 2)-antimagic labeling; if a 2-regular graph G has an odd (a, d)-antimagic labeling,
then |V (G)| = 2n + 1 and (a, d) = (2n + 2, 2); C2n is odd magic; and an odd magic graph
with at least three vertices, minimum degree δ, maximum degree ∆, and q > 2 edges has
all its vertex labels between δ 2 and ∆(2q − ∆).
Combining the notions of 1-vertex-magic vertex labelings and antimagic labelings
Swaminathan and Jeyanthi [3175] introduced a new labeling as follows. For a graph
with p vertices a 1-1 mapping from the vertices to {1, 2, . . . , p} is called an (a, d)-1-vertex-
antimagic vertex labeling if the sums of the labels of the vertices adjacent to each vertex
taken over all vertices form the set {a, a+d, a+2d, . . . , a+(p−1)d}. They give some basic
properties of such labelings and provide some results for some classes of regular graphs.
For a graph G = (V, E), a bijection g from V (G)∪E(G) into {1, 2, . . . , |V (G)|+|E(G)|}
is called a (a, d)-edge-antimagic graceful labeling of G if the edge-weights w(xy) = |g(x) +
g(y) − g(xy)|, xy ∈ E(G), form an arithmetic progression starting from a and having
a common difference d. An (a, d)-edge-antimagic graceful labeling is called super (a, d)-
edge-antimagic graceful if g(V (G)) = {1, 2, . . . , |V (G)|}. Marimuthu and Krishnaveni
[2082] proved mCn has a super (0, 1)-edge-antimagic graceful labeling for every m > 2
and n > 3; and mKn and M Pn have a super (a, 1)-edge-antimagic graceful labeling for
every m > 2 and n > 2.
In [123] Ahmed, Semaničová-Feňovčı́ková, Bača, Baskar Babujee, and Shobana in- [123] new
troduced the notion of graceful antimagic graphs as follows. A graceful labeling that is
simultaneously antimagic (that is, the sums of labels of all edges incident to a given vertex
are pairwise distinct for different vertices) is said to be graceful antimagic . They obtain
results about paths, stars, double stars, cycles, complete graphs, complete graphs with
deleted edges, and complete bipartite graphs. They include many conjectures and open
probelems.
In [251] Arumugam, Premalatha, Bacǎ, and Semaničová-Feňovčı́ková introduced a new
graph coloring parameter as follows. Let f be a local antimagic labeling of a connected
graph G. The assignment of w(u) to u for each vertex u of G induces naturally a proper
vertex coloring of G, called a of G. The , denoted χla (G), is the minimum number of
colors taken over all local antimagic colorings of G. Arumugam, Lee, Premalatha, Wang
[246] proved that for m > 1, χla (C3 Om ) = 3m + 3, where Om is the null graph on
m verticies, and for n > 1, χla (Kn K1 ) = 2n − 1. In [1807] Lau and Nalliah correct
a mistake in [1248] for the lower bounds of the local antimagic chromatic number of the
corona product of friendship and fan graphs with null graph and obtain a sharp lower
bound that gives the exact local antimagic chromatic number of the corona product of
friendship and null graph. In [1808] Lau, Ng, and Shiu give counterexamples to the lower
bound of χla (G ∨ O2 ) that was obtained in [251]. A sharp lower bound of χla (G ∨ On ) and
sufficient conditions for the given lower bound to be attained are obtained. Moreover,
they improve a theorem and solve a problem stated in [251] and determine the local
antimagic chromatic number of complete bipartite graphs. In [1814] Lau, Shiu, and Ng
obtain a sharp lower bound of the local antimagic chromatic number of a graph with
cut-vertices given by pendants is obtained. They also determine the exact value of the
local antimagic chromatic number of many families of graphs with cut-vertices (possibly

the electronic journal of combinatorics (2023), #DS6 233

given by pendant edges). In [1813] Lau, Shiu, and Ng provide sharp upper and lower
bounds of χla (G) for G with pendant vertices, and give sufficient conditions for equality.
They show that there are infinitely many graphs with k > χ(G) − 1 pendant vertices
and χla (G) = k + 1. They conjecture that every tree Tk , other than certain caterpillars,
spiders and lobsters, with k pendant vertices has χla (Tk ) = k + 1. Lau, Shiu, and Soo
[1816] proved that a d-leg spider graph has d + 1 6 χla 6 d + 2 and a 3-leg spider has
χla = 4, if not all legs are of odd length. They also obtain many sufficient conditions such
that both the values are attainable. They conjecture that almost all d-leg spiders of size
q that satisfy d(d + 1) 6 2(2q − 1) with each leg length at least 2 has χla = d + 1. Bača,
Semaničová-Feňovčı́ková, Lai, and Wang [381] verified a conjecture by Arumugam, Lee,
Premalatha, and Wang [246] that for every tree T the local antimagic chromatic number
satisfies l + 1 6 χla (T ) 6 l + 2, where l is the number of leaves of T , by determining the
exact value for the local antimagic chromatic number of all complete full t-ary trees is
l + 1 for odd t. In [56] Adawiyah, Makhfudloh, and Prihandini obtained results about the [56] new
local (a, d)-antimagic chromatic number of sunflower graphs and umbrella graphs.
For a connected graph G with q edges a bijection f : E → {1, 2, . . . , q} is called a local
antimagic
P labeling if for any two adjacent vertices u and v, w(u) 6= w(v), where w(u) =
e∈E(u) f (e), and E(u) is the set of edges incident to u. In [251] Arumugam, Premalatha,
Bača, and Semaničová-Feňovčı́ková proved several basic results on this new parameter and
conjectured that any connected graph other than K2 admits a local antimagic labeling.
This conjecture was proved by Haslegrave [1193] using the probabilistic method, proves
that the local antimagic conjecture is true. Lau [1801] proved that every graph admits a
local antimagic total labeling. For any graph G, the graph H = G ∨ On , n > 1, is defined
by V (H) = V (G) ∪ {vi : 1 6 i 6 n} and E(H) = E(G) ∪ {uvi : u ∈ V (G)}. In [251,
Theorem 2.16], it was claimed that for any G with order m > 4,
(
χla (G) + 1 if m is even,
χla (G) + 1 6 χla (G ∨ O2 ) 6
χla (G) + 2 if m is odd.
Lau and Shiu [1809] determined the local antimagic total chromatic number of graphs
that are the amalgamation of complete graphs.
The number of distinct induced vertex labels under a local antimagic labeling f is de-
noted by c(f ), and is called the color number of f . The local antimagic chromatic number
of G, denoted by χla (G), is min{c(f ) : f is a local antimagic labeling of G}. In [1193],
Haslegrave proved that the local antimagic chromatic number is well-defined for every con-
nected graph other than K2 . Thus, for every connected graph G 6= K2 , χla (G) > χ(G),
the chromatic number of G. In [1811] Lau, Shiu, and Ng provided several sufficient con-
ditions for χla (H) 6 χla (G), where H is obtained from G with a certain edge deleted or
added. The further determined the exact value of the local antimagic chromatic number
of many cycle-related join graphs.
Let G(V, E) be a simple graph and f be a bijection f : V ∪ E → {1, 2, . . . , |V | + |E|}
where f (V ) = {1, 2, . . . , |V |}. For a vertex x ∈ V , define the weight of x, w(x), as the
sum of labels of all edges incident with x and the vertex label itself. Such an f is called a
super vertex local antimagic total labeling (SLAT) if for every two adjacent vertices their

the electronic journal of combinatorics (2023), #DS6 234

weights are different. The super vertex local antimagic total chromatic number χslat (G)
is the minimum number of colors taken over all colorings induced by super vertex local
antimagic total labelings of G. Hadiputra, Sugeng, Silaban, Maryati, and Fronček classify
all trees T that have χslat (T ) = 2, present a class of trees that have χslat (T ) = 3, and
show that for any positive integer n > 2 there is a tree T with χslat (T ) = n.
In Table 13 we use the abbreviation (a, d)-A to mean that the graph has an (a, d)-
antimagic labeling. A question mark following an abbreviation indicates that the graph
is conjectured to have the corresponding property. The table was prepared by Petr Kovář
and Tereza Kovářová and updated by J. Gallian in 2008.

the electronic journal of combinatorics (2023), #DS6 235

 Table 13: Summary of (a, d)-Antimagic Labelings

Graph Labeling Notes

P2n not (a, d)-A [588]

P2n+1 iff (n, 1)-A [588]

C2n not (a, d)-A [588]

C2n+1 (n + 2, 1)-A [588]

stars not (a, d)-A [588]

(k) (k)
C3 , C4 not (a, d)-A [588]
K3,3 not (a, d)-A [588]

K4 not (a, d)-A [588]

Petersen graph not (a, d)-A [588]

Wn not (a, d)-A n > 3 [1954]

antiprism on 2n (6n + 3, 2)-A n > 3, n 6≡ 2 (mod 4) [305]

vertices (see §6.1) (4n + 4, 4)-A n > 3, n 6≡ 2 (mod 4) [305]
(2n + 5, 6)-A? n > 4 [305]
(6n + 3, 2)-A? n > 6, n 6≡ 2 (mod 4) [305]
(4n + 4, 4)-A? n > 6, n 6≡ 2 (mod 4) [305]
Hershel graph (see [684]) not (a, d)-A [584], [586]

parachutes Pg,p (see §6.2) (a, d)-A for certain classes [584], [586]

prisms Cn × P2 ((7n + 4)/2, 1)-A n > 3, n even [585], [333]

((5n + 5)/2, 2)-A n > 3, n odd [585], [333]
((3n + 6)/2, 3)-A n > 3, n even [333]
((n + 7)/2, 4)-A? n > 7, [586], [333]
generalized Petersen ((3n + 6)/2, 3)-A n > 8, n ≡ 0 (mod 4) [334]
graph P (n, 2)

the electronic journal of combinatorics (2023), #DS6 236

6.3 (a, d)-Antimagic Total Labelings
Bača, Bertault, MacDougall, Miller, Simanjuntak, and Slamin [323] introduced the notion
of a (a, d)-vertex-antimagic total labeling in 2000. For a graph G(V, E), an injective
mapping f from V ∪ E toPthe set {1, 2, . . . , |V | + |E|} is a (a, d)-vertex-antimagic total
labeling if the set {f (v) + f (vu)} where the sum is over all vertices u adjacent to v for
all v in G is {a, a+d, a+2d, . . . , a+(|V |−1)d}. In the case where the vertex labels are 1,2,
. . . , |V |, (a, d)-vertex-antimagic total labeling is called a super (a, d)-vertex-antimagic total
labeling. Among their results are: every super-magic graph has an (a, 1)-vertex-antimagic
total labeling; every (a, d)-antimagic graph G(V, E) is (a + |E| + 1, d + 1)-vertex-antimagic
total; and, for d > 1, every (a, d)-antimagic graph G(V, E) is (a + |V | + |E|, d − 1)-vertex-
antimagic total. They also show that paths and cycles have (a, d)-vertex-antimagic total
labelings for a wide variety of a and d. In [324] Bača et al. use their results in [323]
to obtain numerous (a, d)-vertex-antimagic total labelings for prisms, and generalized
Petersen graphs (see §2.7 for the definition). (See also [340] and [3086] for more results
on generalized Petersen graphs.)
Sugeng, Miller, Lin, and Bača [3086] prove: Cn has a super (a, d)-vertex-antimagic
total labeling if and only if d = 0 or 2 and n is odd, or d = 1; Pn has a super (a, d)-vertex-
antimagic total labeling if and only if d = 2 and n > 3 is odd, or d = 3 and n > 3; no
even order tree has a super (a, 1)-vertex antimagic total labeling; no cycle with at least
one tail and an even number of vertices has a super (a, 1)-vertex-antimagic labeling; and
the star Sn , n > 3, has no super (a, d)-super antimagic labeling. As open problems they
ask whether Kn,n has a super (a, d)-vertex-antimagic total labeling and the generalized
Petersen graph has a super (a, d)-vertex-antimagic total labeling for specific values a, d,
and n. In [2540] Raheem proved that various subclasses of stars admit super (a, d)-edge
antimagic total labelings for d = 1, 2, and 3. Lin, Miller, Simanjuntak, and Slamin [1954]
have shown that for n > 20, Wn has no (a, d)-vertex-antimagic total labeling. Tezer and
Cahit [3203] proved that neither Pn nor Cn has (a, d)-vertex-antimagic total labelings for
a > 3 and d > 6. Kovář [1747] has shown that every 2r-regular graph with n vertices has
an (s, 1)-vertex antimagic total labeling for s ∈ {(rn + 1)(r + 1) + tn | t = 0, 1, . . . , r}.
Dafik, Slamin, Romdhani, and Arianti [777] studied the super (a, d)-antimagicness of
generalized flower and disk brake graphs. Dafik, Slamin, Eka, and Sya’diyah [776] proved [776] new
that triangular books and diamond ladder graphs admit a super (a, d)-edge-antimagic
total labeling of graph for d ∈ {0, 1, 2}.
Several papers have been written about vertex-antimagic total labeling of graphs that
are the disjoint union of suns. The sun graph Sn is Cn K1 . Rahim and Sugeng [2546]
proved that Sn1 ∪ Sn2 ∪ · · · ∪ Snt is (a, 0)-vertex-antimagic total (or vertex magic total).
Parestu, Silaban, and Sugeng [2342] and [2343] proved Sn1 ∪ Sn2 ∪ · · · ∪ Snt is (a, d)-
vertex-antimagic total for d = 1, 2, 3, 4, and 6 and particular values of a. In [2544]
Rahim, Ali, Kashif, and Javaid provide (a, d)-vertex antimagic total labelings of disjoint
unions of cycles, sun graphs, and disjoint unions of sun graphs. In [891] Enomoto et
al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph.
Javaid [1357] gave (a, d)-edge-antimagic total labelings for certain subclasses of subdivided
stars. Javaid [1358] gave a super (a, d)-edge-antimagic total labeling for the subdivided

the electronic journal of combinatorics (2023), #DS6 237

star T (n, n, n+4, n+4, n5 , n6 , . . . , nr ) for d = 0, 1, 2, where np = 2p−4 (n+3)+1, 5 6 p 6 r
and n > 3 is odd.
In [2289] Ngurah, Baskova, and Simanjuntak provide (a, d)-vertex-antimagic total la-
belings for the generalized Petersen graphs P (n, m) for the cases: n > 3, 1 6 m 6
b(n − 1)/2c, (a, d) = (8n + 3, 2); odd n > 5, m = 2, (a, d) = ((15n + 5)/2, 1); odd
n > 5, m = 2, (a, d) = ((21n + 5)/2, 1); odd n > 7, m = 3, (a, d) = ((15n + 5)/2, 1); odd
n > 7, m = 3, (a, d) = ((21n + 5)/2, 1); odd n > 9, m = 4, (a, d) = ((15n + 5)/2, 1);
and (a, d) = ((21n + 5)/2, 1). They conjecture that for n odd and 1 6 m 6 b(m − 1)/2c,
P (n, m) has an ((21n + 5)/2, 1)-vertex-antimagic labeling. In [3091] Sugeng and Silaban
show: the disjoint union of any number of odd cycles of orders n1 , n2 , . . . , nt , each at least
5, has a super (3(n1 + n2 + · · · + nt ) + 2, 1)-vertex-antimagic total labeling; for any odd
positive integer t, the disjoint union of t copies of the generalized Petersen graph P (n, 1)
has a super (10t + 2)n − bn/2c + 2, 1)-vertex-antimagic total labeling; and for any odd
positive integers t and n (n > 3), the disjoint union of t copies of the generalized Petersen
graph P (n, 2) has a super (21tn + 5)/2, 1)-vertex-antimagic total labeling. Ahmad, Ali,
Bača, Kovar, and Semaničová-Feňovčı́ková, investigated the vertex-antimagicness of reg-
ular graphs and the existence of (super) (a, d)-vertex antimagic total labelings for regular
graphs in general.
Ali, Bača, Lin, and Semaničová-Feňovčiková [153] investigated super-(a, d)-vertex an-
timagic total labelings of disjoint unions of regular graphs. Among their results are: if
m and (m − 1)(r + 1)/2 are positive integers and G is an r-regular graph that admits
a super-vertex magic total labeling, then mG has a super-(a, 2)-vertex antimagic total
labeling; if G has a 2-regular super-(a, 1)-vertex antimagic total labeling, then mG has a
super-(m(a − 2) + 2, 1), 1)-vertex antimagic total labeling; mCn has a super-(a, d)-vertex
antimagic total labeling if and only if either d is 0 or 2 and m and n are odd and at
least 3 or d = 1 and n > 3; and if G is an even regular Hamilton graph, then mG has a
super-(a, 1)-vertex antimagic total labeling for all positive integers m.
In [385] Bača, A. Semaničová-Feňovčı́ková, Wang, and Zhang investigate the exis-
tence of (a, 1)-vertex-antimagic edge labelings for disconnected 3-regular graphs. As an
extension of (a, d)-vertex-antimagic edge labeling they also introduce the concept of (a, d)-
vertex-antimagic edge deficiency for measuring how close a graph is away from being an
(a, d)-antimagic graph. In [250] Arumugam and Nalliah investigate the existence of a
super (a, d)-edge-antimagic total labelings of disconnected graphs.
Ahmad, Ali, Bača, Kovář and Semaničová-Feňovčı́ková [83] provided a technique that
allows one to construct several (a, r)-vertex-antimagic edge labelings for any 2r-regular
graph G of odd order provided the graph is Hamiltonian or has a 2-regular factor that
has (b, 1)-vertex-antimagic edge labeling. A similar technique allows them to construct a
super (a, d)-vertex-antimagic total labeling for any 2r-regular Hamiltonian graph of odd
order with differences d = 1, 2, . . . , r and d = 2r + 2.
For n > 2 Dafik, Setiawani, and Azizah [839] define a shackle as a graph constructed
from connected graphs G1 , G2 , . . . , Gn , all isomorphic to G, such that Gs and Gt are
disjoint when |s − t| > 2 and for every i = 1, 2, . . . , n − 1, Gi and Gi+1 share exactly one
common vertex v. In a generalized shackle a common subgraph is shared by each Gi and

the electronic journal of combinatorics (2023), #DS6 238

Gi+1 . Dafik, Setiawani, and Azizah prove that the generalized shackle of a fan of order
four and five admits a super (a, d)-edge antimagic total labeling for d = 0, 1, 2.
Sugeng and Bong [3080] show how to construct super (a, d)-vertex antimagic total
labelings for the circulant graphs Cn (1, 2, 3), for d = 0, 1, 2, 3, 4, 8. Thirusangu, Nagar,
and Rajeswari [3212] show that certain Cayley digraphs of dihedral groups have (a, d)-
vertex-magic total labelings.
For a simple graph H we say that G(V, E) admits an H-covering if every edge in
E(G) belongs to a subgraph of G that is isomorphic to H. Inayah, Salman, and Siman-
juntak [1323] define an (a, d)-H-antimagic total labeling of G as a bijective function ξ
from V ∪ E → {1, 2, P . . . , |V | + |E|} such that for all subgraphs H 0 isomorphic to H, the
H-weights w(H 0 ) = v∈V (H 0 ) ξ(v) + e∈E(H 0 ) ξ(e) constitute an arithmetic progression
P

a, a + d, a + 2d, . . . , a + (t − 1)d where a and d are positive integers and t is the number of
subgraphs of G isomorphic to H. Such a labeling ξ is called a super (a, d)-H-antimagic
total labeling, if ξ(V ) = {1, 2, . . . , |V |}. Inayah et al. study some basic properties of such
labeling and give (a, d)-cycle-antimagic labelings of fans. Taimur, Numan, Mumtaz, and
Semaničová-Feňovčı́ková [3184] proved that if a graph G is super cycle-antimagic then the
subdivided graph of G also admits a super cycle-antimagic labeling and they showed that
the subdivided wheel is super (a, d)-cycle-antimagic for wide range of values. Laurence
and Kathiresan [1817] investigated super (a, d)-Pn -antimagic total labeling of stars. In
[2521] Prihandini, Dafik, Agustin, Alfarisi, Adawiyah, and Santoso investigated the exis- [2521] new
tence of super (a, d)-P2 . H-antimagic total labelings of the disjoint union graph Cn 4H.
Bača, Jeyanthi, Selvagopal, Muthu Raja, and Semaničová-Feňovčı́ková [269] proved the
existence of super (a, d)-H-antimagic labelings of fan graphs and ladders for H isomorphic
to a cycle.
In [2750] Semaničová-Feňovčı́ková, Bača, Lascsáková, Miller, and Ryan investigated
the super (a, d)-Cn -antimagic total labelings of wheels and super (a, d)-Pn -antimagic to-
tal labelings of cycles and paths. Ovais, Umar, Bača, and Semaničová-Feňovčı́ková [2323]
proved that fans admits a super (a, d)-Ck -antimagic labeling for d = 1, 3, 2k − 5, 2k −
1, 3k − 1, k − 7, k + 1, 3k − 9. They also prove that fans admits a super (a, d)-C3 -
antimagic labeling for d = 0, 1, 2, 3, 4, 5, 6, 8, and a super (a, d)-C4 -antimagic labeling
for d = 0, 1, 2, 3, 4, 5, 6, 7, 11. They propose an open problem to find a super (a, d)-Ck -
antimagic labeling of fans for d 6= 1, 3, k − 7, k + 1, 2k − 5, 2k − 1, 3k − 1, 3k − 9. Bača,
Miller, Ryan, and Semaničová-Feňovčı́ková [369] study super (a, d)-H-antimagic labelings
of a disjoint union of graphs for d = |E(H)| − |V (H)|.
For a vertex u of a graph G, Gu [Sn ] is the graph obtained by identifying u with
the center of Sn . Then for any vertex w of Sn G + e, e = uw is a subgraph of Gu [Sn ].
Kathiresan and Laurence [1672] prove that the graph Gu [Sn ] admits a super-(a, d)-(G+e)-
antimagic total labeling if and only if d ∈ {0, 1, 2, . . . , |V (G)| + |E(G)| + 2}. Moreover,
they show that a caterpillar Sn1 ,n2 ,...,nk has a super-(a, 4n2 )-Sn,n -antimagic total labeling
for n1 = n2 = · · · = nk = n. In [2567] Rajkumar, Nalliah, Uma Maheswari provided a
partial solution to the problem of characterizing the super (a, d) − G + e-antimagic total
labeling of the graph Gu [Sn ], where n > 3 and 4 6 d 6 p + q + 2 posed in 2015 by
Kathiresan and Laurence in [1672].

the electronic journal of combinatorics (2023), #DS6 239

 Jeyanthi, Muthuraja, Semaničová-Feňovčı́ková, and Dharshikha proved [1483] proved
that fans, triangular ladders, and middle graphs of cycles are super (a, d)-C3 -antimagic
for some values of a and d. They also proved that ladder are super (a, d)-C4 -antimagic
for 1 6 d 6 8. Inayah, Simanjuntak, and Salman [1324] proved that there exists a super
(a, d) − H-antimagic total labelings for shackles of a connected graph H. Nadzima and
Martini [2243] determined (a, d)-H-antimagic total labeling for certains cases of Wn Pn
with H as C3 Pn and Wn Cn with H as C3 Cn .
A graph G is said to have an (H1 , H2 , . . . , Hk )-covering if every edge in G belongs
to at least one of the Hi ’s. Susilowati, Sania, and Estuningsih [3164] investigated such
antimagic labelings for the ladders Pn × P2 with Ct -coverings for t = 4, 6, and 8 for some
value of d.
Simanjuntak, Bertault, and Miller [2958] define an (a, d)-edge-antimagic vertex labeling
for a graph G(V, E) as an injective mapping f from V onto the set {1, 2, . . . , |V |} such
that the set {f (u) + f (v)|uv ∈ E} is {a, a + d, a + 2d, . . . , a + (|E| − 1)d}. (The equivalent
notion of (a, d)-indexable labeling was defined by Hegde in 1989 in his Ph. D. thesis–see
[1210].) Similarly, Simanjuntak et al. define an (a, d)-edge-antimagic total labeling for a
graph G(V, E) as an injective mapping f from V ∪ E onto the set {1, 2, . . . , |V | + |E|}
such that the set {f (v) + f (vu) + f (v)|uv ∈ E} where v ranges over all of V is {a, a +
d, a + 2d, . . . , a + (|V | − 1)d}. Among their results are: C2n has no (a, d)-edge-antimagic
vertex labeling; C2n+1 has a (n + 2, 1)-edge-antimagic vertex labeling and a (n + 3, 1)-
edge-antimagic vertex labeling; P2n has a (n+2, 1)-edge-antimagic vertex labeling; Pn has
a (3, 2)-edge-antimagic vertex labeling; Cn has (2n + 2, 1)- and (3n + 2, 1)-edge-antimagic
total labelings; C2n has (4n + 2, 2)- and (4n + 3, 2)-edge-antimagic total labelings; C2n+1
has (3n + 4, 3)- and (3n + 5, 3)-edge-antimagic total labelings; P2n+1 has (3n + 4, 2)-,
(3n + 4, 3)-, (2n + 4, 4)-, (5n + 4, 2)-, (3n + 5, 2)-, and (2n + 6, 4)-edge-antimagic total
labelings; P2n has (6n, 1)- and (6n+2, 2)-edge-antimagic total labelings; and several parity
conditions for (a, d)-edge-antimagic total labelings. They conjecture: C2n has a (2n+3, 4)-
or a (2n + 4, 4)-edge-antimagic total labeling; C2n+1 has a (n + 4, 5)- or a (n + 5, 5)-edge-
antimagic total labeling; paths have no (a, d)-edge-antimagic vertex labelings with d > 2;
and cycles have no (a, d)-antimagic total labelings with d > 5. The first and last of these
conjectures were proved by Zhenbin in [3594] and the last two were verified by Bača, Lin,
Miller, and Simanjuntak [352] who proved that a graph with v vertices and e edges that
has an (a, d)-edge-antimagic vertex labeling must satisfy d(e−1) 6 2v −1−a 6 2v −4. As
a consequence, they obtain: for every path there is no (a, d)-edge-antimagic vertex labeling
with d > 2; for every cycle there is no (a, d)-edge-antimagic vertex labeling with d > 1;
for Kn (n > 1) there is no (a, d)-edge-antimagic vertex labeling (the cases for n = 2 and
n = 3 are handled individually); Kn,n (n > 3) has no (a, d)-edge-antimagic vertex labeling;
for every wheel there is no (a, d)-edge-antimagic vertex labeling; for every generalized
Petersen graph there is no (a, d)-edge-antimagic vertex labeling with d > 1. They also
study the relationship between graphs with (a, d)-edge-antimagic labelings and magic and
antimagic labelings. They conjecture that every tree has an (a, 1)-edge-antimagic total
labeling.
Bača and Barrientos [309] prove that if a tree T has an α-labeling and {A, B} is the

the electronic journal of combinatorics (2023), #DS6 240

bipartition of the vertices of T , then T also admits an (a, 1)-edge-antimagic vertex labeling
and it admits a (3, 2)-edge-antimagic vertex labeling if and only if ||A| − |B|| 6 1.
In [352] Bača, Lin, Miller, and Simanjuntak prove: if Pn has an (a, d)-edge-antimagic
total labeling, then d 6 6; Pn has (2n + 2, 1)-, (3n, 1)-, (n + 4, 3)-, and (2n + 2, 3)-edge-
antimagic total labelings; P2n+1 has (3n + 4, 2)-,(5n + 4, 3)-, (2n + 4, 4)-, and (2n + 6, 4)-
edge-antimagic total labelings; and P2n has (3n+3, 2)- and (5n+1, 2)-edge-antimagic total
labelings. Ngurah [2285] proved P2n+1 has (4n + 4, 1)-, (6n + 5, 3)-,(4n + 4, 2)-,(4n + 5, 2)-
edge-antimagic total labelings and C2n+1 has (4n + 4, 2)- and (4n + 5, 2)-edge-antimagic
total labelings. Silaban and Sugeng [2956] prove: Pn has (n + 4, 4)- and (6, 6)-edge-
antimagic total labelings; if Cm Kn has an (a, d)-edge-antimagic total labeling, then
d 6 5; Cm Kn has (a, d)-edge-antimagic total labelings for m > 3, n > 1 and d = 2 or
4; and Cm Kn has no (a, d)-edge-antimagic total labelings for m and d and n ≡ 1 mod
4. They conjecture that Pn (n > 3) has (a, 5)-edge-antimagic total labelings. In [3093]
Sugeng and Xie use adjacency methods to construct super edge magic graphs from (a, d)-
edge-antimagic vertex graphs. Pushpam and Saibulla [2533] determined super (a, d)-edge
antimagic total labelings for graphs derived from copies of generalized ladders, fans, gen-
eralized prisms and web graphs. Liu, Aslam, Javaid, and Raheen [1970] compute bounds
of the minimum and maximum edge-weights for super (a, d)-edge-antimagic labelings on
a generalized class of subdivided caterpillars. They also investigate the existence of super
(a, d)-edge-antimagic total labeling for the validation of the obtained bounds.
In [389] Bača and Youssef used parity arguments to find a large number of conditions
on p, q and d for which a graph with p vertices and q edges cannot have an (a, d)-edge-
antimagic total labeling or vertex-antimagic total labeling. Bača and Youssef [389] made
the following connection between (a, d)-edge-antimagic vertex labelings and sequential
labelings: if G is a connected graph other than a tree that has an (a, d)-edge-antimagic
vertex labeling, then G + K1 has a sequential labeling.
In [3066] Sudarsana, Ismaimuza, Baskoro, and Assiyatun prove: for every n > 2, Pn ∪
Pn+1 has a (6n + 1, 1)- and a (4n + 3, 3)-edge-antimagic total labeling, for every odd
n > 3, Pn ∪ Pn+1 has a (6n, 1)- and a (5n + 1, 2)-edge-antimagic total labeling, for every
n > 2, nP2 ∪ Pn has a (7n, 1)- and a (6n + 1, 2)-edge-antimagic total labeling. In [3063]
the same authors show that Pn ∪ Pn+1 , nP2 ∪ Pn (n > 2), and nP2 ∪ Pn+2 are super edge-
magic total. They also show that under certain conditions one can construct new super
edge-magic total graphs from existing ones by joining a particular vertex of the existing
super edge-magic total graph to every vertex in a path or every vertex of a star and by
joining one extra vertex to some vertices of the existing graph. Baskoro, Sudarsana, and
Cholily [512] also provide algorithms for constructing new super edge-magic total graphs
from existing ones by adding pendent vertices to the existing graph. A corollary to one
of their results is that the graph obtained by attaching a fixed number of pendent edges
to each vertex of a path of even length is super edge-magic. Baskoro and Cholily [510]
show that the graphs obtained by attaching any numbers of pendent edges to a single
vertex or a fix number of pendent edges to every vertex of the following graphs are super
edge-magic total graphs: odd cycles, the generalized Petersen graphs P (n, 2) (n odd and
at least 5), and Cn × Pm (n odd, m > 2).

the electronic journal of combinatorics (2023), #DS6 241

 (n)
Arumugam and Nalliah [249] proved: the friendship graph C3 with n ≡ 0, 8 (mod 12)
(n)
has no super (a, 2)-edge-antimagic total labeling; Cn with n ≡ 2 (mod 4) has no super
(a, 2)-edge-antimagic total labeling; and the generalized friendship graph F2,p consisting
of 2 cycles of various lengths, having a common vertex, and having order p where p > 5,
has a super (2p + 2, 1)-edge-antimagic total labeling if and only if p is odd.
An (a, d)-edge-antimagic total labeling of G(V, E) is called a super (a, d)-edge-
antimagic total if the vertex labels are {1, 2, . . . , |V (G)|} and the edge labels are
{|V (G)| + 1, |V (G)| + 2, . . . , |V (G)| + |E(G)|}. Bača, Baskoro, Simanjuntak, and Sugeng
[322] prove the following: Cn has a super (a, d)-edge-antimagic total labeling if and only
if either d is 0 or 2 and n is odd, or d = 1; for odd n > 3 and m = 1 or 2, the generalized
Petersen graph P (n, m) has a super (11n + 3)/2, 0)-edge-antimagic total labeling and a
super ((5n + 5)/2, 2)-edge-antimagic total labeling; for odd n > 3, P (n, (n − 1)/2) has
a super ((11n + 3)/2, 0)-edge-antimagic total labeling and a super ((5n + 5)/2, 2)-edge-
antimagic total labeling. They also prove: if P (n, m), n > 3, 1 6 m 6 b(n − 1)/2c
is super (a, d)-edge-antimagic total, then (a, d) = (4n + 2, 1) if n is even, and either
(a, d) = ((11n + 3)/2, 0), or (a, d) = (4n + 2, 1), or (a, d) = ((5n + 5)/2, 2), if n is odd;
and for odd n > 3 and m = 1, 2, or (n − 1)/2, P (n, m) has an (a, 0)-edge-antimagic
total labeling and an (a, 2)-edge-antimagic total labeling. (In a personal communica-
tion MacDougall argues that “edge-magic” is a better term than “(a, 0)-edge-antimagic”
for while the latter is technically correct, “antimagic” suggests different weights whereas
“magic” emphasizes equal weights and that the edge-magic case is much more important,
interesting, and fundamental rather than being just one subcase of equal value to all the
others.) They conjecture that for odd n > 9 and 3 6 m 6 (n − 3)/2, P (n, m) has a (a, 0)-
edge-antimagic total labeling and an (a, 2)-edge-antimagic total labeling. Ngurah and
Baskoro [2288] have shown that for odd n > 3, P (n, 1) and P (n, 2) have ((5n + 5)/2, 2)-
edge-antimagic total labelings and when n > 3 and 1 6 m < n/2, P (n, m) has a super
(4n + 2, 1)-edge-antimagic total labeling. In [2289] Ngurah, Baskova, and Simanjuntak
provide (a, d)-edge-antimagic total labelings for the generalized Petersen graphs P (n, m)
for the cases m = 1 or 2, odd n > 3, and (a, d) = ((9n + 5)/2, 2).
In [3064] Sudarsana, Baskoro, Uttunggadewa, and Ismaimuza show how to construct
new larger super (a, d)-edge-antimagic-total graphs from existing smaller ones.
In [2290] Ngurah, Baskoro, and Simanjuntak prove that mCn (n > 3) has an (a, d)-
edge-antimagic total in the following cases: (a, d) = (5mn/2 + 2, 1) where m is even;
(a, d) = (2mn +2, 2); (a, d) = ((3mn +5)/2, 3) for m and n odd; and (a, d) = ((mn +3), 4)
for m and n odd; and mCn has a super (2mn + 2, 1)-edge-antimagic total labeling.
Bača and Barrientos [310] have shown that mKn has a super (a, d)-edge-antimagic total
labeling if and only if (i) d ∈ {0, 2}, n ∈ {2, 3} and m > 3 is odd, or (ii) d = 1, n > 2
and m > 2, or (iii) d ∈ {3, 5}, n = 2 and m > 2, or (iv) d = 4, n = 2, and m > 3 is
odd. In [309] Bača and Barrientos proved the following: if a graph with q edges and q + 1
vertices has an α-labeling, than it has an (a, 1)-edge-antimagic vertex labeling; a tree has
a (3, 2)-edge-antimagic vertex labeling if and only if it has an α-labeling and the number
of vertices in its two partite sets differ by at most 1; if a tree with at least two vertices
has a super (a, d)-edge-antimagic total labeling, then d is at most 3; if a graph has an

the electronic journal of combinatorics (2023), #DS6 242

(a, 1)-edge-antimagic vertex labeling, then it also has a super (a1 , 0)-edge-antimagic total
labeling and a super (a2 , 2)-edge-antimagic total labeling.
Bača and Youssef [389] proved the following: if G is a connected (a, d)-edge-antimagic
vertex graph that is not a tree, then G+K1 is sequential; mCn has an (a, d)-edge-antimagic
vertex labeling if and only if m and n are odd and d = 1; an odd degree (p, q)-graph G
cannot have a (a, d)-edge-antimagic total labeling if p ≡ 2 (mod 4) and q ≡ 0 (mod 4),
or p ≡ 0 (mod 4), q ≡ 2 (mod 4), and d is even; a (p, q)-graph G cannot have a super
(a, d)-edge-antimagic total labeling if G has odd degree, p ≡ 2 (mod 4), q is even, and d
is odd, or G has even degree, q ≡ 2 (mod 4), and d is even; Cn has a (2n + 2, 3)- and an
(n + 4, 3)-edge-antimagic total labeling; a (p, q)-graph is not super (a, d)-vertex-antimagic
total if: p ≡ 2 (mod 4) and d is even; p ≡ 0 (mod 4), q ≡ 2 (mod 4), and d is odd; p ≡ 0
(mod 8) and q ≡ 2 (mod 4).
In [3066] Sudarsana, Ismaimuza, Baskoro, and Assiyatun prove: for every n > 2, Pn ∪
Pn+1 has super (n + 4, 1)- and (2n + 6, 3)-edge antimagic total labelings; for every odd
n > 3, Pn ∪ Pn+1 has super (4n + 5, 1)-,(3n + 6, 2)-, (4n + 3, 1)- and (3n + 4, 2)-edge
antimagic total labelings; for every n > 2, nP2 ∪ Pn has super (6n + 2, 1)- and (5n + 3, 2)-
edge antimagic total labelings; and for every n > 1, nP2 ∪ Pn+2 has super (6n + 6, 1)- and
(5n + 6, 2)-edge antimagic total labelings. They pose a number of open problems about
constructing (a, d)-edge antimagic labelings and super (a, d)-edge antimagic labelings for
the graphs Pn ∪ Pn+1 , nP2 ∪ Pn , and nP2 ∪ Pn+2 for specific values of d.
Dafik, Miller, Ryan, and Bača [773] investigated the super edge-antimagicness of the
disconnected graph mCn and mPn . For the first case they prove that mCn , m > 2, has
a super (a, d)-edge-antimagic total labeling if and only if either d is 0 or 2 and m and
n are odd and at least 3, or d = 1, m > 2, and n > 3. For the case of the disjoint
union of paths they determine all feasible values for m, n and d for mPn to have a super
(a, d)-edge-antimagic total labeling except when m is even and at least 2, n > 2, and d is 0
or 2. In [775] Dafik, Miller, Ryan, and Bača obtain a number of results about super edge-
antimagicness of the disjoint union of two stars and state three open problems. Nalliah
and Arumugam [2256] proved that K1,6 ∪ K1,5 does not have such a labeling and prove
that some special cases of K1,n+1 ∪ K1,n do have them.
Sudarsana, Hendra, Adiwijaya, and Setyawan [3065] show that the t-joint copies of
wheel Wn have a super edge antimagic ((2n + 2)t + 2, 1)-total labeling for n > 4 and t > 2.
In [347] Bača, Lascsáková, and Semaničová investigated the connection between graphs
with α-labelings and graphs with super (a, d)-edge-antimagic total labelings. Among their
results are: If G is a graph with n vertices and n − 1 edges (n > 3) and G has an α-
labeling, then mG is super (a, d)-edge-antimagic total if either d is 0 or 2 and m is odd,
or d = 1 and n is even; if G has an α-labeling and has n vertices and n − 1 edges with
vertex bipartition sets V1 and V2 where |V1 | and |V2 | differ by at most 1, then mG is super
(a, d)–edge-antimagic total for d = 1 and d = 3. In the same paper Bača et al. prove:
caterpillars with odd order at least 3 have super (a, 1)-edge-antimagic total labelings; if
G is a caterpillar of odd order at least 3 and G has a super (a, 1)-edge-antimagic total
labeling, then mG has a super (b, 1)-edge-antimagic total labeling for some b that is a
function of a and m.

the electronic journal of combinatorics (2023), #DS6 243

 In [772] Dafik, Miller, Ryan, and Bača investigated the existence of antimagic labelings
of disjoint unions of s-partite graphs. They proved: if s ≡ 0 or 1 (mod 4), s > 4, m >
2, n > 1 or mn is even , m > 2, n > 1, s > 4, then the complete s-partite graph mKn,n,...,n
has no super (a, 0)-edge-antimagic total labeling; if m > 2 and n > 1, then mKn,n,n,n has
no super (a, 2)-antimagic total labeling; and for m > 2 and n > 1, mKn,n,n,n has an
(8mn + 2, 1)-edge-antimagic total labeling. They conjecture that for m > 2, n > 1 and
s > 5, the complete s-partite graph mKn,n,...,n has a super (a, 1)-antimagic total labeling.
In [373] Bača, Muntaner-Batle, Semaničová-Feňovčiková, and Shafiq investigate super
(a, d)-edge-antimagic total labelings of disconnected graphs. Among their results are: If
G is a (super) (a, 2)-edge-antimagic total labeling and m is odd, then mG has a (super)
(a0 , 2)-edge-antimagic-total labeling where a0 = m(a − 3) + (m + 1)/2 + 2; and if d a
positive even integer and k a positive odd integer, G is a graph with all of its vertices
having odd degree, and the order and size of G have opposite parity, then 2kG has no
(a, d)-edge-antimagic total labeling. Bača and Brankovic [325] have obtained a number of
results about the existence of super (a, d)-edge-antimagic totaling of disjoint unions of the
form mKn,n . In [329] Bača, Dafik, Miller, and Ryan provide (a, d)-edge-antimagic vertex
labelings and super (a, d)-edge-antimagic total labelings for a variety of disjoint unions
of caterpillars. Bača and Youssef [389] proved that mCn has an (a, d)-edge-antimagic
vertex labeling if and only if m and n are odd and d = 1. Bača, Dafik, Miller, and
Ryan [330] constructed super (a, d)-edge-antimagic total labeling for graphs of the form
m(Cn K s ) and mPn ∪ kCn while Dafik, Miller, Ryan, and Bača [774] do the same for
graphs of the form mKn,n,n and K1,m ∪ 2sK1,n . Both papers provide a number of open
problems. In [357] Bača, Lin, and Muntaner-Batle provide super (a, d)-edge-antimagic
total labeling of forests in which every component is a specific kind of tree. In [345] Bača,
Kov́ǎr, Semaničová-Feňovčiková, and Shafiq prove that every even regular graph and
every odd regular graph with a 1-factor are super (a, 1)-edge-antimagic total and provide
some constructions of non-regular super (a, 1)-edge-antimagic total graphs. Bača, Lin, and
Semaničová-Feňovčiková [359] show: the disjoint union of m graphs with super (a, 1)-edge
antimagic total labelings have super (m(a − 2) + 2, 1)-edge antimagic total labelings; the
disjoint union of m graphs with super (a, 3)-edge antimagic total labelings have super
(m(a − 3) + 3, 3)-edge antimagic total labelings; if G has a (a, 1)-edge antimagic total
labelings then mG has an (b, 1)-edge antimagic total labeling for some b; and if G has a
(a, 3)-edge antimagic total labelings then mG has an (b, 3)-edge antimagic total labeling
for some b.
Bača, Miller, Ryan, and Semaničová-Feňovčı́ková [369] prove that if G admits a (super)
(a, d)-H-antimagic labeling, where d = |E(H)|−|V (H)|, then mG admits a (super) (b, d)-
H-antimagic labelling. By considering special H-coverings of a given H-antimagic graph
G they derive many corollaries. In [2749] Semaničová-Feňovčı́ková, Bača, and Lascsáková
provide two constructions of (super) H-antimagic graphs obtained from smaller (super)
H 0 -antimagic graphs. Dafik, Slamin, Tana, Semaničová-Feňovčı́ková, and Bača [778]
show a connection between a constructions of H-antimagic labelings of graph and edge-
antimagic total labelings and describe how to obtain the H-antimagic graph using smaller
edge-antimagic graph. Bača, Semaničová-Feňovčikovǎ, Umar, and Welyyanti [384] gave

the electronic journal of combinatorics (2023), #DS6 244

sufficient conditions for G1 × G2 to admit an H-supermagic or a super (a, d)-H-antimagic
labeling but provide no examples of graphs that satisfy the given conditions.
For t > 2 and n > 4 the Harary graph, Cpt , is the graph obtained by joining every
two vertices of Cp that are at distance t in Cp . In [2544] Rahim, Ali, Kashif, and Javaid
provide super (a, d)-edge antimagic total labelings for disjoint unions of Harary graphs and
disjoint unions of cycles. In [1275] Hussain, Ali, Rahim, and Baskoro construct various
(a, d)-vertex-antimagic labelings for Harary graphs and disjoint unions of identical Harary
graphs. For p odd and at least 5, Balbuena, Barker, Das, Lin, Miller, Ryan, Slamin,
Sugeng, and Tkac [409] give a super ((17p + 5)/2)-vertex-antimagic total labeling of Cpt .
t
MacDougall and Wallis [2050] have proved the following: C4m+3 , m > 1, has a super (a, 0)-
edge-antimagic total labeling for all possible values of t with a = 10m + 9 or 10m + 10;
t
C4m+1 , m > 3, has a super (a, 0)-edge-antimagic total labeling for all possible values
t
except t = 5, 9, 4m − 4, and 4m − 8 with a = 10m + 4 and 10m + 5; C4m+1 , m > 1, has
a super (10m + 4, 0)-edge-antimagic total labeling for all t ≡ 1 (mod 4) except 4m − 3;
t
C4m , m > 1, has a super (10m + 2, 0)-edge-antimagic total labeling for all t ≡ 2 (mod 4);
t
C4m+2 , m > 1, has a super (10m + 7, 0)-edge-antimagic total labeling for all odd t other
than 5 and for t = 2 or 6. In [1276] Hussain, Baskoro, and Ali prove the following: for
any p > 4 and for any t > 2, Cpt admits a super (2p + 2, 1)-edge-antimagic total labeling;
for n > 4, k > 2 and t > 2, kCnt admits a super (2nk + 2, 1)-edge-antimagic total labeling;
and for p > 5 and t > 2, Cpt admits a super (8p + 3, 1)-vertex-antimagic total labeling,
provided if p 6= 2t.
Bača and Murugan [379] have proved: if Cnt , n > 4, 2 6 t 6 n − 2, is super (a, d)-
edge-antimagic total, then d = 0, 1, or 2; for n = 2k + 1 > 5, Cnt has a super (a, 0)-
edge-antimagic total labeling for all possible values of t with a = 5k + 4 or 5k + 5; for
n = 2k+1 > 5, Cnt has a super (a, 2)-edge-antimagic total labeling for all possible values of
t with a = 3k +3 or 3k +4; for n ≡ 0 (mod 4), Cnt has a super (5n/2+2, 0)-edge-antimagic
total labeling and a super (3n/2+2, 0)-edge-antimagic total labeling for all t ≡ 2 (mod 4);
for n = 10 and n ≡ 2 (mod 4), n > 18, Cnt has a super (5n/2 + 2, 0)-edge-antimagic total
labeling and a super (3n/2 + 2, 0)-edge-antimagic total labeling for all t ≡ 3 (mod 4) and
for t = 2 and 6; for odd n > 5, Cnt has a super (2n + 2, 1)-edge-antimagic total labeling
for all possible values of t; for even n > 6, Cnt has a super (2n + 2, 1)-edge-antimagic
total labeling for all odd t > 3; and for even n ≡ 0 (mod 4), n > 4, Cnt has a super
(2n + 2, 1)-edge-antimagic total labeling for all t ≡ 2 (mod 4). They conjecture that there
is a super (2n + 2, 1)-edge-antimagic total labeling of Cnt for n ≡ 0 (mod 4) and for t ≡ 0
(mod 4) and for n ≡ 2 (mod 4) and for t even.
(n)
In [353] Bača, Lin, Miller, and Youssef prove: if the friendship C3 is super (a, d)-
(n)
antimagic total, then d < 3; C3 has an (a, 1)-edge antimagic vertex labeling if and only
(n)
if n = 1, 3, 4, 5, and 7; C3 has a super (a, d)-edge-antimagic total labelings for d = 0 and
(n)
2; C3 has a super (a, 1)-edge-antimagic total labeling; if a fan Fn (n > 2) has a super
(a, d)-edge-antimagic total labeling, then d < 3; Fn has a super (a, d)-edge-antimagic total
labeling if 2 6 n 6 6 and d = 0, 1 or 2; the wheel Wn has a super (a, d)-edge-antimagic
total labeling if and only if d = 1 and n 6≡ 1 (mod 4); Kn , n > 3, has a super (a, d)-edge-
antimagic total labeling if and only if either d = 0 and n = 3, or d = 1 and n > 3, or

the electronic journal of combinatorics (2023), #DS6 245

d = 2 and n = 3; and Kn,n has a super (a, d)-edge antimagic total labeling if and only if
d = 1 and n > 2.
Bača, Lin, and Muntaner-Batle [354] have shown that if a tree with at least two vertices
has a super (a, d)-edge-antimagic total labeling, then d is at most three and Pn , n > 2,
has a super (a, d)-edge-antimagic total labeling if and only if d = 0, 1, 2, or 3. They also
characterize certain path-like graphs in a grid that have super(a, d)-edge-antimagic total
labelings.
In [3085] Sugeng, Miller, and Bača prove that the ladder, Pn × P2 , is super (a, d)-edge-
antimagic total if n is odd and d = 0, 1, or 2 and Pn × P2 is super (a, 1)-antimagic total
if n is even. They conjecture that Pn × P2 is super (a, 0)- and (a, 2)-edge-antimagic when
n is even. Sugeng, Miller, and Bača [3085] prove that Cm × P2 has a super (a, d)-edge-
antimagic total labeling if and only if either d = 0, 1 or 2 and m is odd and at least 3, or
d = 1 and m is even and at least 4. They conjecture that if m is even, m > 4, n > 3,
and d = 0 or 2, then Cm × Pn has a super (a, d)-edge-antimagic total labeling. In [1831]
M.-J. Lee studied super (a, 1)-edge-antimagic properties of m(P4 × Pn ) for m, n > 1 and
m(Cn Kt ) for n even and m, t > 1. He also proved that for n > 2 the graph P4 × Pn
has a super (8n + 2, 1)-edge antimagic total labeling.
In [145] and [146] Azizu, Yulianti, Sy, Narwen proved that (Cm × P2 ) Kn (branched- [145] new
prism) for odd m > 3 and n > 1 admits an edge magic and a super (a, d)-edge antimagic [146] new
total labelings for odd m > 3 and n > 1.
Sugeng, Miller, and Bača [3085] define a variation of a ladder, Ln , as the graph obtained
from Pn × P2 by joining each vertex ui of one path to the vertex vi+1 of the other path for
i = 1, 2, . . . , n − 1. They prove Ln , n > 2, has a super (a, d)-edge-antimagic total labeling
if and only if d = 0, 1, or 2.
In [771] Dafik, Miller, and Ryan investigate the existence of super (a, d)-edge-antimagic
total labelings of mKn,n,n and K1,m ∪ 2sK1,n . Among their results are: for d = 0 or
2, mKn,n,n has a super (a, d)-edge-antimagic total labeling if and only if n = 1 and
m is odd and at least 3; K1,m ∪ 2sK1,n has a super (a, d)-edge-antimagic labeling for
(a, d) = (4n + 5)s + 2m + 4, 0), ((2n + 5)s + m + 5, 2), ((3n + 5)s + (3m + 9)/2, 1) and
(5s + 7, 4).
In [313] Bača, Bashir, and Semaničová showed that for n > 4 and d = 0, 1, 2, 3, 4, 5,
and 6 the antiprism An has a super d-antimagic labeling of type (1, 1, 1). The generalized
antiprism Anm is obtained from Cm ×Pn by inserting the edges {vi,j+1 , vi+1,j } for 1 6 i 6 m
and 1 6 j 6 n − 1 where the subscripts are taken modulo m. Sugeng et al. prove that
Anm , m > 3, n > 2, is super (a, d)-edge-antimagic total if and only if d = 1.
A toroidal polyhex (toroidal fullerene) is a cubic bipartite graph embedded on the torus
such that each face is a hexagon. Note that the torus is a closed surface that can carry a
toroidal polyhex such that all its vertices have degree 3 and all faces of the embedding are
hexagons. Bača and Shabbir [386] proved the toroidal polyhex Hnm with mn hexagons,
m, n > 2, admits a super (a, d)-edge-antimagic total labeling if and only if d = 1 and
a = 4mn + 2.
Bača, Miller, Phanalasy, and A. Semaničová-Feňovčı́ková [365] investigated the exis-
tence of (super) 1-antimagic labelings of type (1, 1, 1) for disjoint union of plane graphs.

the electronic journal of combinatorics (2023), #DS6 246

They prove that if a plane graph G(V, E, F ) has a (super) 1-antimagic labeling h of
type (1, 1, 1) such that h(zext ) = |V (G)| + |E(G)| + |F (G)| where zext denotes the
unique external face then, for every positive integer m, the graph mG also admits a
(super) 1-antimagic labeling of type (1, 1, 1); and if a plane graph G(V, E, F ) has 4-
sided inner faces and h is a (super) d-antimagic labeling of type (1, 1, 1) of G such that
h(zext ) = |V (G)| + |E(G)| + |F (G)| where d = 1, 3, 5, 7, 9 then, for every positive integer
m, the graph mG also admits a (super) d-antimagic labeling of type (1, 1, 1). They also
give a similar result about plane graphs with inner faces that are 3-sided.
Sugeng, Miller, Slamin, and Bača [3088] proved: the star Sn has a super (a, d)-
antimagic total labeling if and only if either d = 0, 1 or 2, or d = 3 and n = 1 or 2;
if a nontrivial caterpillar has a super (a, d)-edge-antimagic total labeling, then d 6 3; all
caterpillars have super (a, 0)-, (a, 1)- and (a, 2)-edge-antimagic total labelings; all cater-
pillars have a super (a, 1)-edge-antimagic total labeling; if m and n differ by at least 2
the double star Sm,n (that is, the graph obtained by joining the centers of K1,m and K1,n
with an edge) has no (a, 3)-edge-antimagic total labeling.
Sugeng and Miller [3083] show how to manipulate adjacency matrices of graphs with
(a, d)-edge-antimagic vertex labelings and super (a, d)-edge-antimagic total labelings to
obtain new (a, d)-edge-antimagic vertex labelings and super (a, d)-edge-antimagic total
labelings. Among their results are: every graph can be embedded in a connected (a, d)-
edge-antimagic vertex graph; every (a, d)-edge-antimagic vertex graph has a proper (a, d)-
edge-antimagic vertex subgraph; if a graph has a (a, 1)-edge-antimagic vertex labeling and
an odd number of edges, then it has a super (a, 1)-edge-antimagic total labeling; every
super edge magic total graph has an (a, 1)-edge-antimagic vertex labeling; and every graph
can be embedded in a connected super (a, d)-edge-antimagic total graph.
Rahmawati, Sugeng, Silaban, Miller, and Bača [2550] construct new larger (a, d)-
edge-antimagic vertex graphs from an existing (a, d)-edge-antimagic vertex graph using
adjacency matrix for difference d = 1, 2. The results are extended for super (a, d)-edge-
antimagic total graphs with differences d = 0, 1, 2, 3.
Ajitha, Arumugan, and Germina [161] show that (p, p−1) graphs with α-labelings (see
§3.1) and partite sets with sizes that differ by at most 1 have super (a, d)-edge antimagic
total labelings for d = 0, 1, 2 and 3. They also show how to generate large classes of trees
with super (a, d)-edge-antimagic total labelings from smaller graceful trees.
Bača, Lin, Miller, and Ryan [351] define a Möbius grid, Mnm , as the graph with vertex
set {xi,j | i = 1, 2, . . . , m + 1, j = 1, 2, . . . , n} and edge set {xi,j xi,j+1 | i = 1, 2, . . . , m +
1, j = 1, 2, . . . , n − 1} ∪ {xi,j xi+1,j | i = 1, 2, . . . , m, j = 1, 2, . . . , n} ∪ {xi,n xm+2−i,1 | i =
1, 2, . . . , m + 1}. They prove that for n > 2 and m > 4, Mnm has no d-antimagic vertex
labeling with d > 5 and no d-antimagic-edge labeling with d > 9.
Ali, Bača, and Bashir, [150] investigated super (a, d)-vertex-antimagic total labelings
of the disjoint unions of paths. They prove: mP2 has a super (a, d)-vertex-antimagic total
labeling if and only if m is odd and d = 1; mP3 , m > 1, has no super (a, 3)-vertex-
antimagic total labeling; mP3 has a super (a, 2)-vertex-antimagic total labeling for m ≡ 1
(mod 6); and mP4 has a super (a, 2)-vertex-antimagic total labeling for m ≡ 3 (mod 4).
Lee, Tsai, and Lin [1834] denote the subdivision of a star Sn obtained by inserting m

the electronic journal of combinatorics (2023), #DS6 247

 n
vertices into every edge of the star Sn by Sm . They proved that for n > 3, the graph
n
kSm is super (a, d)-edge antimagic total for certain values. In [1283] Ichishima, López,
Muntaner-Batle and Rius-Font proved that if G is tripartite and has a (super) (a, d)-
edge antimagic total labeling, then nG (n > 3) has a (super) (a, d)-edge antimagic total
labeling for d = 1 and for d = 0, 2 when n is odd.
Let p, t1 , t2 , . . . , tk be integers such that 1 6 t1 < t2 < · · · < tk < p. A Toeplitz
graph, denoted by Tp ht1 . . . , tk i, is a graph with vertex set {v1 , v2 , . . . , vp } and edge set
{vi vj : |i − j| ∈ {t1 , t2 , . . . , tk }}. Bača, Bashir, Nadeem, and Shabbir [312] give an
upper bound on the difference d when a Toeplitz graph Tp ht1 , t2 , . . . tk i is super (a, d)-
edge-antimagic total. They also construct a super (a, 1)-edge-antimagic total labeling for
an arbitrary Toeplitz graph without isolated vertices and prove that the Toeplitz graph
Tp ht1 i admits a super (a, 3)-edge-antimagic total labeling. Moreover, when p and t1 satisfy
certain conditions Tp ht1 i also admits a super (a, d)-edge-antimagic total labeling for d = 0
and d = 2. When k = 2 they show the existence of a super (a, 2)-edge-antimagic total
labeling for the Toeplitz graph Tp ht1 , t1 + 1i.
In [178] Amudha, Jayapriya, and Gowri provide an algorithmic encryption method
that employs antimagic labelings of graphs.
Pandimadevi and Subbiah [2330] show the existence and nonexistence of (a, d)-vertex
antimagic total labeling for several class of digraphs and show how to construct labelings
for generalized de Bruijn digraphs.
In [1077] Getzimah and Palani define vertex antimagic total labeling, edge antimagic
total labeling on Zp+q , and discuss these labelings for cycles, stars, complete bipartite
graphs, the subdivision graphs of ladders, and combs. They also investigate totally (a, d)-
edge antimagic graphs, totally super vertex graphs, edge antimagic graphs, and determine
the bounds for the vertices and the edges under total labelings.
The book [363] by Bača and Miller has a wealth of material and open problems on
super edge-antimagic labelings. In [321] Bača, Baskoro, Miller, Ryan, Simanjuntak, and
Sugeng provide detailed survey of results on edge antimagic labelings and include many
conjectures and open problems. In 2015 Nalliah [2255] published a list of open problems
on super (a, d)-edge antimagic total labelings of graphs. In 2017 Brankovic, Jendrol’, Lin,
Phanalasy, Ryan, Semaničová-Feňovčı́ková, Slamin, and Sugeng [314] provided a survey
of recent results on face-antimagic labelings. It was dedicated to the memory of Mirka
Miller, who introducted the concept of face-antimagic labeling of plane graphs in 2003.

In Tables 14, 15, 16 and 17 we use the abbreviations

(a, d)-VAT (a, d)-vertex-antimagic total labeling

(a, d)-SVAT super (a, d)-vertex-antimagic total labeling

(a, d)-EAT (a, d)-edge-antimagic total labeling

(a, d)-SEAT super (a, d)-edge-antimagic total labeling

(a, d)-EAV (a, d)-edge-antimagic vertex labeling

the electronic journal of combinatorics (2023), #DS6 248

 A question mark following an abbreviation indicates that the graph is conjectured to
have the corresponding property. The tables were prepared by Petr Kovář and Tereza
Kovářová and updated by J. Gallian in 2008.

Table 14: Summary of (a, d)-Vertex-Antimagic Total and Super (a, d)-Vertex-
Antimagic Total Labelings

Graph Labeling Notes

Pn (a, d)-VAT wide variety of a and d [323]

Pn (a, d)-SVAT iff d = 3, d = 2, n > 3 odd

or d = 3, n > 3 [3086]

Cn (a, d)-VAT wide variety of a and d [322]

Cn (a, d)-SVAT iff d = 0, 2 and n odd or

d = 1 [3086]

generalized Petersen (a, d)-VAT [324]

graph P (n, k) (a, 1)-VAT n > 3, 1 6 k 6 n/2 [3087]

prisms Cn × P2 (a, d)-VAT [324]

antiprisms (a, d)-VAT [324]

Sn1 ∪ . . . ∪ Snt (a, d)-VAT d = 1, 2, 3, 4, 6 [2343], [2546]

Wn not (a, d)-VAT for n > 20 [1954]

K1,n not (a, d)-SVAT n > 3 [3086]

the electronic journal of combinatorics (2023), #DS6 249

 Table 15: Summary of (a, d)-Edge-Antimagic Total Labelings

Graph Labeling Notes

trees (a, 1)-EAT? [352]

Pn not (a, d)-EAT d > 2 [352]

P2n (6n, 1)-EAT [2958]

(6n + 2, 2)-EAT [2958]

P2n+1 (3n + 4, 2)-EAT [2958]

(3n + 4, 3)-EAT [2958]
(2n + 4, 4)-EAT [2958]
(5n + 4, 2)-EAT [2958]
(3n + 5, 2)-EAT [2958]
(2n + 6, 4)-EAT [2958]

Cn (2n + 2, 1)-EAT [2958]

(3n + 2, 1)-EAT [2958]
not (a, d)-EAT d > 5 [352]

C2n (4n + 2, 2)-EAT [2958]

(4n + 3, 2)-EAT [2958]
(2n + 3, 4)-EAT? [2958]
(2n + 4, 4)-EAT? [2958]

C2n+1 (3n + 4, 3)-EAT [2958]

(3n + 5, 3)-EAT [2958]
(n + 4, 5)-EAT? [2958]
(n + 5, 5)-EAT? [2958]

Kn not (a, d)-EAT d > 5 [352]

Kn,n (a, d)-EAT iff d = 1, n > 2 [353]

caterpillars (a, d)-EAT d 6 3 [3088]

Wn not (a, d)-EAT d > 4 [352]

generalized Petersen not (a, d)-EAT d > 4 [352]

graph P (n, k) ((5n + 5)/2, 2)-EAT n > 3 odd, k = 1, 2 [2288]

super (4n + 2, 1)-EAT n > 3, 1 6 k 6 n/2 [2288]

the electronic journal of combinatorics (2023), #DS6 250

 Table 16: Summary of (a, d)-Edge-Antimagic Vertex Labelings

Graph Labeling Notes

Pn (3, 2)-EAV [2958]
not (a, d)-EAV d > 2 [2958]

P2n (n + 2, 1)-EAV [2958]

Cn not (a, d)-EAV d > 1 [352]

C2n not (a, d)-EAV [2958]

C2n+1 (n + 2, 1)-EAV [2958]

(n + 3, 1)-EAV [2958]

Kn not (a, d)-EAV for n > 1 [352]

Kn,n not (a, d)-EAV for n > 3 [352]

Wn not (a, d)-EAV [352]

(n)
C3 (friendship graph) (a, 1)-EAV iff n = 1, 3, 4, 5, 7 [353]

generalized Petersen not (a, d)-EAV d > 1 [352]

graph P (n, k)

the electronic journal of combinatorics (2023), #DS6 251

 Table 17: Summary of (a, d)-Super-Edge-Antimagic Total Labelings

Graph Labeling Notes

Cn K1 (a, d)-SEAT variety of cases [302], [379]

Pn × P2 (ladders) (a, d)-SEAT n odd, d 6 2 [3085]

n even, d = 1 [3085]
(a, d)-SEAT? d = 0, 2, n even [3085]

C n × P2 (a, d)-SEAT iff d 6 3 n odd [3085]

or d = 1, n > 4 even [3085]

C m × Pn (a, d)-SEAT? m > 4 even,

n > 3, d = 0, 2 [3085]

caterpillars (a, 1)-SEAT [3088]

(n)
C3 (friendship graphs) (a, d)-SEAT d = 0, 1, 2 [353]

Fn (n > 2) (fans) (a, d) SEAT only if d < 3 [353]

(a, d)-SEAT 2 6 n 6 6, d = 0, 1, 2 [353]

Wn (a, d)-SEAT iff d = 1, n 6≡ 1 (mod 4) [353]

Kn (n > 3) (a, d) SEAT iff d = 0, n = 3 [353]

d = 1, n > 3 [353]
d = 2, n = 3 [353]

trees (a, d)-SEAT only if d 6 3 [354]

Pn (n > 1) (a, d)-SEAT iff d 6 3 [354]

mKn (a, d)-SEAT iff d ∈ {0, 2}, n ∈ {2, 3},

m > 3 odd [310]
d = 1, m, n > 2 [310]
d = 3 or 5,n = 2, m > 2 [310]
d = 4, n = 2, m > 3 odd [310]

Cn (a, d)-SEAT iff d = 0 or 2, n odd [354]

d = 1 [322]
P (m, n) (a, d)-SEAT many cases [322]

the electronic journal of combinatorics (2023), #DS6 252

6.4 Face Antimagic Labelings and d-antimagic Labeling of Type (1,1,1)
Bača [304] defines a connected plane graph G with edge set E and face set F to be (a, d)-
face antimagic if there exist positive integers a and d and a bijection g : E → {1, 2, . . . , |E|}
such that the induced mapping ψg : F → {a, a + d, . . . , a + (|F (G)| − 1)d}, where for a
face f, ψg (f ) is the sum of all g(e) for all edges e surrounding f is also a bijection. In
[306] Bača proves that for n even and at least 4, the prism Cn × P2 is (6n + 3, 2)-face
antimagic and (4n + 4, 4)-face antimagic. He also conjectures that Cn × P2 is (2n + 5, 6)-
face antimagic. In [349] Bača, Lin, and Miller investigate (a, d)-face antimagic labelings of
the convex polytopes Pm+1 × Cn . They show that if these graphs are (a, d)-face antimagic
then either d = 2 and a = 3n(m + 1) + 3, or d = 4 and a = 2n(m + 1) + 4, or d = 6 and
a = n(m + 1) + 5. They also prove that if n is even, n > 4 and m ≡ 1 (mod 4), m > 3,
then Pm+1 × Cn has a (3n(m + 1) + 3, 2)-face antimagic labeling and if n is at least 4 and
even and m is at least 3 and odd, or if n ≡ 2 (mod 4), n > 6 and m is even, m > 4,
then Pm+1 × Cn has a (3n(m + 1) + 3, 2)-face antimagic labeling and a (2n(m + 1) + 4, 4)-
face antimagic labeling. They conjecture that Pm+1 × Cn has (3n(m + 1) + 3, 2)- and
(2n(m + 1) + 4, 4)-face antimagic labelings when m ≡ 0 (mod 4), n > 4, and for m even
and m > 4, that Pm+1 × Cn has a (n(m + 1) + 5, 6)-face antimagic labeling when n is even
and at least 4. Bača, Baskoro, Jendroľ, and Miller [318] proved that graphs in the shape
of hexagonal honeycombs with m rows, n columns, and mn 6-sided faces have d-antimagic
labelings of type (1, 1, 1) for d = 1, 2, 3, and 4 when n odd and mn > 1.
In [361] Bača and Miller define the class Qm n of convex polytopes with vertex set
{yj,i : i = 1, 2, . . . , n; j = 1, 2, . . . , m + 1} and edge set {yj,i yj,i+1 : i = 1, 2, . . . , n; j =
1, 2, . . . , m + 1} ∪ {yj,i yj+1,i : i = 1, 2, . . . , n; j = 1, 2, . . . , m} ∪ {yj,i+1 yj+1,i : 1 +
1, 2, . . . , n; j = 1, 2, . . . , m, j odd} ∪ {yj,i yj+1,i+1 : i = 1, 2, . . . , n; j = 1, 2, . . . , m, j even}
where yj,n+1 = yj,1 . They prove that for m odd, m > 3, n > 3, Qm n is (7n(m + 1)/2 + 2, 1)-
m
face antimagic and when m and n are even, m > 4, n > 4, Qn is (7n(m + 1)/2 + 2, 1)-face
antimagic. They conjecture that when n is odd, n > 3, and m is even, then Qm n is
((5n(m + 1) + 5)/2, 2)−face antimagic and ((n(m + 1) + 7)/2, 4)-face antimagic. They
further conjecture that when n is even, n > 4, m > 1 or n is odd, n > 3 and m is odd,
m > 1, then Qm n is (3n(m + 1)/2 + 3, 3)-face antimagic. In [308] Bača proves that for
the case m = 1 and n > 3 the only possibilities for (a, d)-antimagic labelings for Qm n are
(7n + 2, 1) and (3n + 3, 3). He provides the labelings for the first case and conjectures that
they exist for the second case. Bača [304] and Bača and Miller [360] describe (a, d)-face
antimagic labelings for a certain classes of convex polytopes.
In [317] Bača et al. provide a detailed survey of results on face antimagic labelings
and include many conjectures and open problems.
For a plane graph G, Bača and Miller [362] call a bijection h from V (G)∪E(G)∪F (G)
to {1, 2, . . . , |V (G)| + |E(G)| ∪ |F (G)|} a d-antimagic labeling of type (1, 1, 1) if for every
number s the set of s-sided face weights is Ws = {as , as + d, as + 2d, . . . , as + (fs − 1)d} for
some integers as and d, where fs is the number of s-sided faces (Ws varies with s). They
show that the prisms Cn × P2 (n > 3) have a 1-antimagic labeling of type (1, 1, 1) and
that for n ≡ 3 (mod 4), Cn × P2 have a d-antimagic labeling of type (1, 1, 1) for d = 2, 3, 4,
and 6. They conjecture that for all n > 3, Cn × P2 has a d-antimagic labeling of type

the electronic journal of combinatorics (2023), #DS6 253

(1, 1, 1) for d = 2, 3, 4, 5, and 6. This conjecture has been proved for the case d = 3 and
n 6= 4 by Bača, Miller, and Ryan [368] (the case d = 3 and n = 4 is open). The cases
for d = 2, 4, 5, and 6 were done by Lin, Slamin, Bača, and Miller [1955]. Bača, Lin, and
Miller [350] prove: for m, n > 8, Pm × Pn has no d-antimagic edge labeling of type (1, 1, 1)
with d > 9; for m > 2, n > 2, and (m, n) 6= (2, 2), Pm × Pn has d-antimagic labelings of
type (1, 1, 1) for d = 1, 2, 3, 4, and 6. They conjecture the same is true for d = 5. Butt,
Numan, Shah, and Ali [634] prove that the generalized prims Cn × Pm have d-antimagic
face labelings of type (1,1,1) for n > 5 and m > 2.
Bača, Miller, and Ryan [368] also prove that for n > 4 the antiprism (see §6.1 for the
definition) on 2n vertices has a d-antimagic labeling of type (1, 1, 1) for d = 1, 2, and 4.
They conjecture the result holds for d = 3, 5, and 6 as well. Lin, Ahmad, Miller, Sugeng,
and Bača [1952] did the cases that d = 7 for n > 3 and d = 12 for n > 11. Sugeng, Miller,
Lin, and Bača [3087] did the cases: d = 7, 8, 9, 10 for n > 5; d = 15 for n > 6; d = 18 for
n > 7; d = 12, 14, 17, 20, 21, 24, 27, 30, 36 for n odd and n > 7; and d = 16, 26 for n odd
and n > 9.
Baca, Numan, and Semaničová-Feňovčı́ková [376] investigated the problem of labeling
the vertices, edges, and faces of a disjoint union of r copies Cn × Pm by the consecutive
integers starting from 1 in such a way that the sum of the labels of a face and the
labels of vertices and edges surrounding that face for all s-sided faces form an arithmetic
progression with common difference d.
Ali, Bača, Bashir, and Semaničová-Feňovčı́ková [152] investigated antimagic labelings
for disjoint unions of prisms and cycles. They prove: for m > 2 and n > 3, m(Cn × P2 )
has no super d-antimagic labeling of type (1, 1, 1) with d > 30; for m > 2 and n >
3, n 6= 4, m(Cn × P2 ) has super d-antimagic labeling of type (1, 1, 1) for d = 0, 1, 2, 3, 4,
and 5; and for m > 2 and n > 3, mCn has (m(n + 1) + 3, 3)- and (2mn + 2, 2)-vertex-
antimagic total labeling. Bača and Bashir [311] proved that for m > 2 and n > 3, n 6=
4, m(Cn × P2 ) has super 7-antimagic labeling of type (1, 1, 1) and for n > 3, n 6= 4 and
2 6 m 6 2n m(Cn × P2 ) has super 6-antimagic labeling of type (1, 1, 1).
Bača, Numan and Siddiqui [378] investigated the existence of the super d-antimagic
labeling of type (1, 1, 1) for the disjoint union of m copies of antiprism mAn . They
proved that for m > 2, n > 4, mAn has super d-antimagic labelings of type (1, 1, 1) for
d = 1, 2, 3, 5, 6. Ahmad, Bača, Lascsáková, and Semaničová-Feňovčı́ková [93] investigated
super d-antimagicness of type (1, 1, 0) for mG in a more general sense. They prove: if
there exists a super 0-antimagic labeling of type (1, 1, 0) of a plane graph G then, for
every positive integer m, the graph mG also admits a super 0-antimagic labeling of type
(1, 1, 0); if a plane graph G with 3-sided inner faces admits a super d-antimagic labeling
of type (1, 1, 0) for d = 0, 6 then, for every positive integer m, the graph mG also admits
a super d-antimagic labeling of type (1, 1, 0); if a plane graph G with 3-sided inner faces is
a tripartite graph with a super d-antimagic labeling of type (1, 1, 0) for d = 2, 4 then, for
every positive integer m, the graph mG also admits a super d-antimagic labeling of type
(1, 1, 0); if a plane graph G with 4-sided inner faces admits a super d-antimagic labeling of
type (1, 1, 0) for d = 0, 4, 8 then the disjoint union of arbitrary number of copies of G also
admits a super d-antimagic labeling of type (1, 1, 0); if a plane graph G with k-sided inner

the electronic journal of combinatorics (2023), #DS6 254

faces, k > 3, admits a super d-antimagic labeling of type (1, 1, 0) for d = 0, 2k then, for
every positive integer m, the graph mG also admits a super d-antimagic labeling of type
(1, 1, 0); if a plane graph G with k-sided inner faces admits a super k-antimagic labeling
of type (1, 1, 0) for k even then, for every positive integer m, the graph mG also admits
a super k-antimagic labeling of type (1, 1, 0).
Bača, Jendraľ, Miller, and Ryan [340] prove: for n even, n > 6, the generalized
Petersen graph P (n, 2) has a 1-antimagic labeling of type (1, 1, 1); for n even, n > 6, n 6=
10, and d = 2 or 3, P (n, 2) has a d-antimagic labeling of type (1, 1, 1); and for n ≡ 0
(mod 4), n > 8 and d = 6 or 9, P (n, 2) has a d-antimagic labeling of type (1, 1, 1). They
conjecture that there is an d-antimagic labeling of type (1,1,1) for P (n, 2) when n ≡ 2
(mod 4), n > 6, and d = 6 or 9.
In [327] Bača, Brankovic, and A. Semaničová-Feňovčikovǎ provide super d-antimagic
labelings of type (1,1,1) for friendship graphs Fn (n > 2) and several other families of
planar graphs.
Bača, Brankovic, Lascsáková, Phanalasy, and Semaničová-Feňovčı́ková [326] provided
super d-antimagic labeling of type (1, 1, 0) for friendship graphs Fn , n > 2, for d ∈
{1, 3, 5, 7, 9, 11, 13}. Moreover, they show that for n ≡ 1 (mod 2) the graph Fn also
admits a super d-antimagic labeling of type (1, 1, 0) for d ∈ {0, 2, 4, 6, 8, 10}.
Bača, Baskoro, and Miller [319] have proved that hexagonal planar honeycomb graphs
with an even number of columns have 2-antimagic and 4-antimagic labelings of type
(1, 1, 1). They conjecture that these honeycombs also have d-antimagic labelings of type
(1, 1, 1) for d = 3 and 5. They pose the odd number of columns case for 1 6 d 6 5 as
an open problem. Bača, Baskoro, and Miller [320] give d-antimagic labelings of a special
class of plane graphs with 3-sided internal faces for d = 0, 2, and 4. Bača, Lin, Miller,
and Ryan [351] prove for odd n > 3, m > 1 and d = 0, 1, 2 or 4, the Möbius grid Mnm has
an d-antimagic labeling of type (1, 1, 1). Siddiqui, Numan, and Umar [2954] examined
the existence of super d-antimagic labelings of type (1,1,1) for Jahangir graphs for certain
differences d.
Bača, Numan, and Shabbir [377] studied the existence of super d-antimagic labelings
of type (1, 1, 1) for the toroidal polyhex Hnm . They labeled the edges of a 1-factor by
consecutive integers and then in successive steps they labeled the edges of 2m-cycles
(respectively 2n-cycles) in a 2-factor by consecutive integers. This technique allowed
them to construct super d-antimagic labelings of type (1, 1, 1) for Hnm with d = 1, 3, 5.
They suppose that such labelings exist also for d = 0, 2, 4.
Kathiresan and Ganesan [1670] define a class of plane graphs denoted by Pab (a >
3, b > 2) as the graph obtained by starting with vertices v1 , v2 , . . . , va and for each i =
1, 2 . . . , a − 1 joining vi and vi+1 with b internally disjoint paths of length i + 1. They
prove that Pab has d-antimagic labelings of type (1, 1, 1) for d = 0, 1, 2, 3, 4, and 6. Lin
and Sugen [1956] prove that Pab has a d-antimagic labeling of type (1, 1, 1) for d = 5, 7a −
2, a + 1, a − 3, a − 7, a + 5, a − 4, a + 2, 2a − 3, 2a − 1, a − 1, 3a − 3, a + 3, 2a + 1, 2a + 3, 3a +
1, 4a − 1, 4a − 3, 5a − 3, 3a − 1, 6a − 5, 6a − 7, 7a − 7, and 5a − 5. Similarly, Bača, Baskoro,
and Cholily [316] define a class of plane graphs denoted by Cab as the graph obtained by
starting with vertices v1 , v2 , . . . , va and for each i = 1, 2 . . . , a joining vi and vi+1 with b

the electronic journal of combinatorics (2023), #DS6 255

internally disjoint paths of length i + 1 (subscripts are taken modulo a). In [316] and [315]
they prove that for a > 3 and b > 2, Cab has a d-antimagic labeling of type (1, 1, 1) for
d = 0, 1, 2, 3, a + 1, a − 1, a + 2, and a − 2.
In [328] Bača, Brankovic, and Semaničová-Feňovčikovǎ investigated the existence of
super d-antimagic labelings of type (1,1,1) for plane graphs containing a special kind
of Hamilton path. They proved: if there exists a Hamilton path in a plane graph G
such that for every face except the external face, the Hamilton path contains all but
one of the edges surrounding that face, then G is super d-antimagic of type (1,1,1) for
d = 0, 1, 2, 3, 5; if there exists a Hamilton path in a plane graph G such that for every face
except the external face, the Hamilton path contains all but one of the edges surrounding
that face and if 2(|F (G)| − 1) 6 |V (G)|, then G is super d-antimagic of type (1, 1, 1) for
d = 0, 1, 2, 3, 4, 5, 6; if G is a plane graph with M = b |F|V(G)|−1
(G)|
c and a Hamilton path such
that for every face, except the external face, the Hamilton path contains all but one of the
edges surrounding that face, then for M = 1, G admits a super d-antimagic labeling of
type (1,1,1) for d = 0, 1, 2, 3, 5; and for M > 2, G admits a super d-antimagic labeling of
type (1,1,1) for d = 0, 1, 2, 3, . . . , M + 4. They also proved that Pn × P2 (n > 3) admits a
super d-antimagic labeling of type (1,1,1) for d ∈ {0, 1, 2, . . . , 15} and the graph obtained
from Pn ×Pm (n > 2) by adding a new edge in every 4-sided face such that the added edges
are “parallel” admits a super d-antimagic labeling of type (1,1,1) for d ∈ {0, 1, 2, . . . , 9}.
In [1320] Imran, Siddiqui, and Numan examine the existence of super d-antimagic
labelings of type (1,1,1) for uniform subdivision of wheel for certain differences d.

In the following tables we use the abbreviations

(a, d)-FA (a, d)-face antimagic labeling

d-AT(1,1,1) d-antimagic labeling of type (1, 1, 1).

A question mark following an abbreviation indicates that the graph is conjectured to

have the corresponding property. The tables were prepared by Petr Kovář and Tereza
Kovářová and updated by J. Gallian in 2008.

the electronic journal of combinatorics (2023), #DS6 256

 Table 18: Summary of Face Antimagic Labelings

Graph Labeling Notes

Qn (see §6.4) (7n(m + 1)/2 + 2, 1)-FA
m
m > 3, n > 3, m odd [361]
(7n(m + 1)/2 + 2, 1)-FA m > 4, n > 4, m, n even [361]
((5n(m + 1) + 5)/2, 2)-FA? m > 2, n > 3, m even, n odd [361]
((n(m + 1) + 7)/2, 4)-FA? m > 2, n > 3, m even, n odd [361]
(3n(m + 1)/2 + 3, 3)-FA? m > 1, n > 4, n even [361]
(3n(m + 1)/2 + 3, 3)-FA? m > 1, n > 3, m odd, n odd [361]

C n × P2 (6n + 3, 2)-FA n > 4, n even [306]

(4n + 4, 4)-FA n > 4, n even [306]
(2n + 5, 6)-FA? [306]

Pm+1 × Cn (3n(m + 1) + 3, 2)-FA n > 4, n even and [349]

m > 3, m ≡ 1 (mod 4),
(3n(m + 1) + 3, 2)-FA and n > 4, n even and [349]
(2n(m + 1) + 4, 4)-FA m > 3, m odd [349],
or n > 6, n ≡ 2 (mod 4) and
m > 4, m even
(3n(m + 1) + 3, 2)-FA? m > 4, n > 4, m ≡ 0 (mod 4) [349]
(2n(m + 1) + 4, 4)-FA? m > 4, n > 4, m ≡ 0 (mod 4) [349]
(n(m + 1) + 5, 6)-FA? n > 4, n even [349]

Table 19: Summary of d-antimagic Labelings of

Type (1,1,1)

Graph Labeling Notes

Pm × Pn not d-AT(1,1,1) m, n, d > 9, [350]

Pm × Pn d-AT(1,1,1) d = 1, 2, 3, 4, 6;
m, n > 2, (m, n) 6= (2, 2) [350]

Pm × Pn 5-AT(1,1,1) m, n > 2, (m, n) 6= (2, 2) [350]

Cn × P 2 1-AT(1,1,1) [362]
d-AT(1,1,1) d = 2, 3, 4 and 6 [362]
for n ≡ 3 (mod 4)
d-AT(1,1,1) d = 2, 4, 5, 6 for n > 3 [1955]
d-AT(1,1,1) d = 3 for n > 5 [368]
Continued on next page

the electronic journal of combinatorics (2023), #DS6 257

 Table 19 – Continued from previous page
Graph Labeling Notes

Pm × Pn 5-AT(1,1,1)? [1955]
not d-AT m, n > 8, d > 9 [1955]

antiprism on 2n d-AT(1,1,1) d = 1, 2 and 4 for n > 4 [368]

vertices d-AT(1,1,1)? d = 3, 5 and 6 for n > 4 [368]

Mnm (Möbius grids) d-AT(1,1,1) n > 3 odd, d = 0, 1, 2, 4 [351]

d = 7, n > 3 [1952]
d = 12, n > 11 [1952]
d = 7, 8, 9, 10, n > 5 [3087]
d = 15, n > 6 [3087]
d = 18 n > 7 [3087]

P (n, 2) d-AT(1,1,1) d = 1; d = 2, 3, n > 6,

n 6= 10 [340]

P (4n, 2) d-AT(1,1,1) d = 6, 9, n > 2, n 6= 10 [340]

P (4n + 2, 2) d-AT(1,1,1)? d = 6, 9, n > 1, n 6= 10 [340]

honeycomb graphs d-AT(1,1,1) d = 2, 4 [319]

with even number d-AT(1,1,1)? d = 3, 5 [319]
of columns

Cn × P 2 d-AT(1,1,1) d = 1, 2, 4, 5, 6 [1955], [362]

Cn × P 2 3-AT(1,1,1) n 6= 4 [368]

6.5 Product Antimagic Labelings

Figueroa-Centeno, Ichishima, and Muntaner-Batle [931] have introduced multiplicative
analogs of magic and antimagic labelings. They define a graph G of size q to be product
magic if there is a labeling from E(G) onto {1, 2, . . . , q} such that, at each vertex v, the
product of the labels on the edges incident with v is the same. They call a graph G of
size q product antimagic if there is a labeling f from E(G) onto {1, 2, . . . , q} such that the
products of the labels on the edges incident at each vertex v are distinct. They prove: a
graph of size q is product magic if and only if q 6 1 (that is, if and only if it is K2 , Kn or
K2 ∪ Kn ); Pn (n > 4) is product antimagic; every 2-regular graph is product antimagic;

the electronic journal of combinatorics (2023), #DS6 258

and, if G is product antimagic, then so are G + K1 and G K n . They conjecture that
a connected graph of size q is product antimagic if and only if q > 3. Kaplan, Lev, and
Roditty [1651] proved the following graphs are product antimagic: the disjoint union of
cycles and paths where each path has least three edges; connected graphs with n vertices
and m edges where m > 4nln n; graphs G = (V, E) where p each component has at least
two edges and the minimum degree of G is at least 8 ln |E| ln (ln |E|); all complete
k-partite graphs except K2 and K1,2 ; and G H where G has no isolated vertices and
H is regular. Wang and Gao [3429] show that caterpillars with at least three edges are
product antimagic by an O(m log m) algorithm.
In [2399] Pikhurko characterizes all large graphs that are product antimagic graphs.
More precisely, it is shown that there is an n0 such that a graph with n > n0 vertices is
product antimagic if and only if it does not belong to any of the following four classes:
graphs that have at least one isolated edge; graphs that have at least two isolated vertices;
unions of vertex-disjoint of copies of K1,2 ; graphs consisting of one isolated vertex; and
graphs obtained by subdividing some edges of the star K1,k+l .
In [931] Figueroa-Centeno, Ichishima, and Muntaner-Batle also define a graph G with
p vertices and q edges to be product edge-magic if there is a labeling f from V (G) ∪ E(G)
onto {1, 2, . . . , p + q} such that f (u) · f (v) · f (uv) is a constant for all edges uv and product
edge-antimagic if there is a labeling f from V (G) ∪ E(G) onto {1, 2, . . . , p + q} such that
for all edges uv the products f (u)·f (v)·f (uv) are distinct. They prove K2 ∪K n is product
edge-magic, a graph of size q without isolated vertices is product edge-magic if and only
if q 6 1 and every graph other than K2 and K2 ∪ K n is product edge-antimagic.

the electronic journal of combinatorics (2023), #DS6 259

7 Miscellaneous Labelings
7.1 Sum Graphs
In 1990, Harary [1183] introduced the notion of a sum graph. A graph G(V, E) is called a
sum graph if there is an bijection f from V to a set of positive integers S such that xy ∈ E
if and only if f (x) + f (y) ∈ S. Since the vertex with the highest label in a sum graph
cannot be adjacent to any other vertex, every sum graph must contain isolated vertices.
In 1991 Harary, Hentzel, and Jacobs [1185] defined a real sum graph in an analogous way
by allowing S to be any finite set of positive real numbers. However, they proved that
every real sum graph is a sum graph. Bergstrand, Hodges, Jennings, Kuklinski, Wiener,
and Harary [540] defined a product graph analogous to a sum graph except that 1 is not
permitted to belong to S. They proved that every product graph is a sum graph and vice
versa.
For a connected graph G, let σ(G), the sum number of G, denote the minimum number
of isolated vertices that must be added to G so that the resulting graph is a sum graph
(some authors use s(G) for the sum number of G). A labeling that makes G together
with σ(G) isolated points a sum graph is called an optimal sum graph labeling. Ellingham
[869] proved the conjecture of Harary [1183] that σ(T ) = 1 for every tree T 6= K1 . Smyth
[3009] proved that there is no graph G with e edges and σ(G) = 1 when n2 /4 < e 6
n(n − 1)/2. Smyth [3010] conjectures that the disjoint union of graphs with sum number
1 has sum number 1. More generally, Kratochvil, Miller, and Nguyen [1753] conjecture
that σ(G ∪ H) 6 σ(G) + σ(H) − 1. Hao [1177] has shown that if d1 6 d2 6 · · · 6 dn
is the degree sequence of a graph G, then σ(G) > max(di − i) where the maximum is
taken over all i. Bergstand et al. [539] proved that σ(Kn ) = 2n − 3. Hartsfield and
Smyth [1192] claimed to have proved that σ(Km,n ) = d3m + n − 3e/2 when n > m but
Yan and Liu [3512] found counterexamples to this assertion when m 6= n. Pyatkin [2535],
Liaw, Kuo, and Chang [1946], Wang, and Liu [3455], and He, Shen, Wang, Chang, Kang,
and Yu [1201] have shown that for 2 6 m 6 n, σ(Km,n ) = d np + (p+1)(m−1) 2
e where
q
2n (p−1)p(m−1) (p+1)p(m−1)
p = d m−1 + 14 − 21 e is the unique integer such that 2
<n6 2
.
n
Miller, Ryan, Slamin, and Smyth [2150] proved that σ(Wn ) = 2 + 2 for n even and
σ(Wn ) = n for n > 5 and n odd (see also [3168]). Miller, Ryan, and Smyth [2152] prove
that the complete n-partite graph on n sets of 2 nonadjacent vertices has sum number
4n − 5 and obtain upper and lower bounds on the complete n-partite graph on n sets
of m nonadjacent vertices. Fernau, Ryan, and Sugeng [927] proved that the generalized
(t)
friendship graphs Cn (see §2.2) has sum number 2 except for C4 . Gould and Rödl [1141]
investigated bounds on the number of isolated points in a sum graph. A group of six
undergraduate students [1129] proved that σ(Kn − edge) 6 2n − 4. The same group of
six students also investigated the difference between the largest and smallest labels in a
sum graph, which they called the spum. They proved spum of Kn is 4n − 6 and the spum
of Cn is at most 4n − 10. Kratochvil, Miller, and Nguyen [1753] have proved that every
sum graph on n vertices has a sum labeling such that every label is at most 4n . Konečný,
Kučera, Novotná, Pekárek, Šimsa, and Töpfer [1727] showed that if one allows for non-

the electronic journal of combinatorics (2023), #DS6 260

injective labelings or graphs with loops then there are sum graphs without a minimal
sum labeling, which partially answers the question posed by Miller, Ryan and Smyth in
[2152]. At a conference in 2000 Miller [2138] posed the following two problems: Given
any graph G, does there exist an optimal sum graph labeling that uses the label 1; Find
a class of graphs G that have sum number of the order |V (G)|s for s > 1. (Such graphs
were shown to exist for s = 2 by Gould and Rödl in [1141]). Fernau and Gajjar [924] [924] new
provided a complete characterization of the sum number of graphs of maximum degree
two. As an immediate corollary they have that all graphs that are the disjoint unions of
paths and cycles are sum labeled graphs.
Elizeche and Tripathi [3228] characterized sum and integral sum labelings of complete
graphs, symmetric complete bipartite graphs, star graphs, and deduced the spum, integral
spum, and integral radius for these classes of graphs.
In [2995] Slamet, Sugeng, and Miller show how one can use sum graph labelings
to distribute secret information to set of people so that only authorized subsets can
reconstruct the secret.
Chang [673] generalized the notion of sum graph by permitting x = y in the definition
of sum graph. He calls graphs that have this kind of labeling strong sum graphs and uses
i∗ (G) to denote the minimum positive integer m such that G∪mK1 is a strong sum graph.
Chang proves that i∗ (Kn ) = σ(Kn ) for n = 2, 3, and 4 and i∗ (Kn ) > σ(Kn ) for n > 5. He
further shows that for n > 5, 3nlog2 3 > i∗ (Kn ) > 12bn/5c − 3.
In [924] Fernau and Gajjar initiate the study of sum graphs from the viewpoint of [924] new
computational complexity. They show that every n-vertex, m-edge, d-degenerate graph
(a graph is d-degenerate if all its subgraphs have a vertex of degree at most d) can be made
a sum graph by adding at most m isolated vertices to it, such that the largest numbers
used as vertex labels grows as Θ(n2 d). As a consequence, we have that such a graph can
be stored using Θ(m log n) bits of memory. The previously best known upper bound on
the numbers needed for labeling general graphs with the minimum number of isolated
vertices was Θ(4n), due to Kratochvı́l, Miller and Nguyen [1753] in 2001. Moreover,
Fernau and Gajjar’s labeling can be constructed in polynomial time. Their results show
the ever-expanding database that is gradually built up can be efficiently implemented and
then accessed using their sum-labeling scheme.
In 1994 Harary [1184] generalized sum graphs by permitting S to be any set of integers.
He calls these graphs integral sum graphs. Unlike sum graphs, integral sum graphs need
not have isolated vertices. Sharary [2867] has shown that Cn and Wn are integral sum
graphs for all n 6= 4. Chen [695] proved that trees obtained from a star by extending each
edge to a path and trees all of whose vertices of degree not 2 are at least distance 4 apart
are integral sum graphs. He conjectures that all trees are integral sum graphs. In [695]
and [697] Chen gives methods for constructing new connected integral sum graphs from
given integral sum graphs by identifying vertices. Chen [697] has shown that every graph
is an induced subgraph of a connected integral sum graph. Chen [697] calls a vertex of a
graph saturated if it is adjacent to every other vertex of the graph. He proves that every
integral sum graph except K3 has at most two saturated vertices and gives the exact
structure of all integral sum graphs that have exactly two saturated vertices. Chen [697]

the electronic journal of combinatorics (2023), #DS6 261

also proves that a connected integral sum graph with p > 1 vertices and q edges and no
saturated vertices satisfies q 6 p(3p − 2)/8 − 2. Wu, Mao, and Le [3486] proved that mPn
are integral sum graphs. They also show that the conjecture of Harary [1184] that the
sum number of Cn equals the integral sum number of Cn if and only if n 6= 3 or 5 is false
and that for n 6= 4 or 6 the integral sum number of Cn is at most 1. Vilfred and Nicholas
[3385] prove that graphs G of order n with ∆(G) = n − 1 and |V∆ (G)| > 2 are not integral
sum graphs, except K3 , and that integral sum graphs G of order n with ∆(G) = n − 1 and
|V∆ (G)| = 2 exist and are unique up to isomorphism. Chen [699] proved that if G(V, E) is
an integral sum other than K3 that has vertex of degree |V | − 1, then the edge-chromatic
number of G is |V | − 1.
In 2021 Singla, Tiwari, and Tripathi [2965] were the first to investigated the spum and
integral spum (denoted ispum(G). They provided results on complete graphs, symmetric
complete bipartite graphs, star graphs, cycles, and paths and gave sharp lower bounds for
the spum and the integral spum of connected graphs. Shortly after that paper appeared,
Li [1925] used some of the techniques in [2965], as well as his own, to correct multiple
errors and improve many results in [2965]. The paper by Singla, Tiwari, and Tripathi and
the one by Li open up new areas for research.
Following are some of the corrected and improved results. For 3 6 n 6 6, spum(Pn ) =
2n−3, and for n > 7, 2n−2 6 spum(Pn ) 6 2n+1 if n is odd, and 2n−2 6 spum(Pn ) 6
2n − 1 if n is even. Li conjectures that for n > 8, we have spum(Pn ) = 2n + 1 if n is odd
and spum(Pn ) = 2n − 1 if n is even. He verified the conjecture for n up to 15. In [2965]
Singla, Tiwari, and Tripathi gave a flawed proof that spum(Cn ) = 2n − 1 for all n > 13.
Li [1925] proved spum(C3 ) = 6 and spum(Cn ) = 2n − 1 for n > 4.
Li [1925] improved the previous best upper bounds given for ispum(Cn ) in [2132] as
follows. For n > 12, we have ispum(Cn ) 6 8(n − 9) if n is odd and 23 (3n − 14) if n is even.
In 1990 Harary [1183] showed that ζ(nK2 ) = 0 for all positive integers n, but Li is the
first to investigate the spum and ispum of nK2 . He proved that for all positive integers
n σ(nK2 ) = 1, spum(nK2 ) = 4n − 2, and ispum(2K2 ) = 4 and ispum(nK2 ) = 4n − 3 for
n 6= 2.
Motivated by the fact that there is no obvious relationship between ispum(G) and
spum(G), due to ζ(G) possibly being strictly smaller than σ(G), i.e., when the inequality
ζ(G) 6 σ(G) is strict, Li introduced the following modification of spum. The sum-
diameter of a graph G, denoted sd(G), is the minimum possible value of range(L) for
a set L of positive integer labels, such that the induced sum graph of L consists of the
disjoint union of G with any number of isolated vertices. The difference between the
definition of sum-diameter and spum is that in spum, one is required to use the minimum
number of additional isolated vertices possible. Similarly, Li defines the integral sum-
diameter of a graph G, denoted isd(G), by allowing the labels to be arbitrary distinct
integers. He notes that sd(G) 6 spum(G), as any set of labels L from the definition
of spum(G), i.e., on n + σ(G) vertices, is a valid labeling for the definition of sd(G).
Similarly, isd(G) 6 sd(G). Noting that any labeling L from the definition of sd(G) is a
valid labeling for the definition of isd(G), yields isd(G) 6 sd(G) for all graphs G.
Li observes that the following stronger result, which was initially stated for spum(G)

the electronic journal of combinatorics (2023), #DS6 262

in [2965] rather than sd(G), follows from the same proof. For graphs G of order n without
any isolated vertices, with maximum and minimum vertex degree ∆ and δ, respectively,
sd(G) > 2n − (∆ − δ) − 2.
Similarly, he noticed that the proof of Theorem 2.2 in [2965] does not use the assump-
tion that exactly ζ(G) isolated vertices are present when bounding ispum(G), and thus
the following strengthening is true. For graphs G of order n without any isolated vertices,
with maximum degree ∆, we have isd(G) > 2n − ∆ − 3.
Li uses the notion of Sidon sets to prove that if G is a graph with n vertices, then
sd(G) 6 64n2 − 64n + 9. Because isd(G) 6 sd(G), we also have that isd(G) 6 64n2 −
64n + 9. To show this upper bound is asymptotically tight, for a graph G with n vertices,
he lets f (n) be the maximum value of sd(G) over all graphs G with n vertices. Then Li
2
proves f (n) > n4 − O(n log n) = Ω(n2 ).
For Kn , Li proves sd(Kn ) = spum(Kn ) = 4n−6 for n > 2 and isd(Kn ) = spum(Kn ) =
4n − 6 for all n > 2 and isd(Kn ) = ispum(Kn ) = n − 1 for n 6 3 and ispum(Kn ) = 4n − 6
when n > 4.
For cycles Li proves: for all n > 4, 2n − 2 6 sd(Cn ) 6 2n − 1 and 2n − 5 6 isd(Cn ) 6
2n − 1.
The current best bounds for ispum(Pn ) are due to Singla, Tiwari, and Tripathi [2965]:
2n − 5 6 ispum(Pn ) 6 25 (n − 3) if n is odd and 2n − 5 6 ispum(Pn ) 6 2n − 3 if n is
even. For the sum-diameter, Li obtains a much tighter result that for n > 3, we have
2n − 3 6 sd(Pn ) 6 2n − 2. An exhaustive computer search yields that sd(Pn ) = 2n − 3
for 3 6 n 6 6 and sd(Pn ) = 2n − 2 for 7 6 n 6 13. This led Li to conjecture that
sd(Pn ) = 2n − 3 for 3 6 n 6 6 and sd(Pn ) = 2n − 2 for n > 7. For isd(Pn ) Li obtains:
2n − 5 6 isd(Pn ) 6 2n − 2 if n is odd and 2n − 5 6 isd(Pn ) 6 2n − 3 if n is even.
Li provides upper bounds on the sum-diameter for the disjoint union of two graphs
and the join of two graphs as follows. For disjoint graphs G1 and G2 with no isolated
vertices sd(G1 ∪ G2 ) 6 10 max{sd(G1 ), sd(G2 )} + sd(G1 ) + sd(G2 ) + 2. If one wishes to
add isolated vertices to a graph G, Li proves that if G is a graph with no isolated vertices,
and Nk is the empty graph on k vertices, then sd(G ∪ Nk ) 6 max{k, 4sd(G)} + k − 5. If
one wishes to add a vertex with arbitrary edges incident to a graph G with no isolated
vertices to form a new graph G0 obtained by adding a vertex to G along with any desired
edges incident to this new vertex, then sd(G0 ) 6 4sd(G) − 1. For two graphs G1 and G2
with no isolated vertices, where without loss of generality sd(G1 ) 6 sd(G2 ), Li proves
sd(G1 + G2 ) 6 8sd(G2 ) + 11sd(G1 ) − 5.
For a subset U of vertices from a graph G(V, E) with no isolated vertices and G[U ]
denoting the subgraph of G consisting of U and all of the edges connecting pairs of vertices
in U , Li proves that sd(G[U ]) 6 2sd(G) − 2. As an open question he asks is: For any
induced subgraph G[U ] of G, is sd(G[U ]) 6 sd(G)? For graphs obtained by deleting an
edge e from a graph G with no isolated vertices (denoted by G \ e) or by contracting an
edge e from G (denoted by G/e), Li proves that sd(G \ e) 6 4sd(G) − 1 and sd(G/e) 6
4sd(G) − 1. For a graph G with no isolated vertices and an edge e = (u, v) between two
vertices u and v of G that is not present in G, Li proves that sd(G + e) 6 4sd(G) − 1.
Li concludes his paper by introducing the generalization of sum-diameter to hyper-

the electronic journal of combinatorics (2023), #DS6 263

graphs, and generalizes his previous general upper and lower bounds to provide prelimi-
nary bounds on both sides for arbitrary k-uniform hypergraphs and with some remarks
on areas for further research and some open questions.
He, Wang, Mi, Shen, and Yu [1199] say that a graph has a tail if the graph contains
a path for which each interior vertex has degree 2 and an end vertex of degree at least 3.
They prove that every tree with a tail of length at least 3 is an integral sum graph.
B. Xu [3499] has shown that the following are integral sum graphs: the union of any
three stars; T ∪K1,n for all trees T ; mK3 for all m; and the union of any number of integral
sum trees. Xu also proved that if 2G and 3G are integral sum graphs, then so is mG for
all m > 1. Xu poses the question as to whether all disconnected forests are integral sum
graphs. Nicholas and Somasundaram [2299] prove that all banana trees (see Section 2.1
for the definition) and the union of any number of stars are integral sum graphs.
Liaw, Kuo, and Chang [1946] proved that all caterpillars are integral sum graphs (see
also [3486] and [3499] for some special cases of caterpillars). This shows that the assertion
by Harary in [1184] that K(1, 3) and S(2, 2) are not integral sum graphs is incorrect. They
also prove that all cycles except C4 are integral sum graphs and they conjecture that every
tree is an integral sum graph. Singh and Santhosh show that the crowns Cn K1 are
integral sum graphs for n > 4 [2978] and that the subdivision graphs of Cn K1 are
integral sum graphs for n > 3 [2714]. Wang, Li, and Wei [3420] proved that there exists
a connected integral sum graph with any minimum degree and give an upper bound for
the relation between the vertex number and the edge number of a connected integral sum
graph with no saturated vertex.
For graphs with n vertices, Tiwari and Tripathi [3218] show that there exist sum
graphs with m edges if and only if m 6 b(n − 12 )/4c and that there exists integral
sum graphs with m edges if and only if m 6 d3(n − 1)2 /8e + b(n − 1)/2c, except for
m = d3(n − 1)2 /8e + b(n − 1)/2c − 1 when n is of the form 4k + 1. They also characterize
sets of positive integers (respectively, integers) that are in bijection with sum graphs
(respectively, integral sum graphs) of maximum size for a given order.
The integral sum number, ζ(G), of G is the minimum number of isolated vertices that
must be added to G so that the resulting graph is an integral sum graph. Thus, by
definition, G is a integral sum graph if and only if ζ(G) = 0. Harary [1184] conjectured
that ζ(Kn ) = 2n − 3 for n > 4. This conjecture was verified by Chen [694], by Sharary
[2867], and by B. Xu [3499]. Yan and Liu proved: ζ(Kn −E(Kr )) = n−1 when n > 6, n ≡
0 (mod 3) and r = 2n/3 − 1 [3513]; ζ(Km.m ) = 2m − 1 for m > 2 [3513]; ζ(Kn \ − edge) =
2n − 4 for n > 4 [3513], [3499]; if n > 5 and n − 3 > r, then ζ(Kn \E(Kr )) > n − 1
[3513]; if d2n/3e − 1 > r > 2, then ζ(Kn \E(Kr )) > 2n − r − 2 [3513]; and if 2 6 m < n,
and n = (i + 1)(im − i + 2)/2, then σ(Km,n ) = ζ(Km,n ) = (m − 1)(i + 1) + 1 while
if (i + 1)(im − i + 2)/2 < n < (i + 2)[(i + 1)m − i + 1]/2, then σ(Km,n ) = ζ(Km,n ) =
d((m−1)(i+1)(i+2)+2n)/(2i+2)e [3513]. Wang [3415] proved that σ(Kn+1 \E(K1,r )) =
ζ(Kn+1 \E(K1,r )) = 2n − 2 when r + 1, 2n − 3 when 2 6 r 6 n − 1, and 2n − 4 when
r = n.
Nagamochi, Miller, and Slamin [2237] have determined upper and lower bounds on
the sum number a graph. For most graphs G(V, E) they show that σ(G) = Ω(|E|). He,

the electronic journal of combinatorics (2023), #DS6 264

Yu, Mi, Sheng, and Wang [1200] investigated ζ(Kn \E(Kr )) where n > 5 and r > 2. They
proved that ζ(Kn \E(Kr )) = 0 when r = n or n − 1;
ζ(Kn \E(Kr )) = n − 2 when r = n − 2; ζ(Kn \E(Kr )) = n − 1 when n − 3 > r >
d2n/3e−1; ζ(Kn \E(Kr )) = 3n−2r−4 when d2n/3e−1 > r > n/2; ζ(Kn \E(Kr )) = 2n−4
when d2n/3e − 1 > n/2 > r > 2. Moreover, they prove that if n > 5, r > 2, and r 6= n − 1,
then σ(Kn \E(Kr )) = ζ(Kn \E(Kr )).
Dou and Gao [851] prove that for n > 3, the fan Fn = Pn + K1 is an integral sum
graph, ρ(F4 ) = 1, ρ(Fn ) = 2 for n 6= 4, and σ(F4 ) = 2, σ(Fn ) = 3 for n = 3 or n > 6 and
n even, and σ(Fn ) = 4 for n > 6 and n odd.
Wang and Gao [3416] and [3417] determined the sum numbers and the integral sum
numbers of the complements of paths, cycles, wheels, and fans as follows: 0 = ζ(P4 ) <
σ(P4 ) = 1; 1 = ζ(P5 ) < σ(P5 ) = 2; 3 = ζ(P6 ) < σ(P6 ) = 4; ζ(Pn ) = σ(Pn ) = 0, n =
1, 2, 3; ζ(Pn ) = σ(Pn ) = 2n − 7, n > 7. ζ(Cn ) = σ(Cn ) = 2n − 7, n > 7. ζ(Wn ) =
σ(Wn ) = 2n − 8, n > 7. 0 = ζ(F5 ) < σ(F5 ) = 1; 2 = ζ(F6 ) < σ(F6 ) = 3; ζ(Fn ) =
σ(Fn ) = 0, n = 3, 4; ζ(Fn ) = σ(Fn ) = 2n − 8, n > 7.
Wang, Yang and Li [3421] proved: ζ(Kn \E(Cn−1 ) = 0 for n =
4, 5, 6, 7; ζ(Kn \E(Cn−1 ) = 2n − 7 for n > 8; σ(K4 \E(Cn−1 ) = 1; σ(K5 \E(Cn−1 ) =
2; σ(K6 \E(Cn−1 ) = 5; σ(K7 \E(Cn−1 ) = 7; σ(Kn \E(Cn−1 ) = 2n − 7 for n > 8.
Wang and Li [3419] proved: a graph with n > 6 vertices and degree greater than
(n + 1)/2 is not an integral sum graph; for n > 8, ζ(Kn \ E(2P3 )) = σ(Kn \ E(2P3 )) =
(Kn \ E(2P3 )) = (Kn \ E(2P3 )) = 2n − 7; for n > 7, ζ(Kn \ E(K2 )) = σ(Kn \ E(K2 )) =
2n − 4; and for n > 7 and 1 6 r 6 d n2 e, ζ(Kn \ E(rK2 )) = σ(Kn \ E(rK2 )) = 2n − 5.
Chen [694] has given some properties of integral sum labelings of graphs G with
∆(G) < |V (G)| − 1 whereas Nicholas, Somasundaram, and Vilfred [2301] provided some
general properties of connected integral sum graphs G with ∆(G) = |V (G)| − 1. They
have shown that connected integral sum graphs G other than K3 with the property that
G has exactly two vertices of maximum degree are unique and that a connected integral
sum graph G other than K3 can have at most two vertices with degree |V (G)| − 1 (see
also [3398]).
Vilfred and Florida [3395] have examined one-point unions of pairs of small complete
graphs. They show that the one-point union of K3 and K2 and the one-point union of
K3 and K3 are integral sum graphs whereas the one-point union of K4 and K2 and the
one-point union of K4 and K3 are not integral sum graphs. In [3396] Vilfred and Florida
defined and investigated properties of maximal integral sum graphs.
Vilfred and Nicholas [3399] have shown that the following graphs are integral sum
graphs: banana trees, the union of any number of stars, fans Pn + K1 (n > 2), Dutch
(m)
windmills K3 , and the graph obtained by starting with any finite number of integral
sum graphs G1 , G2 , . . . , Gn and any collections of n vertices with vi ∈ Gi and creating a
graph by identifying v1 , v2 , . . . , vn . The same authors [3400] also proved that G + v where
G is a union of stars is an integral sum graph.
Melnikov and Pyatkin [2132] have shown that every 2-regular graph except C4 is an
integral sum graph and that for every positive integer r there exists an r-regular integral
sum graph. They also show that the cube is not an integral sum graph. For any integral

the electronic journal of combinatorics (2023), #DS6 265

sum graph G, Melnikov and Pyatkin define the integral radius of G as the smallest natural
number r(G) that has all its vertex labels in the interval [−r(G), r(G)]. For the family
of all integral sum graphs of order n they use r(n) to denote maximum integral radius
among all members of the family. Two questions they raise are: Is there a constant C
such that r(n) 6 Cn and for n > 2, is r(n) equal to the (n − 2)th prime?
The concepts of sum number and integral sum number have been extended to hyper-
graphs. Sonntag and Teichert [3035] prove that every hypertree (i.e., every connected,
non-trivial, cycle-free hypergraph) has sum number 1 provided that a certain cardinality
condition for the number of edges is fulfilled. In [3036] the same authors prove that for
d > 3 every d-uniform hypertree is an integral sum graph and that for n > d + 2 the
sum number of the complete d-uniform hypergraph on n vertices is d(n − d) + 1. They
also prove that the integral sum number for the complete d-uniform hypergraph on n
vertices is 0 when d = n or n − 1 and is between (d − 1)(n − d − 1) and d(n − d) + 1
for d 6 n − 2. They conjecture that for d 6 n − 2 the sum number and the integral
sum number of the complete d-uniform hypergraph are equal. Teichert [3197] proves
that hypercycles have sum number 1 when each edge has cardinality at least 3 and that
hyperwheels have sum number 1 under certain restrictions for the edge cardinalities.
(A hypercycle Cn = (Vn , En ) has Vn = ∪ni=1 {v1i , v2i , . . . , vdi i −1 }, En = {e1 , e2 , . . . , en } with
ei = {v1i , . . . , vdi i = v1i+1 } where i + 1 is taken modulo n. A hyperwheel Wn = (Vn0 , En0 ) has
Vn0 = Vn ∪ {c} ∪ni=1 {v2 n+i , . . . , vdn+i −1 n+i }, En0 = En ∪ {en+1 , . . . , e2n } with en+i = {v1 n+i =
c, v2 n+i , . . . , vdn+i −1 n+i , vdn+i n+i = v1 i }.)
Teichert [3196] determined an upper bound for the sum number of the d-partite com-
plete hypergraph Knd1 ,...,nd . In [3198] Teichert defines the strong hypercycle Cnd to be the
d-uniform hypergraph with the same vertices as Cn where any d consecutive vertices
of Cn form an edge of Cnd . He proves that for n > 2d + 1 > 5, σ(Cnd ) = d and for
d
d > 2, σ(Cd+1 ) = d. He also shows that σ(C53 ) = 3; σ(C63 ) = 2, and he conjectures that
σ(Cnd ) < d for d > 4 and d + 2 6 n 6 2d.
In [2302] Nicholas and Vilfred define the edge reduced sum number of a graph as
the minimum number of edges whose removal from the graph results in a sum graph.
They show that for Kn , n > 3, this number is (n(n − 1)/2 + bn/2c)/2. They ask for
a characterization of graphs for which the edge reduced sum number is the same as its
sum number. They conjecture that an integral sum graph of order p and size q exists if
and only if q 6 3(p2 − 1)/8 − b(p − 1)/4c when p is odd and q 6 3(3p − 2)/8 when p is
even. They also define the edge reduced integral sum number in an analogous way and
conjecture that for Kn this number is (n − 1)(n − 3)/8 + b(n − 1)/4c when n is odd and
n(n − 2)/8 when n is even.
For certain graphs G Vilfred and Florida [3394] investigated the relationships among
σ(G), ζ(G), χ(G), and χ0 (G) where χ(G) is the chromatic number of G and χ0 (G) is the
edge chromatic number of G. They prove: σ(C4 ) = ζ(C4 ) > χ(C4 ) = χ0 (C4 ); for n >
3, ζ(C2n ) < σ(C2n ) = χ(C2n ) = χ0 (C2n ); ζ(C2n+1 ) < σ(C2n+1 ) < χ(C2n+1 ) = χ0 (C2n+1 );
for n > 4, χ0 (Kn ) 6 χ(Kn ) < ζ(Kn ) = σ(Kn ); and for n > 2, χ(Pn ×P2 ) < χ0 (Pn ×P2 ) =
ζ(Pn × P2 ) = σ(Pn × P2 ).
Alon and Scheinermann [168] generalized sum graphs by replacing the condition

the electronic journal of combinatorics (2023), #DS6 266

f (x) + f (y) ∈ S with g(f (x), f (y)) ∈ S where g is an arbitrary symmetric polynomial.
They called a graph with this property a g-graph and proved that for a given symmetric
polynomial g not all graphs are g-graphs. On the other hand, for every symmetric poly-
nomial g and every graph G there is some vertex labeling such that G together with at
most |E(G)| isolated vertices is a g-graph.
Boland, Laskar, Turner, and Domke [595] investigated a modular version of sum
graphs. They call a graph G(V, E) a mod sum graph (MSG) if there exists a positive
integer n and an injective labeling from V to {1, 2, . . . , n − 1} such that xy ∈ E if and
only if (f (x) + f (y)) (mod n) = f (z) for some vertex z. Obviously, all sum graphs are
mod sum graphs. However, not all mod sum graphs are sum graphs. Boland et al. [595]
have shown the following graphs are MSG: all trees on 3 or more vertices; all cycles on
4 or more vertices; and K2,n . They further proved that Kp (p > 2) is not MSG (see also
[1100]) and that W4 is MSG. They conjecture that Wp is MSG for p > 4. This conjecture
was refuted by Sutton, Miller, Ryan, and Slamin [3169] who proved that for n 6= 4, Wn is
not MSG (the case where n is prime had been proved in 1994 by Ghoshal, Laskar, Pillone,
and Fricke [1100]. In the same paper Sutton et al. also showed that for n > 3, Kn,n is
not MSG. Ghoshal, Laskar, Pillone, and Fricke [1100] proved that every connected graph
is an induced subgraph of a connected MSG graph and any graph with n vertices and at
least two vertices of degree n − 1 is not MSG.
In [550] Beste, de Wiljes, and Kreh investigated the sum and mod sum graphs using [550] new
arithmetic progressions and prime numbers and characterized the induced sum graphs
and mod sum graphs.
Sutton, Miller, Ryan, and Slamin [3169] define the mod sum number, ρ(G), of a con-
nected graph G to be the least integer r such that G ∪ Kr is MSG. Recall the cocktail
party graph Hm,n , m, n > 2, as the graph with a vertex set V = {v1 , v2 , . . . , vmn } par-
titioned into n independent sets V = {I1 , I2 , . . . , In } each of size m such that vi vj ∈ E
for all i, j ∈ {1, 2, . . . , mn} where i ∈ Ip , j ∈ Iq , p 6= q. The graphs Hm,n can be used
to model relational database management systems (see [3165]). Sutton and Miller [3167]
prove that Hm,n is not MSG for n > m > 3 and ρ(Kn ) = n for n > 4. In [3166] Sutton,
Draganova, and Miller prove that for n odd and n > 5, ρ(Wn ) = n and when n is even,
ρ(Wn ) = 2. Wang, Zhang, Yu, and Shi [3453] proved that fan Fn (n > 2) are not mod
sum graphs and ρ(Fn ) = 2 for even n at least 6. They also prove that ρ(Kn,n ) = n for
n > 3.
Dou and Gao [852] obtained exact values for ρ(Km,n ) and ρ(Km − E(Kn )) for some
cases of m and n and bounds in the remaining cases. They call a graph G(V, E) a mod
integral sum graph if there exists a positive integer n and an injective labeling from V to
{0, 1, 2, . . . , n − 1} (note that 0 is included) such that xy ∈ E if and only if (f (x) + f (y))
(mod n) = f (z) for some vertex z. They define the mod integral sum number, ψ(G), of
a connected graph G to be the least integer r such that G ∪ Kr is a mod integral sum
graph. They prove that for m + n > 3, ψ(Km,n ) = ρ(Km,n ) and obtained exact values for
ψ(Km − E(Kn )) for some cases of m and n and bounds in the remaining cases.
Wallace [3406] has proved that Km,n is MSG when n is even and n > 2m or when n is
odd and n > 3m − 3 and that ρ(Km,n ) = m when 3 6 m 6 n < 2m. He also proves that

the electronic journal of combinatorics (2023), #DS6 267

the complete m-partite Kn1 ,n2 ,...,nm is not MSG when there exist ni and nj such that ni <
nj < 2ni . He poses the following conjectures: ρ(Km,n ) = n when 3m − 3 > n > m > 3; if
Kn1 ,n2 ,...,nm where n1 > n2 > · · · > nm , is not MSG, then (m − 1)nm 6 ρ(Kn1 ,n2 ,...,nm ) 6
(m − 1)n1 ; if G has n vertices, then ρ(G) 6 n; and determining the mod sum number
of a graph is N P -complete (Sutton has observed that Wallace probably meant to say
‘N P -hard’). Miller [2138] has asked if it is possible for the mod sum number of a graph
G be of the order |V (G)|2 .
In a sum graph G, a vertex w is called a working vertex if there is an edge uv in G
such that w = u + v. If G = H ∪ Hr has a sum labeling such that H has no working vertex
the labeling is called an exclusive sum labeling of H with respect G. The exclusive sum
number, (H), of a graph H is the smallest integer r such that G ∪ Kr has an exclusive
sum labeling. The exclusive sum number is known in the following cases (see [2142] and
[2151]): for n > 3, (Pn ) = 2; for n > 3, (Cn ) = 3; for n > 3, (Kn ) = 2n − 3; for
(n)
n > 4, (Fn ) = n (fan of order n + 1); for n > 4, (Wn ) = n; (C3 ) = 2n (friendship
graph–see §2.2); m > 2, n > 2, (Km,n ) = m + n − 1; for n > 2, Sn = n (star of order
n + 1); (Sm,n ) = max{m, n} (double star); H2,n = 4n − 5 (cocktail party graph); and
(caterpillar G) = ∆(G). Dou [850] showed that Hm,n is not a mod sum graph for m > 3
and n > 3; ρ(Hm,3 ) = m for m > 3; Hm,n ∪ ρ(Hm,n )K1 is exclusive for m > 3 and > 4;
and m(n − 1) 6 ρ(Hm,n ) 6 mn(n − 1)/2 for m > 3 and n > 4. Vilfred and Florida [3397]
proved that (P3 × P3 ) = 4 and (Pn × P2 ) = 3. In [1239] Hegde and Vasudeva provide an
O(n2 ) algorithm that produces an exclusive sum labeling of a graph with n vertices given
its adjacency matrix.
In 2001 Kratochvil, Miller, and Nguyen proved that σ(G ∪ H) 6 σ(G) + σ(H) − 1.
In 2003 Miller, Ryan, Slamin, Sugeng, and Tuga [2147] posed the problem of finding the
exclusive sum number of the disjoint union of graphs. In 2010 Wang and Li [3418] proved
the following. Let G1 and G2 be graphs without isolated vertices, Li be an exclusive sum
labeling of Gi ∪ (Gi )K1 , and Ci be the isolated set of Li for i = 1 and 2. If maxC1 and
minC2 are relatively prime, then (G1 ∪ G2 ) 6 (G1 ) + (G2 ) − 1. Wang and Li also proved
the following: (Kr,s ) = s+r−1; (Kr,s −E(K2 )) = s−1; for s > r > 2, (Kr,s −E(rK2 )) =
s + r − 3. For n > 5 they prove: (Kn − E(Kn )) = 0; (Kn − E(Kn−1 )) = n − 1; for
2 6 r < n/2, (Kn − E(Kr )) = 2n − 4; for n/2 6 r 6 n − 2, (Kn − E(Kr )) = 3n − 2r − 4,
and (Cn K1 ) is 3 or 4. They show that (C3 K1 ) = 3 and guess that for n > 4 the
class Ek of hypergraphs with a k-exclusive sum labeling is hereditary, but nontrivial to
characterise even for k = 1. In [2532] Purcell, Ryan, Ryjááček, and Skyvová provided
a complete description of the minimal forbidden induced subhypergraphs of E1 that are
3-uniform with maximum vertex degree 2. They also show that every hypertree has a
1-exclusive sum labeling and every combinatorial design does not.
A survey of exclusive sum labelings of graphs is given by Ryan in [2660].
If (G) = ∆(G), then G is said to be an ∆-optimum summable graph. An exclusive sum
labeling of a graph G using ∆(G) isolates is called a ∆-optimum exclusive sum labeling
of G. Tuga, Miller, Ryan, and Ryjáček [3232] show that some families of trees that are
∆-optimum summable and some that are not. They prove that if G is a tree that has at
least one vertex that has two or more neighbors that are not leaves then (G) = ∆(G).

the electronic journal of combinatorics (2023), #DS6 268

 Koh, Miller, Smyth, and Wang [1709] show the following: the graphs obtained by
identifying one end of a q-path with a vertex of a p-cycle are 1-optimum summable, and
that two of these graphs can be joined via a new edge to create a 2-optimum summable
graph; generalized θ-graphs are 2-optimum summable; θ(p, q, r) which consists of a pair of
vertices joined by 3 independent paths of lengths p, q and r (with a few small exceptions)
are 2-optimum summable; there exists a 3-optimum summable graph of order 4l + 3 for
all l > 1; how to construct for all k > 4 a k-optimum summable graph; and if G is a
k-optimum summable graph of order n, then n > 2k.
In [1356] Javaid, Khalid, Ahmad, and Imran introduce a weaker version of sum labeling
of graphs as follows. Let H = (V, E) be a simple, finite, undirected graph with |V | = p.
H is a weak sum graph if there exists a labeling L (called a w-sum) of the vertices of V
by distinct positive integers such that (u, v) ∈ E if there exists a vertex w ∈ V such that
L(w) = L(u) + L(v). (A sum graph also requires the “only if” condition). If H is a w-sum
graph with the additional constraint that the labels L all fall in the range 1, . . . , p, then H
is called a super weak sumgraph (sw-sumgraph). Because sumgraphs must have isolated
vertices we may write H = G + Kδ , where G is connected and Kδ denotes δ isolated
vertices If δ is a minimum with respect to G, we say that the sumgraph (respectively, w-
sumgraph, sw-sumgraph) H is δ-optimal and that G is δ-optimal summable (respectively,
w-summable, sw-summable). Javaid et al. prove: paths are 1-optimal sw-summable;
cycles are 2-optimal sw-summable; wheels are 3-optimal sw-summable; Kn is (n − 1)-
optimal sw-summable; and G = Kn1 ,n2 ,...,nq are t-optimal sw-summable, where t is the
minimum degree of any vertex in G. They also prove that for n > 5, the Cayley graph
Cay(Zn , ±1, ±2) is 4-optimal w-summable. They conjecture that all connected graphs are
δ-optimal w-summable for some δ. See also [1709] and [2147].
Grimaldi [1160] has investigated labeling the vertices of a graph G(V, E) with n vertices
with distinct elements of the ring Zn so that xy ∈ E whenever (x + y)−1 exists in Zn .
In his 2001 Ph. D. thesis Sutton [3165] introduced two methods of graph labelings
with applications to storage and manipulation of relational database links specifically in
mind. He calls a graph G = (Vp ∪ Vi , E) a sum* graph of Gp = (Vp , Ep ) if there is an
injective labeling λ of the vertices of G with non-negative integers with the property that
uv ∈ Ep if and only if λ(u) + λ(v) = λ(z) for some vertex z ∈ G. The sum∗ number,
σ ∗ (Gp ), is the minimum cardinality of a set of new vertices Vi such that there exists a
sum* graph of Gp on the set of vertices Vp ∪ Vi . A mod sum* graph of Gp is defined in the
identical fashion except the sum λ(u) + λ(v) is taken modulo n where the vertex labels of
G are restricted to {0, 1, 2, . . . , n − 1}. The mod sum* number, ρ∗ (Gp ), of a graph Gp is
defined in the analogous way. Sum* graphs are a generalization of sum graphs and mod
sum* graphs are a generalization of mod sum graphs. Sutton shows that every graph
is an induced subgraph of a connected sum* graph. Sutton [3165] poses the following
conjectures: ρ(Hm,n ) 6 mn for m, n > 2; σ ∗ (Gp ) 6 |Vp |; and ρ∗ (Gp ) 6 |Vp |.
The following table summarizes what is known about sum graphs, mod sum graphs,
sum* graphs, and mod sum* graphs is reproduced from Sutton’s Ph. D. thesis [3165]. It
was updated by J. Gallian in 2006. A question mark indicates the value is unknown. The
results on sum* and mod sum* graphs are found in [3165].

the electronic journal of combinatorics (2023), #DS6 269

 Table 20: Summary of Sum Graph Labelings

Graph σ(G) ρ(G) σ ∗ (G) ρ∗ (G)

K2 = S1 1 1 0 0

stars, Sn , n > 2 1 0 0 0

trees Tn , n > 3 when Tn 6= Sn 1 0 1 0

C3 2 1 1 0

C4 3 0 2 0

Cn , n > 4 2 0 2 0

W4 4 0 2 0

Wn , n > 5, n odd n n 2 0
n
Wn , n > 6, n even 2
+2 2 2 0

fan, F4 , 2 1 1 0

fans, Fn , n > 5, n odd ? 2 1 0

fans, Fn , n > 6, n even 3 2 1 0

Kn , n > 4 2n − 3 n n−2 0

cocktail party graphs, H2,n 4n − 5 0 ? 0

(t)
Cn (n, t) 6= (4, 1) (see §2.2) 2 ? ? ?
 4n−3 
Kn,n 2
n(n > 3) ? ?

Km,n , 2nm > n > 3 ? n ? ?

Km,n m > 3n − 3, n > 3, m odd ? 0 ? 0

Km,n , m > 2n, n > 3, m even ? 0 ? 0

 kn−k m

Km,n , m < n 2
+ k−1
? ? ?
p
k = d 1 + (8m + n − 1)(n − 1)/2 e

Kn,n − E(nK2 ), n > 6 2n − 3 n−2 ? ?

the electronic journal of combinatorics (2023), #DS6 270

7.2 Prime and Vertex Prime Labelings4
The notion of a prime labeling originated with Entringer and was introduced in a paper
by Tout, Dabboucy, and Howalla [3221]. A graph with vertex set V is said to have
a prime labeling if its vertices are labeled with distinct integers 1, 2, . . . , |V | such that
for each edge xy the labels assigned to x and y are relatively prime. Around 1980,
Entringer conjectured that all trees have a prime labeling. Little progress was made on
this conjecture until 2011 when Haxell, Pikhurko, Taraz [1197] proved that all large trees
are prime. Also, their method allowed them to determine the smallest size of a non-prime
connected order-n graph for all large n, proving a conjecture of Rao [2595] in this range.
Among the classes of trees known to have prime labelings are: paths, stars, complete
binary trees, spiders (i.e., trees with one vertex of degree at least 3 and with all other
vertices with degree at most 2), olive trees (i.e., a rooted tree consisting of k branches
such that the ith branch is a path of length i), all trees of order up to 50, palm trees (i.e.,
trees obtained by appending identical stars to each vertex of a path), banana trees, and
binomial trees (the binomial tree B0 of order 0 consists of a single vertex; the binomial
tree Bn of order n has a root vertex whose children are the roots of the binomial trees of
order 0, 1, 2, . . . , n − 1 (see [2689], [2398], [3221], [990], and [2636]). Tout, Dabboucy, and
Howalla [3221] showed t-toe caterpillars (the internal vertices on the spine are regular in
degree) are prime and that all caterpillars with maximum degree at most 5 are prime.
Seoud, Sonbaty, and Mahran [2794] provide necessary and sufficient conditions for a
graph to be prime. They also give a procedure to determine whether or not a graph is
prime. Other graphs with prime labelings include all cycles and the disjoint union of C2k
and Cn [804]. The complete graph Kn does not have a prime labeling for n > 4 and
Wn is prime if and only if n is even (see [1921]). Lee, Wui, and Yeh [1921] proved that
friendship graphs have prime labelings. Diefenderfer et al. [838] and [837] proved that
the graph obtained by identifying a vertex of Cn with an endpoint of the star Sm where
1 6 m 6 9, chains of Cn where n = 4, 6, or 8, Cn × P2 where n − 1 is prime and n > 4,
generalized books Sn × Pm where 3 6 m 6 7, and other families of uncylic graphs have
prime vertex labelings.
Seoud, Diab, and Elsakhawi [2769] have shown the following graphs are prime: fans;
helms; flowers (see §2.2); stars; K2,n ; and K3,n unless n = 3 or 7. They also shown that
Pn + Km (m > 3) is not prime. Berliner, Dean, Hook, Marr, Mbirka, and McBee give
consecutive cyclic prime labelings of certain classes of ladders. Although Kn,n does not
have a prime labeling when n > 2, Berliner et al. give minimal prime labelings for all n-
values 1 6 n 6 23 and give conditions on m and n for which Km,n are prime. They provide
specific values of n for m up to 13. Dissanayake, Abeysekara, Dhananjaya, Perera, and
Ranasinghe [841] provide necessary and sufficient conditions for K1,m,n to have a prime
labeling. In [570] Bigham, Donovan, Pack, Turley, and Wiglesworth [570] investigated the [570] new
existence of prime labelings of certain snake graphs. [570] new
Tout, Dabboucy, and Howalla [3221] proved that Cm Kn is prime for all m and n.
4
I am grateful to John Asplund and N. Bradley Fox for their helpful comments on the results in this
section.

the electronic journal of combinatorics (2023), #DS6 271

Vaidya and Prajapati [3297] proved that the graphs obtained by duplication of a vertex
by a vertex in Pn and K1,n are prime graphs and the graphs obtained by duplication of a
vertex by an edge, duplication of an edge by a vertex, duplication of an edge by an edge in
Pn , K1,n , and Cn are prime graphs. They also proved that graph obtained by duplication
of every vertex by an edge in Pn , K1,n , and Cn are not prime graphs. Ghorbani and
Kamali [1094] proved that ladders have prime labelings.
(m)
For m and n at least 3, Seoud and Youssef [2797] define Sn , the (m, n)-gon star, as
the graph obtained from the cycle Cn by joining the two end vertices of the path Pm−2 to
every pair of consecutive vertices of the cycle such that each of the end vertices of the path
is connected to exactly one vertex of the cycle. Seoud and Youssef [2797] have proved the
(m)
following graphs have prime labelings: books; Sn ; Pn + K2 if and only if n = 2 or n is
odd; Cn K1 with a complete binary tree of order 2k −1 (k > 2) attached at each pendent
vertex, and that Cm -snakes are prime (see §2.2) for the definition). They also prove that
every spanning subgraph of a prime graph is prime and every graph is a subgraph of a
prime graph. They conjecture that all unicycle graphs have prime labelings. Diefenderfer,
Hastings, Heath, Prawzinsky, Preston, White, and Whittemore [837] proved that certain
families of graphs that are special cases of Seoud and Youssef’s conjecture [2797] have
prime labelings. Seoud and Youssef [2797] proved the following graphs are not prime:
Cm + Cn ; Cn2 for n > 4; Pn2 for n = 6 and for n > 8; and Möbius ladders Mn for n even
(see §2.3 for the definition). They also give an exact formula for the maximum number
of edges in a prime graph of order n and an upper bound for the chromatic number of a
prime graph.
Youssef and Elsakhawi [3559] have shown: the union of stars Sm ∪ Sn , are prime; the
union of cycles and stars Cm ∪ Sn are prime; Km ∪ Pn is prime if and only if m is at most
3 or if m = 4 and n is odd; Kn K1 is prime if and only if n 6 7; Kn K2 is prime if and
only if n 6 16; 6Km ∪ Sn is prime if and only if the number of primes less than or equal
to m + n + 1 is at least m; and that the complement of every prime graph with order
at least 20 is not prime. Michael and Youssef [2136] determined all self-complementary
graphs that have prime labelings.
Salmasian [2689] has shown that every tree with n vertices (n > 50) can be labeled
with n integers between 1 and 4n such that every two adjacent vertices have relatively
prime labels. Pikhurko [2398] has improved this by showing that for any c > 0 there is
an N such that any tree of order n > N can be labeled with n integers between 1 and
(1 + c)n such that labels of adjacent vertices are relatively prime.
Baskar Babujee and Vishnupriya [506] proved the following graphs have prime label-
ings: nP2 , Pn ∪ Pn ∪ · · · ∪ Pn , bistars (that is, the graphs obtained by joining the centers
of two identical stars with an edge), and the graph obtained by subdividing the edge
joining edge of a bistar. Baskar Babujee [485] obtained prime labelings for the graphs:
(Pm ∪ nK1 ) + K2 , (Cm ∪ nK1 ) + K2 , (Pm ∪ Cn ∪ Kr ) + K2 , Cn ∪ Cn+1 , (2n − 2)C2n (n >
1), Cn ∪ mPk and the graph obtained by subdividing each edge of a star once. In [495]
Baskar Babujee and Jagadesh prove the following graphs have prime labelings: bistars
Bm , n; P3 K1,n ; the union of K1,n and the graph obtained from K1,n by appending a
pendent edge to every pendent edge of K1,n ; and the graph obtained by identifying the

the electronic journal of combinatorics (2023), #DS6 272

center of K1,n with the two endpoints and the middle vertex of P5 .
In [3293] Vaidya and Prajapati prove the following graphs have prime labelings: a
t-ply graph of prime order; graphs obtained by joining center vertices of wheels Wm and
Wn to a new vertex w where m and n are even positive integers such that m + n + 3 = p
and p and p−2 are twin primes; the disjoint union of the wheel W2n and a path; the graph
obtained by identifying any vertex of a wheel W2n with an end vertex of a path; the graph
obtained from a prime graph of order n by identifying an end vertex of a path with the
vertex labeled with 1 or n; the graph obtained by identifying the center vertices of any
number of fans (that is, a “multiple shell”); the graph obtained by identifying the center
vertices of m wheels Wn1 , Wn2P , . . . , Wnm where each ni > 4 is an even integer and each
ni is relatively prime to 2 + i−1 k=1 nk for each i ∈ {2, 3, . . . , m}. Prajapati and Suther
[2510] provided results about the existence of prime labelings of graphs obtained from
K2,n by the duplication of vertices and edges. In [2484] Prajapati and Gajjar provided
conditions under which the disjoint union of two graphs admit a prime labeling. They
showed that C2n+1 × P2 is not prime, Wn is prime if and only if 3 6 n 6 6, and, for a
prime p > 3 , Cp−1 × P2 is prime and a wheel graph of odd order is switching invariant.
In [2496] they proved that generalized Petersen graph P (n, k) is prime then n must be
even and k must be odd and found some classes of generalized Petersen graphs that admit
prime labelings.
In [3479] Wilson and Jini define the torch On as the graph that has n + 4 vertices and
2n + 3 edges with V (On ) = {v − i | 1 6 i 6 n + 4} and E(On ) = {vi vn+1 | 2 6 i 6
n−2}∪{vi vn+3 | 2 6 i 6 n−2}∪{v1 vi | n 6 i 6 n+4}∪{vn−1 vn , vn vn+2 , vn vn+4 , vn+1 vn+3 }.
They proved that the torch graph On is a prime graph.
The Knödel graphs W∆,n with n even and degree ∆, where 1 6 ∆ 6 b log2 nc have
vertices pairs (i, j) with i = 1, 2 and 0 6 j 6 n/2 − 1 where for every 0 6 j 6 n/2 − 1
and there is an edge between vertex (1, j) and every vertex (2, (j + 2k − 1) mod n/2), for
k = 0, 1, . . . , ∆ − 1. Haque, Lin, Yang, and Zhao [1182] have shown that W3,n is prime
when n 6 130.
In [2727] Schuchter and Wilson gave evidence for their conjecture that a generalized
Petersen graph P (n, k) is prime if and only if it is bipartite, which occurs for n even and
k. They show that it is true for all even n and odd k such that n 6 9000 and 1 6 k 6 n2 .
They conjectured that all cubic bipartite graphs with at least 8 vertices are prime and
verified it for all such graphs G, connected or not, satisfying 8 6 V (G) 6 22.
In the 24th edition of this survey, the following was stated.“Schroeder [2729] proved
that every bipartite graph is prime except K3,3 . This result establishes that the generalized
Petersen graph P (n, k) is prime precisely when it is bipartite, the Knődel graph W3,n is
prime for all even n > 4, and the union of any number of even cycles is prime.” Schroeder’s
result about bipartite graphs was later modified [2730] to state that for 4 6 n 6 32,
cubic bipartite graphs on 2n vertices are prime. Consequently, the statements about the
generalized Petersen graph, the Knődel graph, and the union of even cycles are open. In
[2193] Mostafa and Ghorbani characterized Hamiltonian k-coprime graphs, which implied
a conjecture of Schroeder in [2728] that all 2-regular graphs are prime if every union
of even cycles is prime. They then cited Schroeder’s original result to claim the 1982

the electronic journal of combinatorics (2023), #DS6 273

conjecture by Tout, Dabboucy, Howalla [3221] that all 2-regular graphs are prime. So,
that conjecture is still open as well.
Prajapati and Shah [2509] investigated the existence of prime labelings for graphs
obtained by the duplication of paths, cycles, stars, and wheels. Sundaram, Ponraj, and
Somasundaram [3138] investigated the prime labeling behavior of all graphs of order at
most 6 and established that only one graph of order 4, one graph of order 5, and 42 graphs
of order 6 are not prime.
Kansagara and Patel [1644] define the web graph without a center as the graph obtained
by joining the n pendent vertices of Cn K1 to form an n-cycle and then adding a single
pendent edge to each vertex of this outer cycle. They investigated prime labelings for web
graphs without a center and graphs resulting from the subdivision of some specific edges
in it. They also provide results on prime labeling of the union of a web graph without
center with a wheel, generalized Jahangir graphs, and drum graphs.
Given a collection of graphs G1 , . . . , Gn and some fixed vertex vi from each Gi , Lee,
Wui, and Yeh [1921] define Amal{(Gi , vi )}, the amalgamation of {(Gi , vi )| i = 1, . . . , n},
as the graph obtained by taking the union of the Gi and identifying v1 , v2 , . . . , vn . They
proved Amal{(Gi , vi )} has a prime labeling when Gi are paths and when Gi are cycles.
They also showed that the amalgamation of any number of copies of Wn , n odd, with a
common vertex is not prime. They conjecture that for any tree T and any vertex v from
T , the amalgamation of two or more copies of T with v in common is prime. They further
conjecture that the amalgamation of two or more copies of Wn that share a common point
is prime when n is even (n 6= 4). Vilfred, Somasundaram, and Nicholas [3403] have proved
this conjecture for the case that n ≡ 2 (mod 4) where the central vertices are identified.
Dean [791], and independently Ghorbani and Kamali [1094], showed that the ladder
Pn × P2 has a prime labeling. In [766] Curran and Ollis pointed out a flaw in Dean’s proof [766] new
and showed that a stronger condition is needed for it to hold. They conjecture that this
stronger condition is true. They also offer an alternative construction inspired by Dean’s
approach that shows that if the Even Goldbach Conjecture and a particular strengthening
of Lemoine’s Conjecture are true, then the Prime Ladder Conjecture follows.
Vilfred, Somasundaram, and Nicholas [3403] proved the following graphs are prime:
helms; Pm × Pn where n is prime, m 6 3; double fans Pn + K2 if and only if n is odd; and
cycles with a Pk -chord. They conjecture that Pm ×Pn where m < n and n is prime is prime
and ladders Pn × P2 are prime. The conjecture about grids was proved by Sundaram,
Ponraj, and Somasundaram [3136]. In the same article they also showed that Pn × Pn is
prime when n is prime. Kanetkar [1627] proved: P6 × P6 is prime; Pn+1 × Pn+1 is prime
when n is a prime with n ≡ 3 or 9 (mod 10) and (n+1)2 +1 is also prime; and Pn ×Pn+2 is
prime when n is an odd prime with n 6≡ 2 (mod 7). Curran [758] showed that Pp × Pn has
a prime labeling for any odd prime p and any integer n such that p < n 6 p2 . Combining
the results of Sundaram, Ponraj, and Somasundaram [3136] and Curran, we have that
Pp × Pn has a prime labeling for any odd prime p and any integer n such that 1 6 n 6 p2 .
Seoud, El Sonbaty, and Abd El Rehim [2770] proved that for m = pn+t−1 − (t + n)
where pi is the ith prime number in the natural order Kn ∪ Kt,m is prime and graphs
obtained from K2,n , (n > 2) by adding p and q edges out from the two vertices of degree

the electronic journal of combinatorics (2023), #DS6 274

n of K2,n are prime. They also proved that if G is not prime, then G ∪ K1,n is prime if
π(n + m + 1) > m where m is the order of G and π(x) is the number of primes less than
or equal to x.
(k)
Recall that Cn is the graph obtained from the k > 2 copies of the cycle Cn by
identifying exactly one vertex of each of these k copies of Cn . Patel and Vasava [2369]
(j) (k)
proved the following: Cn ∪ Cm is a prime graph if and only if either n is even or m is
(2) (2) (2)
even; C2n ∪ C2m ∪ Ck is a prime graph for all n,m and k; C2n ∪
SC2n ∪ C2n∪ C2n ∪ C2m ∪ Ck
SN (2) M (2)
is a prime graph for all n, m and k; and G = k=1 Cnk ∪ j=1 Cmj is not a prime
(2) (2) (2)
graph if M 6 N − 2 They also provided conditions for which G = C2n ∪ C2m+1 ∪ C2k+1
is a prime graph.
For any finite collection {Gi , ui vi } of graphs Gi , each with a fixed edge ui vi , Carlson
[658] defines the edge amalgamation Edgeamal{(Gi , ui vi )} as the graph obtained by taking
the union of all the Gi and identifying their fixed edges. The case where all the graphs are
cycles she calls generalized books. She proves that all generalized books are prime graphs.
Moreover, she shows that graphs obtained by taking the union of cycles and identifying
in each cycle the path Pn are also prime.
In [484] Baskar Babujee proves that the maximumPn number of edges in a simple graph
with n vertices that has a prime labeling is k=2 φ(k). He also shows that the planar
graphs having n vertices and 3(n − 2) edges (i.e., the maximum number of edges for a
planar graph with n vertices) obtained from Kn (n > 5) with vertices v1 , v2 , . . . , vn by
deleting the edges joining vs and vt for all s and t satisfying 3 6 s 6 n−2 and s+2 6 t 6 n
has a prime labeling if and only if n is odd.
By showing that for every even n 6 2.468 × 109 there exists 1 6 s 6 n − 1 such that
both n + s and 2n + s are prime, Schluchter, Schroeder, Cokus, Ellingson, Harris, Rarity,
and Wilson [2726] prove the generalized Peterson graph P (n, 1) (which is isomorphic to
Cn × P2 ) is prime for all even 4 6 n 6 2.468 × 109 . For a fixed n they also describe a
method for labeling P (n, k) that is a prime labeling for multiple values of k. Using this
method, they prove P (n, k) is prime for all even n 6 50 and odd k < n/2.
Yao, Cheng, Zhongfu, and Yao [3530] have shown: a tree of order p with maximum
degree at least p/2 is prime; a tree of order p with maximum degree at least p/2 has a
vertex subdivision that is prime; if a tree T has an edge u1 u2 such that the two components
T1 and T2 of T − u1 u2 have the properties that dT1 (u1 ) > |T1 |/2 and dT2 (u2 ) > |T2 |/2,
then T is prime when |T1 | + |T2 | is prime; if a tree T has two edges u1 u2 and u2 u3
such that the three components T1 , T2 , and T3 of T − {u1 u2 , u2 u3 } have the properties
that dT1 (u1 ) > |T1 |/2, dT2 (u2 ) > |T2 |/2, and dT3 (u3 ) > |T3 |/2, then T is prime when
|T1 | + |T2 | + |T3 | is prime.
Vaidya and Prajapati [3294] define a vertex switching Gv of a graph G as the graph
obtained by taking a vertex v of G, removing all the edges incident to v and adding edges
joining v to every other vertex that is not adjacent to v in G. They say a prime graph G
is switching invariant if for every vertex v of G, the graph Gv obtained by switching the
vertex v in G is also a prime graph. They prove: Pn and K1,n are switching invariant;
the graph obtained by switching the center of a wheel is a prime graph; and the graph

the electronic journal of combinatorics (2023), #DS6 275

obtained by switching a rim vertex of Wn is a prime graph if n + 1 is a prime. They also
prove that the graph obtained by switching a rim vertex in Wn is not a prime graph if
n + 1 is an even integer greater than 9.
Prajapati and Gajjar [2484] prove the following graphs are prime: graphs obtained
from Pm+1 and m copies of Cn by identifying each edge of Pm+1 with an edge of a
corresponding copy of Cn ; graphs obtained from Cm and m copies of Cn by identifying
each edge of Cm with an edge of corresponding copy of Cn ; for a prime p > 3 and p − 2
copies of Cp+1 , the graph obtained by identifying one vertex of each copy of Cp+1 with
corresponding pendent vertex of K1,p−2 ; for a prime p > 3, Cp−1 × P2 ; and for a prime
p > 3, the graphs obtained by joining every rim vertex of a wheel graph Wp−1 with the
corresponding vertex of Cp−1 . They also prove that the complement of Wn is prime if and
only if 3 6 n 6 6; for odd n > 3 Cn × P2 is not prime; and W2n is switching invariant.
Selvaraju and Moha [2743] proved that the one-point union of any number of cycles
and the one-point union of any number of wheels at the center are prime graphs. Haque,
Xiaohui, Yuansheng, and Pingzhong proved that the generalized Petersen graph P (n, k)
is prime for all even n 6 2500 when k = 1 [1179] and for all even n 6 100 when k = 3
[1181]. They show P (n, 3) is not prime for odd n and conjecture that P (n, 3) are prime
for all even n.
In [2775] Seoud, El-Sonbaty, and Mahran discuss the primality of some corona graphs
G H and conjecture that Kn Km is prime if and only if n 6 π(nm + n) + 1, where
π(x) is the number of primes less than or equal to x. For m 6 20 they give the exact
values of n for which Kn Km is prime. They also show that Km,n is prime if and only
if min{m, n} 6 π(m + n) − π((m + n)/2) + 1.
In [2369] Patel and Vasava provided the following results about prime graphs: Wn ∪Cm
is a prime graph if and only if n and m both are even; (Pn + K2 ) ∪ Cm is a prime graph if
(2)
and only if either n = 2, or n is odd and m is even; Cn ∪ Cm is a prime graph if and only
(m) (j)
if at least one of n and m is even; Sn ∪ Sk is not a prime graph if m and j are even
(m)
and n and k are odd (Sn denotes the (m, n)-gon star obtained from Cn and n copies of
Pm−2 by joining the two end vertices of Pm−2 to each pair of consecutive vertices of the
cycle such that each of the end vertices of the path is adjacentSto exactly one vertex of
(2m) (2m)
the cycle); S2n ∪ Sk is a prime graph for all n, m, and k; Hn Bn is a prime graph for
all n and m; Circ(n, k) is not a prime graph when n and k both are even; and Circ(n, k)
is not a prime graph when n is odd.
In [2360] Patel and Kansagara prove that the following graphs are prime: (Cn K1 ) ∪
(Cn K1 ) for all n; Gn ∪ Gn for all n (Gn is the gear graph); Hn ∪ Hn for all n (Hn is
the helm graph); Bn ∪ (K1,n × P2 ) for all n; Hn ∪ Gn for all n; (Cn K1 ) ∪ Gn for all n;
(Cn K1 ) ∪ Hn for all n; and Cn (Cn ) ∪ Cn (Cn ) if n 6≡ 1 (mod 3) (Cn (Cn ) is the graph
obtained by taking barycentric subdivision of Cn and joining each newly inserted vertices
of incident edges by an edge).
In [2362] Patel, Kansagava, and Vasva provided prime labeling of graphs obtained by
taking barycentric subdivision of Wn , flower graphs, and (Cn K1 ) ∪ (Cn K1 ); and
the graphs by obtained by taking subdivision of certain edges Wn , Hn , (Cn K1 ) and
(Cn K1 ) ∪ (Cn K1 ).

the electronic journal of combinatorics (2023), #DS6 276

 Hamm, Hamm, and Way [1173] proved that if a complete k-partite k-uniform hyper- [1173] new
graph has enough vertices and every pod of vertices is large enough, then it does not
have a prime labeling. They also proved that if a pod of vertices in a complete k-partite
k-uniform is small enough, the graph it does have a prime labeling.
Klee, Lehmann, and Park [1705] we extended the notion of prime labeling to the
Gaussian integers. They showed that paths, stars, spiders, graphs obtained by joining the
centers of two stars with a path, and some firecrackers admit Gaussian prime labelings.
In [2946] Shrimali and Singh proved the following graphs have Gaussian vertex prime
labelings: books; kayaks; the one point union of k copies of Wn ; the one point union of
k copies of a gear graph; the one point union of k copies a graph obtained from a wheel
by replacing each cycle edge by Pn ; and the one point union of k copies a graph obtained
from a wheel by replacing each spoke by Pn . Kavitha and Jayalalitha [1677] proved the [1677] new
following graphs admit Gaussian prime distance labeling: grids, paths, bipartite graphs,
non-trivial Dutch windmills, non-trivial stars, double stars, and spider trees.
The Prime Ladder Conjecture states that every ladder Pn × P2 is prime. This was
proved by Dean [791] in 2017. He conjectures that every integer n > 50 has a canonical
partition with at most three terms and he states that this conjecture was verified by
computer up to 5,000,000.
Lau, Chu, Suhadak, Foo, and Ng [1803] introduced SD-prime cordial labelings as
follows. Given a finite, simple graph G with n vertices and a bijection f : V (G) →
{1, 2, . . . , n}, for each edge uv let S = f (u) + f (v) and D = |f (u) − f (v)|. For each
edge uv define f 0 induced by f by assigning f 0 (uv) = 1 if gcd(S, D) = 1 and f 0 (uv) = 0
otherwise. Then f 0 is said to be SD-prime cordial if f 0 (uv) = 1 for all edges uv. They
provide results about paths, complete bipartite graphs, stars, double stars, wheels, fans,
double fans, ladders, and grids. They conjecture that Pm × Pn is SD-prime for all m > 2
and n > 2. Lau, Shiu, Ng, and Jeyanthi [1812] give sufficient conditions for a theta graph
to have an SD-prime cordial labeling, provide a way to construct new SD-prime cordial
graphs from existing ones, and investigate SD-prime cordialness of some general graphs.
Lourdusamy and Patrick [2011] provide a way to construct SD-prime cordial graphs from
an existing graph G with an SD-prime cordial labeling by identifying a vertex of G having
a particular label with a vertex of maximum degree of a star or fan or with an endpoint
of a path. In [2012] Lourdusamy and Patrick investigated SD-prime cordial labelings of
subdivision graphs, splitting graphs, shadow graphs of stars and bistars, T (Pn ), T (Cn ), the
graph obtained by duplication of each vertex of a path and a cycle by an edge, Qn , A(Tn ),
triangular ladders, Pn K1 , Cn K1 , and jewel graphs. Shiu and Lau [2914] provided [2914] new
SD-prime labelings for some one-point unions of gear graphs.
The following definitions appear in [2444], [2431], [2432], and [2433]. A double trian-
gular snake DTn consists of two triangular snakes that have a common path; a double
quadrilateral snake DQn consists of two quadrilateral snakes that have a common path;
an alternate triangular snake A (Tn ) is the graph obtained from a path u1 , u2 , . . . , un by
joining ui and ui+1 (alternatively) to new vertex vi (that is, every alternate edge of a
path is replaced by C3 ); a double alternate triangular snake DA (Tn ) is obtained from a
path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to two new vertices vi and wi ;

the electronic journal of combinatorics (2023), #DS6 277

an alternate quadrilateral snake A (Qn ) is obtained from a path u1 , u2 , . . . , un by joining
ui and ui+1 (alternatively) to new vertices vi and wi respectively and then joining vi and
wi (that is, every alternate edge of a path is replaced by a cycle C4 ); a double alternate
quadrilateral snake DA (Qn ) is obtained from a path u1 , u2 , . . . , un by joining ui and ui+1
(alternatively) to new vertices vi , xi and wi and yi respectively and then joining vi and
wi and xi and yi .
Prajapati and Vantiya [2511] proved that the following snake graphs have SD-prime
cordial labelings: triangular (except for n = 3), alternate triangular, quadrilateral, alter-
nate quadrilateral, double triangular, double alternate triangular, double quadrilateral,
and double alternate quadrilateral. Lourdusamy, Wency, and Patrick [2022] proved that
the union of stars and paths, subdivision of combs, subdivision of ladders, and the graph
obtained by attaching a star at one end of a path are SD-prime graphs. They proved that
the union of two SD-prime cordial graphs need not be SD-prime cordial graphs. Also, they
proved that given a positive integer n, there is SD-prime cordial graph with n vertices. In
[2512] Prajapati and Vantiya investigated SD-prime cordial labelings of various kinds of
snakes involving K4 . In [2513] they investigate the SD-prime cordial labeling of alternate
k-polygonal snake graphs of type-1, type-2 and type-3.
Vaidya and Prajapati [3293] have introduced the notion of k-prime labeling. A k-prime
labeling of a graph G is an injective function f : V (G) → {k + 1, k + 2, k + 3, . . . , k +
|V (G)| − 1} for some positive integer k that induces a function f + on the edges of G
defined by f + (uv) = gcd(f (u), f (v)) such that gcd(f (u), f (v)) = 1 for all edges uv. A
graph that admits a k-prime labeling is called a k-prime graph. They prove the following
are prime graphs: a tadpole (that is, a graph obtained by identifying a vertex of a cycle
to an end vertex of a path); the union of a prime graph of order n and a (n + 1)-prime
graph; the graph obtained by identifying the vertex labeled with n in an n-prime graph
with either of the vertices labeled with 1 or n in a prime graph of order n. Arockiamary
and Vijayalakshmi [239] proved that shell graphs, uniform shellbutterfly graphs, and shell- [239] new
flower graphs admit k-prime total labelings.
For connected graphs G1 (p1 , q1 ) and G2 (p2 , q2 ), G1 ô G2 is the graph obtained by
superimposing any selected vertex of G2 on any selected vertex of G1 . Then for any graph
k-prime graph G, Vijayalashmi and Arockiamary [3384] proved the following graphs have
k-prime labelings: C2n ∪C2n , G∪tPm (m > 1), G∪K1,n , G ô Pn , Gô K1,n and G ô (Pn +K1 ).
A dual of prime labelings has been introduced by Deretsky, Lee, and Mitchem [804].
They say a graph with edge set E has a vertex prime labeling if its edges can be labeled
with distinct integers 1, . . . , |E| such that for each vertex of degree at least 2 the greatest
common divisor of the labels on its incident edges is 1. Deretsky, Lee, and Mitchem
show the following graphs have vertex prime labelings: forests; all connected graphs;
C2k ∪ Cn ; C2m ∪ C2n ∪ C2k+1 ; C2m ∪ C2n ∪ C2t ∪ Ck ; and 5C2m . They further prove that a
graph with exactly two components, one of which is not an odd cycle, has a vertex prime
labeling and a 2-regular graph with at least two odd cycles does not have a vertex prime
labeling. They conjecture that a 2-regular graph St has a vertex prime
Pt labeling if and only
if it does not have two odd cycles. Let G = i=1 C2ni and N = i=1 ni . In [600] Borosh,
Hensley and Hobbs proved that there is a positive constant n0 such that the conjecture

the electronic journal of combinatorics (2023), #DS6 278

of Deretsky et al. is true for the following cases: G is the disjoint union of at most seven
cycles; G is a union of cycles all of the same even length 2n where n 6 150 000 or where
n > n0 ; ni > (log N )4 log log log n for all i = 1, . . . , t; and when each C2ni is repeated at most
ni times. They end their paper with a discussion of graphs whose components are all even
cycles, and of graphs with some components that are not cycles and some components
that are odd cycles. In [1820] Lavanya and Ganesa provided vertex prime labelings for
graphs related to Cn K1 .
In [283] Bapat proved the following graphs have vertex prime labelings: kayak paddles
KP (k, m, l); books; irregular books not necessarily with pages of the same size; triangular
snakes; m-fold triangular snakes of length n obtained from a path v1 , v2 , . . . , vn , vn+1 by
joining vi and vi+1 to new m vertices w1i , w2i , . . . , wm i
, for i = 1, 2, . . . , n giving edges vi wji
i
and wj vi+1) , for j = 1, . . . , m, i = 1, 2, . . . , n; m-fold petal sunflowers obtained from a cycle
v1 , v2 , . . . , vn by joining vi and vi+1 to new m vertices w1i , w2i , . . . , wm i
, for i = 1, 2, . . . , n
i i
giving edges vi wj and wj vi+1) for j = 1, . . . , m, i = 1, 2, . . . , n(vn+1 = v1 ); and one-point
unions of cycles not necessarily of the same length.
A bijection f from V (G to {1, 2, . . . , |V | + |E|} is said to be a total prime if for each
edge uv the labels assigned to u and v are relatively prime and for each vertex of degree
at least 2, the labels on the incident edges are relatively prime. A graph that admits a
total prime labeling is called a total prime graph. In [2493] Prajapati and Gajjar defined
a braided star graph as follows. Let a0 be the apex vertex and a1 , a2 , . . . , an−1 , an be
consecutive n rim vertices of Wn , (n > 3). Let b1 , b2 , b3 , . . . , b2n−1 , b2n be consecutive 2n
vertices of C2n (n > 1); and let c1 , c2 , c3 , . . . , c2n−1 , c2n be consecutive 2n vertices of a
second copy of C2n . Join each ai to b2i−1 by an edge and b2i to c2i by an edge. For each
i, join a new vertcies di to each c2i−1 and c2i+1 by an edge taking the subscripts modulo
n. They proved that braided stars are prime, total prime, and vertex prime.
In [224] Arockiamary, Baskar Babujee, and Vijayalakshmi say a graph G has a k- [224] new
prime total labeling if k is a positive integer and there is a bijection f : V (G) ∪ E(G) →
{k, k + 1, k + 2, . . . , k + V (G) ∪ E(G) − 1} such that for every edge uv the labels f (u), f (v),
and f (uv) are pairwise relatively prime. A graph that admits a k-prime total labeling
is called a k-prime total graph. They proved that Pn is k-prime total for odd k, K1,n is
k-prime total for odd k and n > 2, the bistar B(m, n) is a k−prime total for odd k and
m, n > 2, and various other tree-related graphs are k-prime total.
Jothi [1559] calls a graph G highly vertex prime if its edges can be labeled with dis-
tinct integers {1, 2, . . . , |E|} such that the labels assigned to any two adjacent edges are
relatively prime. Such labeling is called a highly vertex prime labeling. He proves: if G
is highly vertex prime then the line graph of G is prime; cycles are highly vertex prime;
paths are highly vertex prime; Kn is highly vertex prime if and only if n 6 3; K1,n is
highly vertex prime if and only if n 6 2; even cycles with a chord are highly vertex prime;
Cp ∪ Cq is not highly vertex prime when both p and q are odd; and crowns Cn K1 are
highly vertex prime.
For a finite simple graph G(V, E) with n vertices and v ∈ V let N (v) denote the open
neighborhood of v. Patel and Shrimali [2364] say a bijective function f :→ {1, 2, 3, . . . , n}
is a neighborhood-prime labeling of G, if for every vertex v ∈ V with deg(v) > 1,

the electronic journal of combinatorics (2023), #DS6 279

gcd {f (u) : u ∈ N (v)} = 1. A graph that admits a neighborhood-prime labeling is called
a neighborhood-prime graph. In [2364], [2365], and [2366] they prove the following graphs
have a prime-neighborhood labeling: graphs with a vertex of degree |V | − 1; paths; Cn
if and only if n 6≡ 2 (mod 4); helms; closed helms; flowers; graphs obtained by the du-
plication of an arbitrary vertex of cycle or path; G1 + G2 where each of G1 and G2 have
at least 2 verticies; Cn ∪ Cm is a neighborhood-prime graph if and only if n ≡ 0 (mod 4)
and m ≡ 0 (mod 4), or n ≡ 0 (mod 4) and m ≡ 1 (mod 2); Wm ∪ Wn ; the union of a
finite number of paths; Pm × Pn ; and the tensor product of two paths of the same order.
They also prove that if G is neighborhood-prime graph and v is a vertex in G that is not
adjacent to any pendent vertices, then the graph obtained by duplicating the vertex v is
neighborhood-prime [2364].
Patel [2357] showed that the generalized Petersen graph P (n, k) is neighborhood-prime
when the greatest common divisor of n and k is 1, 2, or 4 and that P (n, 8) is neighborhood-
prime for all n. Patel and Kansagara [2361] proved that the snake graphs of the type Ckm
are neighborhood-prime if and only if either k 6≡ 2 (mod 4) or m 6≡ 1 (mod 4) and that
m m
Ck,2 and Ck,3 are neighborhood-prime for all m > 2. Rozario Raj and Sheriff [2659] gave
neighborhood-prime labelings for books with triangular and rectangle pages. Shrimali,
Rathod, and Vihol [2945] proved the following graphs are neighborhood-prime: graphs
obtained from the helm Hn by identifying each vertex of degree 1 with a vertex of Wn ,
graphs obtained from the helm Hn by identifying each vertex of degree 1 with a vertex
of the fan Fn graphs obtained by identifying each pendent vertex of Hn with a vertex of
outer cycle of closed helm of Hn , and graphs obtained by identifying each pendent vertex
of Hn by vertex of outer cycle of the Petersen graph.
Let G(V, E) be a graph with p vertices and Q edges. Rajesh Kumar and Mathew
Varkey [2565] call a bijection from V (G) ∪ E(G) to {1, 2, . . . , p + q} an total neighborhood
prime labeling if for for each vertex of degree at least two, the gcd of labeling on its
neighborhood vertices is 1 and for each vertex of degree at least two, the gcd of labeling on
the induced edges is 1. They proved that paths, combs, and C4n+2 are total neighborhood-
prime graphs. Shrimali and Pandya [2940] proved that the following graphs have total
neighborhood-prime labelings: combs Pn K1 , Pm ∪ Pn , (Pm K1 ) ∪ (Pn K1 ), Wm ∪ Wn ,
graphs obtained from a copy of Pn and n copies K1,n by joining the ith vertex of Pn with
an edge to the center vertex of the ith copy of K1,m , Cn mK1 , and subdivisions of bistars
Bm,n . Shrimali, Rathod, and Vihol [2945] proved that following graphs are neighborhood-
prime graphs: the graph obtained by identifying each pendent vertex of a helm Hn with
a rim vertex of the wheel Wn ; the graph obtained by identifying each pendent vertex of a
helm Hn with a vertex of maximum degree of the fan Pn + K1 ; and the graph obtained by
identifying each pendent vertex of Hn with a vertex of outer cycle of closed helm graph
Hn . Rajesh Kumar [1778] proved that double stars, spiders, caterpillars, and firecrackers
admit total neighborhood-prime labelings.
In [2564] Rajesh Kumar and Mathew Varkey extend the neighborhood-prime labeling
concept to Gaussian integers. Using the spiral order on the Gaussian integers, they showed
the following graphs have Gaussian neighborhood-prime labelings: graphs obtained by
connecting the centers of two stars with a path, combs Pn K1 , spiders, Cn where n 6= 2

the electronic journal of combinatorics (2023), #DS6 280

mod 4, C4 (n > 4) with a cord, graphs obtained by switching of any vertex Cn , and graphs
obtained by duplicating arbitrary vertex of Cn . Rajesh Kumar, Jerome, and Santhosh
Kumar [2562] extended the Gaussian neighborhood-prime labeling concept to Gaussian
total neighborhood-prime labeling. Among the graphs they prove to have a Gaussian
neighborhood-prime labeling are: paths, stars, trees with one vertex of degree at least 3
and all other vertices having degree 1 or 2, and caterpillars. In [2947] Shrimali and Trivedi [2947] new
provided results depending upon the Hamiltonicity of a graph that guarantee that the
graph is Gaussian neighborhood-prime graph under the spiral order and proved that
generalized Petersen graphs are Gaussian neighborhood-prime graphs under the spiral
order.
In [2331] Pandya and Shrimali introduce a vertex-edge neighborhood-prime label-
ing of graphs as follows. For a graph G an injective function f : V (G) ∪ E(G) →
{1, 2, . . . , |V (G)| + |E(G|} is said to be a vertex-edge neighborhood-prime labeling if it
has the following properties: If u has degree 1, then gcd{f (w), f (uw)} = 1 taken over
all vertices w adjacent to u; if u has degree greater than 1, then gcd{f (w)} = 1 taken
over all vertices w adjacent to u and gcd{f (wu)} = 1 taken over all vertices w adjacent
to u. A graph that admits vertex-edge neighborhood-prime labeling is called a vertex-
edge neighborhood-prime graph. They give vertex-edge neighborhood-prime labelings for
paths, helms, Cn ⊕ K1 , bistars, the central edge subdivision of bistars, and subdivisions
of edges of bistars. They observe that every vertex-edge neighborhood-prime graph is a
total neighborhood-prime graph and that a total neighborhood-prime graph that does not
have a vertex of degree 1 is vertex-edge neighborhood-prime. Shrimali and Rathod [2944]
proved that coconut trees, double coconut trees, spiders with legs of equal length, olive
trees, combs, and F (n, 2)-firecrackers have vertex-edge neighborhood-prime labelings.
Patel and Ghodasara [2358] proved the following graphs are neighborhood-prime: one
(k)
point union Cn (k > 2, n > 3) of k copies of cycle Cn , the barycentric subdivision of
wheels and gears, the middle and total graph of crowns Cn K1 (n > 3), the square
of crowns, tadpoles T (n, l) (n > 3, l > 1), cycles, and umbrellas. In [796] Delman,
Koilraj, and Raj gave neighborhood-prime labelings of arbitrary super subdivision of
helms, tadpoles, and triangular snakes.
In [2507] Prajapati and Shah introduce an odd prime labeling as follows. Let G(V, E)
be a graph. A bijection f from V to {1, 3, . . . , 2|V | − 1} is called an odd prime labeling if
for each edge uv, gcd(f (u), f (v)) = 1. A graph that admits odd prime labeling is called
an odd prime graph. They prove paths, ladders, complete bipartite graphs, wheels, gears,
flowers, helms, closed helms, and generalized Petersen graphs P (n, 2) are odd prime and
conjecture that generalized Petersen graphs P (n, k) and every prime graph is an odd
prime graph. In [2508] they proved the following graphs are odd prime graphs: graphs
obtained by duplication of a vertex of paths, stars, and wheels, and graphs obtained by
dupilcation of an edge of cycles, stars, and wheels. Carter and Fox [660] prove that the
disjoint union of cycles; cycle chains; snakes; books; triangular, pentagonal, and hexagonal
stacked prisms; spiders; perfect binary trees; special cases of caterpillars; and firecrackers
are odd prime. They characterize when odd prime labelings exist for powers of paths and
cycles and make progress towards proving the conjecture that all prime graphs are also

the electronic journal of combinatorics (2023), #DS6 281

odd prime. Meena and Gajalakshmi [2125] proved that the corona product of Cn × P2 [2125] new
and K1 , K2 , and K3 are odd prime graphs.
For a graph G(V, E) with p vertices and q edges Shiu, Lau, and Lee [2913] call a
bijection f from E to {1, 2, . . . , q} an edge-prime labeling if for each edge uv in E, we have
gcd(f + (u), f + (v)) = 1, where f + (u) = Σf (uw) over all uw ∈ E. A graph that admits an
edge-prime labeling is called an edge-prime graph. A bijection f from E to {1, 2, . . . , q}
is an semi-edge-prime labeling if for each edge uv in E, we have gcd(f + (u), f + (v)) = 1 or
f + (u) = f + (v). They obtained a necessary and sufficient condition for the disjoint union
of paths to be edge-prime, proved that all 2-regular graphs are edge-prime, proved that
many bipartite and tripartite graphs are edge-prime (or not edge-prime), and showed that
certain bipartite and tripartite graphs are semi-edge-prime graphs. In [1806] Lau, Lee,
and Shiu proved that if G is a cubic graph and every component is of order 4, 6 or 8, then
G is edge-prime if and only if G 6≈ K4 or nK3,3 and n = 2 or 3 (mod 4). They conjectured
that a connected cubic graph G is not edge-prime if and only if G ≈ K4 .
In [1352] Jagadesh and Baskar Babujee introduced an edge vertex prime labeling of
a graph G as an injection f from V (G) ∪ E(G) to {1, 2, . . . , |V (G)| + |E(G)|} such that
for every edge uv, the labels f (u), f (v), and f (uv) are pairwise relatively prime. A graph
that admits such a labeling is called an edge vertex prime graph. They proved that
paths, cycles, and stars are are edge vertex prime. In [2346] and [2347] Parmar proved
that wheels, fans, friendship graphs, and K2,n are edge vertex prime. Simaringa and
Muthukumaran [2960] proved that following graphs have edge vertex prime labelings:
triangular and rectangular books, butterfly graphs, Kn ∪ K1,m , K1,m + K1 , Km ∪ K n ,
Jahangir graphs Jn,3 and Jn,4 . In [2961] Simaringa and Muthukumaran investigated the
existence of edge vertex prime labelings for crowns, unions of cycles, and wheel relate
graphs. Shrimali and Parmar [2941] proved that the following graphs have edge vertex
prime labelings: bistars B(m, n), n-centipede trees, coconut trees obtained from the path
Pn by appending m new pendent edges at an end vertex of Pn ), double coconut trees
(graphs obtained by attaching n > 1 pendent vertices to one end of the path Pr and
m > 1 pendent vertices to the other end of path Pr ), and special classes of banana trees
and firecrackers. In [2942] Shrimali and Parmar showed that helms and graphs obtained
by joining a fan (n > 2) and C2n by sharing a common vertex are edge vertex prime graphs
and that Pn1 ∪ Pn2 ∪ · · · ∪ Pnk and K1,n1 ∪ K1,n2 ∪ · · · ∪ K1,nk are not an edge vertex prime
graphs. They also provided a necessary condition for being edge vertex prime graph.
Rilwan and Radha [2624] investigated edge vertex prime labelings and super edge vertex
prime labelings of Cayley graphs and Cayley digraphs of finite groups. Baskar Babujee
and Jagadesh [498] proved generalized stars K1,n1 ,n2 ,n3 ,...,nm and generalized cycle stars [498] new
Cn ∗ (Pn1 ∪ Pn2 m ∪ . . . ∪ Pnm ) ) that are obtained by joining one of the pendant vertices
of each of the paths with an edge to any vertex of Cn , admit edge vertex prime labelings.
Simaringa and Muthukumaran [2962] proved that the following graphs are edge vertex [2962] new
prime graphs: Cm ∪ K1,n , Cm ∪ Pn , K2,m ∪ Cn , Cn ∪ Cn when n = 0 or 2 mod n, and the
one point union of wheel and cycle-related graphs. They also proved that for graphs G
with |V (G)| + |E(G)| even G ∪ K1,n and G ∪ Pn are edge vertex prime graphs.
In [3558] Youssef and Almoreed gave a new variation of the prime labeling as follows:

the electronic journal of combinatorics (2023), #DS6 282

A graph G(V, E) has an odd prime labeling if its vertices can be labeled with distinct odd
integers from 1 to 2|V (G)| − 1 such that for every edge xy in E the labels assigned to
the vertices of x and y are relatively prime. A graph that admits an odd prime labeling
is called an odd prime graph. They provided some families of odd prime graphs and give
some necessary conditions for a graph to be odd prime. They conjectured that every
prime graph is odd prime graph.
A coprime labeling of vertices of a graph G with distinct labels from the set {1, . . . , m}
for some integer m > n such that adjacent labels are relatively prime. The minimum value
m for which G has a coprime labeling is defined as the minimum coprime number , denoted
by pr(G), and a coprime labeling of G with largest label being pr(G) is called a minimum
coprime labeling of G. Obviously, if G is a prime graph of order n, then pr(G) = n. In
[261] Asplund and Fox focus on the problem of determining the minimum coprime number
for graphs that have been shown to not be prime. Amomg them are Kn (n > 4), W2n+1 ,
and the union of odd cycles. C. Lee [1828] determined the minimum coprime number of
coronas of complete graphs with empty graphs, the joins of two paths, and prisms. She
also proved that gears are prime, double wheels DWn are prime if and only if n is even,
and the graph that obtained by attaching P2 to each vertex of Cn followed by attaching
the star Sm at its center to each pendent vertex is prime.
In [2384] Periasamy, Venugopal, and Rozario Raj introduced the kth Fibonacci prime
labeling of graphs as follows. A kth Fibonacci prime labeling of a graph G(V, E) with
|V (G)| = n is an injective function g from V (G) to {fk , fk+1 , . . . , fk+n−1 } where fk is
the kth Fibonacci number, that induces a function g ∗ from E(G) to the non-negative
integers defined by g(uv) = gcd(g(u), g(v)) = 1 for all uv ∈ E(G). A graph that admits
a kth Fibonacci prime labeling and is called a kth Fibonacci prime graph. They proved
that paths, cycles, Pn K1 , triangular snakes, quadrilateral snakes, and tadpoles are kth
Fibonacci prime graphs.
The tables following summarize the state of knowledge about prime labelings and
vertex prime labelings. In the table, P means prime labeling exists, and VP means
vertex prime labeling exists. A question mark following an abbreviation indicates that
the graph is conjectured to have the corresponding property.

the electronic journal of combinatorics (2023), #DS6 283

 Table 21: Summary of Prime Labelings

Graph Types Notes

Pn P [990]

stars P [990]

complete binary trees P [990]

spiders P [990]

trees P? [1921]

Cn P [804]

Cn ∪ C2m P [804]

Kn P iff n 6 3 [1921]

Wn P iff n is even [3221]

helms P [2769]

fans P [2769]

flowers P [2769]

K2,n P [2769]

K3,n P n 6= 3, 7 [2769]

Pn + K m not P n > 3 [2769]

Pn + K 2 P iff n = 2 or n is odd [2769]

books P [2797]

Cm + Cn not P [2797]

Cn2 not P n > 4 [2797]

Pn2 not P n > 6, n 6= 7 [2797]

Continued on next page

the electronic journal of combinatorics (2023), #DS6 284

 Table 21 – Continued from previous page
Graph Types Notes

Mn (Möbius ladders) not P n even [2797]

Sm ∪ Sn P [3559]

Cm ∪ Sn P [3559]

Km ∪ S n P iff no. of primes 6 m + n + 1

is at least m [3559]

Kn K1 P iff n 6 7 [3559]

Pm × Pn (grids) P m 6 3, n prime [3403]

m prime > 2, p < n 6 p2 [758]

Cn Ki (crowns) P [3221]

Pn K2 P iff n 6= 2 [3403]

Cm -snakes (see §2.2) P [658]

unicyclic P? [2769]

Table 22: Summary of Vertex Prime Labelings

Graph Types Notes

Cm + Cn not P [2797]

Cn2 not P n > 4 [2797]

Pn not P n = 6, n > 8 [2797]

M2n (Möbius ladders) not P [2797]

connected graphs VP [804]

forests VP [804]
Continued on next page

the electronic journal of combinatorics (2023), #DS6 285

 Table 22 – Continued from previous page
Graph Types Notes

C2m ∪ Cn VP [804]

C2m ∪ C2n ∪ C2k+1 VP [804]

C2m ∪ C2n ∪ C2t ∪ Ck VP [804]

5C2m VP [804]

G∪H VP if G, H are connected and

one is not an odd cycle [804]

2-regular graph G not VP G has at least

2 odd cycles
[804]
VP? iff G has at most
1 odd cycle [804]

7.3 Edge-graceful Labelings

In 1985, Lo [1984] introduced the notion of edge-graceful graphs. A graph G(V, E) is said
to be edge-graceful if there exists a bijection f from E to {1, 2, . . . P
, |E|} such that the
+ +
induced mapping f from V to {0, 1, . . . , |V | − 1} given by f (x) = ( f (xy)) (mod |V |)
taken over all edges xy is a bijection. Note that an edge-graceful graph is antimagic (see
§6.1). A necessary condition for a graph with p vertices and q edges to be edge-graceful
is that q(q + 1) ≡ p(p + 1)/2 (mod p). Lee [1838] notes that this necessary condition
extends to any multigraph with p vertices and q edges. It was conjectured by Lee [1838]
that any connected simple (p, q)-graph with q(q + 1) ≡ p(p − 1)/2 (mod p) vertices is
edge-graceful. Lee, Kitagaki, Young, and Kocay [1844] prove that the conjecture is true
for maximal outerplanar graphs. Lee and Murthy [1830] proved that Kn is edge-graceful
if and only if n 6≡ 2 (mod 4). (An edge-graceful labeling given in [1984] for Kn for
n 6≡ 2 (mod 4) is incorrect.) Lee [1838] notes that a multigraph with p ≡ 2 (mod 4)
vertices is not edge-graceful and conjectures that this condition is sufficient for the edge-
gracefulness of connected graphs. Lee [1837] has conjectured that all trees of odd order
are edge-graceful. Small [3006] has proved that spiders for which every vertex has odd
degree with the property that the distance from the vertex of degree greater than 2 to
each end vertex is the same are edge-graceful. Keene and Simoson [1687] proved that all
spiders of odd order with exactly three end vertices are edge-graceful. Cabaniss, Low, and
Mitchem [636] have shown that regular spiders of odd order are edge-graceful. For a (p, q)
connected edge-graceful graph G with q = kp + r, where kis aninteger and 0 6 r < p.

the electronic journal of combinatorics (2023), #DS6 286

Kayathri and Amutha [1679] proved that every edge-graceful labeling f of G induces
((k + 1)!)r (k!)p−r edge-graceful labelings of G.
Lee and Seah [1883] have shown that Kn,n,...,n is edge-graceful if and only if n is odd
and the number of partite sets is either odd or a multiple of 4. Lee and Seah [1882] have
also proved that Cnk (the kth power of Cn ) is edge-graceful for k < bn/2c if and only if
n is odd and Cnk is edge-graceful for k > bn/2c if and only if n 6≡ 2 (mod 4) (see also
[636]). Lee, Seah, and Wang [1888] gave a complete characterization of edge-graceful Pnk
graphs. Shiu, Lam, and Cheng [2906] proved that the composition of the path P3 and any
null graph of odd order is edge-graceful. Uma and Mazuda Shanofer [3234] prove that
C2n+1 K2 is edge graceful and the graphs obtained by starting with Cn and, for each
edge of Cn , adjoining a copy of Cn that shares an edge with the starting copy (the flower
graph F Ln ) is not edge-graceful.
Lo [1984] proved that all odd cycles are edge-graceful and Wilson and Riskin [3480]
proved the Cartesian product of any number of odd cycles is edge-graceful. Lee, Ma,
Valdes, and Tong [1858] investigated the edge-gracefulness of grids Pm ×Pn . The necessity
condition of Lo [1984] that a (p, q) graph must satisfy q(q + 1) ≡ 0 or p/2 (mod p) severely
limits the possibilities. Lee et al. prove the following: P2 × Pn is not edge-graceful for all
n > 1; P3 × Pn is edge-graceful if and only if n = 1 or n = 4; P4 × Pn is edge-graceful if
and only if n = 3 or n = 4; P5 × Pn is edge-graceful if and only if n = 1; P2m × P2n is
edge-graceful if and only if m = n = 2. They conjecture that for all m, n > 10 of the form
m = (2k + 1)(4k + 1), n = (2k + 1)(4k + 3), the grids Pm × Pn are edge-graceful. Riskin
and Weidman [2631] proved: if G is an edge-graceful 2r-regular graph with p vertices and
q edges and (r, kp) = 1, then kG is edge-graceful when k is odd; when n and k are odd,
kCnr is edge-graceful; and if G is the cartesian product of an odd number of odd cycles
and k is odd, then kG is edge-graceful. They conjecture that the disjoint union of an odd
number of copies of a 2r-regular edge-graceful graph is edge-graceful.
Shiu, Lee, and Schaffer [2917] investigated the edge-gracefulness of multigraphs derived
from paths, combs, and spiders obtained by replacing each edge by k parallel edges. Lee,
Ng, Ho, and Saba [1868] construct edge-graceful multigraphs starting with paths and
spiders by adding certain edges to the original graphs. Lee and Seah [1884] have also
investigated edge-gracefulness of various multigraphs.
Lee and Seah (see [1838]) define a sunflower graph SF (n) as the graph obtained by
starting with an n-cycle with consecutive vertices v1 , v2 , . . . , vn and creating new vertices
w1 , w2 , . . . , wn with wi connected to vi and vi+1 (vn+1 is v1 ). In [1885] they prove that
SF (n) is edge-graceful if and only if n is even. In the same paper they prove that C3
is the only triangular snake that is edge-graceful. Lee and Seah [1882] prove that for
k 6 n/2, Cnk is edge-graceful if and only if n is odd, and for k > n/2, Cnk is edge-graceful
if and only if n 6≡ 2 (mod 4). Lee, Seah, and Lo (see [1838]) have proved that for n odd,
C2n ∪ C2n+1 , Cn ∪ C2n+2 , and Cn ∪ C4n are edge-graceful. They also show that for odd k
and odd n, kCn is edge-graceful. Lee and Seah (see [1838]) prove that the generalized
Petersen graph P (n, k) (see Section 2.7 for the definition) is edge-graceful if and only if
n is even and k < n/2. In particular, P (n, 1) = Cn × P2 is edge-graceful if and only if n
is even.

the electronic journal of combinatorics (2023), #DS6 287

 Schaffer and Lee [2725] proved that Cm × Cn (m > 2, n > 2) is edge-graceful if and
only if m and n are odd. They also showed that if G and H are edge-graceful regular
graphs of odd order then G × H is edge-graceful and that if G and H are edge-graceful
graphs where G is c-regular of odd order m and H is d-regular of odd order n, then G × H
is edge-magic if gcd(c, n) = gcd(d, m) = 1. They further show that if H has odd order,
is 2d-regular and edge-graceful with gcd(d, m) = 1, then C2m × H is edge-magic, and if
G is odd-regular, edge-graceful of even order m that is not divisible by 3, and G can be
partitioned into 1-factors, then G × Cm is edge-graceful.
In 1987 Lee (see [1886]) conjectured that C2m ∪ C2n+1 is edge-graceful for all m and
n except for C4 ∪ C3 . Lee, Seah, and Lo [1886] have proved this for the case that m = n
and m is odd. They also prove: the disjoint union of an odd number copies of Cm is edge-
graceful when m is odd; Cn ∪ C2n+2 is edge-graceful; and Cn ∪ C4n is edge-graceful for n
odd. Bu [617] gave necessary and sufficient conditions for graphs of the form mCn ∪ Pn−1
to be edge-graceful.
Kendrick and Lee (see [1838]) proved that there are only finitely many n for which
Km,n is edge-graceful and they completely solve the problem for m = 2 and m = 3. Ho,
Lee, and Seah [1252] use S(n; a1 , a2 , . . . , ak ) where n is odd and 1 6 a1 6 a2 6 · · · 6
ak < n/2 to denote the (n, nk)-multigraph with vertices v0 , v1 , . . . , vn−1 and edge set
{vi vj | i 6= j, i − j ≡ at ( mod n) for t = 1, 2, . . . , k}. They prove that all such multigraphs
are edge-graceful. Lee and Pritikin (see [1838]) prove that the Möbius ladders (see §2.2
for definition) of order 4n are edge-graceful. Lee, Tong, and Seah [1904] have conjectured
that the total graph of a (p, p)-graph is edge-graceful if and only if p is even. They have
proved this conjecture for cycles. In [1695] Khodkar and Vinhage proved that there exists
a super edge-graceful labeling of the total graph of K1,n and the total graph of Cn . Wang
and Zang [3451] proved that a regular graph of odd degree is edge-graceful if it contains
either a quasi-prism factor or a claw factor.
Kuang, Lee, Mitchem, and Wang [1768] have conjectured that unicyclic graphs of odd
order are edge-graceful. They have verified this conjecture in the following cases: graphs
obtained by identifying an endpoint of a path Pm with a vertex of Cn when m + n is
even; crowns with one pendent edge deleted; graphs obtained from crowns by identifying
an endpoint of Pm , m odd, with a vertex of degree 1; amalgamations of a cycle and a
star obtained by identifying the center of the star with a cycle vertex where the resulting
graph has odd order; graphs obtained from Cn by joining a pendent edge to n − 1 of the
cycle vertices and two pendent edges to the remaining cycle vertex.
In [3452] Wang and Zhang introduced the notion called edge-graceful deficiency, which
is a parameter to measure how close a graph is away from being an edge-graceful graph.
The edge-graceful deficiency of a graph G is the minimum value of k such that the edge
labeling f E → {1, 2, . . . , q +k} is edge-graceful. They proved that an odd regular graph is
edge-graceful if it contains a quasi-prism factor or a claw factor and completely determine
the edge-graceful deficiency of Hamiltonian regular graphs of even degree.
Gayathri and Subbiah [1062] say a graph G(V, E) has a strong edge-graceful labeling
if there is an injection f from the E to {1, 2, 3, . . . , h3|E|/2i} such that the induced
mapping f + from V defined by f + (u) = (Σf (uv)) (mod 2|V |) taken all edges uv is an

the electronic journal of combinatorics (2023), #DS6 288

injection. They proved the following graphs have strong edge graceful labelings: Pn (n >
3), Cn , K1,n (n > 2), crowns Cn K1 , and fans Pn + K1 (n > 2). In his Ph.D. thesis [3060]
Subbiah provided edge-graceful and strong edge-graceful labelings for a large variety of
graphs. Among them are bistars, twigs, y-trees, spiders, flags, kites, friendship graphs,
mirror of paths, flowers, sunflowers, graphs obtained by identifying a vertex of a cycle
with an endpoint of a star, and K2 Cn , and various disjoint unions of path, cycles, and
stars.
Hefetz [1205] has shown that a graph G(V, E) of the form G = H ∪ f1 ∪ f2 ∪ · · · ∪ fr
where H = (V, E 0 ) is edge-graceful and the fi ’s are 2-factors is also edge-graceful and that
a regular graph of even degree that has a 2-factor consisting of k cycles each of length t
where k and t are odd is edge-graceful.
Bača and Holländer [334] investigated a generalization of edge-graceful labeling called
(a, b)-consecutive labelings. A connected graph G(V, E) is said to have an (a, b)-
consecutive labeling where a is a nonnegative integer and b is a positive proper divisor
of |V |, if there is a bijection from E to {1, 2, . . . , |E|} such that if each vertex v is as-
signed the sum of all edges incident to v the vertex labels are distinct and they can be
partitioned into |V |/b intervals
Wj = [wmin = (j − 1)b + (j − 1)a, wmin + jb + (j − 1)a − 1], where 1 6 j 6 p/b and
wmin is the minimum value of the vertices. They present necessary conditions for (a, b)-
consecutive labelings and describe (a, b)-consecutive labelings of the generalized Petersen
graphs for some values of a and b.
A graph with p vertices and q edges is said to be k-edge-graceful if its edges can be
labeled with k, k+1, . . . , k+q−1 such that the sums of the edges incident to each vertex are
distinct modulo p. In [1907] Lee and Wang show that for each k 6= 1 there are only finitely
many trees that are k-edge graceful (there are infinitely many 1-edge graceful trees).
They describe completely the k-edge-graceful trees for k = 0, 2, 3, 4, and 5. Gayathri and
Sarada Devi [1037] obtained some necessary conditions and characterizations for k-edge-
gracefulness of trees. They also proved that specific families of trees are edge-graceful and
k-edge-graceful and conjecture that all odd trees are k-edge-graceful.
Gayathri and Sarada Devi [822] defined a k-even edge-graceful labeling of a (p, q) graph
G(V, E) as an injection f from E to {2k − 1, 2k,P 2k + 1, . . . , 2k + 2q − 2} such that the
induced mapping f + of V defined by f + (x) = f (xy) (mod 2s) taken over all edges
xy, are distinct and even, where s = max{p, q} and k is a positive integer. A graph
G that admits a k-even-edge-graceful labeling is called a k-even-edge-graceful graph. In
[822], [1038], [1039], and [1040] Gayathri and Sarada Devi investigate the k-even edge-
gracefulness of a wide variety of graphs. Among them are: paths; stars; bistars; cycles
with a pendent edge; cycles with a cord; crowns Cn K1 ; graphs obtained from Pn by
replacing each edge by a fixed number of parallel edges; and sparklers (paths with a star
appended at an endpoint of the path).
In 1991 Lee [1838] defined the edge-graceful spectrum of a graph G as the set of all
nonnegative integers k such that G has a k-edge graceful labeling. In [1910] Lee, Wang,
Ng, and Wang determine the edge-graceful spectrum of the following graphs: G K1
where G is an even cycle with one chord; two even cycles of the same order joined by an

the electronic journal of combinatorics (2023), #DS6 289

edge; and two even cycles of the same order sharing a common vertex with an arbitrary
number of pendent edges attached at the common vertex (butterfly graph). Lee, Chen, and
Wang [1841] have determined the edge-graceful spectra for various cases of cycles with a
chord and for certain cases of graphs obtained by joining two disjoint cycles with an edge
(i.e., dumbbell graphs). More generally, Shiu, Ling, and Low [2919] call a connected with
p vertices and p + 1 edges bicyclic. In particular, the family of bicyclic graphs includes the
one-point union of two cycles, two cycles joined by a path and cycles with one cord. In
[2920] they determine the edge-graceful spectra of bicyclic graphs that do not have pendent
edges. Kang, Lee, and Wang [1632] determined the edge-graceful spectra of wheels and
Wang, Hsiao, and Lee [3434] determined the edge-graceful spectra of the square of Pn
for odd n. Results about the edge-graceful spectra of three types of (p, p + 1)-graphs are
given by Chen, Lee, and Wang [691]. In [3435] Wang and Lee determine the edge-graceful
spectra of the one-point union of two cycles, the corona product of the one-point union
of two cycles with K1 , and the cycles with one chord.
Lee, Levesque, Lo, and Schaffer [1852] investigate the edge-graceful spectra of cylin-
ders. They prove: for odd n > 3 and m ≡ 2 (mod) 4, the spectra of Cn × Pm is ∅; for
m = 3 and m ≡ 0, 1 or 3 (mod 4), the spectra of C4 × Pm is ∅; for even n > 4, the spectra
of Cn × P2 is all natural numbers; the spectra of Cn × P4 is all odd positive integers if
and only if n ≡ 3 (mod) 4; and Cn × P4 is all even positive integers if and only if n ≡ 1
(mod) 4. They conjecture that C4 × Pm is k-edge-graceful for some k if and only if m ≡ 2
(mod) 4. Shiu, Ling, and Low [2920] determine the edge-graceful spectra of all connected
bicyclic graphs without pendent edges.
A graph G(V, E) is called super edge-graceful if there is a bijection f from E to
{0, ±1, ±2, . . . , ±(|E| − 1)/2} when |E| is odd and from E to {±1, ±2, . . . , ±|E|/2} when
|E| is even such that the induced vertex labeling f ∗ defined by f ∗ (u) = Σf (uv) over all
edges uv is a bijection from V to {0, ±1, ±2, . . . , ±(p − 1)/2} when p is odd and from V
to {±1, ±2, . . . , ±p/2} when p is even. Lee, Wang, Nowak, and Wei [1911] proved the
following: K1,n is super-edge-magic if and only if n is even; the double star DS(m, n)
(that is, the graph obtained by joining the centers of K1,m and K1,n with an edge) is
super edge-graceful if and only if m and n are both odd. They conjecture that all trees of
odd order are super edge-graceful. In [1899] Lee, Su, and Wei exhibit a family of trees of
odd orders which are super edge-graceful. Chung, Lee, Gao and Schaffer [726] posed the
problems of characterizing the paths and tress of diameter 4 that are super edge-graceful.
In [725] Chung, Lee, and Gao prove various classes of caterpillars, combs, and amal-
gamations of combs and stars of even order are super edge-graceful. Lee, Sun, Wei, Wen,
and Yiu [1900] proved that trees obtained by starting with the paths the P2n+2 or P2n+3
and identifying each internal vertex with an endpoint of a path of length 2 are super
edge-graceful.
Shiu [2891] has shown that Cn ×P2 is super-edge-graceful for all n > 2. More generally,
he defines a family of graphs that includes Cn × P2 and generalized Petersen graphs
are follows. For any permutation θ on n symbols without a fixed point the θ-Petersen
graph P (n; θ) is the graph with vertex set {u1 , u2 , . . . , un } ∪ {v1 , v2 , . . . , vn } and edge set
{ui ui+1 , ui wi , wi wθ(i) | 1 6 i 6 n} where addition of subscripts is done modulo n. (The

the electronic journal of combinatorics (2023), #DS6 290

graph P (n; θ) need not be simple.) Shiu proves that P (n; θ) is super-edge-graceful for
all n > 2. He also shows that certain other families of connected cubic multigraphs are
super-edge-graceful and conjectures that every connected cubic of multigraph except K4
and the graph with 2 vertices and 3 edges is super-edge-graceful.
In [2904] Shiu and Lam investigated the super-edge-gracefulness of fans and wheel-like
graphs. They showed that fans F2n and wheels W2n are super-edge-graceful. Although F3
and W3 are not super-edge-graceful the general cases F2n+1 and W2n+1 are open. For a
positive integer n1 and even positive integers n2 , n3 , . . . , nm they define an m-level wheel
as follows. A wheel is a 1-level wheel and the cycle of the wheel is the 1-level cycle. An
i-level wheel is obtained from an (i − 1)-level wheel by appending ni /2 pairs of edges from
any number of vertices of the i − 1-level cycle to ni new vertices that form the vertices in
the i-level cycle. They prove that all m-level wheels are super-edge-graceful. They also
prove that for n odd Cm Kn is super-edge-graceful, for odd m > 3 and even n > 2
Cm Kn is edge-graceful, and for m > 3 and n > 1 Cm Kn is super-edge-graceful. For a
cycle Cm with consecutive vertices v1 , v2 , . . . , vm and nonnegative integers n1 , n2 , . . . , nm
they define the graph A(m; n1 , n2 , . . . , nm ) as the graph obtained from Cm by attaching
ni edges to the vertex vi for 1 6 i 6 m. They prove A(m; n1 , n2 , . . . , nm ) is super-edge-
graceful if m is odd and A(m; n1 , n2 , . . . , nm ) is super-edge-graceful if m is even and all
the ni are positive and have the same parity. Chung, Lee, Gao, and Schaffer [726] provide
super edge-graceful labelings for various even order paths, spiders and disjoint unions
of two stars. In [723] Chung and Lee characterize spiders of even orders that are not
super-edge-graceful and exhibit some spiders of even order of diameter at most four that
are super-edge-graceful. They raised the question of which paths are super edge-graceful.
This was answered by Cichacz, Fronček, and Xu [743] who showed that the only paths
that are not super edge-graceful are P2 and P4 . Cichacz et al. also proved that the only
cycles that are not super edge-graceful are C4 and C6 . Gao and Zhang [1030] proved that
some cases of caterpillars are super edge-graceful.
In [726] Chung, Lee, Gao, and Schaffer asked for a characterize trees of diameter 4 that
are super edge-graceful. Krop, Mutiso, and Raridan [1765] provide a super edge-graceful
labelings for all caterpillars and even size lobsters of diameter 4 that permit such labelings.
They also provide super edge-graceful labelings for several families of odd size lobsters of
diameter 4. They were unable to find general methods that describe super edge-graceful
labelings for a few families of odd size lobsters of diameter 4, although they are able to
show that certain lobsters in these families are super-edge graceful. They conclude with
three conjectures about rooted trees of height 2 and diameter 4.
Although it is not the case that a super edge-graceful graph is edge-graceful, Lee,
Chen, Yera, and Wang [1840] proved that if G is a super edge-graceful with p vertices
and q edges and q ≡ −1 (mod p) when q is even, or q ≡ 0 (mod p) when q is odd, then
G is also edge-graceful. They also prove: the graph obtained from a connected super
edge-graceful unicyclic graph of even order by joining any two nonadjacent vertices by
an edge is super edge-graceful; the graph obtained from a super edge-graceful graph with
p vertices and p + 1 edges by appending two edges to any vertex is super edge-graceful;
and the one-point union of two identical cycles is super edge-graceful. Collins, Magnant,

the electronic journal of combinatorics (2023), #DS6 291

and Wang [752] present a stronger concept of “tight” super-edge-graceful labeling. Such a
super-edge graceful labeling has an additional constraint on the edge and vertices with the
largest and smallest labels. They use this concept to recursively construct tight super-edge
graceful trees of any order.
Gayathri, Duraisamy, and Tamilselvi [1042] calls a (p, q)-graph with q > p even edge-
graceful if there is an injection f from the set of edges to {1, 2, 3, . . . , 2q} such that the
values of the induced mapping f + from the vertex set to {0, 1, 2, . . . , 2q − 1} given by
f + (x) = (Σf (xy))(mod 2q) over all edges xy are distinct and even. In [1042] and [1041]
Gayathri et al. prove the following: cycles are even edge-graceful if and only if the cycles
are odd; even cycles with one pendent edge are even edge-graceful; wheels are even edge-
graceful; gears (see §2.2 for the definition) are not even edge-graceful; fans Pn + K1 are
even edge-graceful; C4 ∪ Pm for all m are even edge-graceful; C2n+1 ∪ P2n+1 are even
(m)
edge-graceful; crowns Cn K1 are even edge-graceful; Cn (see §2.2 for the definition)
are even edge-graceful; sunflowers (see §3.7 for the definition) are even edge-graceful;
triangular snakes (see §2.2 for the definition) are even edge-graceful; closed helms (see
§2.2 for the definition) with the center vertex removed are even edge-graceful; graphs
decomposable into two odd Hamiltonian cycles are even edge-graceful; and odd order
graphs that are decomposable into three Hamiltonian cycles are even edge-graceful.
In [1041] Gayathri and Duraisamy generalized the definition of even edge-graceful to
include (p, q)-graphs with q < p by changing the modulus from 2q the maximum of 2q and
2p. With this version of the definition, they have shown that trees of even order are not
even edge-graceful whereas, for odd order graphs, the following are even edge-graceful:
banana trees (see §2.1 for the definition); graphs obtained joining the centers of two stars
by a path; Pn K1,m ; graphs obtained by identifying an endpoint from each of any number
of copies of P3 and P2 ; bistars (that is, graphs obtained by joining the centers of two stars
with an edge); and graphs obtained by appending the endpoint of a path to the center
of a star. They define odd edge-graceful graphs in the analogous way and provide a few
results about such graphs. Kathiresan, Muthumari, and Ramalakshmi [1673] proved that
Knc ∨ 2K2 and the flower graph F Ln (n > 3) admit edge odd graceful labelings. They
further prove that Pa,b (the graph obtained by identifying the end points of b internally
disjoint paths each of length a) admit odd edge graceful labelings when a and b are odd,
whereas Pa,2 is not edge odd graceful when a > 2.
Paley graphs are dense undirected graphs raised from the vertices as elements of an
appropriate finite field by joining pairs of vertices that differ by a quadratic residue.
In [1571], Kamaraj and Thangakani study the construction of edge even (odd) graceful
labeling for Paley graphs and prove that Paley graphs of prime order are edge even (odd)
graceful. Lee, Pan, and Tsai [1874] call a graph G with p vertices and q edges vertex-
graceful if there exists a labeling f V (G) → {1, 2, . . . , p} such that the induced labeling
f + from E(G) to Zq defined by f + (uv) = f (u) + f (v) (mod q) is a bijection. Vertex-
graceful graphs can be viewed the dual of edge-graceful graphs. They call a vertex-graceful
graph strong vertex-graceful if the values of f + (E(G) are consecutive. They observe
that the class of vertex-graceful graphs properly contains the super edge-magic graphs
and strong vertex-graceful graphs are super edge-magic. They provide vertex-graceful

the electronic journal of combinatorics (2023), #DS6 292

and strong vertex-graceful labelings for various (p, p + 1)-graphs of small order and their
amalgamations.
Shiu and Wong [2933] proved the one-point union of an m-cycle and an n-cycle is
vertex-graceful only if m+n ≡ 0 (mod 4); for k > 2, C(3, 4k −3) is strong vertex-graceful;
C(2n + 3, 2n + 1) is strong vertex-graceful for n > 1; and if the one-point union of two
cycles is vertex-graceful, then it is also strong vertex-graceful. In [3020] Somashekara and
Veena found the number of (n, 2n − 3) strong vertex graceful graphs. Gao, Zhang, and
Xu [1016] proved that Cn , Cn K1 and Cn K1,t are vertex-graceful if n is odd; Cn is
super vertex-graceful if n 6= 4, 6; and Cn K1 is super vertex-graceful if n is even. They
proposed two conjectures on (super)vertex-graceful labelings.
As a dual to super edge-graceful graphs Lee and Wei [1914] define a graph G(V, E) to
be super vertex-graceful if there is a bijection f from V to {±1, ±2, . . . , ±(|V |−1)/2} when
|V | is odd and from V to {±1, ±2, . . . , ±|V |/2} when |V | is even such that the induced
edge labeling f ∗ defined by f + (uv) = f (u)+f (v) over all edges uv is a bijection from E to
{0, ±1, ±2, . . . , ±(|E| − 1)/2} when |E| is odd and from E to {±1, ±2, . . . , ±|E|/2} when
|E| is even. They show: for m and n1 , n2 , . . . , nm each at least 3, Pn1 × Pn2 × · · · × Pnm
is not super vertex-graceful; for n odd, books K1,n × P2 are not super vertex-graceful; for
n > 3, Pn2 × P2 is super vertex-graceful if and only if n = 3, 4, or 5; and Cm × Cn is not
super vertex-graceful. They conjecture that Pn × Pn is super vertex-graceful for n > 3.
In [1918] Lee and Wong generalize super edge-vertex graphs by defining a graph
G(V, E) to be P (a)Q(1)-super vertex-graceful if there is a bijection f from V to
{0, ±a, ±(a + 1), . . . , ±(a − 1 + (|V | − 1)/2)} when |V | is odd and from V to {±a, ±(a +
1), . . . , ±(a−1+|V |/2)} when |V | is even such that the induced edge labeling f ∗ defined by
f + (uv) = f (u) + f (v) over all edges uv is a bijection from E to {0, ±1, ±2, . . . , ±(|E| −
1)/2} when |E| is odd and from E to {±1, ±2, . . . , ±|E|/2} when |E| is even. They
show various classes of unicyclic graphs are P (a)Q(1)-super vertex-graceful. In [1851]
Lee, Leung, and Ng more simply refer to P (1)Q(1)-super vertex-graceful graphs as super
vertex-graceful and show how to construct a variety of unicyclic graphs that are super
vertex-graceful. They conjecture that every unicyclic graph is an induced subgraph of
a super vertex-graceful unicyclic graph. Lee and Leung [1850] determine which trees of
diameter at most 6 are super vertex-graceful graphs and propose two conjectures. Lee,
Ng, and Sun [1870] found many classes of caterpillars that are super vertex-graceful. In
[1025] Gao shows that the generalized butterfly graph Bnt is super vertex-graceful when
(t)
t > 0 is even, Bn0 is super vertex-graceful when n ≡ 0 or 3 (mod 4), and C3 is super
vertex-graceful if and only if t = 1, 2, 3, 5, or 7.
In [712] Chopra and Lee define a graph G(V, E) to be Q(a)P (b)-super edge-graceful if
there is a bijection f from E to {±a, ±(a+1), . . . , ±(a+(|E|−2)/2)} when |E| is even and
from E to {0, ±a, ±(a + 1), . . . , ±(a + (|E| − 3)/2)} when |E| is odd and f + (u) is equal to
the sum of f (uv) over all edges uv is a bijection from V to {±b, ±(b + 1), . . . , (|V | − 2)/2}
when |V | is even and from V to {0, ±b, ±(b + 1), . . . , ±(|V | − 3)/2} when |V | is odd.
They say a graph is strongly super edge-graceful if it is Q(a)P (b)-super edge-graceful for
all a > 1. Among their results are: a star with n pendent edges is strongly super edge-
graceful if and only if n is even; wheels with n spokes are strongly super edge-graceful

the electronic journal of combinatorics (2023), #DS6 293

if and only if n is even; coronas Cn K1 are strongly super edge-graceful for all n > 3;
and double stars DS(m, n) are strongly super edge-graceful in the case that m is odd and
at least 3 and n is even and at least 2 and in the case that both m and n are odd and
one of them is at least 3. Lee, Song, and Valdés [1891] investigate the Q(a)P (b)-super
edge-gracefulness of wheels Wn for n = 3, 4, 5, and 6.
In [1915] Lee, Wang, and Yera proved that some Eulerian graphs are super edge-
graceful, but not edge-graceful, and that some are edge-graceful, but not super edge-
graceful. They also showed that a Rosa-type condition for Eulerian super edge-graceful
graphs does not exist and pose some conjectures, one of which was: For which n, is Kn
is super edge-graceful? It was known that the complete graphs Kn for n = 3, 5, 6, 7, 8 are
super edge-graceful and K4 is not super edge-graceful. Khodkar, Rasi, and Sheikholeslami,
[1694] answered this question by proving that all complete graphs of order n > 3, except
4, are super edge-graceful.
In 1997 Yilmaz and Cahit [3537] introduced a weaker version of edge-graceful called
E-cordial. Let G be a graph with vertex P set V and edge set E and let f a function from
E to {0, 1}. Define f on V by f (v) = {f (uv)|uv ∈ E} (mod 2). The function f is
called an E-cordial labeling of G if the number of vertices labeled 0 and the number of
vertices labeled 1 differ by at most 1 and the number of edges labeled 0 and the number
of edges labeled 1 differ by at most 1. A graph that admits an E-cordial labeling is
called E-cordial. Yilmaz and Cahit prove the following graphs are E-cordial: trees with
n vertices if and only if n 6≡ 2 (mod 4); Kn if and only if n 6≡ 2 (mod 4); Km,n if and
only if m + n 6≡ 2 (mod 4); Cn if and only if n 6≡ 2 (mod 4); regular graphs of degree 1
(n)
on 2n vertices if and only if n is even; friendship graphs C3 for all n (see §2.2 for the
definition); fans Fn if and only if n 6≡ 1 (mod 4); and wheels Wn if and only if n 6≡ 1
(mod 4). They observe that graphs with n ≡ 2 (mod 4) vertices can not be E-cordial.
They generalized E-cordial labelings to Ek -cordial (k > 1) labelings by replacing {0, 1}
by {0, 1, 2, . . . , k − 1}. Of course, E2 -cordial is the same as E-cordial (see §3.7). Vaidya
and Barasara [3249] proved that every graph can be embedded as an induced subgraph of
an E-cordial graph thereby ruling out any possibility of obtaining any forbidden subgraph
characterization for E-cordial graphs. They also proved that a connected graph can be
embedded as an induced subgraph of an E-cordial connected graph and every planar
graph can be embedded as an induced subgraph of an E-cordial planar graph.
Liu, liu, and Wu [1980] provide two necessary conditions for a graph to be Ek -cordial
and prove that Pn (n > 3) is Ep -cordial for odd p. They also discuss the E2 -cordiality of
graphs that have a subgraph that is a 1-factor. Devaraj [808] has shown that M (m, n),
the mirror graph of K(m, n), is E-cordial when m+n is even and the generalized Petersen
graph P (n, k) is E-cordial when n is even. (Recall that P (n, 1) is Cn × P2 .)
In [3324] Vaidya and Vyas prove that the following graphs are E-cordial: the mirror
graphs (see §2.3 for the definition) even paths, even cycles, and the hypercube are E-
cordial. In [3290] they show that the middle graph, the total graph, and the splitting
graph of a path are E-cordial and the composition of P2 n with P2 . (See §2.7 for the
definitions of middle, total and splitting graphs.) In [3291] Vaidya and Lekha [3291]
prove the following graphs are E-cordial: the graph obtained by duplication of a vertex

the electronic journal of combinatorics (2023), #DS6 294

(see §2.7 for the definition) of a cycle; the graph obtained by duplication of an edge (see
§2.7 for the definition) of a cycle; the graph obtained by joining of two copies of even
cycle by an edge; the splitting graph of an even cycle; and the shadow graph (see §3.8 for
the definition) of a path of even order.
Vaidya and Vyas [3325] proved the following graphs have E-cordial labelings: K2n ×P2 ;
P2n × P2 ; Wn × P2 for odd n; and K1,n × P2 for odd n. Vaidya and Vyas [3326] proved
that the Möbius ladders, the middle graph of Cn , and crowns Cn K1 are E-cordial
2
graphs for even n while bistars Bn,n and its square graph Bn,n are E-cordial graphs for
odd n. In [3328] and [3329] Vaidya and Vyas proved the following graphs are E-cordial:
flowers, closed helms, double triangular snakes, gears, graphs obtained by switching of an
arbitrary vertex in Cn except n ≡ 2 (mod 4), switching of rim vertex in wheel Wn except
n ≡ 1 (mod 4), switching of an apex vertex in helms, and switching of an apex vertex in
closed helms. Sugumaran and Vishnu Prakash [3109] proved that the following graphs
are E-cordial: theta graphs, duplication of any vertex in theta graphs, switching of any
vertex in theta graphs, the fusion of any two vertices in theta graphs, and the open star
of n copies of a fixed theta graph (that is, the graph obtained by replacing each endpoint
vertex of K1,n by copies of the theta graph).
In her PhD thesis [3338] Vanitha defines a (p, q) graph G to be directed edge-graceful if
there exists an orientation of G and a labeling of the arcs of G with {1, 2, . . . , q} such that
the induced mapping g on V defined by g(v) = |f + (v) − f − (v)| (mod p) is a bijection
where, f + (v) is the sum of the labels of all arcs with head v and f − (v) is the sum of the
labels of all arcs with tail v. She proves that a necessary condition for a graph with p
vertices to be directed edge-graceful is that p is odd. Among the numerous graphs that
she proved to be directed edge-graceful are: odd paths, odd cycles, fans F2n (n > 2),
wheels W2n , nC3 -snakes, butterfly graphs Bn (two even cycles of the same order sharing
a common vertex with an arbitrary number of pendent edges attached at the common
vertex), K1,2n (n > 2), odd order y-trees with at least 5 vertices, flags F l2n (the cycle
C2n with one pendent edge), festoon graphs Pn mK1 , the graphs Tm,n,t obtained from
a path Pt (t > 2) by appending m edges at one endpoint of Pt and n edges at the other
endpoint of Pt , C3n , P3 ∪ K1,2n+1 , P5 ∪ K1,2n+1 , and K1,2n ∪ K1,2m+1 .
In [599] Boonklurb, Ruamkaew, and Singhun use C(c×a) to denote the graph obtained
by identifying a vertex of c cycles Ca to a single vertex. They provide directed edge-
graceful labelings for C(c × a) in the case when a > 3 is an odd integer and c > 2 and in
the case where a and c are even with a > 4 and c > 2.
The table following summarizes the state of knowledge about edge-graceful labelings.
In the table EG means edge-graceful labeling exists. A question mark following an ab-
breviation indicates that the graph is conjectured to have the corresponding property.

Table 23: Summary of Edge-graceful Labelings

Graph Types Notes

Kn EG iff n 6≡ 2 (mod 4) [1830]
Continued on next page

the electronic journal of combinatorics (2023), #DS6 295

 Table 23 – Continued from previous page
Graph Types Notes

odd order trees EG? [1837]

Kn,n,...,n (k terms) EG iff n is odd or

k 6≡ 2 (mod 4) [1883]

Cnk , k < bn/2c EG iff n is odd [1882]

Cnk , k > bn/2c EG iff n 6≡ 2 (mod 4) [1882]

P3 [Kn ] EG n is odd [1882]

M4n (Möbius ladders) EG [1838]

odd order dragons EG [1768]

odd order unicycilc graphs EG? [1768]

P2m × P2n EG iff m = n = 2 [1858]

Cn ∪ P2 EG n even [1886]

C2n ∪ C2n+1 EG n odd [1886]

Cn ∪ C2n+2 EG [1886]

Cn ∪ C4n EG n odd [1886]

C2m ∪ C2n+1 EG? (m, n) 6= (4, 3) odd [1887]

P (n, k) generalized Petersen EG n even, k < n/2 [1838]

graph

C m × Cn EG? (m, n) 6= (4, 3) [1887]

the electronic journal of combinatorics (2023), #DS6 296

7.4 Radio Labelings
In 2001 Chartrand, Erwin, Zhang, and Harary [680] were motivated by regulations for
channel assignments of FM radio stations to introduce radio labelings of graphs. A radio
labeling of a connected graph G is an injection c from the vertices of G to the natural
numbers such that d(u, v) + |c(u) − c(v)| > 1 + diam(G) for every two distinct vertices
u and v of G. The radio number of c, rn(c), is the maximum number assigned to any
vertex of G. The radio number of G, rn(G), is the minimum value of rn(c) taken over
all radio labelings c of G. Chartrand et al. and Zhang [3580] gave bounds for the radio
numbers of cycles. The exact values for the radio numbers for paths and cycles were
reported by Liu and Zhu [1969] as follows: for odd n > 3, rn(Pn ) = (n − 1)2 /2 + 2; for
even n > 4, rn(Pn ) = n2 /2 − n + 1; rn(C4k ) = (k + 2)(k − 2)/2 + 1; rn(C4k+1 ) = (k +
1)(k − 1)/2; rn(C4k+2 ) = (k + 2)(k − 2)/2 + 1; and rn(C4k+3 ) = (k + 2)(k − 1)/2. However,
Chartrand, Erwin, and Zhang [679] obtained different values than Liu and Zhu for P4 and
P5 . Chartrand, Erwin, and Zhang [679] proved: rn(Pn ) 6 (n − 1)(n − 2)/2 + n/2 + 1
when n is even; rn(Pn ) 6 n(n − 1)/2 + 1 when n is odd; rn(Pn ) < rn(Pn+1 ) (n > 1);
for a connected graph G of diameter d, rn(G) > (d + 1)2 /4 + 1 when d is odd; and
rn(G) > d(d + 2)/4 + 1 when d is even. Karst, Langowitz, Oehrlein, and Troxell [1653]
provide general lower bounds for rck (Cn ) for all cycles Cn when k > diam(Cn ) and show
that these bounds are exact values when k = diam(Cn ) + 1. In [581] Bloomfield, Liu, and
Ramirez combine a lower bound approach with the cyclic group structure to determine the
value of rnk(Cn ) for k > n − 3. For d 6 k < n − 3, they obtain the values of rnk(Cn ) when
n and k have the same parity, and prove partial results when n and k and have different
parities. These results extend the known values of rnd (Cn ) and rnd+1 (Cn ) shown by Liu
and Zhu [1969], and by Karst, Langowitz, Oehrlein, and Troxell in [1653], respectively.
Benson, Porter, and Tomova [535] determined the radio numbers of all graphs of order n
and diameter n − 2. In [1965] Liu obtained lower bounds for the radio number of trees
and the radio number of spiders (trees with at most one vertex of degree greater than
2) and characterized the graphs that achieve these bounds. Bantva, Vaidya, and Zhou
[514] and [515] give a lower bound for the radio number of trees and a necessary and
sufficient condition for their bound to be achieved. They determine the radio number
for symmetric trees (that is, trees whose non-leaf vertices all have the same degree and
whose leaf vertices all have the same eccentricity), banana trees, and firecracker trees. In
[1724] Kola and Panigrahi provide the radio number for a class of caterpillars. In [282]
Bantva and Der-Fen Liu give a lower bound for the radio number of the cartesian product
of two trees. Moreover, they present three necessary and sufficient conditions, and three
sufficient conditions for the product of two trees to achieve this bound. Applying these
results, they determine the radio number of the cartesian product of two stars as well as a
path and a star. Nazeer, Khan, Kousar, and Nazeer [2262] investigated the radio number
for some families of generalized caterpillar graphs. Chakraborty, Nandi, Sen, and Supraja
[664] gave the exact values of rck (G) for powers of paths where the diameter of the graph [664] new
is strictly less than k. Their proof provides a linear time algorithm for providing such
labelings.
Chartrand, Erwin, Zhang, and Harary [680] proved: rn(Kn1 ,n2 ,...,nk ) = n1 + n2 + · · · +

the electronic journal of combinatorics (2023), #DS6 297

nk + k − 1; if G is a connected graph of order n and diameter 2, then n 6 rn(G) 6 2n − 2;
and for every pair of integers k and n with n 6 k 6 2n − 2, there exists a connected graph
of order n and diameter 2 with rn(G) = k. They further provide a characterization of
connected graphs of order n and diameter 2 with prescribed radio number.
Fernandez, Flores, Tomova, and Wyels [926] proved rn(Kn ) = n; rn(Wn ) = n + 2;
and the radio number of the gear graph obtained from Wn by inserting a vertex between
each vertex of the rim is 4n + 2. Morris-Rivera, Tomova, Wyels, and Yeager [2192]
determine the radio number of Cn × Cn . Martinez, Ortiz, Tomova, and Wyels [2097]
define generalized prisms, denoted Zn,s , s > 1, n > s, as the graphs with vertex set
{(i, j) |i = 1, 2 andj = 1, . . . , n} and edge set {((i, j), (i, j ± 1))} ∪ {((1, i), (2, i + σ)) | σ =
− 2 . . . , 0, . . . , 2s }. They determine the radio number of Zn,s for s = 1, 2 and 3. In
 s−1

[278] and [279] Bantva determines the radio number for three families of trees obtained by
taking a graph operation on a given tree or a family of trees and the radio number for the
middle graph of paths. Sun [3126] determined the radio number for the middle graph of a
dandelion (the one-point union of a star and a path), which generalized Bantva’s results
in [279]. Zhang, Nazeer, Habib, Zia, and Ren [3578] determined the radio number for the
generalized Petersen graphs P (4k+2, 2) and provided a lower bound for P (4k, 2). In [3343] [3343] new
Vasoya and Bantva gave a lower bound for the radio number for the Cartesian product
of the generalized Petersen graph and a tree. They give two necessary and sufficient
conditions and three other sufficient conditions to achieve the lower bound. They use
these results to determine the radio number for the Cartesian product of the Petersen
graph and stars.
ELrokh, Badr, Al-Shamiri, and Ramadhan [871] provided upper bounds for the radio
number of triangular snakes and double triangular snakes that improved on those given
by Badr and Moussa [271] and by Saha and Panigrahi in [2668] and [2671]. DeVito,
Niedzialomski, and Warren [814] determined the radio number of all diameter 3 Hamming [814] new
graphs and showed that an infinite subset of them have radio graceful labelings.
In [1202] Ramyal and Sooryanarayana generalized the notion of radio labeling as fol-
lows. Let M be a subset of non-negative integers and (M, ?) be a monoid with the
identity e. A radio ?-labeling of graph G(V, E) is a mapping f : V → M such that
|f (u) − f (v)| ? d(u, v) > diam(G) + 1 − e, for all u, v ∈ V . The radio ?-number rn ? (f )
of a radio ? -labeling f of G is the maximum label assigned to a vertex of G. The radio
?-number of G, denoted by rn ? (G), is the minimum of rn ? (f ) taken over all radio
?-labeling f of G. They completely determine rn ? (G) of some transformation graphs of
paths and cycles where ? is the usual multiplication of integers.
Sooryanarayana and Ranghunath [3037] define a radio labeling f of a graph G to
be a consecutive radio labeling of G if f (V (G)) = {1, 2, . . . , |V (G)|}. They call a graph
for which a consecutive radio labeling exists radio graceful. In her Ph.D. thesis [2274]
Niedzialomski (see also [2275]) investigated the existence of radio graceful labelings of
Cartesian products of graphs. Among her results are: for n > 3 and 1 6 t 6 n − 1 the
Cartesian product of t copies of Kn is radio graceful; for 2 6 p 6 n2 the Cartesian product
of p · dn/pe copies of Kn is radio graceful; the Cartesian product Kn1 × Kn2 , . . . , ×Kns
is radio graceful when n1 , n2 , . . . , ns are relatively prime; certain families of generalized

the electronic journal of combinatorics (2023), #DS6 298

Petersen graphs are radio graceful; and the Cartesian product of t > 1 + n(n2 − 1)/6
copies of Kn is not radio graceful. Locke and Niedzialomski [1985] proved that Kn × P is
radio graceful where P is the Peterson graph. Wyels and Tomova [1985] proved that that
P × P is radio graceful. Sooryanarayana and Raghunath [3037] determine the values of
n for which Cn3 is radio graceful.
For a simple connected graph G with at least 3 vertices the triameter of G, denoted
by tr(G), is the smallest positive integer M such that d(u, v) + d(v, w) + d(w, u) 6 M
for every triplet u, v, and w in V (G). Saha and Basunia [2666] proved that a graph with
diameter 2 is radio graceful if and only if it contains a Hamiltonian path. They also prove
that if both a graph G and its complement G are connected and tr(G) > 9, then G is
radio graceful only if G contains a Hamiltonian path and tr(G) = 5 or 6.
The generalized gear graph Jt,n is obtained from a wheel Wn by introducing t-vertices
between every pair (vi , vi+1 ) of adjacent vertices on the n-cycle of wheel. Ali, Rahim, Ali,
and Farooq [158] gave an upper bound for the radio number of generalized gear graph,
which coincided with the lower bound found in and [2545]. They proved for t < n − 1
and n > 7, rn(Jt,n ) = (nt2 + 4nt + 3n + 4)/2. They pose the determination of the radio
number of Jt,n when n 6 7 and t > n − 1 as an open problem.
Saha and Panigrahi [2669] determined the radio number of the toroidal grid Cm × Cn
when at least one of m and n is an even integer and gave a lower bound for the radio
number when both m and n are odd integers. Liu and Xie [1967] determined the radio
numbers of squares of cycles for most values of n. In [1968] Liu and Xie proved that
rn(Pn2 ) is bn/2c + 2 if n ≡ 1 (mod 4) and n > 9 and rn(Pn2 ) is bn/2 + 1c otherwise. In
[1966] Liu found a lower bound for the radio number of trees and characterizes the trees
that achieve the bound. She also provides a lower bound for the radio number of spiders
in terms of the lengths of their legs and characterizes the spiders that achieve this bound.
Sweetly and Joseph [3179] prove that the radio number of the graph obtained from the
wheel Wn by subdividing each edge of the rim exactly twice is 5n − 3. Marinescu-Ghemeci
[2091] determined the radio number of the caterpillar obtained from a path by attaching
a new terminal vertex to each non-terminal vertex of the path and the graph obtained
from a star by attaching k new terminal vertices to each terminal vertex of the star.
Ahmad and Marinescu-Ghemeci [111] determined the radio numbers of Mongolian tents,
diamonds, fans, and double fans.
Sooryanarayana and Raghunath [3037] determined the radio number of Cn3 , for n 6 20
and for n ≡ 0 or 2 or 4 (mod 6). Sooryanarayana, Vishu Kumar, Manjula [3038] determine
the radio number of Pn3 , for n > 4. Lo and Alegria [1983] completely determine the radio
number for the fourth-power of Pn for n > 6, except when n ≡ 1 (mod 8). Saha and
Panigrahi [2670] prove that for an n-vertex simple connected graph G, the difference
between the upper and lower bounds of the radio number of G2 is at most b(n − 1)/2c.
They also determine the radio number for square of graphs belonging to some specific
class and apply this to find the radio number for square of hypercube Q2n (n 6≡ 0 (mod
2
4)), the square of toroidal grid Tm,n (m + n ≡ 1, 2, 3, 4, 6 (mod 8)), and the square of some
generalized prism graphs. Wang, Xu, Yang, Zhang, Luo, and Wang [3426] determine the
radio number of ladder graphs. Jiang [1544] completely determined the radio number of

the electronic journal of combinatorics (2023), #DS6 299

the grid graph Pm × Pn (m, n > 2). In [3322] Vaidya and Vihol determined upper bounds
on radio numbers of cycles with chords and determined the exact radio numbers for the
splitting graph and the middle graph of Cn . In [1929] Li, Mak, and Zhou determine
the radio number of complete m-ary trees. Kim, Hwang, and Song [1696] determine the
radio numbers of Pn with n > 4 and Km with m > 3. Bantva [280] improved the lower
bound for the radio number of graphs given by Das et al. in [786] and gave necessary and
sufficient condition to achieve the lower bound. He also determined the radio number for
cartesian product of paths Pn and the Peterson graph P and provided a short proof for
the radio number of cartesian product of paths Pn and complete graphs Km given by Kim
[1696]. Bantva [281] determined the radio number of the Cartesian product of a path and [281] new
a wheel.
In [2263] Nazeer, Kousar, and Nazeer give radio and radio antipodal labelings for
certain circulant graphs. In [2264] Nazeer, Kousar, and Munir determined the radio
number and radio antipodal number of non-bipartite cubic graphs of order 2k . Shen,
Dong, Zheng, and Guo [2878] use C(m, t) to denote the caterpiller consisting of a path
x1 x2 · · · xm with t pendent edges at each inner vertex. They determine the exact value
of the radio number of C(m, t) for all integers m > 4 and t > 2, and explicitly construct
an optimal radio labeling. They also show that the radio number and the construction of
optimal radio labelings of paths are the special cases of C(m, t) with t = 2. An edge-joint
graph G is a 1-edge connected graph having an edge uv such that eccentricity of u equuls
the eccentricity of v and deletion of uv disconnects G.
Niranjan and Rao Kola [2278] determined rn(Pn Cm ) when n is even and m > 5
and gave an upper bound for the same when n is odd. For m > 4 they determined the
radio number of Pn Pm when n is even, and gave both upper and lower bounds for
rn(Pn Pm ) when n is odd.
In [655] Canales, Tomova, and Wyels investigated the question of which radio numbers
of graphs of order n are achievable. They proved that the achievable radio numbers of
graphs of order n must lie in the interval [n, rn(Pn )], and that these bounds are the
2
best possible. They also show that for odd n, the integer rn(Pn ) − 1 = (n−1) 2
+ 2 is an
unachievable radio number for any graph of order n. In [3013] Sokolowsky settled the
question of exactly which radio numbers are achievable for a graph of order n.
Adefokun and Ajayi [57] investigated the radio number of K1,m × P2n for the case [57] new
m > 4. They also obtained new lower and upper bounds of the radio number for the case
that m = 3 that improve similar their results in [126]. For a graph H, Naseem, Shabbir, [126] new
and Shaker [2260] use JuH to denote the graph obtained by joining two disjoint copies of [2260] new
a graph H by an edge between the vertices labeled with u in H. They provided a lower
bound for the radio number of such graphs and show that their lower bound is optimal
(i.e., equal to the radio number) for certain a subfamily of JuH. They obtained similar
results for graphs obtained by contracting the edge uv of JuH.
For any connected graph G and positive integer k Chartrand, Erwin, and Zhang,
[678] define a radio k-coloring as an injection f from the vertices of G to the natural
numbers such that d(u, v) + |f (u) − f (v)| > 1 + k for every two distinct vertices u and
v of G. Using rck (f ) to denote the maximum number assigned to any vertex of G by

the electronic journal of combinatorics (2023), #DS6 300

f , the radio k-chromatic number of G, rck (G), is the minimum value of rck (f ) taken
over all radio k-colorings of G. Note that rc1 (G) is χ(G), the chromatic number of G,
and when k = diam(G), rck (G) is rn(G), the radio number of G. Chartrand, Nebesky,
and Zang [686] gave upper and lower bounds for rck (Pn ) for 1 6 k 6 n − 1. Kchikech,
Khennoufa, and Togni [1680] improved Chartrand et al.’s lower bound for rck (Pn ) and
Kola and Panigrahi [1726] improved the upper bound for certain special cases of n. The
exact value of rcn−2 (Pn ) for n > 5 was given by Khennoufa and Togni in [1690] and the
exact value of rcn−3 (Pn ) for n > 8 was given by Kola and Panigrahi in [1726]. Kola and
Panigrahi [1726] gave the exact value of rcn−4 (Pn ) when n is odd and n > 11 and an
upper bound for rcn−4 (Pn ) when n is even and n > 12. In [2667] Saha and Panigrahi
provided an upper and a lower bound for rck (Cnr ) for all possible values of n, k and r and
showed that these bounds are sharp for antipodal number of Cnr for several values of n and
r. Kchikech, Khennoufa, and Togni [1681] gave upper and lower bounds for rck (G × H)
and rck (Qn ). In [1680] the same authors proved that rck (K1,n ) = n(k − 1) + 2 and for
any tree T and k > 2, rck (T ) 6 (n − 1)(k − 1).
Karst, Langowitz, Oehrlein, and Troxell [1653] provide general lower bounds for
rck (Cn ) for all cycles Cn when k > diam(Cn ) and show that these bounds are exact
values when k = diam(Cn ) + 1.
In [638] Čada, Ekstein, Holub, and Togni [638] defined a k-labeling of a connected [638] new
graph as an assignment c of non-negative integers to the vertices of the graph so that for [638] new
every pair of vertices x and y, |c(x) − c(y)| > k + 1 − d(x, y). The radio k-number of a
graph is the largest number that has to be used in a k-labeling of the graph. A distance
graph is a graph with integer vertices, where two vertices are adjacent if the absolute
value of their difference is in some chosen set D. They established some lower and upper
bounds for the radio k-number of graphs with distance sets D(1, 2, . . . , t), D(1, t), and
D(t − 1, t) for a positive t. Korze, Shao, and Vesel [1737] improved some lower and upper [1737] new
bounds for the radio k-labeling number of the same three families studied by Čada et
al. and conjectured that some of these upper bounds for the radio k-labeling number of
D(1, 2, . . . , t) are exact radio k-labeling numbers. They obtained their main results using
theoretical constructions and the mathematical optimization methods of integer linear
programming. Arockiamary and Vijayalakshmi [239] investigated the existence of vertex [239] new
k-labeling of various cyclic snakes and mCn K1 .
For a positive integer k, Arockiamary and Vijayalakshmi [226] define a vertex k-prime [226] new
labeling f of a graph G(V, E) as a bijective function from V to {k, k + 1, . . . , k + |V | − 1}
such that gcd(f (u), f (v) = 1 for every edge uv. A graph G that admits vertex k-prime
labeling is called a vertex k-prime graph. They proved that the class of planar graphs
containing the maximum number of edges possible in a graph with n vertices is vertex
k-prime if and only if n is odd, G ∪ K1,n is vertex k-prime, and if G and H are k-prime
labelings, then so is G ∪ H. They also prove that Kn (n > 4) is not vertex k-prime.
A radio k-coloring of G when k = diam(G) − 1 is called a radio antipodal labeling. The
minimum span of a radio antipodal labeling of G is called the radio antipodal number of G
and is denoted by an(G). Khennoufa and Togni [1686] determined the radio number and
the radio antipodal number of the hypercube by using a generalization of binary Gray

the electronic journal of combinatorics (2023), #DS6 301

codes. They proved that rn(Qn ) = (2n−1 −1)d n+3 2
e+1 and an(Qn ) = (2n−1 −1)d n2 e+ε(n),
with ε(n) = 1 if n ≡ 0 mod 4, and ε(n) = 0 otherwise. In [1124] Gomathi and Venu- [1124] new
gopal provided bounds for the radio antipodal number of honeycombs derived networks—
triangular and rhombic honeycombs. These bounds give the optimum number of channels
(bandwidth) needed for these honeycomb derived networks for effective communication
without interference.
The Dd-distance was introduced by Anto Kinsley and Siva Ananthi [218] as follows.
For a connected graph G, the Dd-length of a connected uv path is defined as Dd(u, v) =
D(u, v) + deg(u) + deg(v). Letting DDd (u, v) denote the Dd-distance between u and v
and diamDd (G) denote the Dd-diameter of G, Viola and Nicholas [3404] define a radio
mean Dd-distance labeling of a connected graph G as an injective map f from V (G) to
the positive integers such that for two distinct vertices u and v of G, DDd (u, v) + d(f (u) +
f (v))/2e > 1 + diamDd (G). The radio mean Dd-distance number of f, rmnDd (f ), is
the maximum label assigned to any vertex of G. The radio mean Dd-distance number
of G, rmnDd (G), is the minimum value of f of G. They determined the radio mean
Dd-distance number of complete graphs, stars, bistars, subdivisions of stars, paths, fans,
and freindship graphs.
The survey article by Panigrahi [2332] includes background information and further
results about radio k-colorings.

7.5 Representations of Graphs modulo n

In 1989 Erdős and Evans [894] defined a representation modulo n of a graph G with
vertices v1 , v2 , . . . , vr as a set {a1 , . . . , ar } of distinct, nonnegative integers each less than
n satisfying gcd(ai − aj , n) = 1 if and only if vi is adjacent to vj . They proved that
every finite graph can be represented modulo some positive integer. The representation
number, Rep(G), is smallest such integer. Obviously the representation number of a graph
is prime if and only if a graph is complete. Evans, Fricke, Maneri, McKee, and Perkel
[909] have shown that a graph is representable modulo a product of a pair of distinct
primes if and only if the graph does not contain an induced subgraph isomorphic to
K2 ∪ 2K1 , K3 ∪ K1 , or the complement of a chordless cycle of length at least five. Nešetřil
and Pultr [2269] showed that every graph can be represented modulo a product of some
set of distinct primes. Evans et al. [909] proved that if G is representable modulo n and
p is a prime divisor of n, then p > χ(G). Evans, Isaak, and Narayan [910] determined
representation numbers for specific families as follows (here we use qi to denote the ith
prime and for any prime pi we use pi+1 , pi+2 , . . . , pi+k to denote the next k primes larger
than pi ): Rep(Pn ) = 2 · 3 · · · · · qdlog (n−1)e ; Rep(C4 ) = 4 and for n > 3, Rep(C2n ) =
2
2 · 3 · · · · · qdlog (n−1)e+1 ; Rep(C5 ) = 3 · 5 · 7 = 105 and for n > 4 and not a power of 2,
2
Rep(C2n+1 ) = 3 · 5 · · · · · qdlog ne+1 ; if m > n > 3, then Rep(Km − Pn ) = pi pi+1 where pi
2
is the smallest prime greater than or equal to m − n + dn/2e; if m > n > 4, and pi is the
smallest prime greater than or equal to m − n + dn/2e, then Rep(Km − Cn ) = qi qi+1 if n
is even and Rep(Km − Cn ) = qi qi+1 qi+2 if n is odd; if n 6 m − 1, then Rep(Km − K1,n ) =
ps ps+1 · · · ps+n−1 where ps is the smallest prime greater than or equal to m − 1; Rep(Km )

the electronic journal of combinatorics (2023), #DS6 302

is the smallest prime greater than or equal to m; Rep(nK2 ) = 2 · 3 · · · · · qdlog ne+1 ; if
2
n, m > 2, then Rep(nKm ) = pi pi+1 · · · pi+m−1 , where pi is the smallest prime satisfying
pi > m, if and only if there exists a set of n − 1 mutually orthogonal Latin squares of
order m; Rep(mK1 ) = 2m; and if t 6 (m − 1)!, then Rep(Km + tK1 ) = ps ps+1 · · · ps+m−1
where ps is the smallest prime greater than or equal to m. Narayan [2258] proved that
for r > 3 the maximum value for Rep(G) over all graphs of order r is ps ps+1 · · · ps+r−2 ,
where ps is the smallest prime that is greater than or equal to r − 1. Agarwal and Lopez
[66] determined the representation numbers for complete graphs minus a set of stars.
Evans [908] used matrices over the additive group of a finite field to obtain various
bounds for the representation number of graphs of the form nKm . Among them are
Rep(4K3 ) = 3 · 5 · 7 · 11; Rep(7K5 ) = 5 · 7 · 11 · 13 · 17 · 19 · 23; and Rep((3q − 1)/2)Kq ) 6
pq pq+1 · · · p(3q−1)/2) where q is a prime power with q ≡ 3 (mod 4), pq is the smallest prime
greater than or equal to q, and the remaining terms are the next consecutive (3q − 3)/2
primes; Rep(2q − 2)Kq ) 6 pq pq+1 · · · p(3q−3)/2) where q is a prime power with q ≡ 3 mod 4,
and pq is the smallest prime greater than or equal to q; Rep((2q −2)Kq ) 6 pq pq+1 · · · p2q−3 .
In [2257] Narayan asked for the values of Rep(C2k +1 ) when k > 3 and Rep(G) when
G is a complete multipartite graph or a disjoint union of complete graphs. He also asked
about the behavior of the representation number for random graphs. Yahyaei and Katre
[3508] gave upper and lower bounds for the representation number of a caterpillar and
exact values in some cases.
Akhtar, Evans, and Pritikin [137] characterized the representation number of K1,n
using Euler’s phi function, and conjectured that this representation number is always of
the form 2a or 2a p, where a > 1 and p is a prime. They proved this conjecture for “small”
n and proved that for sufficiently large n, the representation number of K1,n is of the
form 2a , 2a p, or 2a pq, where a > 1 and p and q are primes. In [138] they showed that for
sufficiently large n > m, rep(Km,n ) = 2a , 3a , 2a pb , or 2a pq, where a, b > 1 and p and q are
primes; and for sufficiently large order, rep(Kn1 ,n2 ,...,nt = pa , pa q b , or pa q b u, where p, q, u
are primes with p, q < u. Akhtar [139] determined the representation number of graphs
of the form K2 ∪ nK1 (he uses the notation K2 + nK1 ) and studies their prime decom-
positions. Using relations between representation modulo r and product representations,
he determined representation number of binary trees and gave an improved lower bound
for hypercubes.

7.6 Product and Divisor Cordial Labelings

Sundaram, Ponraj, and Somasundaram [3133] introduced the notion of product cordial
labelings. A product cordial labeling of a graph G with vertex set V is a function f
from V to {0, 1} such that if each edge uv is assigned the label f (u)f (v), the number
of vertices labeled with 0 and the number of vertices labeled with 1 differ by at most 1,
and the number of edges labeled with 0 and the number of edges labeled with 1 differ by
at most 1. A graph with a product cordial labeling is called a product cordial graph. In
[3133] and [3142] Sundaram, Ponraj, and Somasundaram prove the following graphs are
product cordial: trees; unicyclic graphs of odd order; triangular snakes; dragons; helms;

the electronic journal of combinatorics (2023), #DS6 303

Pm ∪ Pn ; Cm ∪ Pn ; Pm ∪ K1,n ; Wm ∪ Fn (Fn is the fan Pn + K1 ); K1,m ∪ K1,n ; Wm ∪
K1,n ; Wm ∪ Pn ; Wm ∪ Cn ; the total graph of Pn (the total graph of Pn has vertex set
V (Pn ) ∪ E(Pn ) with two vertices adjacent whenever they are neighbors in Pn ); Cn if and
(t)
only if n is odd; Cn , the one-point union of t copies of Cn , provided t is even or both t and
n are even; K2 +mK1 if and only if m is odd; Cm ∪Pn if and only if m+n is odd; Km,n ∪Ps
if s > mn; Cn+2 ∪ K1,n ; Kn ∪ Kn,(n−1)/2 when n is odd; Kn ∪ Kn−1,n/2 when n is even; and
Pn2 if and only if n is odd. They also prove that Km,n (m, n > 2), Pm × Pn (m, n > 2)
and wheels are not product cordial and if a (p, q)-graph is product cordial graph, then
q 6 (p − 1)(p + 1)/4 + 1.
The bicyclic graph B[m, n] is the one-point union of Cm and Cn . Meena and Usharani
[2127] provided product cordial labelings for some bicyclic relalated graphs. Among them [2127] new
are B[n, n], the graphs obtained by adjoining the center of K1,m to each vertex of B[n, n],
B[n, n] K2 , and B[n, n] K3 .
In [2776] Seoud and Helmi obtained the following results: Kn is not product cordial
for all n > 4; Cm is product cordial if and only if m is odd; the gear graph Gm is
product cordial if and only if m is odd; all web graphs are product cordial; the corona of
a triangular snake with at least two triangles is product cordial; the C4 -snake is product
cordial if and only if the number of 4-cycles is odd; Cm Kn is product cordial; and
they determine all graphs of order less than 7 that are not product cordial. Seoud and
Helmi define the conjunction G1 ˆG2 of graphs G1 and G2 as the graph with vertex set
V (G1 ) × V (G2 ) and edge set {(u1 , v1 )(u2 , v2 )| u1 u2 ∈ E(G1 ), v1 v2 ∈ E(G2 )}. They prove:
Pm ˆPn (m, n > 2) and Pm ˆSn (m, n > 2) are product cordial. Nada, Diab, Elrokh, and
Sabra [2239] proved that Pn Cm is product cordial if and only if (n, m) 6= (1, 3) (mod
4). Gao, Lau, and Lee [1027] investigated the friendly index and product-cordial index
sets of a family of Möbius-like cubic graphs. Rokad [2644] proved the following graphs
are product cordial: double wheels DWn = 2Cn + K1 , path unions of finite number of
copies of double wheels, the graphs obtained by joining two copies of double wheels by a
path of arbitrary length, DWn ⊕ K1,n , and DFn ⊕ K1,n (DFn = Pn + K 2 ).
Vaidya and Kanani [3276] prove the following graphs are product cordial: the path
union of k copies of Cn except when k is odd and n is even; the graph obtained by joining
two copies of a cycle by path; the path union of an odd number copies of the shadow
of a cycle (see §3.8 for the definition); and the graph obtained by joining two copies of
the shadow of a cycle by a path of arbitrary length. In [3279] Vaidya and Kanani prove
the following graphs are product cordial: the path union of an even number of copies of
Cn (Cn ); the graph obtained by joining two copies of Cn (Cn ) by a path of arbitrary length;
the path union of any number of copies of the Petersen graph; and the graph obtained by
joining two copies of the Petersen graph by a path of arbitrary length.
Vaidya and Barasara [3238] prove that the following graphs are product cordial: friend-
ship graphs; the middle graph of a path; odd cycles with one chord except when the chord
joins the vertices at a diameter distance apart; and odd cycles with two chords that share
a common vertex and form a triangle with an edge of the cycle and neither chord joins
vertices at a diameter apart. In [3258] Vaidya and Barasara investigated the product
cordial labeling of the line graph of the middle graphs of paths, triangular snakes, armed

the electronic journal of combinatorics (2023), #DS6 304

crowns, the square of paths, the splitting graphs of paths, and the total graph of paths.
In [3265] Vaidya and Dani prove the following graphs are product cordial:
(1) (2) (k) (1) (2) (k)
< Sn : Sn : . . . : Sn > except when k odd and n even; < K1,n : K1,n : . . . : K1,n >; and
(1) (2) (k)
< Wn : Wn : . . . : Wn > if and only if k is even or k is odd and n is even with k > n.
(See §3.7 for the definitions.)
Vaidya and Barasara [3244] proved the following graphs are product cordial: closed
helms, web graphs, flower graphs, double triangular snakes obtained from the path Pn if
and only if n is odd, and gear graphs obtained from the wheel Wn if and only if n is odd.
Vaidya and Barasara [3245] proved that the graphs obtained by the duplication of an
edge of a cycle, the mutual duplication of pair of edges of a cycle, and mutual duplication
of pair of vertices between two copies of Cn admit product cordial labelings. Moreover,
if G and G0 are the graphs such that their orders or sizes differ at most by 1 then the
new graph obtained by joining G and G0 by a path Pk of arbitrary length admits product
cordial labeling.
Vaidya and Barasara [3246] define the duplication of a vertex v of a graph G by a new
edge u0 v 0 as the graph G0 obtained from G by adding the edges u0 v 0 , vu0 and vv 0 to G.
They define the duplication of an edge uv of a graph G by a new vertex v 0 as the graph G0
obtained from G by adding the edges uv 0 and vv 0 to G. They proved the following graphs
have product cordial labelings: the graph obtained by duplication of an arbitrary vertex
by a new edge in Cn or Pn (n > 2); the graph obtained by duplication of an arbitrary edge
by a new vertex in Cn (n > 3) or Pn (n > 3); and the graph obtained by duplicating all
the vertices by edges in path Pn . They also proved that the graph obtained by duplicating
all the vertices by edges in Cn (n > 3) and the graph obtained by duplicating all the edges
by vertices in Cn are not product cordial.
Recall (see [2444], [2431], [2432], [2433]) a double triangular snake DTn consists of two
triangular snakes that have a common path; a double quadrilateral snake DQn consists of
two quadrilateral snakes that have a common path; an alternate triangular snake A (Tn ) is
the graph obtained from a path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to new
vertex vi (that is, every alternate edge of a path is replaced by C3 ); a double alternate
triangular snake DA (Tn ) is obtained from a path u1 , u2 , . . . , un by joining ui and ui+1
(alternatively) to two new vertices vi and wi ; an alternate quadrilateral snake A (Qn ) is
obtained from a path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to new vertices
vi and wi respectively and then joining vi and wi (that is, every alternate edge of a path is
replaced by a cycle C4 ); a double alternate quadrilateral snake DA (Qn ) is obtained from
a path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to new vertices vi , xi and wi
and yi respectively and then joining vi and wi and xi and yi .
Vaidya and Barasara [3248] prove that the shell graph Sn is product cordial for odd
n and not product cordial for even n. They also show that D2 (Cn ); D2 (Pn ); Cn2 ; M (Cn );
S 0 (Cn ); circular ladder CLn ; Möbius ladder Mn ; step ladder S(Tn ) and Hn,n does not
admit product cordial labeling.
Vaidya and Vyas [3332] prove the following graphs are product cordial: alternate
triangular snakes A(Tn ) except n ≡ 3 (mod 4); alternate quadrilateral snakes A(QSn )
except except n ≡ 2 (mod 4); double alternate triangular snakes DA(Tn ) and double

the electronic journal of combinatorics (2023), #DS6 305

alternate quadrilateral snakes DA(QSn ). Vaidya and Vyas [3333] prove the following
graphs are product cordial: the splitting graph of bistar S 0 (Bn,n ); duplicating each edge
by a vertex in bistar Bn,n and duplicating each vertex by an edge in bistar Bn,n . They
also proved that D2 (Bn,n ) is not product cordial.
Ghodasara and Vaghasiya [1092] prove the following graphs admit product cordial
labelings: the path union of an odd number of copies of Cn with a chord except for n = 4,
the path union of an odd number of copies of Cn with twin chords except when n = 6, the
path union of Cn (n > 6) with three cords that form two triangles and a cycle of length
n − 3, the graph obtained by joining two copies of the same cycle that has one chord
by a path, the graph obtained by joining two copies of same cycle that has twin chords
by a path, and the graph obtained by joining two copies of Cn (n > 7) with three cords
that form two triangles and a cycle of length n − 3 by a path. Ghodasara and Vaghasiya
[1093] prove the following graphs are product cordial: the path union of helms, the path
union of closed helms, the path union of gear graphs Gn for odd n, the graph obtained by
joining two copies of the same helm by a path, the graph obtained by joining two copies
of the same closed helm by a path, and the graph obtained by joining two copies of the
same gear graph by a path.
In [285] Bapat proves the following graphs are product cordial: graphs obtained by
identifying an endpoint of Pn with each vertex of C3 , graphs obtained by identifying an
endpoint of Pn with each vertex of C4 , graphs obtained by identifying the degree m vertex
of K1,m with each vertex of C3 , and graphs obtained by identifying the degree m vertex
of K1,m with each vertex of the shell Cn,n−3) (Cn with n − 3 chords that share a common
endpoint) if and only n is even or n is odd and m is even. In [284] Bapat proves K5 Cn
and kayak paddles are product cordial, the one-point union of n copies of Km is product
cordial if and only if n is even, and graphs obtained by identifying one edge of K5 with
each edge of Pn is product cordial if and only if n is even.
Prajapati and Raval [2501] investigated product cordial labelings of the graphs ob-
tained by duplication of verticies and edges of gears and graphs obtained by the vertex
switching operation of gears. In [2502] Prajapati and Raval proved that the book Bm,n is
a product cordial graph if and only if m and n both are odd and m > 3. They showed
that graphs obtained from books by duplicating or deleting vertices or edges are product
cordial. For graphs with an even number of vertices they proved that the duplication of
each of the vertices of a product cordial graph with an edge is a product cordial graph
and that for graphs that have an odd number of vertices and even number of edges the
duplication of each of the vertices of a product cordial graph with an edge is a product
cordial graph.
Kwong, Lee, and Ng [1791] determine the product-cordial index sets of Möbius ladders
and the graphs obtained by subdividing an edge of K4 and an edge of a Möbius ladder that
is not a rung and joining the two new vertices by an edge. They show that no Möbius
ladder is product cordial. Gao, Sun, Zhang, Meng, and Lau [1023] provide sufficient
conditions for a graph to admit (or not admit) a product cordial labeling. Gao, Lau,
and Lee [1022] investigated the friendly index and product-cordial index sets of a family
of cubic graphs known as Möbius-like graphs. Prajapati and Raval [2500] proved that

the electronic journal of combinatorics (2023), #DS6 306

windmills, barbells, the one point union at the apex of copies of a wheel (generalized
wheel), and the one point union of copies of a wheel connected at one common rim vertex
of the wheel are product cordial graphs. They also showed that duplicating all rim edges
with a vertex and duplicating all the vertices with an edge of generalized wheels, and the
graphs obtained by switching an apex vertex in a generalized wheel are product cordial
graphs. Patel, Prajapati, and Kansagara [2363] proved that graphs obtained from the
barbell graph by duplicating all vertices by edges and duplicating all edges by vertices in
the path joining complete graphs are product cordial and the graphs obtained by switching
a vertex of path in the barbell graph are product cordial.
In [2676] Salehi called the set {|ef (0) − ef (1)| : f is a friendly labeling of G} the
product-cordial set of G. He determines the product-cordial sets for paths, cycles, wheels,
complete graphs, bipartite complete graphs, double stars, and complete graphs with an
edge deleted. Salehi and Mukhin [2685] say a graph G of size q is fully product-cordial
if its product cordial set is {q − 2k : 0 6 k 6 bq/2c}. They proved: Pn (n > 2) is fully
product-cordial; trees with a perfect matching are fully product-cordial; and P2 × Pn is
not fully product-cordial. They determine the product-cordial sets of P2 × Pn , Pn × P2m ,
and Pn × P2m+1 , where m > n. Because the product-cordial set is the multiplicative
version of the friendly index set, Kwong, Lee, and Ng [1789] called it the product-cordial
index set of G. They determined the exact values of the product-cordial index set of Cm
and Cm × Pn and that Pm × Pn has the maximum product cordial-index 2mn − m − n. In
[1790] Kwong, Lee, and Ng determined the friendly index sets and product-cordial index
sets of 2-regular graphs and the graphs obtained by identifying the centers of any number
of wheels. In [2679] z Salehi, Churchman, Hill, and Jordan determine the product-cordial
index sets of certain classes of trees.
In [2903] Shiu and Kwong define the full product-cordial index of G under f as FPCI(G)
= {i∗f (G) | f is a friendly labeling of G}. They provide a relation between the friendly
index and the product-cordial index of a regular graph. As applications, they determine
the full product-cordial index sets of Cm and Cm × Cn , which was asked by Kwong,
Lee, and Ng in [1789]. Shiu [2894] determined the product-cordial index sets of grids
Pm × Pn . Recall the twisted cylinder graph is the permutation graph on 4n (n > 2)
vertices, P (2n; σ), where σ = (1, 2)(3, 4) · · · (2n − 1, 2n) (the product of n transpositions).
Shiu and Lee [2916] determined the full friendly index sets and the full product-cordial
index sets of twisted cylinders.
Jeyanthi and Maheswari define a mapping f : V (G) → {0, 1, 2} to be a 3-product
cordial labeling if |vf (i) − vf (j)| 6 1 and |ef (i) − ef (j)| 6 1 for any i, j ∈ {0, 1, 2}, where
vf (i) denotes the number of vertices labeled with i, ef (i) denotes the number of edges
xy with f (x)f (y) ≡ i (mod 3). A graph with a 3-product cordial labeling is called a
3-product cordial graph. In [1455] they prove that for a (p, q) 3-product cordial graph:
2 2
p ≡ 0 (mod 3) implies q 6 p −3p+6 3
; p ≡ 1 (mod 3) implies q 6 p −2p+7 3
; and p ≡ 2 (mod
p2 −p+4
3) implies q 6 3
. They prove the following graphs are 3-product cordial: paths;
stars; Cn if and only if n ≡ 1, 2 (mod 3); Cn ∪ Pn , Cm Kn ; Pm Kn for m > 3 and
n > 1; Wn when n ≡ 1 (mod 3); and the graph obtained by joining the centers of two
identical stars to a new vertex. They also prove that Kn is not 3-product cordial for

the electronic journal of combinatorics (2023), #DS6 307

n > 3 and if G1 is a 3-product cordial graph with 3m vertices and 3n edges and G2 is
any 3-product cordial graph, then G1 ∪ G2 is a 3-product cordial graph. In [1456] they
(1) (2) (k)
prove that ladders, < Wn : Wn : . . . : Wn > (see §3.7 for the definition), graphs
obtained by duplicating an arbitrary edge of a wheel, graphs obtained by duplicating an
arbitrary vertex of a cycle or a wheel are 3-product cordial. They also prove that the
graphs obtained by from the ladders Ln = Pn × P2 (n > 2) by adding the edges ui vi+1
for 1 6 i 6 n − 1, where the consecutive vertices of two copies of Pn are u1 , u2 , . . . , un
and v1 , v2 , . . . , vn and the edges are ui vi . They call these graphs triangular ladders . The
∗
graph Bn,n is obtained from the bistar Bn,n with V (Bn,n ) = {u, v, ui , vi | 1 6 i 6 n}
and E(Bn,n ) = {uv, uui , vvi , vui , uvi | 1 6 i 6 n} by joining u with vi and v with ui
for 1 6 i 6 4. Jeyanthi and Maheswari [1462] proved: the splitting graphs S 0 (K1,n )
and S 0 (Bn,n ) are 3-product cordial graphs; Bn,n ∗
is a 3-product cordial graph if and only
if n ≡ 0, 1 (mod 3); and the shadow graph D2 (Bn,n ) is a 3-product cordial graph if
and only if n ≡ 0, 1 mod 3. Jeyanthi, Maheswari, and Vijaya Laksmi [1477] prove the
following: graphs obtained by switching an apex vertex in a closed helm are 3-product
cordial; Wn are 3-product cordial if and only if n ≡ 2 (mod 3); double fans are 3-product
cordial if and only if n ≡ 0 (mod 3); books are 3-product cordial; and permutation graphs
P (K2 + mK1 ; T ) are 3-product cordial if and only if m ≡ 2 (mod 3). In [1480] Jeyanthi,
Maheswari, and Vijayalaksmi investigated the 3-product cordial behavior of alternate
triangular snakes, double alternate triangular snakes, and triangular snakes.
A k-product cordial labeling of a graph G is a map f from V (G) to {0, 1, . . . , k − 1}
where k is a positive integer at most |V (G)| such that when each edge uv is assigned the
label f (u)f (v) (mod k), the number of verticies (edges) labeled with i and the number of
edges (verticies) labeled with j differ by at most 1. In [1418], [1415], [1420], and [1421]
Jeya Daisy, Sabibha, Jeyanthi, and Youssef showed that the following graphs admit k-
product cordial labelings: fans and double fans when k = 4 and 5; cones (K1 + Cm ) and
double cones (K2 + Cm ) for k = 5. They also proved that double cones are not 4-product
cordial. In [1421] they investigated the k-product cordial behavior of G + Kt , where G is a
k-product cordial graph and found an upper bound of the size of k-product cordial graphs.
In [1415] they investigated the k-product cordial behavior of union of graphs. In [1417] [1417] new
Jeya Daisy, Santrin Sabibha, Jeyanthi, and Youssef proved that the 1-cone Cn + K1 and
double cone Cm +K2 admit 5-product cordial labelings. They also showed that the double
cone does not admit 4-product cordial labeling. In [1416] they define the Napier bridge, [1416] new
Pn (t), as the graph obtained from the path Pn by joining the pairs of vertices u, v of Pn
with d(u, v) = t. They provided necessary and significant conditions for Pn (3), Pn (4) and
Pn (5) to have 3-product and 4-product cordial labelings. In [1419] Jeya Daisy, Sabibha, [1419] new
Jeyanthi and Youssef proved that fans Fn and double fans DFn admit 4-product cordial
labelings and 5-product cordial labelings. In [1422] they investigated the existence of [1422] new
k-product cordial labelings of direct products, Cartesian products, strong products, and
lexicographic products of graphs.
Sundaram and Somasundaram [3137] introduced the notion of total product cordial
labelings. A total product cordial labeling of a graph G with vertex set V is a function
f from V to {0, 1} such that if each edge uv is assigned the label f (u)f (v) the number

the electronic journal of combinatorics (2023), #DS6 308

of vertices and edges labeled with 0 and the number of vertices and edges labeled with 1
differ by at most 1. A graph with a total product cordial labeling is called a total product
cordial graph. In [3137] and [3135] Sundaram, Ponraj, and Somasundaram prove the
following graphs are total product cordial: every product cordial graph of even order or
odd order and even size; trees; all cycles except C4 ; Kn,2n−1 ; Cn with m edges appended
at each vertex; fans; double fans; wheels; helms; Cn × P2 ; K2,n if and only if n ≡ 2 (mod
4); Pm × Pn if and only if (m, n) 6= (2, 2); Cn + 2K1 if and only if n is even or n ≡ 1
(mod 3); Kn × 2K2 if n is odd, or n ≡ 0 or 2 (mod 6), or n ≡ 2 (mod 8). Y.-L. Lai, the
reviewer for MathSciNet [1793], called attention to some errors in [3135]. Pedrano and
Rulete [2376] determined the total product cordial labeling of Pm × Cn , Cm × Cn and the
generalized Petersen graph P (m, n). In [2377] Pedrano and Rulete determined the total
product cordial labeling of Pm Cn , Pm Pn , Cm Pn , Pm Fn , Pm Wn , and Pm Kn .
Villar [3368] proved Pn Cm (n > 2, m > 3) is product cordial, Pn Pm (n, m > 2) is
product cordial except when n and m are both even, and P2n+1 Km (n > 1, m > 4) is
m
not product cordial. Gao, Sun, Zhang, Meng, and Lau [1023] proved that Pn+1 is total
product cordial. Ramanjaneyulu, Venkaiah, and Kothapalli [2576] give total product
cordial labeling for a family of planar graphs for which each face is a 4-cycle.
Vaidya and Vihol [3316] prove the following graphs have total product cordial labelings:
a split graph; the total graph of Cn ; the star of Cn (recall that the star of a graph G is
the graph obtained from G by replacing each vertex of star K1,n by a graph G); the
friendship graph Fn ; the one point union of k copies of a cycle; and the graph obtained
by the switching of an arbitrary vertex in Cn .
Sundaram, Ponraj, and Somasundaram [3140] introduced the notion of EP-cordial
labeling (extended product cordial) labeling of a graph G as a function f from the
verticies of a graph to {−1, 0, 1} such that if each edge uv is assigned the label f (u)f (v),
then |vf (i) − vf (j)| 6 1 and |ef (i) − ef (j)| 6 1 where i, j ∈ {−1, 0, 1} and vf (k) and
ef (k) denote the number of vertices and edges respectively labeled with k. An EP-
cordial graph is one that admits an EP-cordial labeling. In [3140] Sundaram, Ponraj, and
Somasundaram prove the following: every graph is an induced subgraph of an EP-cordial
graph, Kn is EP-cordial if and only if n 6 3; Cn is EP-cordial if and only if n ≡ 1, 2
(mod 3), Wn is EP-cordial if and only if n ≡ 1 (mod 3); and caterpillars are EP-cordial.
They prove that all K2,n , paths, stars and the graphs obtained by subdividing each edge
of a star exactly once are EP-cordial. They also prove that if a (p, q) graph is EP-cordial,
then q 6 1 + p/3 + p2 /3. They conjecture that every tree is EP-cordial.
Ponraj, Sivakumar, and Sundaram [2466] introduced the notion of k-product cordial
labeling of graphs. Let f be a map from V (G) to {0, 1, 2, . . . , k − 1}, where 2 6 k 6 |V |.
For each edge uv assign the label f (u)f (v) (mod k). f is called a k-product cordial
labeling if |vf (i) − vf (j)| 6 1 and |ef (i) − ef (j)| 6 1, i, j ∈ {0, 1, 2, . . . , k − 1}, where vf (x)
and ef (x) denote the number of vertices and edges labeled with x. A graph with a k-
product cordial labeling is called a k-product cordial graph. Observe that 2-product cordial
labeling is simply a product cordial labeling and 3-product cordial labeling is an EP-cordial
labeling. In [2466] and [2467] Ponraj et al. prove the following are 4-product cordial: Pn if
and only n 6 11, Cn if and only if n = 5, 6, 7, 8, 9, or 10, Kn if and only if n 6 2, Pn K1 ,

the electronic journal of combinatorics (2023), #DS6 309

Pn 2K1 , K2,n if and only if n ≡ 0, 3 ( mod 4), Wn if and only if n = 5 or 9, Kn + 2K2 iff
n 6 2, and the subdivision graph of K1,n . Sivakumar [2990] proved the following coronas
are 4-total product cordial: Pn K1 , Pn 2K1 , S(Pn K1 ), S(Pn 2K1 ), S(Cn K1 ) and
S(Cn 2K1 ). Jeyanthi, Maheswari, and Vijayalakshmi [1476] investigated the 3-product
cordial behavior of alternate triangular snakes, double alternate triangular snakes, and
triangular snake graphs. In [1478] they establish that vertex switching graphs of wheels,
gears, and degree splitting of bistars are 3-product cordial graphs.
Let f be a map from V (G) to {0, 1, 2, . . . , k − 1} where 2 6 k 6 |V |. For each edge
uv assign the label f (u)f (v) (mod k). Ponraj, Sivakumar, and Sundaram [2468] define
f to be a k-total product cordial labeling if |f (i) − f (j)| 6 1, i, j ∈ {0, 1, 2, . . . , k − 1},
where f (x) denote the number of vertices and edges labeled with x. A graph with a k-
total product cordial labeling is called a k-total product cordial graph . A 2-total product
cordial labeling is simply a total product cordial labeling. In [2468], [2469], [2470], [2471]
and [2472], Ponraj et al. proved the following graphs are 3-total product cordial: Pn , Cn
if and only if n 6= 3 or 6, K1,n if and only if n ≡ 0, 2 (mod 3), Pn K1 , Pn 2K1 ,
K2 + mK1 if and only if m ≡ 2 (mod 3), helms, wheels, Cn 2K1 , Cn K2 , dragons
Cm @Pn (obtained by identitying an endpoint of Pn with a vertex of Cm ), Cn K1 , bistars
Bm,n , and the subdivision graphs of K1,n , Cn K1 , K2,n , Pn K1 , Pn 2K1 , Cn K2 ,
wheels and helms. They also proved that every graph is a subgraph of a connected k-total
product cordial graph, Bm,n is (n + 2)-total product cordial, and Km,n is (n + 2)-total
product cordial. Ahmad, Hasni, Irfan, Naseem, and Siddiqui [104] proved that Pm × Pn
for m, n > 2 is 3-total edge product cordial. Sharon Philomena and Thirusangu [2870]
proved that the flower graph is 3-total product cordial. Ahmada, Bača, Naseemc, and
Semaničová-Feňovčı́ková [95] described a method for obtaining a 3-total edge product
cordial labeling of the hexagonal grid from a smaller hexagonal grid. In [78] Ahmad
proved that the generalized Petersen graphs P (n, m) are 3-total edge product cordial. In
[267] Azaizeh, Hasni, Lau, and Ahmad proved that complete graphs, bipartite graphs and
generalised friendship graphs have 3-total edge product cordial labelings. Ahmad, Ali,
Bilal, Zafar, and Zahid [82] prove that webs, helms, gears, and Ln 2K1 (Ln is the ladder
with 2n vertices) have 3-total edge product cordial labelings. Ivančo [1342] characterized
graphs admitting a 2-total edge product cordial labeling and proved that dense graphs
and regular graphs of degree 2(k − 1) admit a k-total edge product cordial labeling. Javed
and Jamil [1365] proved that the rhombic grid graphs R1m , R2m and R3m are 3-total edge
product cordial for m > 1 and that the rhombic grid graph Rnm is 3-total edge product
cordial for m, n > 1. Ullah, Rahmat, Numan, Anoh Yannick, and Aslam [3235] proved
that the stellation of Pn × Pn (that is, the graph obtained from Pn × Pn by adding a vertex
in each square of Pn ×Pn and then joining this vertex to each vertex of that square) admits
a 3-total edge product cordial labeling. Bala, Krithika Devi, and Thirusangu [400] proved [400] new
the existence of 3-total cordial edge magic labeling, 3-total sum cordial labeling, and total
product cordial labeling for the square graph of a comb.
In [1779] Kumari and Mehra call a vertex labeling f of a graph G with 0 and 1 with
the induced edge labeling f given by f (uv) = f (u)f (v) a vertex product cordial labeling if
the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by

the electronic journal of combinatorics (2023), #DS6 310

at most 1 and the number of edges labeled with 0 and the number of edges labeled with 1
differ by at most 1. They prove the following graphs have vertex product cordial labelings:
Pn2 if and only if n is odd, the path unions of k copies of Pn2 , Pn K1 , helms, gears Gn
for odd n, graphs obtained from Cn after switching of a vertex, Cn K1 , Cn K̄m , and
certain banana trees.
A labeling f of a graph G(V, E) from V ∪ E to {0, 1} is said to be a total product
cordial labeling of G if f (xy) = f (x)f (y) for all x, y ∈ V and xy ∈ E and the difference
of the total number vertices and edges labeled 0 and the total number vertices and edges
labeled 1 differ by at most 1. Cyrile, Valdehueza, and Pedrano [769] determined the total
edge product cordial labeling of the corona graphs Pn Pm and Pn Cm . Gondalia [1127] [1127] new
proved that the graphs obtained by vertex switching of the following graphs are Fibonacci
product cordial: cycles, cycles with one chord, cycles with twin chords where the chords
form two triangles and one cycle Cn−2 , and cycles with twin chords where chords form
two triangles and one cycle Cn (1, 1, n − 5).
In [998] Gajjar and Raval define an E-sum cordial labeling of a graph G as P an edge [998] new
∗
labeling f : E(G) → {0, 1}, where the induced vertex labeling defined by f (u) = f (uv)
mod 2 over all edges incident to u, has the property that the number of verticies labeled
with 0 and the number of verticies labeled with 1 differ by at most 1, and the number
of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.
They intruduce two new graphs insprited by origamai models that they call the north
star graph and the lotus star (see article for the defintions) and investigate the existence
of cordial labelings, sum cordial labelings, signed product cordial labelings, and E-sum
cordial labelings for these new graph.
In 2019 the concept of a Fibonacci product cordial labeling was introduced by Abraham
and Jose [17] as follows. An injective function f from the vertices of a graph to the set [17] new
{F0 , F1 , F2 , . . . , Fn+1 } where Fj is the jth Fibonacci number is said to be a Fibonacci
cordial labeling if the induced function f ∗ from the edges s to the set {0, 1} defined by
f ∗ (uv) = (f (u)f v))(mod 2) has the property that the number of edges with label 0 and
the number of edges with label 1 differ by at most 1. A graph which admits a Fibonacci
cordial labeling is called a Fibonacci cordial graph. They proved that the following graphs
are Fibonacci product cordial: paths, cycles, wheels Wn except when n = 2 mod 3, and the
Petersen graph. For n > 2, Sulayman and Pedrano [3120] determined Fibonacci cordial [3120] new
labelings of alternate triangular snakes A(Tn ), quadrilateral snakes Qn , cycle quadrilateral
snakes CQn , and for n > 3, double alternate quadrilateral snakes.
For a graph G Sundaram, Ponraj, and Somasundaram [3141] defined the index of
product cordiality, ip (G), of G as the minimum of {|ef (0) − ef (1)|} taken over all the
0-1 binary labelings f of G with |vf (i) − vf (j)| 6 1 and f (uv) = f (u)f (v), where ef (k)
and vf (k) denote the number of edges and the number of vertices labeled with k. They
established that ip (Kn ) = bn/2c2 ; ip (Cn ) = 2 if n is even; ip (Wn ) = 2 or 4 according as n
is even or odd; ip (K2,n ) = 4 or 2 according as n is even or odd; ip (K2 + nK1 ) = 3 if n is
even; ip (G × P2 ) 6 2ip (G); ip (G1 ∪ G2 ) 6 ip (G1 ) + ip (G2 ) + 2 min{∆(G1 ), ∆(G2 )} where
G1 and G2 are graphs of odd order; and ip (G1 G2 ) 6 ip (G1 ) + ip (G2 ) + 2δ(G2 ) + 3 where
G1 and G2 have odd order.

the electronic journal of combinatorics (2023), #DS6 311

 In [3200] Tenguria and Verma called a mapping f from V (G) to {0, 1, 2} such that each
edge uv is labeled (f (u)+f (v)) mod 3 a 3-total super sum cordial labeling if |f (i)−f (j)| 6 1
for i, j ∈ {0, 1, 2}, where f (x) denotes the total number of vertices and edges labeled
with x and for each edge uv, |f (u) − f (v)| 6 1. A graph that has a 3-total super sum
cordial labeling is called 3-total super sum cordial graph. They proved Pm ∪ Pn , Cm ∪ Cn ,
and K1,m ∪ K1,n are 3-total super sum cordial graphs. (These results also appeared in
[3201] and [3202]).
Sridevi, Nagarajan, Nellaimurugan, and Navaneethakrishnan [3043] introduced the [3043] new
notion of Fibonacci divisor cordial labeling of a graph G(V, E) as a bijection f : V →
{F1 , F2 , F3 , . . . , Fp }, where Fi is the ith Fibonacci number such that if each edge uv is
assigned the label 1 if f (u) divides f (v) or f (v) divides f (u) and 0 otherwise, then the
number of edges labeled with 0 and the number of edges labeled with 1 differ by at most
1. If a graph has a Fibonacci divisor cordial labeling, then it is called a Fibonacci divisor
cordial graph. They proved Pn , Cn , K2,n , and the subdivision of the bistar Bn,n are
Fibonacci divisor cordial graphs. They further proved that Kn (n > 3) is not a Fibonacci
divisor cordial graph. Ghosh and Pal [1095] proved that the graphs obtained by the [1095] new
switching of an arbitrary vertex of cycles and wheels, the duplication of an arbitrary
vertex of cycles, the degree splitting graphs of paths, umbrella graphs, and bistars Bn,n
are also Fibonacci divisor cordial graphs. Sridevi, Palani, Navanaeethakrishnan, and
Nagarajan [3044] proved that K1,n for n 6 9 and n = 11, Wn for n = 7, 8, 9, 10 and [3044] new
Cm @Pn are Fibonacci divisor cordial graphs. They also we prove that K1,n for n > 12
and n = 10, and Wn for n = 4, 5, 6 and n > 11 are not Fibonacci divisor cordial graphs.
Vaidya and Vyas [3323] define the tensor product G1 (Tp )G2 of graphs G1 and G2 as
the graph with vertex set V (G1 ) × V (G2 ) and edge set
{(u1 , v1 )(u2 , v2 )| u1 u2 ∈ E(G1 ), v1 v2 ∈ V (G2 )}. They proved the following graphs are
product cordial: Pm (Tp )Pn ; C2m (Tp )P2n ; C2m (Tp )C2n ; the graph obtained by joining two
components of Pm (Tp )Pn an by arbitrary path; the graph obtained by joining two com-
ponents of C2m (Tp )P2n by an arbitrary path; and and the graph obtained by joining two
components of C2m (Tp )C2n by an arbitrary path.
In [2404] Ponraj introduced the notion of an (α1 , α2 , . . . , αk )-cordial labeling of a graph.
Let S = {α1 , α2 , . . . , αk } be a finite set of distinct integers and f be a function from a
vertex set V (G) to S. For each edge uv of G assign the label f (u)f (v). He calls f an
(α1 , α2 , . . . , αk )-cordial labeling of G if |vf (αi ) − vf (αj )| 6 1 for all i, j ∈ {1, 2, . . . , k} and
|ef (αi αj ) − ef (αr αs )| 6 1 for all i, j, r, s ∈ {1, 2, . . . , k}, where vf (t) and ef (t) denote the
number of vertices labeled with t and the number of edges labeled with t, respectively. A
graph that admits an (α1 , α2 , . . . , αk )-cordial labeling is called an (α1 , α2 , . . . , αk )-cordial
graph. Note that an (−α, α)-cordial graph is simply a cordial graph and a (0, α)-cordial
graph is a product cordial graph. Ponraj proved that K1,n is (α1 , α2 , . . . , αk )-cordial if
and only if n 6 k and for α1 6= 0, α2 6= 0, α1 + α2 6= 0 proved the following: Kn is
(α1 , α2 )-cordial if and only if n 6 2; Pn is (α1 , α2 )-cordial; Cn is (α1 , α2 )-cordial if and
only if n > 3; Km,n (m, n > 2) is not (α1 , α2 )-cordial; the bistar Bn,n+1 is (α1 , α2 )-cordial;
Bn+2,n is (α1 , α2 )-cordial if and only if n ≡ 1, 2 (mod 3); Bn+3,n is (α1 , α2 )-cordial if and
only if n ≡ 0, 2 (mod 3); and Bn+r,n , r > 3 is not (α1 , α2 )-cordial. He also proved that if

the electronic journal of combinatorics (2023), #DS6 312

G is an (α1 , α2 )-cordial graph with p vertices and q edges, then q 6 3p2 /8 − p/2 + 9/8. In
[2404] Ponraj proved that combs Pn K1 are (α1 , α2 )-cordial; coronas Cn K1 are (α1 , α2 )-
(t)
cordial for n ≡ 0, 2, 4, 5 (mod 6); C3 is not (α1 , α2 )-cordial; Wn is not (α1 , α2 )-cordial;
and Kn + 2K2 is (α1 , α2 )-cordial if and only if n = 2.
In [3340] Varatharajan, Navanaeethakrishnan Nagarajan define a divisor cordial label-
ing of a graph G with vertex set V as a bijection f from V to {1, 2, . . . , |V |} such that
an edge uv is assigned the label 1 if one f (u) or f (v) divides the other and 0 otherwise,
then the number of edges labeled with 0 and the number of edges labeled with 1 differ by
at most 1. If graph that has a divisor cordial labeling, it is called a divisor cordial graph.
They proved the standard graphs such as paths, cycles, wheels, stars and some complete
bipartite graphs are divisor cordial. They also proved that complete graphs are not divisor
cordial. In [3341] they proved dragons, coronas, wheels, and complete binary trees are
divisor cordial. For t copies S1 , S2 , . . . , St of an n-star K1,n they define hS1 , S2 , . . . , St i as
the graph obtained by starting with S1 , S2 , . . . , St and joining the central vertices of Sk−1
and Sk to a new vertex xk−1 . They prove that hS1 , S2 i and hS1 , S2 , S3 i are divisor cordial.
Vaidya and Shah [3305] proved that the splitting graphs of stars and bistars are divisor
cordial and the shadow graphs and the squares of bistars are divisor cordial. In [3307]
they proved that helms, flower graphs, and gears are divisor cordial graphs. They also
proved that graphs obtained by switching of a vertex in a cycle, switching of a rim vertex
in a wheel, and switching of an apex vertex in a helm admit divisor cordial labelings. Raj
and Valli [2553] proved the following graphs divisor cordial: the duplication of a vertex
of a cycle; graphs obtained by joining two wheels of the same size by a path of length
at least 3; Gv K1 , where Gv is a graph obtained by switching any vertex of a cycle of
size at least 4; graphs obtained by joining the apex vertices of two shells of the same size
to an isolated vertex; graphs obtained by joining the centers of two wheels of the same
size to an isolated vertex; and a class of graphs obtained by removing certain edges from
complete graphs. Bosmia and Kanani [602] proved that the graphs of the form G K1
where G any of the following admits a divisor cordial labeling: K1,n , K2,n , K3,n , a wheel,
a helm, a flower, a fan, a double fan, and a barycentric subdivision of a star. Bosmia
and Kanani [603] prove that the following graphs admit divisor cordial labelings: bistars,
the splitting graph of bistars, the degree splitting graph of bistars, the shadow graph of
bistars, the restricted square graph of bistars, the barycentric subdivision of bistars, and
the corona product of a bistar with K1 . Thirusangu and Madhu [3211] proved that the
extended duplicate graph of star and bistar graphs are divisor cordial graphs.
In [2179] Sugumaran and Mohan proved that the following graphs are divisor cordial
graphs: degree splitting graph of K1,n,n ), the splitting graph of the graph obtained from
two isolated vertices are joined by n paths of length 2, the W − graph (the graph obtained
from two copies of K1,n and identifying the last pendent vertex of the first copy with the
first pendent edge of the secnd copy), B(n) um K1 , where B(n) = 2Pn + K1 (bow graph,
the Herschel graph Hs and switching of an apex vertex in the Herschel graph (see [596, p.
53]. In [3099] Sugumaran and Suresh proved that the following graphs are divisor cordial
graphs: fans, Petersen graphs, Cm K1 , friendship graphs Fn , and the switching of a end
vertex in path Pn , switching of any one of the inner vertices of Petersen graph Pe .

the electronic journal of combinatorics (2023), #DS6 313

 Barasara and Thakkar [432] investigated divisor cordial labelings of armed crowns,
closed helms, webs, and the one point union of t copies of Cn ). In [429] they investigated
divisor cordial labeling of the combs, Pn2 , Cn2 for n 6= 4, and middle graphs of paths and
cycles. Barasara and Thakkar [431] proved that ladders, circular ladders, Möbius ladders,
total graphs of paths, and total graphs of cycles are divisor cordial graphs.
Vaidya and Barasara [3249] proved that every graph can be embedded as an induced
subgraph of a product cordial graph, thereby ruling out any possibility of obtaining any
forbidden subgraph characterization for product cordial graphs. They also proved that
every connected graph can be embedded as an induced subgraph of a product cordial
connected graph and every planar graph can be embedded as an induced subgraph of
a product cordial planar graph. Similar results for total product cordial labeling were
also obtained. In [3260] they prove that every graph can be embedded as an induced
subgraph of a divisor cordial graph, thereby ruling out any possibility of obtaining any
forbidden subgraph characterization for divisor cordial graphs. They also proved that
every connected graph can be embedded as an induced subgraph of a divisor cordial
connected graph and every planar graph can be embedded as an induced subgraph of a
divisor cordial planarr graph.
Gondalia [1126] proved that the Herschel graph, the fusion of any two adjacent vertices
of degree 3 in a Herschel graph, the duplication of any vertex of degree 3 in a Herschel
graph, the switching of a central vertex in the Herschel graph, the joint sum of two copies
of a Herschel graph, and the degree splitting of Herschel graph are divisor cordial graphs.
Motivated by the concept of divisor cordial labeling, Lourdusamy and Patrick [2008]
introduced a new concept of divisor cordial labeling called sum divisor cordial labeling. Let
G = (V (G), E(G)) be a simple graph and f be a bijection from V (G) to {1, 2, . . . , |V (G)|}.
For each edge uv, assign the label 1 if 2 divides f (u) + f (v) and the label 0 otherwise. The
function f is called a sum divisor cordial labeling if the number of edges labeled with 0
and the number of edges labeled with 1 differ by at most 1. A graph which admits a sum
divisor cordial labeling is called a {it sum divisor cordial . They prove that paths, combs,
stars, complete bipartite, K2 +mK1 , bistars, jewels, crowns, flowers, gears, subdivisions of
stars, the graph obtained from K1,3 by attaching the center of K1,n at each pendent vertex
of K1,3 , and the square Bn,n are sum divisor cordial graphs. In [2014] Lourdusamy and [2014] new
Patrick proved that every transformed tree admits a sum divisor cordial labeling. They
also investigated the sum divisor cordial labelings of the graphs obtained by identifying
a vertex of graphs of paths, middle graphs of paths, and the splitting graphs of cycles.
The zero divisor graph of a commutative ring R, Γ(R), is the graph whose vertex set
is set of zero divisors in R in which two distinct vertices u, v are adjacent if uv = 0.
In [2021] Lourdusamy, Jenifer Wency, and Joy Beaula investigate the existence of sum
divisor cordial labelings of graphs of the form Γ(Zn ), Γ(Zm ) + Γ(Zn ), and Γ(Zm ) + Γ(Zn ).
In [3111], [3112], [3113], and [3114] Sugumaran and Rajesh proved that the following
graphs are sum divisor cordial: swastiks, path unions of finite number of copies of swastiks,
cycles of k copies of swastiks, when k is odd, jelly fish, Petersen graphs, theta graphs,
the fusion of any two vertices in the cycle of swastiks, duplication of any vertex in the
cycle of swastiks, the switchings of a central vertex in swastiks, the path unions of two

the electronic journal of combinatorics (2023), #DS6 314

copies of a swastik, the star graph of the theta graphs, the Herschel graph, the fusion of
any two adjacent vertices of degree 3 in Herschel graphs, the duplication of any vertex
of degree 3 in the Herschel graph, the switching of central vertex in Herschel graph, the
path union of two copies of the Herschel graph, H-graph Hn , when n is odd, C3 @K1,n
(obtained by identifying the center of K1,n with a vertex of C3 ), < Fn1 4Fn2 > (the graph
obtained by joining the apex vertices of Fn1 and Fn2 by an edge and by joining the two
apex vertices to a new vertex v 0 ) and open star of swastik graphs S(t.Swn ), when t is odd.
In [3115], [3116] and [3117] Sugumaran and Rajesh proved that the following graphs are
sum divisor cordial graphs: H-graph Hn , when n is even, duplication of all edges of the
H-graph Hn , when n is even, Hn K1 , P (r.Hn ), C(r.Hn ), plus graphs, umbrella graphs,
path unions of odd cycles, kites, complete binary trees, drums graph (two copies of Cn
that share exactly one vertex v and two copies of Pn that have an end point at v, twigs
(graphs obtained from a path by attaching exactly two pendent edges to each internal
vertices of the path), fire crackers of the form Pn Sn , where n is even, and the double
arrow graph DAnm , where |m − n| 6 1 and n is even (obtained from Pm × Pn by adding
two new vertices u and v such that each of the top row vertices of Pm × Pn are connected
to u by an edge and the bottom row vertices of Pm × Pn are connected to v by an edge).
Sugumaran and Rajesh [3098] proved that the following graphs are sum divisor cordial:
Pn + Pn (n is odd), Pn @K1,m (obtained by identifying an endpoint of Pn with the center
of K1,n ), Cn @K1,m (n is odd), the graph obtained from W2n by attaching the apex vertex
of a copy of K1,m to each rim vertex, the graph obtained by joining the central vertices of
two copies of K1,n,n by an edge and to a new vertex, the graph obtained by starting with
Cn and, for each edge of Cn , adjoining a copy of Cn that shares an edge with the starting
copy (the flower graph F Ln ). In [54] Adalja and Ghodasara provide sum divisor cordial
labelings for the graphs resulting from the duplication of graph elements in stars, cycles,
and paths. In [2543] Raheem, Javaid, Numan, and Hasni investigated the existence sum
divisor cordial labelings for the disjoint union of paths and subdivided stars.
Murugesan [2227] introduced a square divisor cordial labeling. Let G be a simple
graph and f :→ {1, 2, . . . , |V (G)|} a bijection. For each edge uv, assign the label 1 if
either (f (u))2 divides f (v) or (f (v))2 divides f (u) and the label 0 otherwise. Call f a
square divisor cordial labeling if |ef (0) − ef (1)| 6 1. A graph with a square divisor cordial
labeling is called a square divisor cordial graph. Murugesan proved that the following are
square divisor cordial graphs: Pn (n 6 12), Cn (3 6 n 6 11), wheels, some stars, some
complete bipartite graphs, and some complete graphs. Vaidya and Shah [3311] proved
that the following are square divisor cordial graphs: flowers, bistars, shadow graphs of
stars, splitting graphs of stars and bistars, degree splitting graphs of paths and bistars.
Kanani and Bosmia [1574] define a cube divisor cordial labeling f of a simple graph G
as a bijection from V (G) to {1, 2, . . . , |V (G)|} such that, when each edge uv is assigned
the label 1 if (f (u))3 divides f (v) or (f (v))3 divides f (u) and the label 0 otherwise, it
holds that |ef (0) − ef (1)| 6 1. A graph with a cube divisor cordial labeling is called a cube
divisor cordial graph. They proved that the following graphs admit cube divisor cordial
labelings: Kn if and only if n = 1, 2, 3; K1,n if and only if n = 1, 2, 3; K2,n for all n; K3,n
if and only if n = 1, 2; bistars Bn,n for all n ; and the graph obtained by joining leaves of

the electronic journal of combinatorics (2023), #DS6 315

one star of a bistar with the center of the opposite star of the bistar. Kanani and Bosmia
[1574] prove: the edge deleted graph of a cube divisor cordial graph is also a cube divisor
cordial graph; Pn is a cube divisor cordial graph if and only if n = 1, 2, 3, 4, 5, 6, 8; Cn is a
cube divisor cordial graph if and only if n = 3, 4, 5; and wheels, flowers and fans are cube
divisor cordial,
The Lucas sequence of numbers is a linear recurrence relation satisfying the conditions:
l1 = 1, l2 = 3 and ln = ln−1 + ln−2 , n > 3. Let G = (V, E) be a simple graph and
f : V (G) → {l1 , l2 , . . . , l|V (G)| } be a bijection such that each edge uv, assign the label 1 if
either f (u) divides f (v) or f (v) divides f (u) and label 0 otherwise. In [3119] Sugumaran
and Rajesh call such an f a Lucas divisor cordial labeling if |ef (0) − ef (1)| 6 1. A graph
with a Lucas divisor cordial labeling is called a Lucas divisor cordial graph. In [3119]
Sugumaran and Rajesh proved that the following graphs are Lucas divisor cordial graphs:
bistars, jelly fish, square graphs of bistars, switching of a vertex in cycles, and switching
of a pendent vertex in paths.
A variation of divisor cordial labeling called vertex odd divisor cordial labeling was
introduced by Muthaiyan and Pugalenthi (see [2228]) as follows. Let G be a graph with
p vertices and a bijection f from V (G) to {1, 3, 5, . . . , 2p − 1} such that if each edge uv is
assigned the label 1 if f (u) divides f (v) or f (v) divides f (u), and the label 0 otherwise.
The function f is called a vertex odd divisor cordial labeling if |ef (0) − ef (1)| 6 1. A
graph with vertex odd divisor cordial labeling is called a vertex odd divisor cordial graph.
Muthaiyan and Pugalenthi (see [2228]) proved paths, cycles, K2,n , K1,n ∪ K1,m , helms,
(1) (2)
flowers, < K1,n , K1,n >, the switching of the apex vertex in helms, and the splitting graph
of stars are vertex odd divisor cordial graphs under some conditions. In [2228] Muthaiyan
and Pugalenthi proved the following graphs have vertex odd divisor cordial labelings:
wheels, the switching of a pendent vertex in paths and cycles, bistars Bn,n , the subdivision
2 (1) (2) (3)
graph of K1,n , Bn,n , DS(Bn,n ), the splitting graph of Bn,n , and < K1,n , K1,n , K1,n >.
Let G1 and G2 be two copies of any graph G that has an apex vertex. The graph
obtained by joining the apex vertices of G1 and G2 by an edge and the graph obtained by
joining the apex vertices of G1 and G2 by an edge and by joining the two apex vertices
to a new vertex v 0 , is denoted G1 4G2 . For any vertex u of Km,n the graph obtained by
joining u to a new pendent vertex is denoted by Km,n u(K1 ). In [3103] Sugumaran
and Suresh proved that the following graphs are vertex odd divisor cordial graphs: the
shadow graph of K1,n , K2,n u(K1 ), K1,n 4K1,n , the subdivision of the edge between
the apex vertices of Bn,n , and the graph K1,n ∗ Pn+2 (the graph obtained by identifying
an end vertex of Pn+2 with the apex vertex of K1,n ). In [3102] they showed that the
graphs Fn 4Fn , K1,n 4K1,n 4K1,n , K1,n 4K1,n 4K1,n 4K1,n , theta graphs, and switching
of a vertex in a Petersen graph are vertex odd divisor cordial graphs. In [3104] they
proved that gears, switching of an apex vertex in S(K1,n ), P2 + mK1 , C(n, n − 3), and
C(n, n − 4) are vertex odd divisor cordial graphs. In [3100] they showed that the globe
Gl(n), jewels, G ∗ Wn (appending the central vertex of wheel Wn with any one of the
vertices of G), G ∗ C(n, n − 3), and wheels are vertex odd divisor cordial graphs.
Let f : V (G) → {1, 2, . . . , |V (G)|} be an injective map. For each edge uv assign the
label r where r is the remainder when f (u) is divided by f (v) or f (v) is divided by f (u)

the electronic journal of combinatorics (2023), #DS6 316

according as f (u) > f (v) or f (v) > f (u). The function f is called a remainder cordial
labeling of G if |ef (0) − ef (1)| 6 1 where ef (0) and ef (1) respectively denote the number
of edges labelled with even integers and number of edges labelled with odd integers. A
graph G with admits a remainder cordial labeling is called a remainder cordial graph.
In [2419] Ponraj, Annathurai, and Kala investigated the remainder cordial behavior of
S(K1,n ), S(Bn,n ), S(Wn ) and union of some star related graphs. Ponraj, Gayathri, and
Somasundaram [2421] investgated the 4-remainder cordial labeling behavior of parachutes,
twigs, and kayak paddles graphs.
A double divisor cordial labeling of a graph G(V, E) is a bijective function ψ from V
to {1, 2, 3, . . . , |V |} such that each edge ab is given label 1 if 2ψ(a)|ψ(b) or 2ψ(b)|ψ(a)
and 0 otherwise, then the number of edges labeled 0 and the number of edges labeled 1
differ by at most 1. An graph that admits a double divisor cordial labeling is said to be
a double divisor cordial graph. In [2351] Parthiban and Sharma proved that the following
graphs admit double divisor cordial labelings: full binary trees, Pn (n > 3), Cn , Wn (n
odd), helms, fans, stars, bistars, jelly fish, and friendship graphs. They also prove that
Kn (n > 5) does not admit a double divisor cordial labeling. Sharma and Parthiban [2868]
proved that the following graphs admit double divisor cordial labelings: the barycentric
subdivision of stars and bistars B(n, n); the splitting graph of K1,n (n > 2); the splitting
(1) (2) (1) (2) (3)
graph of B(m, n) (m, n > 2); hK1,n , K1,n i; hK1,n , K1,n , K1,n i; the graph constructed by
connecting an apex vertex of one copy of Bn,n to a new vertex r an apex vertex of another
copy of Bn,n to another vertices s; and Ki,n K1 for i = 1, 2, and 3.

7.7 Edge Product Cordial Labelings

Vaidya and Barasara [3249] introduced the concept of edge product cordial labeling as
edge analogue of product cordial labeling. An edge product cordial labeling of graph G
is an edge labeling function f : E(G) → Q {0, 1} that induces a vertex labeling function
∗ ∗
f : V (G) → {0, 1} defined as f (u) = {f (uv) | uv ∈ E(G)} such that the number of
edges labeled with 0 and the number of edges labeled with 1 differ by at most 1 and the
number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at
most 1. A graph with an edge product cordial labeling is called an edge product cordial
graph.
In [3249], [3260], [3252], [3253], and [3256] Vaidya and Barasara proved the following
graphs are edge product cordial: Cn for n odd; trees with order greater than 2; unicyclic
(t)
graphs of odd order; Cn , the one point union of t copies of Cn for t even or t and n both
odd; Cn K1 ; armed crowns Cm Pn ; helms; closed helms; webs; flowers; gears; shells
Sn for odd n; tadpoles Cn @Pm for m + n even or m + n odd and m > n while not edge
product cordial for m + n odd and m < n; triangular snakes; for odd n, double triangular
snakes DTn , quadrilateral snakes Qn and double quadrilateral snakes DQn ; Pn2 for odd
n; M (Pn ), T (Pn ); S 0 (Pn ) for even n; the tensor product of Pm and Pn ; and the tensor
product of Cn and Cm if m and n are even. In [3257] Vaidya and Barasara investigate
product and edge product cordial labelings of the degree splitting graphs of paths, shells,
bistars, and gear graphs. They proved the following graphs are not edge product cordial:

the electronic journal of combinatorics (2023), #DS6 317

Cn for n even; Kn for n > 4; Km,n for m, n > 2; wheels; the one point union of t copies of
Cn for t odd and n even; shells Sn for even n; tadpoles Cn @Pm for m + n odd and m < n;
for n even double triangular snake DTn , quadrilateral snake Qn and double quadrilateral
snake DQn ; double fans; Cn2 for n > 3; Pn2 for even n; D2 (Cn ), D2 (Pn ); M (Cn ); T (Cn );
S 0 (Cn ); S 0 (Pn ) for odd n; Pm × Pn and Cm × Cn ; the tensor product of Cn and Cm if m
or n odd; and Pn [P2 ] and Cn [P2 ].
Barasara [428] proved that Cn with one chord except when n is even and the chord joins
vertices that are at diameter distance, Cn with twin chords except when n is even and the
chords join vertices that are at diameter distance, and Pn K1 are edge product cordial
graphs, whereas triangular ladders are not edge product cordial. In [3250], Barasara
proved that Cn with one chord, Cn with twin chords, Pn K1 , and triangular ladders are
total edge product cordial graphs. Vaidya and Barasara [3259] proved that every graph
can be embedded as an induced subgraph of an edge product cordial graph, thereby ruling
out any possibility of obtaining any forbidden subgraph characterization for edge product
cordial graphs. They also proved that every connected graph can be embedded as an
induced subgraph of an edge product cordial connected graph and every planar graph can
be embedded as an induced subgraph of an edge product cordial planar graph. In [427],
Barasara proved that the shadow graph of Wn and the splitting graph of Wn are not edge
product cordial graphs, whereas the middle graph of Wn is edge product cordial for n > 5,
and the total graph of Wn is edge product cordial for n > 8. He also investigated total
edge product cordial labeling of the shadow graph, the splitting graph, the middle graph,
and the total graph of Wn .
Vaidya and Barasara [3260] proved that every graph can be embedded as an induced
subgraph of a total edge product cordial graph thereby ruling out any possibility of
obtaining any forbidden subgraph characterization for total edge product cordial graphs.
They also proved that a connected graph can be embedded as an induced subgraph of a
total edge product cordial connected graph and every planar graph can be embedded as
an induced subgraph of a total edge product cordial planar graph.
Prajapati and Shah [2506] proved the following graphs are edge product cordial: graphs
obtained from a crown by duplication of a vertex, duplication of a vertex by an edge, or
duplication of an edge by a vertex; graphs obtained from a gear graph by duplication of
each of the vertices of degree three by an edge; and the graph obtained from a helm by
duplication of each of the pendent vertices by a new vertex. In [2498] Prajapati and Patel
provided results about the existence of edge product cordial labelings closed webs, lotus
inside a circle, and sunflower graphs.
Vaidya and Barasara [3254] introduced the concept of a total edge product cordial
labeling as edge analogue of total product cordial labeling. An total edge product cordial
labeling of graph G is an edge labeling function f : E(G)
∗ ∗
Q→ {0, 1} that induces a vertex
labeling function f : V (G) → {0, 1} defined as f (u) = {f (uv) | uv ∈ E(G)} such that
the number of edges and vertices labeled with 0 and the number of edges and vertices
labeled with 1 differ by at most 1. A graph with total edge product cordial labeling is
called a total edge product cordial graph.
In [3254] and [3255] Vaidya and Barasara proved the following graphs are total edge

the electronic journal of combinatorics (2023), #DS6 318

product cordial: Cn for n 6= 4; Kn for n > 2; Wn ; Km,n except K1,1 and K2,2 ; gears;
(t)
Cn , the one point union of t copies of Cn ; fans; double fans; Cn2 ; M (Cn ); D2 (Cn ); T (Cn );
S 0 (Cn ); Pn2 for n > 2; M (Cn ); D2 (Cn ) for n > 2; T (Cn ); S 0 (Cn ). Moreover, they prove
that every edge product cordial graph of either even order or even size admits total edge
product cordial labeling. Bača, Irfan, Javad, and Semaničová-Feňočová [337] investigated
the existence of total edge product cordial labeling of toroidal fullerenes and for Klein-
bottle fullerenes. Prajapati and Patel [2499] proved that the one point union of t copies
of a wheel with a rim vertex in common is edge product cordial if and only is t is even;
all pentagonal snakes (obtained from the path by replacing every edge of a path by C5 )
are edge product cordial; and a double pentagonal snakes (two pentangonal snakes that
have a common path) is edge product cordial if and only is t is odd.
In [2514] Prasad and Maheswari developed a technique for coding a secret messages
using sunflower graphs by subdividing edges and applying edge product cordial labeling.

7.8 Difference Cordial Labelings

Ponraj, Sathish Narayanan, and Kala [2443] introduced the notion of difference cordial
labelings. A difference cordial labeling of a graph G is an injective function f from V (G)
to {1, . . . , |V (G)|} such that if each edge uv is assigned the label |f (u)−f (v)|, the number
of edges labeled with 1 and the number of edges not labeled with 1 differ by at most 1.
A graph with a difference cordial labeling is called a difference cordial graph.
The following definitions appear in [2444], [2431], [2432], and [2433]. A double trian-
gular snake DTn consists of two triangular snakes that have a common path; a double
quadrilateral snake DQn consists of two quadrilateral snakes that have a common path;
an alternate triangular snake A (Tn ) is the graph obtained from a path u1 , u2 , . . . , un by
joining ui and ui+1 (alternatively) to new vertex vi (that is, every alternate edge of a
path is replaced by C3 ); a double alternate triangular snake DA (Tn ) is obtained from a
path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to two new vertices vi and wi ;
an alternate quadrilateral snake A (Qn ) is obtained from a path u1 , u2 , . . . , un by joining
ui and ui+1 (alternatively) to new vertices vi and wi respectively and then joining vi and
wi (that is, every alternate edge of a path is replaced by a cycle C4 ); a double alternate
quadrilateral snake DA (Qn ) is obtained from a path u1 , u2 , . . . , un by joining ui and ui+1
(alternatively) to new vertices vi , xi and wi and yi respectively and then joining vi and
wi and xi and yi .
In [2432] and [2433] Ponraj and Sathish Narayanan define the irregular triangular snake
ITn as the graph obtained from the path Pn : u1 , u2 , . . . , un with vertex set V (ITn ) =
V (Pn ) ∪ {vi : 1 6 i 6 n 6 2} and the edge set E(ITn ) = E(Pn ) ∪ {ui vi , vi ui+2 :
1 6 i 6 n − 2}. The irregular quadrilateral snake IQn is obtained from the path Pn :
u1 , u2 , . . . , un with vertex set V (IQn ) = V (Pn ) ∪ {vi , wi : 1 6 i 6 n − 2} and edge set
E (IQn ) = E (Pn ) ∪ {ui vi , wi ui+2 , vi wi : 1 6 i 6 n − 2}. They proved the following graphs
are difference cordial: triangular snakes Tn , quadrilateral snakes, alternate triangular
snakes, alternate quadrilateral snakes, irregular triangular snakes, irregular quadrilateral
snakes, double triangular snakes DTn if and only if n 6 6, double quadrilateral snakes,

the electronic journal of combinatorics (2023), #DS6 319

double alternate triangular snakes DA (Tn ), and double alternate quadrilateral snakes.
In [2443], [2430], [2444], and [2431] Ponraj, Sathish Narayanan, and Kala proved the
following graphs have difference cordial labelings: paths; cycles; wheels; fans; gears; helms;
K1,n if and only if n 6 5; Kn if and only if n 6 4; K2,n if and only if n 6 4; K3,n if and
only if n 6 4; bistar B1,n if and only if n 6 5; B2,n if and only if n 6 6; B3,n if and only if
n 6 5; DTn K1 ; DTn 2K1 ; DTn K2 ; DQn K1 ; DQn 2K1 ; DQn K2 ; DA (Tn ) K1 ;
DA (Tn ) 2K1 ; DA (Tn ) K2 ; DA (Qn ) K1 ; DA (Qn ) 2K1 ; and DA (Qn ) K2 . They
also proved: if G is a (p, q) difference cordial graph, then q 6 2p − 1; if G is a r-regular
graph with r > 4, then G is not difference cordial; if m > 4 and n > 4, then Km,n is not
difference cordial; if m + n > 8 then the bistar Bm,n is not difference cordial; and every
graph is a subgraph of a connected difference cordial graph. If G is a book, sunflower,
lotus inside a circle, or square of a path, they prove that G mK1 (m = 1, 2) and G K2
is difference cordial.
In [2445], [2447], and [2446] Ponraj, Sathish Narayanan, and Kala proved that the
following graphs are difference cordial: crowns Cn K1 ; combs Pn K1 ; Pn Cm ; Cn
Cm ; Wn K2 ; Wn 2K1 ; Gn K1 where Gn is the gear graph; Gn 2K1 ; Gn K2 ;
(Cn × P2 ) K1 ; (Cn × P2 ) 2K1 ; (Cn × P2 ) K2 ; Ln K1 ; Ln 2K1 ; and Ln K2 . Ponraj,
Sathish Narayanan and Kala proved that the following subdivision graphs are difference
cordial: S (Tn ); S (Qn ); S (DTn ); S (DQn ); S (A (Tn )); S (DA (Tn )); S (AQn ); S (DAQn );
S (K1,n ); S (K2,n ); S (Wn ); S (Pn K1 ); S (Pn 2K1 ); S (LCn ); S (Pn2 ); S (K2 + mK1 );
subdivision graphs of sunflowers S (SFn ); subdivisions graphs flowers S (F ln ); S (Bm )
(Bm is a book with m pages); S (Cn × P2 ); S (Bm,n ); subdivisions n-cubes; S (J (m, n));
S (W (t, n)); subdivisions of Young tableaus S (Yn,n ); and if S (G) is difference cordial,
then S (G mK1 ) is difference cordial. For graphs G that are a tree, a unicycle, or when
|E(G)| = |V (G)| + 1, they proved that G Pn and G mK1 (m = 1, 2, 3) are difference
cordial.
In [2491] Prajapati and Gajjar define a holiday star as follows. Let v1 , v2 , . . . , v4n−1 , v4n
be the consecutive 4n vertices of C4n (n > 3). Let u0 be the central vertex and
u1 , u2 , . . . , u2n−1 , u2n be end vertices of K1,2n . Join u0 to v4i−3 by an edge; for each i
from 1 to n. In [2492] they define a Kusadama flower graph as follows. Let v0 be the apex
vertex and v1 , v2 , v3 , . . . , v2n−1 , v2n be 2n consecutive rim vertices of the wheel W2n (n > 3).
Subdivide the spoke edge v0 v2i−1 by a vertex wi and at each wi join two copies of path
of length 2; P2` = v0 , u2i−1 , wi and P2r = v0 , u2i , wi , for each i ∈ [n]. In [2491] and [2492]
Prajapati and Gajjar proved that the holiday star graph and the Kusudama flower graph
admit cordial, E-cordial, difference cordial, prime, vertex prime, and total prime label-
ings. In [2493] Prajapati and Gajjar define a braided star graph as follows: Let a0 be
the apex vertex and a1 , a2 , . . . , an−1 , an be consecutive n rim vertices of Wn (n > 3); let
b1 , b2 , b3 , . . . , b2n−1 , b2n be 2n consecutive vertices of the cycle C2n ; let c1 , c2 , . . . , c2n−1 , c2n
be consecutive 2n vertices of C2n . Join each ai to b2i−1 by an edge and b2i to c2i by an
edge. Take a new vertex di and join each di to c2i−1 and c2i+1 by an edge for each i ∈ [n]
where subscripts are taken modulo n. Prajapati and Gajjar [2493] proved that braided
star graphs are cordial, E-cordial and difference cordial. In [2495] Prajapati and Gajjar [2495] new
investigated the existence of cordial, E-cordial, vertex prime, and difference cordial label-

the electronic journal of combinatorics (2023), #DS6 320

ings of graphs that are inspired by the origami model called an aboreale star (see their
paper for the definition).
Recall the splitting graph of G, S 0 (G), is obtained from G by adding for each vertex
v of G a new vertex v 0 so that v 0 is adjacent to every vertex that is adjacent to v and the
shadow graph D2 (G) of a connected graph G is constructed by taking two copies of G,
G0 and G00 , and joining each vertex u0 in G0 to the neighbors of the corresponding vertex
u0 in G00 .
Ponraj and Sathish Narayanan [2432], [2433] proved the following graphs are difference
0 0 0 0
cordial: S (Pn ); S (Cn ); S (Pn K1 ); and S (K1,n ) if and only if n 6 3. They proved
0 0 0
following are not difference cordial: S (Wn ); S (Kn ); S (Cn × P2 ); the splitting graph of
a flower graph; DS (SFn ); DS (LCn ); DS (F ln ); D2 (G) where G is a (p, q) graph with
q > p; and DS (Bm,n ) (m 6= n) with m + n > 8.
Let G (V, E) be a graph with V = S1 ∪ S2 ∪ · · · ∪ St ∪ T where each Si is a set of
vertices having at least two vertices and having the same degree. Panraj and Sathish
Narayanan [2432], [2433] define the degree splitting graph of G denoted by DS (G) as the
graph obtained from G by adding vertices w1 , w2 , . . . , wt and joining wi to each vertex of
Si (1 6 i 6 t). They proved the following graphs are difference cordial: DS (Pn ); Wn ;
DS (Cn ); DS (Kn ) if and only if n 6 3; DS (K1,n ) if and only if n 6 4; DS (Wn ) if and
only if n = 3; DS (Knc + 2K2 ) if and only if n = 1; DS (K2 + mK1 ) if and only if n 6 3;
DS (Kn,n ) if and only if n 6 2; DS (Tn ) if and only if n 6 5; DS (Qn ) if and only if n 6 5;
DS (Ln ) if and only if n 6 5; DS (Bn,n ) if and only if n 6 2; DS (B1,n ) if and only n 6 4;
DS (B2,n ) if and only n 6 4; D2 (Pn ); D2 (Kn ) if and only if n 6 2; and D2 (K1,m ) if and
only if m 6 2.
In [2434], Ponraj and Sathish Narayanan proved the following graphs are difference
cordial: Tn K1 , Tn 2K1 , Tn K2 , A(Tn ) K1 , A(Tn ) 2K1 and A(Tn ) K2 where Tn and
A(Tn ) are triangular snake and alternate triangular snake respectively. In [2448, 2449]
Ponraj, Sathish Narayanan, and Kala proved the following graphs are difference cor-
dial: Cn × P2 ; Möbius ladders; the n-cube; sunflower graphs; lotuses inside a circle;
pyramids; books with n pentagonal pages; mongolian tents; graphs obtained from a lad-
der by subdividing each step exactly once; permutation graphs P (P2k , f ) where f =
(1 2)(3 4) · · · (k k+1) · · · (2k−1 2k); and P (Pn , I), P (Cn , I), P (Pn K1 , I), P (Pn 2K1 , I)
where I is the identity permutation. Ponraj, Sathish Narayanan, and Kala [2448] [2449]
proved the following graphs are not difference cordial: G1 (p1 , q1 ) × G2 (p2 , q2 ) with q1 > p1
and q2 > p2 ; Cm × Cn ; G × Kn where G connected graph and n > 5, G + K1 where
|E(G) > |V (G) + 1; G1 + G2 where G1 and G2 are connected and |E(G1 )| > 1 and
E(G2 )| > 3; permutation graphs P (G × K2 , f ) where |E(G)| > |V (G)| and f is any
0 0
permutation; P (Wn , f ) for any permutation f ; P (S (G), f ) where S (G) is the splitting
graph of G, |E(G)| > |V (G)|, and f is any permutation; and P (F ln , f ) where F ln is a
flower graph and f is any permutation. They also obtained the following necessary and
sufficient conditions for difference cordiality: Km ×P2 if and only if m 6 3; for a connected
graph G, G × Wn if and only if G = K1 ; books Bm if and only if m 6 6; G + G if and
only if |V (G)| 6 3 and |E(G)| 6 1; K2 + mK1 if and only if m 6 4; Kn + 2K2 if and only
if n 6 2; the double fan DFn if and only if n 6 4; the t-fold wheel Wn + Kt if and only

the electronic journal of combinatorics (2023), #DS6 321

if t 6 2 and n = 3; cocktail party graphs Hn,n if and only n 6 6; P (Kn , I) if and only if
n 6 3; P (K2 + mK1 , I) if and only if m 6 3; and P (Km,n , I) (m, n > 1) if and only if
m = n = 2 and n = 3, 4, 5.
Vaidya and Barasara [3251] proved that every graph can be embedded as an induced
subgraph of a difference cordial graph, thereby ruling out any possibility of obtaining any
forbidden subgraph characterization for difference cordial graphs. They also proved that
every connected graph can be embedded as an induced subgraph of a difference cordial
connected graph and every planar graph can be embedded as an induced subgraph of a
difference cordial planar graph.
In [2412], Ponraj, Maria Adaickalam, and Kala introduced a new graph labeling called
a k-difference cordial labeling. Let G be a (p, q)-graph and 2 6 k 6 |V (G)|. Let f :
V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label |f (u) − f (v)|. They
say f is a k-difference cordial labeling of G if |vf (i) − vf (j)| 6 1 and |ef (0) − ef (1)| 6 1,
where vf (x) denotes the number of vertices labeled with x, ef (1) denotes the number of
edges labeled with 1, and ef (0) denotes the number of edges that are not labeled with 1. A
graph witha k-difference cordial labeling is called a k-difference cordial graph. They proved
the following: every graph is a subgraph of a connected k-difference cordial graph; if k is
even, then k-copies of K1,p is k-difference cordial; and if n ≡ 0 (mod k) and k > 6, then
K1,n is not k-difference cordial. They further prove the following are 3-difference cordial
graphs: paths; Cn where n ≡ 0, 3 (mod 4); Km,n (m 6 n) and m is even; combs; double
(t)
combs; quadrilateral snakes; bistars; subdivisions of a star; subdivisions of a bistar; C4 ;
Kn if and only if n ∈ {1, 2, 3, 4, 6, 7, 9, 10}; and K1,n if and only if n ∈ {1, 2, 3, 4, 5, 6, 7, 9}.
In [2407], [2408], [2409], Ponraj and Maria Adaickalam proved the following are 3-
difference cordial graphs: K1,n K2 , Pn 3K1 , Cn K2 , mC4 , splitting graph of a star,
fan, double fan, Wn where n ≡ 0, 1 (mod 3), helms, flower, sunflower graph, lotus inside
a circle, closed helm, double wheel DWn where V (DWn ) = V (Wn ) ∪ {vi : 1 6 i 6 n}
and edge set E(DWn ) = E(Wn ) ∪ {uvi : 1 6 i 6 n} ∪ {vi vi+1 : 1 6 i 6 n − 1} ∪ {v1 vn },
degree splitting graph of a bistar, spl(K1,n ) ∪ K1,n , spl(K1,n ) ∪ Pn , K3,n ∪ spl(K1,n ),
DFn ∪ spl(K1,n ), S(K1,n ) ∪ S(Bn,n ), K2,n ∪ S(K1,n ), Fn ∪ S(K1,n ), Wn ∪ S(K1,n ), Bn,n ∪
S(Bn,n ), K2,n ∪ Bn,n , (Cn K1 ) ∪ (Pn K1 ), Fn ∪ Fn , jelly fish, Pn ∪ K1,n , K1,n ∪ K2,n ,
K1,n ∪ S(K1,n ), are Let Cn be the cycle u1 u2 . . . un u1 . If G is (p, q) 3-difference cordial
graph with p ≡ 0 (mod 2) and q ≡ 0 (mod 3), then G ∪ G also 3-difference cordial.
Let G be the graph obtained from Cn with V (G) = V (Cn ) ∪ {vi : 1 6 i 6 n2 } and


E(G) = {ui vi , ui+1 vi : 1 6 i 6 n}. Then G is 3-difference cordial. The graph Gn with
the vertex set V (Gn ) = {ui , vi , wi : 1 6 i 6 n} and E(Gn ) = {ui ui+1 , vi vi+1 : 1 6 i 6
n − 1} ∪ {un u1 , v1 u1 } ∪ {ui vi , vi wi : 1 6 i 6 n} is 3-difference cordial. Let C3 be the cycle
u1 u2 u3 u1 . Let G be a graph obtained from C3 with V (G) = V (C3 )∪{vi , wi , zi : 1 6 i 6 n}
and E(G) = E(C3 ) = {u1 vi , u2 wi , u3 zi : 1 6 i 6 n}. Then G is 3-difference cordial
if n ≡ 0, 2, 3 (mod 4). If n ≡ 0, 1 (mod 3), then K1,n ∪ K1,n is 3-difference cordial.
Ponraj, Adaickalam, and Kala [2413] proved the following graphs have 3-difference cordial
labelings: DA(Tn ) K1 , DA(Tn ) 2K1 , DA(Tn ) K2 , DA(Qn ) K1 , and DA(Qn ) 2K1
(Tn is a triangular snake.) In [2410] Ponraj, Adaickalam, Maria Adaickalam, and Kala
investigated the 3-difference cordial labeling behavior of ladders, books, dumbbell graphs,

the electronic journal of combinatorics (2023), #DS6 322

and umbrella graphs. Ponraj, Subbulakshmi, and Somasundarami [2477] investigated the
4-difference cordial labeling behavior of jelly fish, jewel graphs, combs, subdivisions of
stars, subdivisions of bistars, and books with triangle pages.
For graphs G and H and a vertex v of G the graph G v H is obtained by joining
any particular vertex of H to vertex v. In [2180] Sugumaran and Mohan proved that
the following graphs are difference cordial graphs: the path union of r copies of Pn2
(that is, P (r.Pn2 ))–see Section 2.7 for the definition), the cycle union of r copies of Cn2 ,
(that is, C(r.Cn2 )), the open star of r copies the square graph Pn2 (that is, S(r.Pn2 )), the
graph Cn2 vn Pk , and the graph Cn2 vn Pk2 . In [2181] they proved that the plus graph
P ln , the path union of plus graph P (r.P ln ), the cycle union of plus graph C(r.P ln ), the
barycentric subdivision of P ln , the hanging pyramid HPyn graph, and the path union of
hanging pyramid P (r.HPyn ). In [3097] they proved that switching of a pendent vertex in
path Pn , switching of an apex vertex in CHn , the graph obtained by duplication of each
vertex of path Pn by an edge, the barycentric subdivision of Cn K1 , the path union of
r copies of fan P (r.Fn ), the cycle union of r copies of fan C(r.Fn ), and the open star of r
copies of fan S(r.Fn ) are difference cordial graphs.

7.9 Prime Cordial Labelings

Sundaram, Ponraj, and Somasundaram [3134] have introduced the notion of prime cordial
labelings. A prime cordial labeling of a graph G with vertex set V is a bijection f from
V to {1, 2, . . . , |V |} such that if each edge uv is assigned the label 1 if gcd(f (u), f (v)) = 1
and 0 if gcd(f (u), f (v)) > 1, then the number of edges labeled with 0 and the number of
edges labeled with 1 differ by at most 1. In [3134] Sundaram, Ponraj, and Somasundram
prove the following graphs are prime cordial: Cn if and only if n > 6; Pn if and only if
n 6= 3 or 5; K1,n (n odd); the graph obtained by subdividing each edge of K1,n if and
only if n > 3; bistars; dragons; crowns; triangular snakes if and only if the snake has
at least three triangles; ladders; K1,n if n is even and there exists a prime p such that
2p < n + 1 < 3p; K2,n if n is even and if there exists a prime p such that 3p < n + 2 < 4p;
and K3,n if n is odd and if there exists a prime p such that 5p < n + 3 < 6p. They
also prove that if G is a prime cordial graph of even size, then the graph obtained by
identifying the central vertex of K1,n with the vertex of G labeled with 2 is prime cordial,
and if G is a prime cordial graph of odd size, then the graph obtained by identifying
the central vertex of K1,2n with the vertex of G labeled with 2 is prime cordial. They
further prove that Km,n is not prime cordial for a number of special cases of m and n.
Sundaram and Somasundaram [3137] and Youssef [3552] observed that for n > 3, Kn is
not prime cordial provided that the inequality φ(2) + φ(3) + · · · + φ(n) > n(n − 1)/4 + 1
is valid for n > 3 (φ is the Euler phi-function). This inequality was proved by Yufei Zhao
[3592]. Haque, Lin, Yang, and Zhao [1180] show that with the exception of P (4, 1), all
generalized Petersen graphs are prime cordial. Haque, Lin, Yang, and Zhang [1178] show
that the flower snark and related graphs are prime cordial. In [1097] Ghosh, Mohanty,
and Pal gave an algorithmic approach to find cordial labelings of Cartesian product of
two balanced bipartite graphs.
A signed product cordial labeling of graph G(V, E) is a function f from V to {−1, 1}

the electronic journal of combinatorics (2023), #DS6 323

such that when each edge uv is assigned the label f (u)f (v), the number of vertices labeled
−1 and the number of vertices labeled 1 differ by at most 1, and likewise for edges. A
graph that admits signed product cordial labeling is called a signed product cordial graph.
Signed product cordial labelings for fractal graphs given by Santhi and Albert in [2696] [2696] new
and by Raval and Prajapati in [2598]. Ghosh and Pal [1098] proved that Km,m × Pn [2598] new
admits signed product cordial labelings and total signed product cordial labelings. El-
hay, Elmshtaye, and Elrokh [816] provided necessary and sufficient conditions for which [1098] new
there exist a signed product cordial labeling of corona product of paths and third power [816] new
of lemniscate graph.
Seoud and Salim [2786] give an upper bound for the number of edges of a graph with
a prime cordial labeling as a function of the number of vertices. For bipartite graphs they
give a stronger bound. They prove that Kn does not have a prime cordial labeling for
2 < n < 500 and conjecture that Kn is not prime cordial for all n > 2. They determine
all prime cordial graphs of order at most 6. For a graph with n vertices to admit a prime
cordial labeling, Seoud and Salim [2788] proved that the number of edges must be less
than n(n − 1) − 6n2 /π 2 + 3. As a corollary they get that Kn (n > 2) is not prime cordial
thereby proving their earlier conjecture.
In [1080] Ghodasara and Jena prove that the following graphs are prime cordial: Cn
with one chord, Cn with twin chords (that is, two cords that form a triangle with an
edge of the cycle), Cn with three cords that form two triangles and a cycle of length
n − 3 (n > 7), the graph obtained by joining two copies of Cn with one chord by a path,
and the graph obtained by joining two copies of the same cycle with twin chords by a
path is prime cordial.
In [503] Baskar Babujee and Shobana proved sun graphs Cn K1 ; Cn with a path of
length n − 3 attached to a vertex; and Pn (n > 6) with n − 3 pendent edges attached to
a pendent vertex of Pn have prime cordial labelings. Additional results on prime cordial
labelings are given in [504].
In [3319] and [3320] Vaidya and Vihol prove following graphs are prime cordial: the
total graph of Pn and the total graph of Cn for n > 5 (see §2.7 for the definition); P2 [Pm ]
for all m > 5; the graph obtained by joining two copies of a fixed cycle by a path; and the
graph obtained by switching of a vertex of Cn except for n = 5 (see §3.6 for the definition);
the graph obtained by duplicating each edge by a vertex in Cn except for n = 4 (see §2.7
for the definition); the graph obtained by duplicating a vertex by an edge in cycle Cn (see
§2.7 for the definition); the path union of any number of copies of a fixed cycle (see §3.7
for the definition); and the friendship graph Fn for n > 3. Vaidya and Shah [3299] prove
following results: Pn2 is prime cordial for n = 6 and n > 8; Cn2 is prime cordial for n > 10;
the shadow graphs of K1,n (see §3.8 for the definition) for n > 4 and the bistar Bn,n are
prime cordial graphs.
Let Gn be a simple nontrival connected cubic graph with vertex set V (Gn ) =
{ai , bi , ci , di : 0 6 i 6 n − 1}, and edge set E(Gn ) = {ai ai+1 , bi bi+1 , ci ci+1 , di ai , di bi , di ci :
0 6 i 6 n − 1}, where the edge labels are taken modulo n. Let Hn be a graph obtained
from Gn by replacing the edges bn−1 b0 and cn−1 c0 with bn−1 c0 and cn−1 b0 respectively. For
odd n > 5, Hn is called a flower snark whereas Gn , H3 and all Hn with even n > 4, are

the electronic journal of combinatorics (2023), #DS6 324

called the related graphs of a flower snark. Mominul Haque, Lin, Yang, and Zhang [2185]
proved that flower snarks and related graphs are prime cordial for all n > 3.
In [3302] Vaidya and Shah prove that the following graphs are prime cordial: split
graphs of K1,n and Bn,n ; the square graph of Bn,n ; the middle graph of Pn for n > 4;
and Wn if and only if n > 8. Vaidya and Shah [3302] prove following graphs are prime
cordial: the splitting graphs of K1,n and Bn,n ; the square of Bn,n ; the middle graph of Pn
for n > 4; and wheels Wn for n > 8. Gajjar [999] proved that the generalized web graph [999] new
W (t, n) (n > 3) is prime cordial for t = 1, 2, 3, and 4 and that W (t, 2p) is prime cordial
for all t and odd primes p.
In [3306] [3308] Vaidya and Shah proved following graphs are prime cordial: gear
graphs Gn for n > 4; helms; closed helms CHn for n > 5; flower graphs F ln for n > 4;
degree splitting graphs of Pn and the bistar Bn,n ; double fans Dfn for n = 8 and n > 10;
the graphs obtained by duplication of an arbitrary rim edge by an edge in Wn where
n > 6; and the graphs obtained by duplication of an arbitrary spoke edge by an edge in
wheel Wn where n = 7 and n > 9.
Let G(p, q) with p > 4 be a prime cordial graph and K2,n be a bipartite graph with
bipartition V = V1 ∪ V2 with V1 = {v1 , v2 } and V2 = {u1 , u2 , . . . , un }. If G1 is the graph
obtained by identifying the vertices v1 and v2 of K2,n with the vertices of G having labels
2 and 4 respectively, Vaidya and Prajapati [3297] proved that G1 admits a prime cordial
labeling if n is even; if n, p, q are odd and with ef (0) = bq/2c; and if n is odd, p is even
and q is odd with ef (0) = dq/2e. Prajapati and Gajjar [2485] proved the following graphs
are prime cordial: Cn × P2 except for n = 1, 2 and 4, Cn × P4 (n > 3), C3 × Pn (n > 1),
C5 × Pn (n > 1), C6 × Pn (n > 1), C2p × Pn where p is an odd prime and n > 1, and
C4 × Pn (n > 2).
In [3096] Sugumaran and Mohan proved the following graphs are prime cordial: the
cycle butterfly graph Bn,m (two copies of Cn that share a common vertex with m pendent
vertices attached to the common vertex), W − graph (obtained by starting with the two
copies of K1,n and merging the last pendent vertex in the first copy of K1,n with the initial
pendent vertex in the second copy of K1,n ), Hn graph (the graph obtained from two paths
u1 , u2 , . . . , un and v1 , v2 , . . . , vn by joining the vertices u(n+1)/2 and v(n+1)/2 if n is odd and
joining un/2 and vn/2+1 if n is even), and duplication of all edges of an Hn graph. In [3095]
Sugumaran and Mohan proved that the following graphs are prime cordial: Hn K1 , the
path union of r copies of Hn , the cycle union of r copies of an Hn , the open star of r
copies of an Hn −graph (obtained by replacing each pendent vertex of K1,n by a copy of
Hn .
In [3101] Sugumaran and Suresh proved that the following graphs are prime cordial
graphs: the duplication of each vertex by an edge of paths, stars, jelly fish, bistars, and
Cn K1 . Sugumaran and Vishnu Prakash [3106] proved that the following graphs are
prime cordial graphs: duplication of any vertex of degree 3 in theta graph , switching of
any vertex of degree 3 in theta graph, fusion of any two vertices in theta graph, the path
union of two copies of theta graph, and two copies of theta graph joined by a path of
any length. They further proved that the theta graph is not a prime cordial labeling. In
[3107] they showed that one point union of path graph Pnt (tn.Tα ), the open star of theta

the electronic journal of combinatorics (2023), #DS6 325

graph, and any path union of even number of theta graphsJ are prime cordial graphs. Also
th
they proved [3105] the subdivision of bistar Bn,n , Pn K1,n−1 , (that is, each i vertex
of path Pn is append with the apex vertex of ith copy of K( 1, n − 1)), the disconnected
graph Pn ∪ Pm are prime cordial graphs.
Vaidya and Barasara [3249] proved that every graph can be embedded as an induced
subgraph of a prime cordial graph thereby ruling out any possibility of obtaining any
forbidden subgraph characterization for prime cordial graphs. They also proved that a
connected graph can be embedded as an induced subgraph of a prime cordial connected
graph and every planar graph can be embedded as an induced subgraph of a prime
cordial planar graph. In [1064] Gayathri, Thanjavur, Maniammai, and Sakar proved that
8-polygonal snakes containing n 8-polygons, splitting graphs of Cn for n > 5, and armed
crowns C2k Pm for all k > 3 and m > 2 admit prime cordial labelings. Barasara and
Prajapati [430] showed that switching of a vertex of degree 1 in the path Pn is a prime
cordial graph for n 6= 2, 3, 4, 5, 7 and not a prime cordial graph for n = 2, 3, 4, 5, 7, the
armed crown ACn is a prime cordial graph for all n, all web graphs are prime cordial,
(t)
and Cn , one-point union of cycles, are prime cordial for t 6= 2 and n 6= 3, 4 and not a
prime cordial graph for t = 2 and n = 3, 4. Babitha and Baskar Babujee [268] proved [268] new
that if G is prime cordial, then so is G with an edge deleted, K1,m Pn (m, n > 2) is
prime cordial, and in certain cases, the one-point union of K1,m and Pn and the one-point
union of a prime cordial graph G and K1,n are prime cordial. They further provided some
characterization results.
For a graph G(V, E) and the group S3 of all permutations of {1, 2, 3} Chandra and
Kala [666] define a function g : V (G) → S3 such that xy ∈ E if g(x) and g(y) have
relatively prime orders. Let nj (g) denote the number of vertices of G having label j under
g. Then g is called a group S3 cordial prime labeling if |ni (g) − nj (g)| 6 1 for every
i, j ∈ S3 . A graph that admits a group S3 cordial prime labeling is called a group S3
cordial prime cordial prime graph. Chandra and Kala [666] prove that all paths, cycles,
gears, ladders, and fans are group S3 cordial prime and characterize wheels that are group
S3 cordial prime.
In [2350] Parthiban and Sharma gave a comprehensive survey on prime cordial and
divisor cordial labeling of graphs.
Vaidya and Prajapati [3295] call a graph strongly prime cordial if for any vertex v
there is a prime labeling f of G such that f (v) = 1. They prove the following: the
graphs obtained by identifying any two vertices of K1,n are prime cordial; the graphs
obtained by identifying any two vertices of Pn are prime cordial; Cn , Pn , and K1,n are
strongly prime cordial; and Wn is a strongly prime cordial for every even integer n > 4.
Prajapati and Gajjar [2497] proved that generalized prism graphs Yn,2 is prime cordial
except for n = 1, 2 and 4; Yn,4 is prime cordial for n > 3; Y3,n , Y5,n , Y6,n and Y2p,n (for
odd prime p) are prime cordial for n > 1; and Y4,n is prime cordial for n > 2. They
also proved the following graphs are prime cordial: Cn × P2 except for n = 1, 2 and 4,
Cn × P4 (n > 3), C3 × Pn (n > 1), C5 × Pn (n > 1), C6 × Pn (n > 1), C2p × Pn where p
is an odd prime and n > 1, and C4 × Pn (n > 2).
In [2460] Ponraj, Singh, Kala, and Sathish Narayanan introduced a new graph labeling

the electronic journal of combinatorics (2023), #DS6 326

called k-prime cordial labeling. Let G be a (p, q)-graph and 2 6 p 6 k and let f : V (G) →
{1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f (u), f (v)). They say that
f is a k-prime cordial labeling of G if |vf (i) − vf (j)| 6 1 for i, j ∈ {1, 2, . . . , k} and
|ef (0) − ef (1)| 6 1, where vf (x) denotes the number of vertices labeled with x, and ef (1)
and ef (0), respectively, denote the number of edges labeled with 1 and not labeled with
1. A graph with a k-prime cordial labeling is a k-prime cordial graph. They proved that
every graph is a subgraph of a connected k-prime cordial graph; if k is even, then Pn ,
n 6= 3, is k-prime cordial; Cn , n 6= 3, is k-prime cordial when k is even; and the bistar Bn,n
is k-prime cordial for all even k. They studied 3-prime cordiality of paths, cycles, and
olive trees. They also proved that if T is a 3-prime cordial tree, then T K1 is 3-prime
cordial; K1,n is 3-prime cordial if and only if n 6 3; Kn is 3-prime cordial if and only if
n < 3; combs Pn K1 are 3-prime cordial; and Cn K1 is 3-prime cordial if and only if
n 6= 3. They proved that K2 + mK1 , K2,n , and wheels are not 3-prime cordial graphs. In
[2461] Ponraj, Singh, and Sathish Narayana proved if G is 3-prime cordial, then G ∪ Pn is
a 3-prime cordial for n > 12, the splitting graph of a star is not a 3-prime cordial graph,
and the jelly fish J(m, n) is 3-prime cordial if 10m > n + 2.
For a 4-prime cordial graph G Ponraj and Singh [2459] proved G ∪ Pn (n > 5), G ∪
2mKn,n , and G ∪ 2mK1,n are 4-prime cordial. For a (4t, q) 4-prime cordial graph G they
prove that G + K1 and G + 2K1 are 4-prime cordial. Ponraj, Singh, and Kala [2462]
prove that Pm × Pn and subdivisions of wheels and helms are 4-prime cordial. They also
show that if G is bipartite then G ∪ G is 4-prime cordial; and if G is 4-prime cordial then
G K1 is 4-prime cordial. Ponraj, Singh, and Kala [2463] proved the following graphs
are 4-prime cordial: 2m(Kn,n ), 2m(Pn × P2 ), m(Cn ⊕ K1 ), mBn,n , and 2W2n+1 .
Murugesan, Jayaraman, and Shiama (see [3108]) defined a 3-equitable prime cordial
labeling of a graph G as a bijection f from V (G) to {1, 2, . . . , |V (G)|} such that if an edge
uv is assigned the label 1 when gcd(f (u), f (v)) = 1 and gcd(f (u) + f (v), f (u) − f (v)) = 1,
the label 2 when gcd(f (u), f (v)) = 1 and gcd(f (u) + f (v), f (u) − f (v)) = 2, and the
label 0 otherwise, then the number of edges labeled with i and the number of edges
labeled with j differ by at most 1 for 0 6 i 6 2 and 0 6 j 6 2. A graph that has a
3-equitable prime cordial labeling is called a 3-equitable prime cordial graph. Sugumaran
and Vishnu Prakash [3108] proved the following graphs are 3-equitable prime cordial
graphs: bistars, combs, ladders, kites, and slanting ladders. In [3110] they showed that
theta graphs, the duplication of any vertex in theta graphs, switching of any vertex in
theta graphs, the fusion of any two vertices in theta graphs, path unions of two copies
of theta graphs, open star graphs of copies of a fixed theta graph are 3-equitable prime
cordial graphs. Seoud and Jaber [2780] proved that the butterfly BFn,m , helms Hn , the
graph hWn : Wm i obtained by joining apex vertices of two wheels with a new vertex
are prime cordial, and determine the prime cordial graphs of order 7. They also gave an
algorithm to calculate the maximum number of edges in a 3-equitable prime cordial graph.
Murugesan, Jayaraman, and Shiama [2226] proved the following graphs are 3-equitable [2226] new
prime cordial: Pn , Cn , (n > 4), K1,n if and only if n = 2 (mod 3), and Kn if and only if
n 6 2. Ghodasaram and Sonchhatra [1091] proved the following graphs admit 3-equitable [1091] new
labeling: wheels, helms, gears, cycles with one pendant edge, and the graphs obtained by

the electronic journal of combinatorics (2023), #DS6 327

joining two copies of a fan by a path of arbitrary length.

7.10 Other Cordial Labelings

In [2458] Ponraj, Sathish Narayanan, and Ramasamy introduced a new graph labeling
called parity combination cordial labeling. Let G be a (p, q)-graph. Let
f be
an injective
map from V (G) to {1, 2, . . . , p}. For each edge xy, assign the label xy or xy according as
x > y or y > x. Call f a parity combination cordial labeling if f is a one to one map and
|ef (0) − ef (1)| 6 1, where ef (0) and ef (1) denote the number of edges labeled with an
even number and odd number, respectively. A graph with a parity combination cordial
labeling is called a parity combination cordial graph. They proved that the following
are parity combination cordial graphs: paths, cycles, stars, triangular snakes, alternate
triangular snakes, olive trees, combs, crowns, fans, umbrellas, Pn2 , helms, dragons, bistars,
butterfly graphs, and graphs obtained from Cn and K1,m by unifying a vertex of Cn and
a pendent vertex of K1,m . They also proved that Wn admits a parity combination cordial
labeling if and only if n > 4 and conjectured that for n > 4, Kn is not a parity combination
cordial graph. In [2464], Ponraj, Rajpal Singh, and Sathish Narayanan proved that if G
is a parity combination cordial graph, then G ∪ Pn is also parity combination cordial if
n 6= 2, 4. In [2756] Seoud and Aboshady surved all graphs of order at most six with
regard to whether they have a parity combination cordial labeling or not. They obtained
an upper bound for the number of edges of any graph that satisfies a certain condition,
and described the parity combination cordial labelings for two families of graphs.
In [2242] Naduvath defines the notion of the set-cordial labeling of a graph as follows.
For a non-empty set X, a function f from the vertices of a graph G to the power set of
X is said to be a set-cordial labeling of G if |f (vi )| − |f (vj )| = ±1 for all edges vi vj of G.
A graph that admits a set-cordial labeling is called a set-cordial graph . He proves that
paths are set-cordial and that a graph G admits a set-cordial labeling if and only if G is
bipartite. He defines the glutting number of a graph G as the minimum number of edges
of G that can be removed so that the resulting graph admits a set-cordial labeling and
provides the glutting number of wheels, helms, and complete graphs.
In 2011 Murugan and Selvaraj [2216] introduced the concept of V -cordial labeling of [2216] new
a graph G with vertex set V as a bijective function φ : V → {0, 1} such that the induced
function φ∗ : E → {0, 1} is defined by φ(uv) = 0 if φ(u) = φ(v) = 0 and 1 otherwise
with the condition that the number of verticies labeled with 0 and the number of verticies
labeled with 1 differ by at most 1, and likewise for the edges. A graph that the admits a V -
cordial labeling is called a V -cordial graph. In 2015 Murugan and Mathubala introduced
the concept of homo-cordial labeling as follows. A homo-cordial labeling of a graph G with
vertex set V is a bijection φ : V → {0, 1} such that the induced function φ∗ : E → {0, 1}
given by φ∗ (uv) = 1, if φ(u) = φ(v) and 0 otherwise with the condition that the number
of verticies labeled with 0 and the number of verticies labeled with 1 differ by at most 1,
and likewise for the edges. A graph that the admits a homo-cordial labeling is called a
homo-cordial graph. In [2217] Murugan and Vidhya say that a hetro-cordial labeling of a [2217] new
graph G with vertex set V is a bijection φ : V → {0, 1} such that the induced function
φ∗ : E → {0, 1} given by φ∗ (uv) = 0, if φ(u) = φ(v) and 1, otherwise with the condition

the electronic journal of combinatorics (2023), #DS6 328

that the number of verticies labeled with 0 and the number of verticies labeled with 1 differ
by at most 1, and likewise for the edges. A graph that the admits a hetro-cordial labeling
is called a hetro-cordial graph. Murugan, and Mathubala [2215] proved that odd cycles, [2215] new
shadow graphs of cycles, graphs obtained by identifying the end points of n paths of length
2 (globe graphs), and double triangular snakes are homo-cordial graphs. Murugan, and
Selva Vidhya [2217] proved that paths, combs, fans, double fans, and ladders are hetro- [2217] new
cordial graphs. Murugan and Selvaraj [2216] proved that paths, fans double fans, and [2216] new
combs are V cordial graphs. Bala, Sundarraj, and Thirusangu [401] proved existence of a
homo-cordial labeling, a hetro-cordial labeling, and a V -cordial labeling for the extended [401] new
triplicate graph of a comb.
In [2273] Nicholas and Maya introduced the concept of an integer edge cordial label- [2273] new
ing of a graph G with edge set E as an injective map f from E to [−q/2, . . . , q/2] or
∗
[b−q/2c, . . . , bq/2c] as q is even or odd, which induces
P ∗a vertex labeling f : V → {0, 1}
such that, a vertex u is assigned the label 1 if (f (ei ) > 0 taken over all i, and 0
otherwise, and the number of vertices labeled with 1 and the number of vertices labeled
with 0 differ by at most by 1. A graph that has integer edge cordial labeling is called
an integer edge cordial graph. They proved that Pn (n > 3), cycles, Wn (n > 3), helms,
closed helms, K1,2n , and flower graphs are integer edge cordial graphs. They also proved
that Kn,n is not integer edge cordial and that Kn,n \ M is integer edge cordial if n is even,
where M is a perfect matching of Kn,n .
For a planar graph G(p, q) suppose that g : E(G) → [ −q 2
, . . . , 2q ] or [−b 2q c, . . . , b 2q c] as
q is even or odd, is an injective map that induces a vertex labeling g ∗ : V (G) → {0, 1}
defined by g ∗ (v) = 1 if the sum of all g(e) over all edges e of G adjacent to v is nonnegative
and g ∗ (v) = 0 otherwise, and the face labeling function g ∗∗ from the faces of G to {0, 1}
defined by g ∗∗ (f ) = 1, if the sum of g(e) over all edges e of f is nonnegative, and g ∗∗ (f ) = 0
otherwise. Then g is called a face integer edge cordial labeling if the number of vertices
labeled 0 and the number of vertices labeled 1 differ by at most 1 and the number of faces
labeled 0 and the number of faces labeled 1 differ by at most 1. A graph that admits
a face integer edge cordial labeling is called face integer edge cordial. Sheriff and Abbas
[2884] gave face integer edge cordial labelings of the duplication of each vertex by an [2884] new
edge in nontrivial fans, the planar graph G0 obtained from joining the outer vertex of the
two copies of a planar graph G by a path of arbitrary length, and the splitting graph of
nontrival stars.
For a simple, finite and planar graph G of order p and size q. Sumathi and J. Suresh
Kumar [3125] introduced the concept of fuzzy quotient-3 cordial labeling as follows. Let [3125] new
r
σ : V (G) → [0, 1] be a function defined by σ(v) = 10 , r ∈ Z4 − {0}. For each edge uv
1 3σ(u)
define µ : E(G) → [0, 1] by µ(uv) = 10 σ(v) where σ(u) 6 σ(v). The function σ is called
fuzzy quotient-3 cordial labeling of G if the number of vertices labeled with i and the
number of vertices labeled with j differ by at most 1, the number of edges labeled with i
r
and the number of edges labeled with j differ by at most 1 where i 6= j have the form 10 ,
where r ∈ {1, 2, 3}. They proved that stars and star related graphs are fuzzy quotient-3
cordial.

the electronic journal of combinatorics (2023), #DS6 329

7.11 Mean Labelings
Somasundaram and Ponraj [3023] introduced the notion of mean labelings of graphs. A
graph G with p vertices and q edges is called a mean graph if there is an injective function
f from the vertices of G to {0, 1, 2, . . . , q} such that when each edge uv is labeled with
(f (u) + f (v))/2 if f (u) + f (v) is even, and (f (u) + f (v) + 1)/2 if f (u) + f (v) is odd,
then the resulting edge labels are distinct. In [3023], [3024], [3025], [3026], [2474], and
[2475] they prove the following graphs are mean graphs: Pn , Cn , K2,n , K2 + mK1 , Kn +
2K2 , Cm ∪ Pn , Pm × Pn , Pm × Cn , Cm K1 , Pm K1 , triangular snakes, quadrilateral
snakes, Kn if and only if n < 3, K1,n if and only if n < 3, bistars Bm,n (m > n) if and only
if m < n + 2, the subdivision graph of the star K1,n if and only if n < 4, the friendship
(t)
graph C3 if and only if t < 2, the one point union of two copies a fixed cycle, dragons
(the one point union of Cm and Pn , where the chosen vertex of the path is an end vertex),
the one point union of a cycle and K1,n for small values of n, and the arbitrary super
subdivision of a path, which is obtained by replacing each edge of a path by K2,m . They
also prove that Wn is not a mean graph for n > 3 and enumerate all mean graphs of order
less than 5.
Gayathri and Gopi [1050] prove the following are mean graphs: double triangular
snakes; double quadrilateral snakes; generalized antiprisms; graphs obtained by joining
the 2 vertices of K2,n of degree n with an edge; and graphs obtained from Cn with
consecutive vertices v1 , v2 , . . . , vn by adding the chords joining vi and vn−i+2 for 2 6 i 6
bn/2c. In [1048] Gayathri and Gopi gave various necessary conditions for mean labelings.
Kannan, Manivannan, Loganathan, and Gyeltshen [1635] investigated the existence of
mean labelings for the graphs obtained by duplicating an edge or vertex of paths, cycles,
combs, and the splitting graph of paths.
Lourdusamy and Seenivasan [2017] prove that kCn -snakes are means graphs and every
cycle has a super subdivision that is a mean graph. They define a generalized kCn -snake
in the same way as a Cn -snake except that the sizes of the cycle blocks can vary (see
Section 2.2). They prove that generalized kCn -snakes are mean graphs. Recall that Pa,b
denotes the graph obtained by identifying the endpoints of b internally disjoint paths each
of length a. Vasuki and Nagarajan [3356] proved that the following graphs admit mean
labelings: Pr,2m+1 for all r and m; Pr,2m for all m and 2 6 r 6 6; Pr2m+1 for all r and m;
and Pr2m for all m and 2 6 r 6 6. Anusa, Sandhya, and Somasundaram [186] proved that
triangular ladders, triangular snakes, double triangular snakes, quadrilateral snakes, and
double quadrilateral snakes are mean graphs.
Lourdusamy and Seenivasan [2018] define an edge linked cyclic snake, EL(kCn ), as
the connected graph obtained from k copies of Cn (n > 4) by identifying an edge of the
(i + 1)th copy to an edge of the ith copy for i = 1, 2, . . . , k − 1 in such a way that the
consecutive edges so chosen are not adjacent. They proved that all EL(kC2n ) are mean
graphs and some cases of EL(C2n−1 ) are mean graphs. They also define a generalized
edge linked cyclic snake in the same way but allow the cycle lengths (at least 4) to vary.
They prove that certain cases of generalized edge linked cyclic snakes are mean graphs.
Barrientos and Krop [454] proved that there exist n! graphs of size n that admit mean

the electronic journal of combinatorics (2023), #DS6 330

labelings. They give two necessary conditions for the existence of a mean labeling of a
graph G with m vertices and n edges: if G is a mean graph, then n + 1 > m; if G is
a mean graph with n edges and maximum degree ∆(G), then ∆(G) 6 n+3 2
when n is
odd and ∆(G) 6 n+2 2
when n is even. They proved that the disjoint union of n copies of
C3 is a mean graph and if a mean r-regular graph has n vertices, then r < n − 2. They
established a connection between α-labelings and mean labelings by proving that every
tree that admits an α-labeling is a mean graph when the size of its stable sets differ by at
most one. When the tree is a caterpillar, this difference can be up to two. Barrientos and
Krop call a mean labeling of a bipartite graph an α-mean labeling if the labels assigned
to vertices of the same color have the same parity. They show that the complementary
labeling of a α-mean labeling is also an α-mean labeling. They use graphs with α-
mean labelings to construct new mean graphs. One construction consists of connecting a
pair of corresponding vertices of two copies of an α-mean graph by an edge. The other
construction identifies a pair of suitable vertices from two α-mean graphs. Barrientos
and Krop also proved that every quadrilateral snake admits an α-mean labeling. They
conjecture that all trees of size n and maximum degree at most d(n + 1)/2e are mean
graphs and state some open problems. In [449] Barrientos proves that all trees with up
to four end-vertices except K1,4 are mean graphs. Bailey and Barrientos [397] prove the
following are mean graphs: Cn ∪ Cm , Cn ∪ Pm , K2 + nK1 , 2K2 + nK1 , Cn × K2 .
In [397] Bailey and Barrientos study several operations with mean graphs. They prove
that the coronas G K1 and G K2 are mean graphs when G is an α-mean graph. Also,
if G and H are mean graphs with n vertices and n − 1 edges and H is an α-mean graph,
then G × H is a mean graph. They prove that given two mean graphs G and H, there
exists a mean graph obtained by identifying an edge from G with an edge from H and
uses this result to prove that the graphs Rn (n > 2) of order 2n and size 4n−3 with vertex
set V (Rn ) = {v1 , v2 , . . . , v2n } and edge set E(Rn ) = {vi vi+1 | 1 6 i 6 n − 1 and n + 1 6
i 6 2n − 1} ∪ {vi vn+i | 1 6 i 6 n} ∪ {vi vn+i−1 | 2 6 i 6 n} (rigid ladders) are mean
graphs.
Barrientos, Abdel-Aal, Minion, and Williams [450] use An to denote the set of all α-
mean labeled graphs of size n such that the difference of the cardinalities of the bipartite
sets of the verticies of the graphs is at most one.They prove that the class An is equivalent
to the class of α-labeled graphs of size n with bipartite sets that differ by at most one.
They also prove that when G ∈ An , the coronas G mK1 , G P2 , and G P3 admit
mean labelings.
In [3262] Vaidya and Bijukumar define two methods of creating new graphs from cycles
as follows. For two copies of a cycle Cn the mutual duplication of a pair of vertices vk
and vk0 respectively from each copy of Cn is the new graph G such that N (vk ) = N (vk0 ).
For two copies of a cycle Cn and an edge ek = vk vk+1 from one copy of Cn with incident
edges ek−1 = vk−1 vk and ek+1 = vk+1 vk+2 and an edge e0m = um um+1 in the second copy
of Cn with incident edges e0m−1 = um−1 um and e0m+1 = um+1 um+2 , the mutual duplication
of a pair of edges ek and e0m respectively from two copies of Cn is the new graph G such
that N (vk ) − vk+1 = N (um ) − um+1 = {vk−1 , um−1 } and N (vk+1 ) − vk = N (um+1 ) − um =
{vk+2 , um+2 }. They proved that the graph obtained by mutual duplication of a pair of

the electronic journal of combinatorics (2023), #DS6 331

vertices each from each copy of a cycle and the mutual duplication of a pair of edges from
each copy of a cycle are mean graphs. Moreover, they proved that the shadow graphs of
the stars K1,n and bistars Bn,n are mean graphs.
Vasuki and Nagarajan [3358] proved the following graphs are admit mean labelings:
the splitting graphs of paths and even cycles; Cm Pn ; Cm 2Pn ; Cn ∪ Cn ; disjoint
unions of any number of copies of the hypercube Q3 ; and the graphs obtained from by
starting with m copies of Cn and identifying one vertex of one copy of Cn with the
corresponding vertex in the next copy of Cn .) Jeyanthi and Ramya [1499] define the
jewel graph Jn as the graph with vertex set {u, x, v, y, ui : 1 6 i 6 n} and edge set
{ux, vx, uy, vy, xy, uui , vui : 1 6 i 6 n}. They proved that the jewel graphs, jelly fish
graphs, and the graph obtained by joining any number of isolated vertices to the two
endpoints of P3 are mean graphs. Ramya and Jeyanthi [2584] proved several families
of graphs constructed from Tp -tree are mean graphs. Ahmad, Imran, and Semaničová-
Feňovčiková [106] studied the relation between mean labelings and (a, d)-edge-antimagic
vertex labelings. They show that two classes of caterpillars admit mean labelings. Revathi
[2616] proved that the shadow graphs of bistars, combs, and the splitting graph of combs
have mean labelings.
Recall from Section 2.7 that given connected graphs G1 , G2 , . . . , Gn , Kaneria, Makadia,
and Jariya [1602] define a cycle of graphs C(G1 , G2 , . . . , Gn ) as the graph obtained by
adding an edge joining Gi to Gi+1 for i = 1, . . . , n − 1 and an edge joining Gn to G1 . (The
resulting graph can vary depending on which vertices of the Gi are chosen.) When the
n graphs are isomorphic to G the notation C(n · G) is used. Also recall Kanneria and
Makadia [1595] define a step grid graph Stn as the graph obtained by starting with paths
Pn , Pn , Pn−1 , . . . , P2 (n > 3) arranged vertically parallel with the vertices in the paths
forming horizontal rows and edges joining the vertices of the rows. In [1626], [1612], and
[1615], Kaneria, Viradia, and Makadia proved the following graphs are mean graphs: the
path union of any number of copies of a mean graph; C(2t·Pn ); C(2t·Cn ); C(2t·Pn ×Pm );
2 2
C(2r · Bn,n ) (Bn,n is the square of the bistar Bn,n ); C(2r · M (Cn )) (M (Cn ) is the middle
graph of Cn ); C(2r · (P2n + 2K1 )); step grid graphs; the path union of finitely copies of
the step grid graphs; cycles of step grid graphs C(2r · Stn ); and C(2t · K2,m ).
For a fixed vertex v of Cm Avadayappan and Vasuki [265] use (Pm ; Cn ) to denote the
graph obtained from m copies of Cn and the path Pm : u1 u2 · · · um by joining ui with v of
the ith copy of Cn with an edge for 1 6 i 6 m. They define (Pm ; Q3 ), (P2n ; Sm ) , (Pn ; S1 )
and (Pn ; S2 ), where v is a fixed vertex of the cube Q3 and v is the center of the star Sk , in
an analogous way. For Cn : v1 v2 . . . vn v1 they use [Pm ; Cn ] to denote the graph obtained
from m copies of Cn with vertices v11 , v12 , . . . , v1n , v21 , . . . , v2n , . . . , vm1 , . . . , vmn by joining
vij and v(i+1)j with an edge, for some j and 1 6 i 6 m − 1. They define [Pm ; Q3 ] and
(2) (2)
[Pm ; Cm ], where Cm is the friendship graph, similarly. In [265] they prove these families
are mean graphs.
Maheswari, Hariprabakaran, and Balaji [2064] introduced a coding technique for con- [2064] new
verting a text message using a sub super mean labeling on two and three star graphs to
a picture coding message. For more on coding a text message using a graph labelings see
[1187], [2061], and [2057]. [1187] new
[2061] new
the electronic journal of combinatorics (2023), #DS6 332
[2057] new
 Ramya, Ponraj, and Jeyanthi [2587] called a mean graph super mean if vertex labels
and the edge labels are {1, 2, . . . , p + q}. They prove following graphs are super mean:
paths, combs, odd cycles, Pn2 , Ln K1 , Cm ∪Pn (n > 2), the bistars Bn,n and Bn+1,n . They
also prove that unions of super mean graphs are super mean and Kn and K1,n are not
super mean when n > 3. In [1504] Jeyanthi, Ramya, and Thangavelu prove the following
are super mean: nK1,4 ; the graphs obtained by identifying an endpoint of Pm (m > 2)
with each vertex of Cn ; the graphs obtained by identifying an endpoint of two copies of
Pm (m > 2) with each vertex of Cn ; the graphs obtained by identifying an endpoint of
three copies of Pm (m > 2); and the graphs obtained by identifying an endpoint of four
copies of Pm (m > 2). In [1500] Jeyanthi and Ramya prove the following graphs have
super mean labelings: the graph obtained by identifying the endpoints of two or more
copies of P5 ; the graph obtained from Cn (n > 4) by joining two vertices of Cn distance 2
apart with a path of length 2 or 3; Jeyanthi and Rama [1502] use S(G) to denote the graph
obtained from a graph G by subdividing each edge of G by inserting a vertex. They prove
the following graphs have super mean labelings: S(Pn K1 ), S(Bn,n ), Cn K2 ; the graphs
obtained by joining the central vertices of two copies of K1,m by a path Pn (denoted by
hBm,m : Pn i); generalized antiprisms (see §6.2 for the definition), and the graphs obtained
from the paths v1 , v2 , v3 , . . . , vn by joining each vi and vi+1 to two new vertices ui and wi
(double triangular snakes).
Lourdusamy and Seenivasan [2019] introduced the notion of super vertex mean la-
beling as follows. For a (p, q)-graph and an injective function f from the edges to
∗
the set {1,
P 2, 3, . . . , p + q} that induces for each vertex v the label defined by f (v) =
(Round e∈Ev f (e))/d(v), where Ev denotes the set of edges in G that are incident to
the vertex v, d(v) is the degree of v, and Round(x) is the integer nearest to x, such that
the set of all edge labels and the induced vertex labels is {1, 2, 3, . . . , p + q} is called a
super vertex mean labeling of G and G is called a super vertex mean graph. In [2004]
they investigated the all graphs of order up to 5 and regular graphs of order up to 7 for
the property of being super vertex mean and proved that all linear triangular snakes are
super vertex mean. Lourdusamy, George, and Seenivasan [2006] proved that all cycles
except C4 are super vertex mean and Lourdusamy and George [2005] proved that linear
Cn snakes with at least 2 blocks are super vertex mean graphs for the following cases:
n = 4, 5, 6, and 7; n > 8 even; n > 9 and n ≡ 1 mod 4; and n > 11 and n ≡ 3 mod 4.
Inayah, Sudarsana, Musdalifah, and Mangesa [1325] have showed that the total graphs of
paths and cycles are super mean graphs.
In [3067] Sudarsana, Suryanto, Lusianti, and Putri show how super mean graph label-
ings can be used to increase the security level of encrypted text on social medias.
A graph G with q edges is called a k-mean graph if there is an injective function f
from the vertices of G to {0, 1, 2, . . . , k + q − 1} such that when each edge uv is labeled
with (f (u) + f (v))/2 if f (u) + f (v) is even, and (f (u) + f (v) + 1)/2 if f (u) + f (v) is
odd, the resulting edge labels are {k, k + 1, k + 2, . . . , k + q − 1}. A graph G with q edges
is said to have a restricted k-mean labeling if there is an injective function f from the
vertices of G to {k − 1, k, k + 1, . . . , k + q − 1} such that when each edge uv is labeled with
{k, k + 1, k + 2, . . . , k + q − 1}, the resulting edge labels {k, k + 1, k + 2, . . . , k + q − 1} are

the electronic journal of combinatorics (2023), #DS6 333

distinct where k is a positive integer. A graph that admits a restricted k-mean labeling is
called a restricted k-mean graph. Gayathri and Gopi proved some properties of k-mean
labelings in [1051]. In [1052] they proved that if G1 and G2 are restricted k-mean graphs
for all k, then G1 ∪ G2 is restricted k-mean for all k, and if G1 is a restricted k-mean graph
for all k > k1 and G2 is a restricted k-mean graphs for all k, then G1 ∪ G2 is restricted
k-mean for all k > k1 .
A mean graph is called k-super mean if vertex labels and the edge labels are {k, k +
1, k + 2, . . . , p + q + k − 1}. Jeyanthi, Ramya, Thangavelu [1505] give super mean labelings
for Cm ∪Cn and k-super mean labelings for a variety of graphs. Tamilselvi, Akilandeswari,
and Suguna [3186] proved that the following graphs admit k-super mean labelings: the
graph obtained by subdividing the central edge of the bistar Bn,n (n > 2), the subdivision
graph of Bn,n , and the corona product of a triangular snake and K1 .
Vasuki and Nagarajan [3357] define Hn , called the H-graph of a path Pn , as the graph
obtained from two copies of Pn with vertices v1 , v2 , . . . , vn and u1 , u2 , . . . , un by joining
the vertices v(n+1)/2 and u(n+1)/2 if n is odd, and the vertices v n2 +1 and u n2 if n is even,
and a cyclic snake mCn as the graph obtained from m copies of Cn by identifying the
vertex v(k+2)j in the jth copy of the vertex v1j+1 in the (j + 1)th copy if n = 2k + 1 and
identifying the vertex v(k+1)j in the jth copy with the vertex v1j+1 in the (j + 1)th copy
if n = 2k. They establish the super meanness of even cycles, H-graphs, the coronas of
H-graphs, 2-coronas of H-graphs, coronas of cycles, mCn -snakes (n 6= 4), dragons Pn (Cm )
for m 6= 4, and Cm × Pn for m = 3 and 5. Vasuki, Sugirtha, and Venkateswari [3366]
proved that the subdivision of the following graphs are super mean graphs: Hn , Hn K1 ,
Hn with two pendent edges attached to each vertex, Cn K1 (n > 3), slanting ladders,
triangular snakes with a pendent edge at each vertex, and Cm @Cn (the graph obtained by
attaching paths Pn to Cm by identifying the endpoints of the paths with each successive
pairs of vertices of Cm ).
Let G(V, E) be a simple graph of order p and size q. Then G is said to be a relaxed
mean graph if it is possible to label the vertices x ∈ V with distinct elements f (x) from
{0, 1, 2 . . . , q−1, q+1} in such a way that when each edge uv is labeled with (f (u)+f (v))/2
if f (u) + f (v) is even and (f (u) + f (v) + 1)/2 if f (u) + f (v) is odd, then the resulting edge
labels {1, 2, 3, . . . , q} are distinct. Such an f is called a relaxed mean labeling of G. Balaji,
Ramesh, and Sudhaker [404] prove that the disjoint union of any path with n − 1 edges
joining the pendent vertices of distinct paths is a relaxed mean graph and K1,m is not a
relaxed mean graph for m > 5. They also prove that the graph consisting of two stars K1,m
and Kn,1 with an edge in common is a relaxed mean graph if and only if |m−n| 6 5. Balaji
and Maheswari [399] proved the following graphs are relaxed mean graphs Cn (n > 4);
K2,n ; triangular snakes; quadrilateral snakes; Pn 2 ; (Pn × P2 ) K1 ; Kn + 2K2 ; K2 + mK1 ;
(t)
C3 ; the union of any two trees; Pm × Pn (m > 1, n > 1); and Pm × Cn (m > 1). They
also prove that Kn is not a relaxed mean graph. Maheswari, Ramesh, and Balaji [2062]
proved the following graphs are relaxed mean graphs: Pn (n > 5); bistars Bm,n if and
only if |m − n| 6 3; combs; and C3 ∪ Pn (n > 1). They also proved that K1,n is not a
relaxed mean graph for n > 5. Francis and Balaji proved that Wn (n > 4) are relaxed
mean graphs.

the electronic journal of combinatorics (2023), #DS6 334

 In [236] Arockiaraj, Rajesh Kannan, and Durai Baskar introduced the F -centroidal
mean labeling of graphs by defining a function f to be an F -centroidal mean labeling
of a graph G(V, E) with q edges if f : V (G) → {1, 2, 3, . . . , q + 1} j is injective and the k
∗ ∗ 2 [f (u)2 +f (u)f (v)+f (v)2 ]
induced function f : E(G) → {1, 2, 3, . . . , q} defined as f (uv) = 3 [f (u)+f (v)]
for all uv ∈ E(G) is bijective. A graph that admits an F -centroidal mean labeling is
called an F -centroidal mean graph. They discussed the F -centroidal meanness of the tree
Pn (X1 , X2 , . . . Xn ) obtained from a path on n vertices by attaching Xi pendent vertices at
each ith vertex of the path for 1 6 i 6 n, the twig graph T W (Pn ), the graph Pn ◦ Sm for
m 6 4, Pm ×Pn for m 6 3, ladders, Pn ◦K2 , Pab for a > 2 and b 6 3, the middle graphs and
splitting graphs of paths, the total graphs of paths, Pn2 , and P (1, 2, . . . , n − 1) the graph
obtained by replacing each ith edge of Pn by identifying its end vertices with the vertices of
the two element component of K2,i . In the same article they introduced super F -centroidal
mean graphs [236] as follows. Let G be a graph and f : V (G) → {1, 2, 3, . . . , p + q} be
an injection. With f ∗ defined as for the F -centroidal case f is called a super F-centroidal
mean labeling if f (V (G)) ∪ {f ∗ (uv) : uv ∈ E(G)} = {1, 2, 3, . . . , p + q}. A graph that
admits a super F -centroidal mean labeling is called a super F-centroidal mean graph. They
proved that the following graphs are super F -centroidal mean graphs: paths, cycles, the
union of any number of paths, the mirror graph of Pn , Pn ◦ Sm , T W (Pn ), Pn ∪ Cm , Pn2 ,
and dragons Pn (Cm ) the graph obtained from Cm by identifying an end vertex of Pn at a
vertex of Cm .
In [1138] Gopi and Kumar proved the following graphs are are F -centroidal mean [1138] new
graphs: the mirror graph M (Pn ) (n > 3), Spl(Pn ) (n > 3), Pn2 (n > 3), V D(G), the
tortoise graph Tn (n > 4) (obtained from a path v1 , v2 , . . . , vn by attaching an edge
between vi and vn−i+1 for 1 6 i 6 bn/2c. (n = 1, 3 (mod 4)), and P Cn (n > 5)
(obtained from Cn = v1 , v2 , . . . , vn by adding chords joining vi and vn−i+2 for 2 6 i 6 t,
where t = bn/2c), In [1137] they proved D(Tn ) (n > 3), AD(Tn ) (n > 4), Qn (n > 2), [1137] new
A(Qn ) (n > 2) AD(Qn ) (n > 2), and SLn (n > 2) are F -centrodial mean graphs.
Arockiaraj, Kannan, Manivannan, and Durai Baskar [238] investigated the F -
centroidal mean property for paths, cycles, stars, Kn , Pn ◦ S1 , the triangular snakes,
arbitrary subdivisions of K1,3 , and some line graphs.
In [406] and [407] Balaji, Ramesh, and Subramanian use the term “Skolem mean”
labeling for super mean labeling. They prove: Pn is Skolem mean; K1,m is not Skolem
mean if m > 4; K1,m ∪ K1,n is Skolem mean if and only if |m − n| 6 4; K1,l ∪ K1,m ∪ K1,n
is Skolem mean if |m − n| = 4 + l for l = 1, 2, 3, . . . , m = 1, 2, 3, . . . , and l 6 m < n; K1,l ∪
K1,m ∪ K1,n is not Skolem mean if |m − n| > 4 + l for l = 1, 2, 3, . . . , m = 1, 2, 3, . . . , n >
l + m + 5 and l 6 m < n; K1,l ∪ K1,l ∪ K1,m ∪ K1,n is Skolem mean if |m − n| = 4 + 2l
for l = 2, . . . , m = 2, 3, 4 . . . , n = 2l + m + 4 and l 6 m < n; K1,l ∪ K1,l ∪ K1,m ∪ K1,n
is not Skolem mean if |m − n| > 4 + l for l = 1, 2, 3, . . . , m = 1, 2, 3, . . . , n > l + m + 5
and l 6 m < n; K1,l ∪ K1,l ∪ K1,m ∪ K1,n is not Skolem mean if |m − n| > 4 + 2l for
l = 2, . . . , m = 2, 3, 4 . . . , n > 2l + m + 5 and l 6 m < n; K1,l ∪ K1,l ∪ K1,m ∪ K1,n
is Skolem mean if |m − n| = 7 for m = 1, 2, 3, . . . , n = m + 7 and 1 6 m < n; and
K1,l ∪ K1,l ∪ K1,m ∪ K1,n is not Skolem mean if |m − n| > 7 for m = 1, 2, 3, . . . , n > m + 8
and 1 6 m < n. Balaji [405] proved that K1,l ∪K1,m ∪K1,n is Skolem mean if |m−n| < 4+l

the electronic journal of combinatorics (2023), #DS6 335

for integers 1, m > 1 and l 6 m < n. In [2850] Shainy and Balaji determined necessary
and sufficient conditions for the disjoint union of three stars to be Skolem mean.
In [2880] Shendra Shainy, Hariprabakaran, Swathy, and Balaji provided a technique
for coding a secret messages by applying a Skolem mean-like labeling on a graph obtained
from the two stars of the form K1,n and K1,n+1 that are joined by an edge from one vertex
of degree 1 in K1,n to one vertex of degree 1 in K1,n+1 .
In [1526] Jeyanthi, Selvi, and Ramya prove that Cm ∪ Cn , (Pn + K1 ) ∪ (n − 2)K2 (n >
2), (Pn + K2 ) ∪ (2n − 3)K2 (n > 2) and Wn ∪ (n − 1)K2 (n > 3) are Skolem difference
mean graphs. In [1527] they show that the union of any finite number of paths, the union
of any finite number of stars, G ∪ nK2 where G is Skolem difference mean and all the
vertex labels are odd, Cm ∪ Pm (m > 2), Km,n ∪ (m − 1)(n − 1)K2 , and K1,1,n ∪ (n − 1)K2 .
are skolem difference mean graphs.
In [1506] Jeyanthi, Ramya, and Thangavelu proved the following graphs have super
mean labelings: the one point union of any two cycles, graphs obtained by joining any
two cycles by an edge (dumbbell graphs), C2n+1 C2m+1 , graphs obtained by identifying
a copy of an odd cycle Cm with each vertex of Cn , the quadrilateral snake Qn , where n is
odd, and the graphs obtained from an odd cycle u1 , u2 , . . . , un by joining the vertices ui
and ui+1 by the path Pm (m is odd) for 1 6 i 6 n−1 and joining vertices un and u1 by the
path Pm . Jeyanthi, Ramya, Thangavelu, and Aditanar [1504] give super mean labelings
of Cm ∪ Cn and Tp -trees. Vasuki and Arockiaraj [3355] proved that nC4 , n > 1, triangular
grid graphs, the edge mCn -snakes, and the braid graphs are super mean graphs. They
further proved that the graphs obtained by identifying an edge of two cycles Cm and Cn
is a super mean graph.
In [1498] Jeyanthi and Ramya define Sm,n as the graph obtained by identifying one
endpoint of each of n copies of Pm and < Sm,n : Pm > as a graph obtained by identifying
one end point of a path Pm with the vertex of degree n of a copy of Sm,n and the other
endpoint of the same path to the vertex of degree n of another copy of Sm,n . They prove
the following graphs have super mean labelings: caterpillars, < Sm,n : Pm+1 >, and the
graphs obtained from P2m and 2m copies of K1,n by identifying a leaf of ith copy of K1,n
with ith vertex of P2m . They further establish that if T is a Tp -tree, then T K1 , T K2 ,
and, when T has an even number of vertices, T Kn (n > 3) are super mean graphs.
In [824] Dhanalakshmi and Parvathi define a mean square cordial labeling of a graph
G(V, E) with p vertices and q edges as one for which there is a bijection from V to {0, 1}
such that when each edge uv is assigned the label d(f (u)2 + f (v)2 )/2e the condition that
the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by at
most 1 and the number of edges labeled with 0 and the number of edges labeled 0 and the
number of edges labeled with 1 differ by at most 1 is satisfied. In [824] Dhanalakshmi and
Parvathi proved that helms, closed helms, gears, sunlet graphs, fans, and Cp nK1 admit
mean square cordial labelings. In [825] Dhanalakshmi and Parvathi showed that the paths,
combs, n-centipedes, and stars admit mean square cordial labelings. They also proved
that the induced subgraph obtained by the upper approximation of any subgraph H of
the above acyclic graphs admits a mean square cordial labeling. In [826] Dhanalakshmi
and Parvathi prove that bistars, subdivisions of stars, coconut trees, banana trees, the

the electronic journal of combinatorics (2023), #DS6 336

one-point union of Cn and K1,n , and Pm K1,n admit mean square cordial labelings.
Dhanalakshmim [827] proved that shell-butterfly graphs with shell orders m > 2 and
n > 2 admit mean square cordial labelings. Dhanalakshmi and Thirunavukkarasu [828] z
proved pentagonal snakes, subdivision of a pentagonal snakes, double pentagonal snakes,
and alternate pentagonal snakes admit mean square cordial labelings.
Arockiaraj, Durai Baskar, and Rajesh Kannan [227] calls a graph G with p vertices
and q edges a F -root square mean graph if there is an injective function f from the
vertices of pV (G) to {1, 2, . . . , q + 1} such that for each edge uv the induced function
f ∗ (uv) = b (f (u)2 + f (v)2 )/2c is bijective. They proved that the following are F -root
square mean graphs: paths, the graph Pn ◦ Sm obtained from the path Pn by attaching m
pendant vertices to each vertex of Pn , twigs T W (Pn ), the graph [Pn ; Sm ] obtained from n
(i)
copies of Sm and the path Pn by joining ui with the central vertex v1 of the ith copy of Sm
with of an edge for i 6 n, the mirror graph of Pn , the total graph of Pn , Pn2 , ladders, and
slanting ladders. In [228], Arockiaraj, Durai Baskar, and Rajesh Kannan analyzed that
the line graph operation preserves the F -root square meanness of line graph of the path,
cycle, star, Pn ◦ S1 , Pn ◦ S2 , [Pn ; S1 ], S(Pn ◦ S1 ), ladder, slanting ladder, the crown graph
Cn ◦ S1 and the arbitrary subdivision of S3 . Gopi [1133] proved that triangular snakes
Tn (n > 2), A(Tn ) (n > 3), D(Tn ) (n > 2), quadrilateral snakes, A(Qn ), D(Qn ) (n > 3)
are F -root square mean graphs.
Rajesh Kannan, Vikrama Prasad, and Gopi [1636] call a graph G with p vertices
and q edges a super root mean graph if there is an injective function f from the ver-
∗
p of G to {1, 2, . . . , p + q}
tices
∗
such thatp for each edge uv the induced function f (uv) =
2 2 2 2
b (f (u) + f (v) )/2c or f (uv) = d (f (u) + f (v) )/2e yields the set of vertex labels
and edge labels {1, 2, . . . , p + q}. They proved the following are super root square mean
graphs: Pm ∪Pm (m, n > 3); Pm ∪(Pn K1 ) (m, n > 3); (Pm K1 )∪(Pn K1 ) (m, n > 3);
the union of a path and a triangular snake; and the union of Pn K1 and a triangular
snake. Gopi and Kalaiyarasi [1135] prove that the following graphs have a super root
square mean labeling: Pn2 (n > 4), slanting ladders SLn (n > 3), triangular snakes with
a pendent edge attached to each vertex, and quadrilateral snakes with a pendent edge
attached to each vertex.
Chitra devi and Saravana Kumar [705] proved that nPm , nK3 , Pn K2 , the middle [705] new
graph of path Pn (graphs obtained by starting with a path and joining every consecutive
pair of vertices excluding the two end vertices of the path to a new isolated vertex), and
Cm Pn admits super root square mean labelings. Venkatesan and Thirugnanasambandam
[3373] proved that the following graphs admit super root square mean labelings: Pn2 (n > [3373] new
4), slanting ladders, Tn K1 (n > 3) ( Tn is a triangular snake), and Qn K1 (Qn is a
quadrilateral snake). Orias and Pedrano [2322] determined the super root square mean [2322] new
labelings of Cn K1 , middle cycles (graphs obtained by starting with a cycle and joining
every consecutive pair of verticies of the cycle to a new isolated vertex), polygonal chains,
alternate polygonal chains, and kayak paddles.
In [133] Akilandeswari calls a graph is a k-super root square mean graph if it is
possible to label the vertices with distinct elements from {k, k p + 1, k + 2, . . . , p + q +
k − 1} in such a way that when each edge uv is labeled with b (f (u)2 + f (v)2 )/2c or

the electronic journal of combinatorics (2023), #DS6 337

 p
d (f (u)2 + f (v)2 )/2e, the union of the vertex and edge labels is the set {k, k + 1, k +
2, . . . , p + q + k − 1}. He proved that Pn K1,2 , Pn K1,3 , the corona product of the
quadrilateral snake and K1 , double triangular snakes, and the corona product of the
double triangular snake and K1 admit k-super root square mean labelings.
A radio mean square labeling of a connnected graph is an injective map h from the set
of vertices of the graph G to the set of positive integers N, such that for any two distinct
vertices x, y, the inequality d(x, y) + d(h(x))2 + (h(y))2 /2e > dim(G) + 1 holds. For a
particular radio mean square labeling h, the maximum number of h(v) taken over all
vertices of G is called its spam, denoted by rmsn(h), and the minimum value of rmsn(h)
taking over all radio mean square labeling h of G is called the radio mean square number
of G, denoted by rmsn(G). In [273] Badr, Nada, Al-Shamiri, Abdel-Hay, and Elrokh
investigated the radio mean square numbersfor paths and cycles. For a graph G, they
present an approximate algorithm to determine rmsn(G). Finally, they introduced a new
mathematical model to find the upper bound of rmsn(G) for graph G.
In [2700] Sandhya, Somasundaram, and Anusa say a graph with q edges is a root
square mean graph if it is possible to label the vertices with distinct p elements from
{1, 2, . . . , q+1} in such a way that when each edge uv is labeled with b (f (u) 2 + f (v)2 )/2c
p
or d (f (u)2 + f (v)2 )/2e, the resulting edge labels are distinct. They prove that paths,
cycles, combs, ladders, triangular snakes, quadrilateral snakes, K1,n) (1 6 6), and Kn for
n = 1, 2 and 3 are root square mean graphs. In [2701] they proved that the following
graphs admit root square mean labelings: double triangular snakes, alternate double tri-
angular snakes, double quadrilateral snakes, alternate double quadrilateral snakes, and
polygonal chains.
In [1771] Kulandhai Therese and Romila introduced the notion of cube root cube
mean labeling as follows. For a graph G(V, E) with |(V (G)| = p and |E(G)| = q, let
f : V (G) → {1, 2, . . . , q + 1} be an injectivep function. The inducedp edge labeling f ∗ for
a vertex labeling f is defined by f ∗ (e) = b 3 (f (u)3 + f (v)3 )/2c or d 3 (f (u)3 + f (v)3 )/2e
for all e = uv ∈ E(G). If f is a bijection it is called a cube root cube mean labeling. If
such labeling exists, G is said to be a k-cube root cube mean graph. They proved that
paths, combs, ladders, and quadrilateral snakes admit cube root cube mean labelings.
In [2522] Princy Kala introduced the notion of k-super cube root cube mean la-
beling as follows. For a graph G(V, E) with |(V (G)| = p and |E(G)| = q let f :
V (G) → {k, k + 1, k + 2, . . . , p + q + k − 1} be an injective p function. The induced
∗ ∗
edge
p labeling f for a vertex labeling f is defined by f (e) = b 3 (f (u)3 + f (v)3 )/2c or
d 3 (f (u)3 + f (v)3 )/2e for all e = uv ∈ E(G). If f is a bijection and f (V (G))∪f ∗ (E(G)) =
{k, k +1, k +2, . . . , p+q +k −1}, f is called a k-super cube root cube mean labeling. If such
labeling exists, then G is said to be a k-super cube root cube mean graph. He proved the
existence k-super cube root mean labelings for triangular snakes, double triangular snakes,
quadrilateral snakes, double quadrilateral snakes, alternate triangular snakes, alternate
double triangular snakes, alternate quadrilateral snakes, and alternate double quadrilat-
eral snakes. In [2523] Princy Kala proved that the corona products of a triangular snake
and K1 , an alternate triangular snake and K1 , an alternate triangular snake and 2K1 ,
an alternate quadrilateral snake and K1 , Pn K1,2 , and Pn K1,3 are k-super cube root

the electronic journal of combinatorics (2023), #DS6 338

cube mean graphs.
Let G be a graph and let f : V (G) → {1, 2, . . . , n} be a function such that the label
of the edge uv is (f (u) + f (v))/2 or (f (u) + f (v) + 1)/2 according as f (u) + f (v) is even
or odd and f (V (G)) ∪ {f ∗ (e) : e ∈ E(G)} ⊆ {1, 2, . . . , n}. If n is the smallest positive
integer satisfying these conditions together with the condition that all the vertex and edge
labels are distinct and there is no common vertex and edge labels, then n is called the
super mean number of a graph G and it is denoted by Sm (G). Nagarajan, Vasuki, and
Arockiaraj [2252] proved that for any graph of order p, Sm (G) 6 2p − 2 and provided an
upper bound of the super mean number of the graphs: K1,n n > 7; tK1,n , n > 5, t > 1;
the bistar B(p, n), p > n; the graphs obtained by identifying a vertex of Cm and the center
of K1,n , n > 5; and the graphs obtained by identifying a vertex of Cm and the vertex of
degree 1 of K1,n . They also gave the super mean number for the graphs Cn , tK1,4 , and
B(p, n) for p = n and p = n + 1.
Manickam and Marudai [2072] defined a graph G with q edges to be an odd mean
graph if there is an injective function f from the vertices of G to {1, 3, 5, . . . , 2q − 1}
such that when each edge uv is labeled with (f (u) + f (v))/2 if f (u) + f (v) is even, and
(f (u) + f (v) + 1)/2 if f (u) + f (v) is odd, then the resulting edge labels are distinct.
Such a function is called a odd mean labeling. For integers a and b at least 2, Vasuki
and Nagarajan [3359] use Pab to denote the graph obtained by starting with verticies
y1 , y2 , . . . , ya and connecting yi to yi+1 with b internally disjoint paths of length i + 1 for
b
i = 1, 2, . . . , a−1 and j = 1, 2, . . . , b. For integers a > 1 and b > 2 they use Ph2ai to denote
the graph obtained by starting with verticies y1 , y2 , . . . , ya+1 and connecting yi to yi+1 with
b internally disjoint paths of length 2i for i = 1, 2, . . . , a and j = 1, 2, . . . , b. They proved
m
that the graphs P2r,m , P2r+1,2m+1 , and Ph2ri are odd mean graphs for all values of r and
m. Jeyanthi and Gomathi [1433] proved the edge linked cyclic snake EL(kCn ) (n > 6) is
an odd mean graph.
For a Tp -tree T with m vertices T @Pn is the graph obtained from T and m copies
of Pn by identifying one pendent vertex of ith copy of Pn with ith vertex of T . For a
Tp -tree T with m vertices T @2Pn is the graph obtained from T by identifying the pendent
vertices of two vertex disjoint paths of equal lengths n − 1 at each vertex of T . Ramya,
Selvi and Jeyanthi [2589] prove that Pm Kn (m > 2, n > 1) is an odd mean graph, Tp
trees are odd mean graphs, and, for any Tp tree T , the graphs T @Pn , T @2Pn , hT õK1,n i
are odd mean graphs.
For a Tp -tree T with m vertices let T ôCn denote the graph obtained from T and m
copies of Cn by identifying a vertex of ith copy of Cn with ith vertex of T and T õCn denote
the graph obtained from T and m copies of Cn by joining a vertex of ith copy of Cn with
ith vertex of T by an edge. In [1529] Selvi, Ramya, and Jeyanthi prove that for a Tp tree
T the graphs T ôCn (n > 3, n 6= 6) and T õCn , (n > 3, n 6= 6) are odd mean graphs.
Ramya, Selvi, and Jeyanthi [2588] prove that for a Tp -tree T the following graphs are
odd mean graphs: T @Pn , T @2Pn , Pm Kn , and the graph obtained from T and m copies
of K1,n by joining the central vertex of ith copy of K1,n with ith vertex of T by an edge.
For a graph G and some fixed vertex v of G, Pooranam, Vaski, and Suganthi [2478]
proved the following graphs have odd mean labelings: graphs obtained from a path Pm :

the electronic journal of combinatorics (2023), #DS6 339

u1 u2 · · · um and G by joining ui to v to the ith copy of G. Their results include the cases
where G = C4n , a star, or the cube Q3 . For a graph G and some fixed vertex v of G
they also proved the existence of odd mean labelings for graphs obtained from a path
Pm : u1 u2 · · · um and G by identitying ui with v in the ith copy of G, where G is Q3 or
(2) (2)
C4n and v is the vertex of C4n of degree 4.
A graph G is said to be vertex odd mean graphvertex odd mean if there exist an
injective function f : V (G) to {1, 3, 5, . . . , 2|E(G)| − 1} such that the induced mapping
f ∗ : E(G) to the set of positive integers defined by f ∗ (uv) = (f (u) + f (v))/2 is injective.
Such a function is called a vertex odd mean labeling. A graph G is called a vertex even
mean graph if there exist an injective function f : V (G) to {2, 4, 6, . . . , 2|E(G)|} such
that the induced mapping f ∗ : E(G) to the set of positive integers defined by f ∗ (uv) =
(f (u)+f (v))/2 is injective. Such a function is called a vertex even mean labeling. Revathi
[2617] gave vertex odd and even mean labelings for nontrivial umbrella graphs, mongolian [2617] new
tents, and K1 + Cn . Anitha, Selvam, and Thirusangu [214] proved that the extended [214] new
duplicate graph of kite graph admits mean, even mean, and odd mean labelings, Prajapati
and Raval [2503] and [2504] proved that cyclic snakes for n = 3, 4, 5 are vertex even mean [2503] new
and vertex odd mean graphs. They have proved that double cyclic snake and alternating [2504] new
cyclic snake for n = 3, 4, 5 are vertex odd mean and vertex even mean graph. Prajapati
and Raval [2505] proved that every vertex even mean graph is vertex odd mean graph and [2505] new
vice versa. They also proved that triangular snakes T Sn , T Sn P2 , quadrilateral snakes
QSn , QSn P2 , double quadrilateral snakes, alternating double quadrilateral snakes, jelly
fish, crowns, shells, and fans are vertex even mean and vertex odd mean graphs. Raval
and Prajapati [2597] proved that cyclic snakes (obtained by replacing each vertex of a [2597] new
path by a cycle), quadrilateral snakes, pentagonal snakes, and alternating quadrilateral
snakes admit vertex even and odd mean labelings. They also proved that even vertex odd
mean graphs are even mean graphs.
In [184] Amuthavalli and S. Dineshkumar say a (p, q) graph G has a k-odd edge mean [184] new
labeling if there exists an injection f from the edges of G toP{0, 1, 2, 3, . . . , 2k+2p−3} such
that the induced map f ∗ defined on V (G) by f ∗ (v) = d (f (vu)/deg(v)e is a bijection
from V to {2k −1, 2k +1, 2k +3, . . . , 2k +2p−3}. A graph that admits a k-odd edge mean
labeling is called a k-odd edge mean graph. They proved that Pn (n 6= 4), K1,2n (n > 2),
and Cn (6= 6, 7) are k-odd edge mean graphs for all k.
Thirugnanasambandam, Chitra, and Vishnupriya [3209] introduced a notion of prime [3209] new
odd mean graphs as follows. A graph G with p vertices and q edges for which there exists
an injective function f : V (G) → {1, 3, 5, . . . , 2q + 1} such that gcd (f (u), f (v)) = 1 and
the induced edge labeling f ∗ : E(G) → {2, 4, 6, . . . , 2p − 2} defined by f ∗ (uv) = d(f (u) +
f (v))/2e is injective is called a prime odd mean graph. They proved that caterpillars,
cycles, kites, ladders, spiders, and stars are prime odd mean graphs.
In [704] Chitra, Priya, and Vishnupriya [704] introduced the notion of odd Fibonacci [704] new
mean labeling of graph G as an injective f from the verticies of G to the odd Fibonacci [704] new
numbers such that the induced edge labeling f ∗ defined by f ∗ (uv) = (f (u) + f (v))/2 is
injective. A graph that admits a odd Fibonacci mean labeling is called an odd Fibonacci
mean graph. They proved the following graphs admit odd Fibonacci mean labelings:

the electronic journal of combinatorics (2023), #DS6 340

wheels, helms, gears, cycles, banana trees, tadpoles, fire crackers, fans, stars, ladders,
complete tripartite grahs, and Dutch windmills.
Uma Devi, Kamaraj, and Arockiaraj [811] determined the odd Fibonacci edge ir- [811] new
regularity strength for Pn (n > 2), K1,n , Pn K1 (n > 2), bistars B(m,n) and proved
the nonexistence of an odd Fibonacci edge irregular labeling for Kn (n 6 3) and
Km,n (m > 2, n > 4). In [813] Devi, Kamaraj, and Arockiaraj determined the odd [813] new
Fibonacci edge irregularity strength for Pn (n > 2), stars, subdivison of stars, subdivision
of fans, Pn mK1 (m, n > 2), and the graphs obtained by joining i pendant vertices to
the ith vertex of Pn (n > 2).
Gayathri and Amuthavalli [1034] (see also [182]) say a (p, q)-graph G has a (k, d)-odd
mean labeling if there exists an injection f from the vertices of G to {0, 1, 2, . . . , 2k −
1 + 2(q − 1)d} such that the induced map f ∗ defined on the edges of G by f ∗ (uv) =
d(f (u)+f (v))/2e is a bijection from edges of G to {2k −1, 2k −1+2d, 2k −1+4d, . . . , 2k −
1 + 2(q − 1)d}. When d = 1 a (k, d)-odd mean labeling is called k-odd mean. For n > 2
they prove the following graphs are k-odd mean for all k: Pn ; combs Pn K1 ; crowns
Cn K1 (n > 4); bistars Bn,n ; Pm Kn (m > 2); Cm Kn ; K2,n ; Cn except for
n = 3 or 6; the one-point union of Cn (n > 4) and an endpoint of any path; grids
Pm × Pn (m > 2); (Pn × P2 ) K1 ; arbitrary unions of paths; arbitrary unions of stars;
arbitrary unions of cycles; the graphs obtained by joining two copies of Cn (n > 4) by any
path; and the graph obtained from Pm × Pn by replacing each edge by a path of length
2. They prove the following graphs are not k-odd mean for any k: Kn ; Kn with an edge
deleted; K3,n (n > 3); wheels; fans; friendship graphs; triangular snakes; Möbius ladders;
books K1,m × P2 (m > 4); and webs. For n > 3 they prove K1,n is k-odd mean if and
only if k > n − 1. Gayathri and Amuthavalli [1035] prove that the graph obtained by
joining the centers of stars K1,m and K1,n are k-odd mean for m = n, n + 1, n + 2 and not
k-odd mean for m > n + 2. For n > 2 the following graphs have a (k, d)-mean labeling
[1063]: Cm ∪ Pn (m > 4) for all k; arbitrary unions of cycles for all k; P2m ; P2m+1 for
k > d; (P2m+1 is not (k, d)-mean when k < d); combs Pn K1 for all k; K1,n for k > d;
K2,n for k > d; bistars for all k; nC4 for all k; and quadrilateral snakes for k > d.
In [2788] Seoud and Salim [2789] proved that a graph has a k-odd mean labeling if
and only if it has a mean labeling. In [2788] Seoud and Salim give upper bounds of the
number of edges of graphs with a (k, d)-odd mean labeling
Pricilla [2519] defines an even mean labeling of a graph G as an injective function f from
the verticies of G to {2, 4, . . . , 2|E(G)|} such that the edge labels given by (f (u) + f (v))/2
are distinct. Vaidya and Vyas [3330] proved that D2 (Pn ), M (Pn ), T (Pn ), S 0 (Pn ), Pn2 , Pn3 ,
switching of pendent vertex in Pn , S 0 (Bn,n ), double fans, and duplicating each vertex by
an edge in paths are even mean graphs.
Gayathri and Gopi [1043] defined a graph G with q edges to be an k-even mean graph
if there is an injective function f from the vertices of G to {0, 1, 2, . . . , 2k + 2(q − 1)}
such that when each edge uv is labeled with (f (u) + f (v))/2 if f (u) + f (v) is even, and
(f (u)+f (v)+1)/2 if f (u)+f (v) is odd, then the resulting edge labels are {2k, 2k +2, 2k +
4, . . . , 2k + 2(q − 1)}. Such a function is called a k-even mean labeling. In [1043] they
proved that the graphs obtained by joining two copies of Cn with a path Pm are k-even

the electronic journal of combinatorics (2023), #DS6 341

mean for all k and all m, n > 3 when n ≡ 0, 1 (mod 4) and for all k > 1, m > 7, and
n > 3. In [1045] Gayathri and Gopi proved that various graphs obtained by joining two
copies of stars K1,m and K1,n with a path by identifying the one endpoint of the path with
the center of one star and the other endpoint of the path with the center of the other star
are k-even mean. In [1044] they proved that various graphs obtained by appending a path
to a vertex of a cycle are k-even mean. In [1046] they proved that Cn ∪ Pm , n > 4, m > 2,
is k-even mean for all k. Gayathri and Gopi [1049] proved the following are k-even mean
graphs: shadow graphs of stars with at least 3 vertices; edge duplication graphs of cycles
with at least 4 vertices; and vertex duplication graphs of paths and cycles with at least 4
vertices.
Gayathri and Gopi [1047] say graph G with q edges has a (k, d)-even mean labeling if
there exists an injection f from the vertices of G to {0, 1, 2, . . . , 2k + 2(q − 1)d} such that
the induced map f ∗ defined on the edges of G by f ∗ (uv) = (f (u) + f (v))/2 if f (u) + f (v)
is even and f ∗ (uv) = (f (u) + f (v) + 1)2 if f (u) + f (v) is odd is a bijection from edges
of G to {2k, 2k + 2d, 2k + 4d, . . . , 2k + 2(q − 1)d}. A graph that has a (k, d)-even mean
labeling is called a (k, d)-even mean graph. They proved that Pm ⊕ nK1 (m > 3, n > 2)
has a (k, d)-even mean labeling in the following cases: all (k, d) when m is even; all (k, d)
when m is odd and n is odd; and m is odd, n is even and k > d.
Kalaimathy [1562] investigated conditions under which a mean labeling for a graph
G will yield a (k, d)-even mean labeling for G and vice versa. He also gave conditions
under which two graphs that have (1, 1)-mean labelings can be joined by an single edge
to obtain a new graph that has a (1, 1)-even mean labeling. Gopi’s Ph. D. thesis [1130]
has a large number of results about mean, k-mean, k-odd mean, k-even mean, (k, d)-odd
mean , and (k, d)-mean labelings.
In [3363] Vasuki, Nagarajan, and Arockiaraj introduced the notion of even vertex odd
mean graphs as follows. A (p, q)-graph is said to have an even vertex odd mean labeling
if there exists an injective function f from V (G) to {0, 2, 4, . . . , 2q − 2, 2q} such that the
induced map f ∗ : E(G) to {1, 3, 5, . . . , 2q − 1} defined by f ∗ (uv) = (f (u) + f (v))/2 is a
bijection. A graph that admits an even vertex odd mean labeling is called an even vertex
odd mean graph. They proved that paths, C4n , K2,n , bistars Bm,n for n = m, m + 1,
quadrilateral snakes Qn , combs, Pm × Pn , C4m × Pn , ladders, and dragons are even vertex
odd mean graphs. Rajesh Kannan, Vikrama Prasad, Gopi [1637] proved the following
graphs have an even vertex odd mean labeling: slanting ladders SLn (n > 3); double
triangular snakes; alternative double triangular snakes; graphs obtained by starting with
a tree G with at least 3 vertices and a mean labeling and a copy G0 of G by joining
each vertex of G to its corresponding vertex in G0 with an edge; graphs obtained by
starting with a path v1 v2 · · · vn (n > 4) and joining v1 and v3 to an isolated vertex; graphs
obtained by starting with a path v1 v2 · · · vn (n > 4) and appending two edges to each of
v2 , v3 , . . . , vn−1 ; and graphs obtained from a quadrilateral snake and appending an edge
at each vertex. The H-graph of a path Pn is the graph obtained from two copies of Pn
with vertices v1 , v2 , . . . , vn and u1 , u2 , . . . , un by joining the vertices vn/2+1 and un/2+1 by
an edge if n is odd and the vertices v(n+1)/2 and u(n/2 by an edge if n is even. Rajesh
Kannan, Vikrama Prasad, and Gopi [1638] prove that the H-graph of Pn (n > 3) and

the electronic journal of combinatorics (2023), #DS6 342

the graph H K1 have even vertex odd mean labelings where H is the H graph of
Pn (n > 3). In [1639] and [1640] Rajesh Kannan, Vikrama Prasad, and Gopi proved the
following are even vertex odd mean graphs: graphs obtanied by joining the centers of
two stars K1,m and K1,n by a path Pt (m, n, t > 2), graphs obtained by duplicating an
edge of Cn (n > 4), graphs obtained by joining each endpoint of P3 to n isolated vertices,
shadow graphs of stars, shadow graphs of bistars B(n, n), mirror graphs of paths, and
the graphs obtained taking two copies of Pn × P2 and joining each vertex of one with
the matching vertex in the other with an edge. Kannan, Vikrama Prasad, and Gopi
[1641] proved that the following graphs admit even vertex odd mean labelings: slanting
ladders SLn (n > 3), twigs TW(n) (n > 4, double triangular snakes, alternative double
quadrilateral snakes, and Qn · K1 . Prasad, Rejesh Kannan, and Gopi [2515] proved that
C4m K1,4n , Pm Pn , and K2 + Kn have even vertex odd mean labelings. In [2503]
Prajapati and Raval proved that quadrilateral snakes, pentagonal snakes, and alternating
quadrilateral snakes are vertex even and odd mean graphs. They also proved that even
vertex odd mean graphs are even mean graphs. Jeyanthi, Ramya, and Selvi [1503] prove
that TP -trees (transformed trees), T @Pn , T @2Pn , and hT ôK1,n i (where T is a TP tree)
are even vertex odd mean graphs.
Basher [477] investigated an even vertex labeling for the calendula graphs and intro-
duced an arbitrary calendula graph as one in which if every edge from Cm is attached by
an edge from arbitrary Cni , where ni may vary for each 1 6 i 6 m. He proved that these
graphs are also even vertex odd mean graphs. In [479] Basher proved several cycle related
graphs are even vertex odd mean graphs. Basher and Kamran Siddiqui [481] proved that
paths, cycles, combs, crowns, and planar grid super subdivisions are even vertex odd mean
graphs.
For a graph G(V, E) a bijection f from V (G) ∪ E(G) onto {1, 2, . . . , |V (G)| + |V (E)|}
is said to be a total mean labeling if the values of f ∗ (uv) = d(f (u) + f (v) + f (uv))/3e
taken over all edges are distinct. A graph G is said to be a total mean labeling graph
if it admits a total mean labeling. Karuppasamy and Kaleeswari [1659] proved that
Pn , Pn+ , K1,n , K2,n , Cn , Bm,n , triangular snakes, and alternate triangular snakes are total
mean labeling graphs.
Murugan and Subramanian [2218] say a (p, q)-graph G has a Skolem difference mean
labeling if there exists an injection f from the vertices of G to {1, 2, . . . , p + q} such that
the induced map f ∗ defined on the edges of G by f ∗ (uv) = (|f (u)−f (v)|)/2 if |f (u)−f (v)|
is even and f ∗ (uv) = (|f (u) − f (v)| + 1)/2 if |f (u) + f (v)| is odd is a bijection from edges
of G to {1, 2, . . . , q}. A graph that has a Skolem difference mean labeling is called a
Skolem difference mean graph. They show that the graphs obtained by starting with two
copies of Pn with vertices v1 , v2 , . . . , vn and u1 , u2 , . . . , un and joining the vertices v(n+1)/2
and u(n+1)/2 if n is odd and the vertices vn/2+1 and un/2 if n is even are Skolem difference
mean. Parmar and Vaghela [2348] proved the following graphs have Skolem difference
mean labelings: brooms Bn,d (n > 4, d > 2) (the graph with n vertices obtained from Pd
by appending n−d edges at an endpoint), combs Pn K1 (n > 2), K1,m ∪K1,n (m, n > 2),
and K1,3 ∗K1,n (n > 2) obtained from K1,3 by attaching root of a star K1,n at each pendent
vertex of K1,3 . Jeyanthi [1424] proved ∪Pni (ni > 2); ∪ K1,ni (ni > 2); Cn ∪ Pm (n >

the electronic journal of combinatorics (2023), #DS6 343

3, m > 2); Km,n ∪ (m − 1)(n − 1)K2 ; and K1,1,n ∪ (n − 1)K2 are Skolem difference mean
graphs. She also proved that if G is a Skolem difference mean graph, then G ∪ nK2 is a
Skolem difference mean graph.
Let L0 , L1 , . . . denote the sequence of Lucas numbers. In [2402] Ponmoni, Navaneetha
Krishnan, and Nagarajan introduce the following graph labeling method. A graph G with
p vertices and q edges is said to have a Skolem difference Lucas mean labeling if there is
an injective function f from the vertices to {1, 2, . . . , Lp+q } such that when the edge uv
is labeled with |f (u) − f (v)|/2 if |f (u) − f (v)| is even, and (|f (u) − f (v)| + 1)/2 if |f (u) −
f (v)| is odd, then the resulting edge labels are distinct and belong to {L1 , L2 , . . . Lq }. A
graph that admits a Skolem difference Lucas mean labeling is called a Skolem difference
Lucas mean graph. They proved the graphs obtained from K1,m by identifying the center
of K1,n with the endpoint of each non-center vextex of K1,m , bistars, K1,m 2Pn and
(1) (2) (m)
hK1,n , K1,n , . . . , K1,n i are Skolem difference Lucas mean graphs.
Selvi, Ramya, and Jeyanthi [2747] prove that Cn @Pn (n > 3, m > 1), Kn (n 6 3),
the shrub St(n1 , n2 , · · · , nm ), and the banana tree Bt(n, n, . . . , n) are Skolem difference
mean graphs. They show that if G is a (p, q) graph with q > p then G is not a Skolem
difference mean graph and prove that Kn (n > 4) is not a Skolem difference mean graph.
A skolem difference mean labeling for which all the labels are odd is called an extra Skolem
difference mean labeling. They also prove that the graph T hK1,n1 : K1,n2 : · · · : K1,nm i,
obtained from the stars K1,n1 , K1,n2 , . . ., K1,nm by joining the central vertex of K1,nj and
K1,nj+1 to a new vertex wj for 1 6 j 6 m − 1 and the graph T hK1,n1 ◦ K1,n2 ◦ · · · ◦ K1,nm i,
obtained from K1,n1 , K1,n2 , . . ., K1,nm by joining a leaf of K1,nj+1 to a new vertex wj for
1 6 j 6 m − 1 by an edge are extra Skolem difference mean graphs. Jeyanthi, Selvi,
and Ramya [1527] proved that the union of any number of paths, any number of stars,
G ∪ nK2 where G is an extra Skolem difference mean tree, Cn ∪ Pm (n > 3, m > 2),
Km,n ∪ (m − 1)(n − 1)K2 , and K1,1,n ∪ (n − 1)K2 have Skolem difference mean labelings.
Vaghela and Parmar [3242] provided an extra Skolem difference mean labeling for combs,
twigs of Pn , H graphs of Pn , graphs obtained from K1,2 by attaching the root of K1,n
at each pendant vertex of K1,2 , graphs obtained from K1,3 by attaching the root of K1,n
at each pendant vertex of K1,3 , and related graphs. Gross and Yellen [1161] proved that
Tp -trees and caterpillars are extra Skolem difference mean graphs.
Let G(V, E) be a graph with p vertices and q edges. Ramya, Kalaiyarasi, and Jeyanthi
[2586] say G is a Skolem odd difference mean if there exists an injective function f :
V (G) → {0, 1, 2, 3, . . . , p+3q−3} such that the induced map f ∗ : E(G) → {1, 3, 5, . . . , 2q−
1} denoted by f ∗ (uv) = d|f (u) − f (v)|/2e is a bijection. A graph that admits a Skolem
odd difference mean labeling is called a odd difference mean graph. They prove that Pn ,
Cn (n > 4), K1,n , Pn K1,n , coconut trees T (n, m) obtained by identifying the central
vertex of the star K1,m with a pendent vertex of Pn , Bm,n , caterpillars S(n1 , n2 , . . . , nm ),
Pm @Pn and Pm @2Pn are Skolem odd difference mean graphs. (Pm @Pn is obtained from
Pm and m copies of Pn by identifying one pendent vertex of the i-th copy of Pn with the
i-th vertex of Pm ; Pm @2Pn is defined analogously.) They establish that Kn , n > 3 and
K2,n (n > 3) are not Skolem odd difference mean graphs. They also prove that K2,n is a
Skolem odd difference mean graph if n 6 2. In [1452] Jeyanthi, Kalaiyarasi, Ramya, and

the electronic journal of combinatorics (2023), #DS6 344

Saratha Devi prove that bistars B(m, n), mPn , mPn ∪ tPs , mK1,n ∪ tK1,s and the graph
hPm õSn i obtained from Pm and m copies of K1,n by joining the central vertex of ith copy
of K1,n with ith vertex of Pm by an edge admit Skolem odd difference mean labelings.
They also prove that if G(p, q) is a Skolem odd differences mean graph then p > q and
that wheels, umbrellas, books, and ladders are not Skolem odd difference mean graphs.
They call a Skolem odd difference mean labeling a Skolem even vertex odd difference mean
labeling if all the vertex labels are even. They prove that Pn , K1,n , Pn K1 , the coconut
tree T (n, m) obtained by identifying the central vertex of K1,m with a pendent vertex of a
path Pn , B(m, n), caterpillars S(n1 , n2 , . . . , nm ), Pm @Pn are Pm @2Pn are even vertex odd
difference mean and Cn is not a Skolem even vertex odd difference mean graph. In [1566]
Kalaiyarasi, Ramya, and Jeyanthi prove the following graphs have Skolem odd difference
mean labelings: graphs obtained from a Tp tree with m vertices and m copies of K1,n by
identifying the central vertex of ith copy of K1,n , with ith vertex of T ; graphs obtained by
connecting an isolated vertex to central vertex of each of a number of stars; the banana
trees obtained by connecting an isolated vertex to one leaf of each of any number of K1,n ;
graphs obtained from K1,n1 , K1,n2 , . . . , K1,nm by joining the central vertices of K1,nj and
K1,nj+1 to a new vertex wj for 1 6 j 6 m−1; graphs obtained from K1,n1 , K1,n2 , . . . , K1,nm
by joining a leaf of K1,nj and a leaf of K1,nj+1 to a new vertex wj for 1 6 j 6 m − 1.
Lau, Jeyanthi, Ramya, and Kalaiyarasi [1805] say a (p, q)-graph G(V, E) is a Skolem
even difference mean if there exists an injective function f : V (G) → {0, 1, 2, 3, . . . , p +
3q − 1} such that the induced map f ∗ : E(G) → {2, 4, . . . , 2q} defined by f ∗ (uv) =
d|f (u) − f (v)|/2e is a bijection. A graph that admits a Skolem even difference mean
labeling is called a even difference mean. They prove: the disjoint union of paths of length
at least 2 and K2,n ∪(n−1)K2 (n > 2) are Skolem even vertex odd difference mean graphs;
if G is a Skolem even vertex odd difference mean (q + 1, q)-graph, then G ∪ nK2 , G ∪ Pn ,
and G ∪ K1,n are Skolem odd difference mean graphs; Cm ∪ Pn (n > 2) is a Skolem odd
difference mean graph for m = 4 and 6; the caterpillar S(n1 , n2 , . . . , nm ) is a Skolem even
vertex even difference mean graph; Pm @Pn , mPn , Km,n ∪ (m − 1)(n − 1)K2 (m, n > 2),
K1,n ∪nK2 , and K1,1,n ∪nK2 are Skolem even difference mean graphs; and if G is a Skolem
even vertex even difference mean (q +1, q)-graph, then G∪nK2 is a Skolem even difference
mean graph. They conclude with the following open problem: Establish that G ∪ nK2
where G is a (complete) multipartite graph is a Skolem even difference mean graph.
Kalaiyarasi, Ramya, and Jeyanthi [1451] say a graph G(V, E) with p vertices and q
edges has a centered triangular mean labeling if it is possible to label the vertices with
distinct elements f (x) from S, where S is a set of non-negative integers in such a way
that for each edge e = uv, f ∗ (e) = d(f (u) + f (v))/2e and the resulting edge labels are
the first q centered triangular numbers. A graph that admits a centered triangular mean
labeling is called a centered triangular mean graph. They prove that Pn , K1,n , bistars
Bm,n , coconut trees, caterpillars S(n1 , n2 , n3 , . . . , nm ), St(n1 , n2 , n3 , . . . , nm ), banana
trees Bt(n, n, . . . , n) and Pm @Pn are centered triangular mean graphs.
Selvi, Ramya, and Jeyanthi [2746] define a triangular difference mean labeling of a
graph G(p, q) as an injection f : V −→ Z + , such that when the edge labels are defined
as f ∗ (uv) = d|f (u) − f (v)|/2e the values of the edges are the first q triangular numbers.

the electronic journal of combinatorics (2023), #DS6 345

A graph that admits a triangular difference mean labeling is called a triangular differ-
ence mean graph. They prove that the following are triangular difference mean graphs:
Pn , K1,n , Pn K1 , bistars Bm,n , graphs obtained by joining the roots of different stars
to the new vertex, trees T (n, m) obtained by identifying a central vertex of a star with a
pendent vertex of a path, the caterpillar S(n1 , n2 , . . . , nm ) and the graph Cn @Pm .
A graph G(V, E) with p vertices and q edges is said to have centered triangular dif-
ference mean labeling if there is an injective mapping f from V to Z + such that the
edge labels induced by f ∗ (uv) = d|f (u) − f (v)|/2e are the first q centered triangu-
lar numbers. A graph that admits a centered triangular difference mean labeling is
called a centered triangular difference mean graph. Ramya, Selvi, and Jeyanthi [1530]
prove that Pn , K1,n , Cn K1 , bistars Bm,n , Cn (n > 4), coconut trees, caterpillars
S(n1 , n2 , n3 , . . . , nm ), Cn @Pm (n > 4) and Sm,n are centered triangular difference mean
graphs.
Gayathri and Tamilselvi [1063] say a (p, q)-graph G has a (k, d)-super mean labeling if
there exists an injection f from the vertices of G to {k, k+d, . . . , k+(p+q)d} such that the
induced map f ∗ defined on the edges of G by f ∗ (uv) = d(f (u) + f (v))/2e has the property
that the vertex labels and the edge labels together are the integers from k to k + (p + q)d.
When d = 1 a (k, d)-super mean labeling is called k-super mean. For n > 2 they prove the
following graphs are k-super mean for all k: odd cycles; Pn ; Cm ∪ Pn ; the one-point union
of a cycle and the endpoint of Pn ; the union of any two cycles excluding C4 ; and triangular
snakes. For n > 2 they prove the following graphs are (k, d)-super mean for all k and d:
Pn ; odd cycles; combs Pn K1 ; and bistars. In [1506] Jeyanthi, Ramya, and Thangavelu
proved the following graphs have k-super mean labelings: C2n , C2n+1 × Pm , grids Pm × Pn
with one arbitrary crossing edge in every square, and antiprisms on 2n vertices (n > 4).
(Recall an antiprism on 2n vertices has vertex set {x1,1 , . . . , x1,n , x2,1 , . . . , x2,n } and edge
set {xj,i , xj,i+1 }∪{x1,i , x2,i }∪{x1,i , x2,i−1 } where subscripts are taken modulo n). Jeyanthi,
Ramya, Thangavelu [1505] give k-super mean labelings for a variety of graphs. Jeyanthi,
Ramya, Thangavelu, and Aditanar [1504] show how to construct k-super mean graphs
from existing ones. For n > 3 Gayathri and Tamilselvi [1063] proved the following graphs
are k-super edge mean for all k: paths; cycles; combs Pn K1 ; triangular snakes; crowns
Cn K1 ; the one-point union of C3 and an endpoint of Pn ; and Pn K2 .
In [2704] Sandhya, Somasundaram, and Ponraj call a graph with q edges a harmonic
mean graph if there is an injective function f from the vertices of the graph to the integers
from 1 to q + 1 such that when each edge uv is labeled with d2f (u)f (v)/(f (u) + f (v))e
or b2f (u)f (v)/(f (u) + f (v))c the edge labels are distinct. They prove the following
graphs have such a labeling: paths, ladders, triangular snakes, quadrilateral snakes, Cm ∪
Pn (n > 1); Cm ∪ Cn ; nK3 ; mK3 ∪ Pn (n > 1); mC4 ; mC4 ∪ Pn ; mK3 ∪ nC4 ; and
Cn K1 (crowns). They also prove that wheels, prisms, and Kn (n > 4) with an edge
deleted are not harmonic mean graphs. In [2702] Sandhya, Somasundaram, and Ponraj
investigated the harmonic mean labeling for a polygonal chain, square of the path and
dragon and enumerate all harmonic mean graph of order at most 5. In [1370] Jayasekaran
and David Raj prove that some disconnected graphs are harmonic mean graphs. In
[2551] Raj, Jayasekaran, and Sandhya investigate some new families of harmonic mean

the electronic journal of combinatorics (2023), #DS6 346

graphs. Seoud and Salim [2793] provided upper bounds of the number of edges of graphs
of given orders with harmonic mean labelings and showed that all graphs of order at most
9 have have harmonic mean labelings using the floor function portion of the definition.
Meena and Sivasakth [2126] prove that subdivision graphs of Pn K1 , Pn K2 , H-graphs,
Cn K1 , Cn K2 , quadrilateral snakes, and triangular snakes are harmonic mean.
Sandhya, Somasundaram, and Ponraj [2703] proved that the following graphs have
harmonic mean labelings: graphs obtained by duplicating an arbitrary vertex or an arbi-
trary edge of a cycle; graphs obtained by joining two copies of a fixed cycle by an edge;
the one-point union of two copies of a fixed cycle; and the graphs obtained by starting
with a path and replacing every other edge by a triangle or replacing every other edge by
a quadrilateral.
Vaidya and Barasara [3247] proved that the following graphs have harmonic mean
labelings: graphs obtained by the duplication of an arbitrary vertex or arbitrary edge of
a path or a cycle; the graphs obtained by the duplication of an arbitrary vertex of a path
or cycle by a new edge; and the graphs obtained by the duplication of an arbitrary edge
of a path or cycle by a new vertex.
In [2259] Narasimhan and Sampathkumar called a graph with p vertices a contra
harmonic mean graph if there is an injective function f from the vertices of the graph to
the integers from 1 to p such that when each edge uv is labeled with f (uv) = d(f (u))2 +
(f (v))2 /(f (u) + f (v))e or f (uv) = b(f (u))2 + (f (v))2 /(f (u) + f (v))c the edge labels are
distinct. They prove the following graphs have such a labeling: paths, cycles, Cm ∪
Pn , Cm ∪ Cn , nK3 , nK3 ∪ Pm , and nK3 ∪ Cm . Gopi [1134] called a graph with q edges
a k-contra harmonic mean graph if there is an bijective function f from the edges of
the graph to the integers from k − 1 to k + q + 1 such that each edge uv is labeled with
f (uv) = d(f (u))2 +(f (v))2 /(f (u)+f (v))e or f (uv) = b(f (u))2 +(f (v))2 /(f (u)+f (v))c. He
proves that triangular snakes, double triangular snakes, quadrilateral snakes, and double
quadrilateral snakes have k-contra harmonic mean labelings.
Gopi and Suba [1140] say a graph G with p verticies and q edges is a super Lehmer-3
mean graph if there is an injective function f from the vertices of G to {1, 2, . . . , q+1} such
that for each edge uv the induced function f ∗ (uv) = b(f (u)3 + f (v)3 )/(f (u)2 + f (v)2 )c or
f ∗ (uv) = d(f (u)3 + f (v)3 )/(f (u)2 + f (v 2 ))e yields that the set of vertex labels and edge
labels is {1, 2, . . . , p}. They prove that Pm K1,n and the graph obtained by identifying
each endpoint of a path with an endpoint of the star K1,n have a super Lehmer-3 labeling.
In [1139] Gopi and Nirmala provide Lehmer-3 mean labelings for Pm Cn (m, n > 3) and
Pm K1 Cn (m, n > 3).
In [2859] Shalini and Meena introduced the notion of Lehmer-4 mean labelings as [2859] new
follows. A graph G(V, E) with p vertices and q edges is called a Lehmer-4 mean graph,
if there is an injection from V to {2, 4, 6, . . . , 2p} and the induced function f ∗ (uv) =
b(f (u)4 + f (v)4 )/(f (u)2 + f (v)2 )c or f ∗ (uv) = d(f (u)4 + f (v)4 )/(f (u)2 + f (v 2 ))e in an
injection. In this case, f is called a Lehmer-4 mean labeling mean of G. They proved
paths, combs, Pn K1,2 and Pn K1,3 are Lehmer-4 mean graphs.
An F -geometric mean labeling of a graph G with q edges, is an injective function
from the vertex set of G to {1, 2, . . . , q + 1} such that the edge labels obtained from the

the electronic journal of combinatorics (2023), #DS6 347

floor function of geometric mean of the vertex labels of the end vertices of each edge,
are all distinct and the set of edge labels is {1, 2, . . . , q}. Durai Baskar, Arockiaraj,
and Rajendran [859] proved that the following graphs are F -geometric mean: graphs
obtained by identifying a vertex of consecutive cycles (not necessarily of the same length)
in a particular way; graphs obtained by identifying an edge of consecutive cycles (not
necessarily of the same length) in a particular way; graphs obtained by joining consecutive
cycles (not necessarily of the same length) by paths (not necessarily of the same length)
in a particular way; Cn K1 ; Pn K1 ; Ln K1 ; G K1 where G is the graph obtained
by joining two copies of Pn by an edge in a particular way; graphs obtained by appending
two edges at each vertex of graphs obtained by joining two copies of Pn by an edge in
a particular way; graphs obtained from Cn by appending two edges at each vertex of
Cn ; graphs obtained from ladders by appending two edges at each vertex of the ladders;
graphs obtained from Pn by appending an end point of the star S2 to each vertex of Pn ;
and graphs obtained from Pn by appending an end point of the star S3 to each vertex of
Pn .
A C-geometric mean labeling of a graph G with q edges, is an injective function from
the vertex set of G to {1, 2, 3, . . . , q + 1} such that the edge labels obtained from the
ceiling function of the geometric mean of the vertex labels of the end vertices of each
edge are all distinct and the set of edge labels is {2, 3, 4, . . . , q + 1}. A graph is said to
be a C-geometric mean graph if it admits a C-geometric mean labeling. In [861] Durai
Baskar and Arockiaraj study the C-geometric meanness of some cycle related graphs such
as cycle, union of a path and a cycle, unions of two cycles, the graphs C3 × Pn , corona of
cycle, the graphs Pa,b , Pba and some chain graphs.
A geometric mean labeling f of G(V, E) is called a super geometric mean labeling if
f (V )∪f (E) = {1, 2, . . . , |V |+|E|}. Sandhya, Merly, and Shiny [2697] [2698] prove that the
subdivision graphs of the following graphs have super geometric mean labelings: alternate
quadrilateral snakes, double quadrilateral snakes, alternate double quadrilateral snakes,
triple quadrilateral snakes, and subdivisions of alternate triple quadrilateral snakes. In
[2699] they prove that the following graphs have super geometric mean labelings: tri-
angular ladders, triangular snakes, alternate triangular snakes, quadrilateral snakes, and
alternate quadrilateral snakes. Hemalatha and Selvi [1241] prove that following graphs
have super geometric mean labelings: flags, kayak paddles, dumbells, polygonal snakes,
and graphs obtained by connecting any number of copies of Cn where each joined to the
next with an edge.
Durai Basker and Arockiaraj [858] study the F -geometric meanness of cycles, stars,
complete graphs, combs, ladders, triangular ladders, middle graphs of paths, graphs ob-
tained from duplicating arbitrary vertex by a vertex as well as arbitrary edge by an edge
in cycles, and subdivisions of combs and stars.
In 2017 Hemalatha, Mohanaselvi, and Amuthavalli [1243] defined a radio geometric [1243] new
mean labeling of a graph G as a mapping from the vertex set to the set of natural numbers
such that for two distinct vertices u and v of G, d(u, v) + df (u)f (v)e > 1 + diam(G).
The radio geometric mean number of f is the maximum number assigned to any vertex
of G. The radio geometric mean number of G is the minimum value taken over all radio

the electronic journal of combinatorics (2023), #DS6 348

geometric mean labeling f of G. A radio antipodal geometric mean labeling of a graph G
is a mapping f from the vertex set of G to pthe set of natural numbers such that for two
distinct vertices u and v of G, d(u, v) + d f (u)f (v)e > diam(G). If d(u, v) = diam(G),
the vertices u and v can be given the same label and if d(u, v) 6= diam(G), the vertices
u and v are assigned different labels. The radio antipodal geometric mean number of f is
the maximum number assigned to any vertex of G. The radio antipodal geometric mean
number of G is the minimum value taken over all radio geometric mean labeling f of
G. Hemalatha, Mohanaselvi, and Amuthavalli [1243] provided the radio geometric mean [1243] new
numbers for stars, bistars, compelte k-ary trees with 3 levels, and the graph lotus inside a
circle. In [1242] Hemalatha and Amuthavalli determined the radio geometric mean number [1242] new
of splitting graphs of stars and bistars. Hemalatha and Mohanaselvi [1244] found the radio [1244] new
geometric mean numbers of the subdivision graphs of complete graphs, complete bipartite
graphs, books, and windmills. In [1102] Giridaran, Jose, and Jeony provided upper bounds [1102] new
for the radio antipodal geometric mean number of ladders, triangular ladders, circular
ladders (Cn ×K2 ), and pagoda graphs (graphs obtained ny joining two adjacent endpoints
of a ladder to new vertex.
Arockiaraj and Meena Kumari introduced the F-face magic mean labeling of graphs in
[859]. This motivated Meena Kumari and Arockiaraj [2121] to introduce the (1,0,0)-F-face
magic mean labeling of graphs as follows. A bijection φ from V (G) to {1, 2, . . . , |V (G)|}
is called a (1,0,0)-F-face magic mean labeling of G if the induced face labeling φ∗ (fi ) =
b(sum of the labels of the vertices in the boundary of fi )/deg(fi )c is a constant for each
face fi , including the exterior face of G, where deg fi is the number of edges that bound
the face. A graph that admits an (1,0,0)-F-face magic mean labeling is called (1,0,0)-F-
face magic mean. In [2121] Arockiaraj and Meena Kumar showed that Pn + K1 (n > 2),
cycles with certain cords, Cm × Pn where m and n are even, and graphs obtained by
duplicating every edge of a cycle by a vertex admit (1,0,0)-F-face magic mean labelings.
In [3139] Sundaram, Ponraj, and Somasundaram introduced a new labeling parameter
called the mean number of a graph. Let f be a function from the vertices of a graph to
the set {0, 1, 2, . . . , n} such that the label of any edge uv is (f (u) + f (v))/2 if f (u) + f (v)
is even and (f (u) + f (v) + 1)/2 if f (u) + f (v) is odd. The smallest integer n for which the
edge labels are distinct is called the mean number of a graph G and is denoted by m(G).
They proved that for a graph G with p vertices m(tK1,n ) 6 t(n + 1) + n − 4; m(G) 6
2p−1 − 1; m(K1,n ) = 2n − 3 if n > 3; m(B(p, n)) = 2p − 1 if p > n + 2 where B(p, n) is a
(t)
bistar; m(kT ) = kp − 1 for a mean tree T , m(Wn ) 6 3n − 1, and m(C3 ) 6 4t − 1.
Let f be a function from V (G) to {0, 1, 2}. For each edge uv of G, assign the label
d(f (u) + f (v))/2e. Ponraj, Sivakumar, and Sundaram [2473] say that f is a mean cordial
labeling of G if |vf (i) − vf (j) | 6 1 for i and j in {0, 1, 2} where vf (x) and ef (x) denote the
number of vertices and edges labeled with x, respectively. A graph with a mean cordial
labeling is called a mean cordial graph. Observe that if the range set of f is restricted to
{0, 1}, a mean cordial labeling coincides with that of a product cordial labeling. Ponraj,
Sivakumar, and Sundaram [2473] prove the following: every graph is a subgraph of a
connected mean cordial graph; K1,n is mean cordial if and only n 6 2; Cn is mean cordial
if and only n ≡ 1, 2 (mod 3); Kn is mean cordial if and only n 6 2; Wn is not mean

the electronic journal of combinatorics (2023), #DS6 349

cordial for all n > 3; the subdivision graph of K1,n is mean cordial; the comb Pn K1 is
mean cordial; Pn 2K1 is mean cordial; and K2,n is a mean cordial if and only n 6 2.
Seoud and Salim [2793] provided upper bounds of the number of edges of graphs of given
orders with mean cordial labelings and proved that P2t × P2 is mean cordial if and only
if t ≡ 2 mod 3 and Cn K1 is mean cordial if and only if n ≡ 1 or 2 mod 3.
In [2465] Ponraj and Sivakumar proved the following graphs are mean cordial: mG
where m ≡ 0 (mod 3); Cm ∪ Pn ; Pm ∪ Pn ; K1,n ∪ Pm ; S(Pn K1 ); S(Pn 2K1 ); Pn2 if
and only if n ≡ 1 (mod 3) and n > 7; and the triangular snake Tn (n > 1) if and only if
n ≡ 0 (mod 3). They also proved that if G is mean cordial then mG, m ≡ 1 (mod 3) is
mean cordial. Deshmukh and Shaikh [807] prove the graph hK1,n : 2i and the path union
of n copies of K1,m are mean cordial graphs.
In [2436] Ponraj and Sathish Narayanan proved double triangular snakes D(Tn ) are
mean cordial if and only if n > 3 and obtained partial results on mean cordial label-
ings of alternate triangular snakes, double alternate triangular snakes. Shendra shainy,
Vinothkumar, and Balaji [2881] proved that for β1 < β2 < β3 , the three star graph [2881] new
K1,β1 ∧ K1,β2 ∧ K1,β3 is a mean cordial graph if and only if |β2 − β3 | 6 3β1 + 7. Further,
in [2063] Maheshwari, Vinothkumar and Balaji proved that for β1 = β2 < β3 the three [2063] new
star graph K1,β1 ∧ K1,β2 ∧ K1,β3 is a mean cordial graph if and only if |β2 − β3 | 6 3β1 + 6.
In [2453] Ponraj, Sathish Narayanan, and Ramasamy introduced the notion of total
mean cordial labeling. A total mean cordial labeling of a graph G(V, E) is a function
f : V (G) → {0, 1, 2} such that when each edge xy is assigned the label d(f (x) + f (y))/2e
we have |evf (i) − evf (j)| 6 1, i, j ∈ {0, 1, 2}, where evf (x) denotes the total number of
vertices and edges labeled with x. A graph with a total mean cordial labeling is called total
mean cordial. In [2453], [2454], and [2455], Ponraj, Sathish Narayanan, and Ramasamy
determined the total mean cordiality of the following graphs: Pn ; Cn ; K1,n ; Wn ; K2 +
mK1 ; combs Pn K1 ; double combs Pn 2K1 ; crowns; flowers; lotuses inside a circle;
bistars; quadrilateral snakes; K2,n ; olive trees; S(Pn K1 ); S(K1,n ) (S(G) denotes the
subdivision of G); triangular snakes; Pn2 ; fans Fn ; umbrellas; butterflies; and dumbbells.
In [2435], [2437], and [2438], Ponraj and Sathish Narayanan determined the total mean
cordiality of Knc + 2K2 ; prisms; gears; helms; P1 ∪ P2 ∪ · · · ∪ Pn ; Ln K1 ; S(Wn ); S(Pn
2K1 ); and graphs obtained by subdividing each step of a ladder exactly once.
Let G be a (p, q)-graph. Ponraj and Sathish Narayanan [2440] and [2441] proved the
following. If G satisfies any one of the following three conditions then G 2K is total
mean cordial: (1) G is a tree, (2) G is a unicycle, (3) q = p + 1. If G satisfies any one of
the following three conditions then the shadow graph of G is total mean cordial: (1) G is
a tree, (2) G is a unicycle, (3) q = p + 1. They also proved that the following are total
(2)
mean cordial graphs: Cn K2 , Cn , dragons, splitting graphs of stars, splitting graphs of
combs, books, ladders, Pn K2 if and only if n 6= 1, and G ∪ Pn (n 6= 3).
In [2002] Lourdusamy and Joy Beaula define the notion of S3 (all permutations of
{1, 2, 3}) mean cordial graphs as follows. Let G(V, E) be a graph and g : V (G) → S3
be a function. For each edge xy assign the label 1 if d(|g(x)| + |g(y)|)/2e is odd, and 0
otherwise. Such a g is said to be a group S3 mean cordial labeling if the number of vertices
labeled with i and j differ by at most 1 where i, j are the elements in S3 and the number

the electronic journal of combinatorics (2023), #DS6 350

of edges labeled with 0 and 1 differ by at most 1. A graph with a group S3 mean cordial
labeling is called a group S3 mean cordial graph. They prove that K2,n , subdivisions of
fans, double fans, wheels, and helms are S3 mean cordial graphs.
Ponraj, Sathish Narayanan, and Kala introduced the concept of radio mean labeling
in [2450]. A radio mean labeling of a connected graph G is a one-to-one map f from
V (G) to the lset of naturalm numbers such that for each pair of distinct vertices u and v of
f (u)+f (v)
G, d (u, v) + 2
> 1 + diam (G). The radio mean number of f , rmn (f ), is the
maximum number assigned to any vertex of G. The radio mean number of G, rmn (G),
is the minimum value of rmn (f ) taken over all radio mean labelings f of G. They proved
rmn (G) > |V (G)|; if G is a (p, q)-graph with diameter d > 2, then rmn (G) 6 p + d − 2;
and if G is a (p, q)-connected graph with diameter 2 or 3, then rmn (G) = p. They also
determine the radio mean number of Kn , Km,n , sunflowers, helms, gears, lotuses inside
a circle, and graphs obtained by identifying any two vertices of two wheels of the same
size, Aasi, Asif, Iqbal, and Ibrahim [1] determine the radio number and the radio mean
number for the lexicographic product of a path with a path, a path with a cycle, and
a cycle with a cycle. Moreover, they present computer programs for finding such radio
labelings of these families of graphs.
In [2451] and [2452] Ponraj, Sathish Narayanan, and Kala determine the radio mean
(t)
numbers of S(Km,n ) (m > 1, n > 1); Km,n Pt ; C6 ; Wn Pm ; graphs obtained by joining
the rim vertices of the two wheels with an edge; and graphs obtained from a wheel by
subdividing each spoke by a vertex. In [2456] Ponraj, Sathish Narayanan, and Kala give
the radio mean number of graphs with diameter three, lotuses inside a circle, helms, and
sunflower graphs.
In [2457] and [2442] Ponraj and Sathish Narayanan give the radio mean number of the
following graphs: subdivisions of stars, subdivisions of wheels, subdivisions of K2 + mK1 ,
subdivisions of bistars, jelly fish, subdivisions of jelly fish, books with pentagonal pages,
graphs obtained by taking m disjoint copies of K1,n and joining a new vertex to the centers
of the m copies of K1,n .
A radio mean D-distance labeling of a connected graph G is an injective map f from
V (G) to the natural numbers such that for two distinct vertices u and v of G, dD (u, v) +
d(f (u) + f (v))/2e > 1 + diamD (G), where dD (u, v) denotes the distance D between u
and v and diamD (G) denotes the D-diameter of G. The radio mean D-distance number
of f, rmnD (f ), is the maximum label assigned to any vertex of G. The radio mean D-
distance number of G, rmnD (G), is the minimum value of rmnD (f ) taken over all radio
mean D-distance labeling f of G. Nicholas and Bosco [2272] determined the radio mean
D-distance number of cycles, wheels, gears, helms, fans, and friendship graphs.
In [2439] Ponraj and Sathish Narayanan proved that the following graphs are not
mean cordial: K2 + K m ; K n + 2K2 ; Pn × K2 ; flower graphs; sunflower graphs; Cn K2 .
Also they proved the following: the Mongolian tent M Tm,n is mean cordial if and only if
m ≡ 0 (mod 3) or n ≡ 0 (mod 3) (M Tm,n is the graph obtained from Pm × Pn , n odd,
by adding one extra vertex above the grid and joining every other vertex of the top row
of Pm × Pn to the new vertex); the book Bm is mean cordial if and only if m = 1; books

the electronic journal of combinatorics (2023), #DS6 351

with n pentagonal pages are mean cordial if and only if n ≡ 1 (mod 3); Pn K2 is mean
cordial if and only if n ≡ 0 (mod 3); quadrilateral snakes are mean cordial; alternate
quadrilateral snakes A(Qn ) are mean cordial if and only if the square starts from second
vertex of the path Pn , ends with (n − 1)th vertex and n ≡ 0, 2 (mod 3), or the square
starts from first vertex, ends with nth vertex and n ≡ 0, 2 (mod 3), or the square starts
from second vertex, ends with nth vertex and n ≡ 0, 1 (mod 3).
Let G be a graph and let f : V (G) → {0, 1, . . . , k − 1} k > 1. For each edge
uv, assign the label f (uv) = d f (u)+f 2
(v)
e. Ponraj, Subbulakshmi, and Somasundaram
[2476] say that f is a k-total mean cordial labeling of G if |tmf (i) − tmf (j)| 6 1, for
all i, j ∈ {0, 1, . . . , k − 1}, where tmf (x) denotes the total number of vertices and edges
labeled with x ∈ {0, 1, . . . , k − 1}. A graph with admit a k-total mean cordial labeling
is called k-total mean cordial graph. Ponraj, Subbulakshmi, and Somasundaram [2476]
investigated the 4-total mean cordial labeling behavior of fans, wheels, jelly fish, jewel
graphs, ladders, and triangular snakes.
A balanced mean cordial labeling is a mean cordial labeling f with the property that
the number of verticies labeled with i is the same as the number labeled with j for
i, j ∈ {0, 1, 2} and likewise for the edgess. Kaneria, Khoda, and Karavadiya [1591] prove:
the path union of n copies of a graph G is a mean cordial when n ≡ 0 (mod 3); if
G is balanced mean cordial, then Pn × G and Cn × G are balanced mean cordial; and
if f : V (G) −→ {0, 1, 2} is a balanced mean cordial labeling for G, then G∗ is also a
balanced mean cordial graph.
In [1459] Jeyanthi and Maheswari define a one modulo three mean labeling of a graph
G with q edges as an injective function φ from the vertices of G to {a | 0 6 a 6 3q − 2
where a ≡ 0 (mod 3) or a ≡ 1 (mod 3)} and φ induces a bijection φ∗ from the edges of G
to {a | 1 6 a 6 3q − 2 where a ≡ 1 (mod 3)} given by φ∗ (uv) = d(φ(u) + φ(v))/2e. They
proved that P2n , combs, bistars Bn,n , Tp -trees with an even number of vertices, C4n+1 ,
ladders, K1,2n × P2 are one modulo three mean graphs. They also proved that bistars
Bm,n (m 6= n), K1,n (n > 3), and Kn , (n > 3) are not one modulo three mean graphs.
In [1466] Jeyanthi, Maheswari, and Pandiaraj [1466] proved that DA(Qn ), DA(Q2 )
nK1 , DA(Qm ) nK1 , DA(T2 ) nK1 , DA(Tm ) nK1 , S(DA(Tn )), S(DA(Qn )), and mPn
are one modulo three mean graphs.
Jeyanthi, Maheswari, and Pandiaraj [1465] prove that following graphs have one mod-
ulo three mean labelings: books K1,2n × P2 ; splitting graphs S 0 (P2n ); vertex duplica-
tion graphs D(G, v 0 ); edge duplication graphs D(G, e0 ); nth alternate quadrilateral snake
graphs N A(Qm ); graphs obtained by joining the endpoints of paths P4m to n isolated
verticies; and extended jewel graphs EJn with vertex set {u, v, x, y, w, z, ui : 1 6 i 6 n}
and edge set {uv, ux, xy, yz, vw, wz, vui , zui : 1 6 i 6 n}. For graphs G1 and G2 , G1b ◦G2
is the graph obtained from G1 and |V (G1 )| copies of G2 by joining a vertex of ith copy
of G2 with the ith vertex of G1 by an edge. Jeyanthi, Maheswari, and Pandiaraj [1468]
prove that the graphs T Kn , T b ◦ K1,n , T b
◦ Pn , and T b◦ 2Pn are one modulo three
mean graphs. Sudarvizhi and Balasangu [3068] provide one modulo three mean labelings
for triangular books, duplication subdivisions of the central edge of bistars, and slanting
ladders (graphs obtained from two paths u1 , u2 , u3 , . . . , un and v1 , v2 , v3 , . . . , vn by joining

the electronic journal of combinatorics (2023), #DS6 352

each ui with vi+1 for 1 6 i 6 n1 ).
In [1053] and [1059] Gayathri and Prakash proved the following graphs admit one [1053] new
modulo three mean graphs: the mirror graph of Pn , Spl(Pn ), Pm × Pn , (Pm × P2 ) K1,n , [1059] new
bistars, Cn @Pm , Cn Pm , and H Km , where H is the graph is obtained from two copies
of Pn with verticies u1 , u2 , . . . , un and v1 , v2 , . . . , vn by joining u(n+1)/2 to v(n+1)/2 with an
edge when n > 1 is odd, and un/2 to vn/2+1 with an edge when n is even. In [1056] Gayathri [1056] new
and Prakash investigated the existence of one modulo three mean labelings of disconnected
graphs. In [1054] they provided a necessary condition for a graph to admit a one modulo [1054] new
three mean labeling. In [1055] Gayathri and Prakash provided one modulo three mean [1055] new
labelings for various trees. In [1057] and [1058] they proved the following graphs admit
are k-one modulo three mean labelings: Pn , K1,n , combs, Pm K1,n , Bm,n , Ln = Pn × [1057] new
P2 , K1,n × P2 , A(Qn ), D(Qn ), A(D(Qn )), A(D(Qn )) Km , A(Qn ) Km , and the graphs [1058] new
obtained by joining the end points of Pm to n isolated points.
A graph G is said to be one modulo three root square mean graph if there is an injective
function φ from the vertex set of G to the set {0, 1, 3, . . . , 3q −2, 3q} where q is the number
of edges of G and φ qinduces a bijection  qφ∗ from the edge  set of G to {1, 4, . . . , 3q − 2}
2
[φ(u)] +[φ(v)] 2 2
[φ(u)] +[φ(v)] 2
given by φ∗ (uv) = 2
or 2
. The function φ is called a one
modulo three root square mean labeling of G. In [1372] Jayasekaran and Jaslin Melbha
investigated some path related graphs that have one modulo three root square mean
labelings.
Somasundaram, Vidhyarani, and Ponraj [3027] introduced the concept of a geometric
mean labeling of a graph G with p vertices and q edges as an injective function f : V (G) →
∗
{1, 2, . . . , q +l1} such thatm thejp
induced edgek labeling f : E(G) → {1, 2, . . . , q} defined
p
as f ∗ (uv) = f (u)f (v) or f (u)f (v) is bijective. Among their results are: paths,
cycles, combs, ladders are geometric mean graphs and Kn (n > 4) and K1,n (n > 5)
are not geometric mean graphs. Somasundaram, Vidhyarani, and Sandhya [3028] proved
Cm ∪ Pn , Cm ∪ Cn , nK3 , nK3 ∪ Pn , nK3 ∪ Cm , Pn2 , and crowns are geometric mean
graphs. Vaidya and Barasara [3250] investigated geometric mean labelings in context of
duplication of graph elements in cycle Cn and path Pn . Durai Baskar, Arockiyaraj, and
Rajendran investigate the geometric meanness of some graphs obtained from paths.
In Jeyanthi, Maheswari, and Pandiaraj [1467] define a graph G to be a one modulo
three geometric mean graph if there is an injective function φ from the vertex set of
G to the set {a|1 6 a 6 3q − 2 and either a ≡ 0 (mod 3) or a ≡ 1 (mod 3)} where
q is the number of edges of G and φ induces a bijection lφ∗ from them edge jp set of G tok
∗
p
{a|1 6 a 6 3q − 2 and a ≡ 1 (mod 3)} given by φ (uv) = φ(u)φ(v) or φ(u)φ(v)
the function φ is called one modulo three geometric mean labeling of G. They proved
paths, cycles with length at least 5, ladders, Pn K1 , Pn P2 , Pn P2 , subdivision graphs
S(Pn K1 ), and subdivision graphs S(Pn K2 ) are one modulo three geometric graphs.
They also prove that K1,n (n > 3) and graphs in which every edge lies on a triangle are
not one modulo three geometric mean graph.
In [1533] Jeyanthi, Selvi and Ramya introduced a new graph labeling as follows. A [1533] new

the electronic journal of combinatorics (2023), #DS6 353

graph G(p, q) is said to be a one modulo N-difference mean graph if there is an injection
f from the vertex set of G to the set {0 6 a 6 2(q − 1)N + 1} and either a = 0
(mod N) or a = 1 (mod N), where N is a positive integer and f induces a bijection
f ∗ from the edge set of G to {1 6 a 6 (q − 1)N + 1} and a = 1 (mod N) given
by f ∗ (uv) = d|f (u) − f (v)|/2e. Such a function f is called a one modulo N-difference
mean labeling of G. They establish that Bm,n , Sm,n , Pn @Pm , B(l, m, n), T (n, m), shrubs,
caterpillars, and K1,n are one modulo N-difference mean graph. In addition, they show
that C3 is not a one modulo N-difference mean graph.
Jeyanthi, Selvi, and Ramya [1528] define a restricted triangular difference mean label-
ing of a graph G with p vertices and q edges as an injection f : V → {1, 2, 3, . . . , pq} such
that for each edge uv, the edge labels defined by f ∗ (uv) = d|f (u) − f (v)|/2e are the first q
triangular numbers. A graph that admits a restricted triangular difference mean labeling
is called a restricted triangular difference mean graph. Jeyanthi, Selvi, and Ramya [1528]
investigate the restricted triangular difference mean behaviors of the paths, combs, Kn ,
bistars Bm,n , caterpillars S(n1 , n2 , . . . , nm ), Km,n , wheels, and graphs obtained by joining
the centers of different stars to the new vertex. They also give a necessary condition for
a graph to be a restricted triangular difference mean graph.
A (p, q) graph G(V, E) is said to be an analytic mean graph if it is possible to injectively
label the vertices with {0, 1, 2, . . . , p − 1} in such a way that when each edge uv is labeled
with |(f (v)2 − (f (u))2 |/2 when |(f (v)2 − (f (u))2 | is even and |(f (v)2 − (f (u))2 + 1|/2 when
|(f (v)2 − (f (u))2 | + 1 is odd and the edge labels are distinct. In this case, f is called an
analytic mean labeling of G. Raj and Vivek [2554] proved that Pm ∪ Cn ∪ K1,s (m, s >
2, n > 3), (Pm + K1 ) ∪ K1,n (m, n > 2), graphs obtained by identifying the apex vertices
of K1,m and K1,n and one vertex of two copies of Cs where m, n > 2, c > 3 are analytic
mean graphs.
Let G = (V, E) be a graph with p vertices and q edges. A graph G is analytic odd
mean if there exist an injective function f : V → {0, 1, 3, 5 . . . , 2q − 1} with an induce
∗ ∗
l 2 labeling2 mf : E → Z such that for eachl edge
edge
2
m uv with f (u) < f (v), f (uv) =
f (v) −(f (u)+1)
2
if f (u) 6= 0, and f ∗ (uv) = f (v) 2
if f (u) = 0 is injective. In this
case we say that f is an analytic odd mean labeling of G. Jeyanthi, Gomathi, and Lau
[1449] proved that fans, double fans, double wheels, closed helms, total graphs of cycles,
total graphs of paths, armed crowns Cn ΘPm , generalized Petersen graphs GP (n, 2) are
analytic odd mean graphs. In [1437] they prove that Pn , Cn , Pn K1 , bistars, fans,
Cn K1 , Ln K1 , Cm ∪ Sm , two copies of Cn sharing a common edge, and Cm ∪ Cn are
analytic odd mean graphs. In [1436] they prove that wheels, flower graphs, some splitting
graphs, and multiples of graphs are analytic odd mean graphs. In [1438] they prove that
quadrilateral snakes, double quadrilateral snakes, coconut trees, fire cracker graphs, some
star graphs, splitting graphs, complete bipartite graphs, unicyclic graphs, and the graphs
obtained from a path of vertices v1 , v2 , v3 , . . . , vn by joining i pendent vertices at each of
ith vertex 1 6 i 6 n (denoted Pn (1, 2, . . . , n)) are analytic odd mean graphs. Jeyanthi,
Gomathi, and Lau [1450] proved the square graphs of Pn , Cn , Bn,n H-graphs, and H mK1
admit analytic odd mean labelings.
In [1534] Jeyanthi, Selvi, and Rama proved that the following graphs admit ana- [1534] new

the electronic journal of combinatorics (2023), #DS6 354

lytic odd mean labeling: arbitrary union of paths, M2 (Pn )(n > 2), ladders, slanting
slanting ladders, diamond snakes, quadrilateral snakes, alternately quadrilateral snakes,
Jln (P3 )(n > 1), C4 K1,n (n > 1), DU P2 (K1,n ), DU P2 (Bn,n ), friendship graphs, and
nC4 (n > 1). Jeyanthi, Gomathi, Lau, and Shiu [1440] proved that the following graphs [1440] new
admit analytic odd mean labeling: Pn + Cm , tadpoles T (m, n), Cm1 + Cm2 , JC(m1 , m2 ),
edge linked cycle snakes EL(kCn ), triangular snakes Tn , double triangular snakes D(Tn ),
Pn (Cm ), nCm , Pn (T (m, 1)), shell graphs Shn . They propose the conjecture that a (p, q)-
graph is analytic odd mean when p 6 q + 1.
In [1434] Jeyanthi and Gomathi proved that the subdivision and super subdivision of
the following graphs are analytic odd mean: cycles, stars, combs, and graphs obtained
from Pn K1 by subdivding the each edge of Pn . Jeyanthi, Gomathi, and Lau [1438] proved
that quadrilateral snakes, double quadrilateral snakes, coconut trees, fire cracker graphs,
and Pn (1, 2, . . . , n) are analytic odd mean graphs. They also proved that Cn K1 , prisms,
helms, banana trees, perfect binary trees, unicyclic graphs, certain caterpillars, and spiders
are analytic odd mean graphs. Jeyanthi and Gomathi [1435] proved that the graphs
T Ln , (the triangular ladder obtained from Ln ), T Ln K1 , Tn K1 , and Qn K1 admit
an analytic odd mean labelings. Simaringa and Thirunavukkarasu [2963] proved that
triangular books, double J triangular
J books, triangular snakes, double triangular snakes,
butterflies, drums, Cc Pc , Fc K1,d , 1 6 d 6 2c − 1, Wc K1,d , 1 6 d 6 2c, Pc2 K1,d ,
c > 3 and 1 6 d 6 2c − 3 are analytic odd mean graphs.
Let G be a (p, q) graph and f a injective function from V (G) to {k, k +1, . . . , p+q +k −
1} For each edge uv, let f ∗ = d(2f (u)f (v)/(f (u)+f (v)e or b(2f (u)f (v)/(f (u)+f (v)c. We
say f is a k-super harmonic mean if f (V )∪{f ∗ (uv) | uv ∈ E(G)} = {k, k+1, . . . , p+q+k−
1}. A graph that admits a k-super harmonic mean labeling is called a k-super harmonic
mean graph. In the case that k = 1 the labeling is called a super harmonic mean labeling.
For all n > 1 Tamilselvi and Revathi [3187] prove that the following graphs have k-super
harmonic mean labelings: Pn , nPm (m > 1), Pn K1 , Pn K2 , Pn K3 , Pn2 (n > 4), the
subdivision graph of Pn K1 , and the middle graph of Pn .
A graph G = (V, E) with p vertices and q edges is said to be a (k, d)-Heronian
mean graph if it is possible to label the vertices x ∈ V with distinct labels f (x) from
k, k + d, k + 2d, p . . . , k + qd in such a way that whenpeach edge uv is labeled with f ∗ (uv) =
b(f (u) + f (v) + f (u)f (v))/3c or d(f (u) + f (v) + f (u)f (v))/3e, then the resulting edge
labels are distinct. In this case f is called a (k, d)-Heronian mean labeling of G. In the
case k = 1 and d = 1, the labeling is called Heronian mean labeling . Akilandeswari and
Tamilselvi [134] proved that paths, ladders, and Pn mK1 for n > 2, 1 6 m 6 4, are
k-Heronian mean graphs. In [134] Akilandeswari and Tamilselvi proved that the following
graphs have (k, d)-Heronian mean labelings: paths, (Pn × P2 ) K1 , Tn K1 (Tn is the
triangular snake obtained from Pn ), Qn K1 , T Ln K1 (T Ln is the triangular ladder
obtained from Ln ), Peterson graphs, and the graphs obtained from two copies of Pn with
vertices v1 , v2 , . . . , vn and u1 , u2 , . . . , un by joining the vertices u(n+1)/2 and v(n+1)/2 if n is
odd and un/2+1 and vn/2+1 if n is even. Sampath, Narasimhan, and Nagaraja [2691] proved
cycles, K1,n if and only if n 6 4, Cm ∪ Pn , Cm ∪ Cn , nK3 , nK3 ∪ Pm , nK3 ∪ Cm , mC4 ,
crowns Cn K1 , dragons Cn @Pm , and Pn2 admit (1, 1)-Heronian mean labelings. Anitha,

the electronic journal of combinatorics (2023), #DS6 355

Selvam, and Thirusangu [215] provide Heronian mean labelings for the extended duplicate
graph of the kite graph.
A pronic number is one of the form n(n + 1), where n is a positive integer. In [2480] [2480] new
Porchelvi and Devi defined a pronic Heron mean labeling of a graph G with n vertices
as a bijection f : V (G) → {0, 2, 6, 12, p. . . , n(n + 1)} such that the resulting edge labels
∗
obtained by f (uv) = d(f (u)+f (v)+ f (u)f (v)/3e for every edge uv are distinct. In [812] [812] new
Devi and Porchevi gave pronic Heron mean labelings for the generalized Peterson graphs
P (6, 2), P (8, 3),P (10, 2), P (10, 3), and P (12, 5). They also investigated the existence
of pronic Heron labelings for mK3 , the unions of cycles and paths, and the union of
combs and paths. They described an algorithm to label the vertices for the pronic Heron
mean labeling for certain disconnected graphs. They further investigated the existence
of proniceron labelings for mK3 , the unions of cycles and paths, and the union of combs
and paths.
Arockiaraj and Meena [234] say a planar graph has an F-face magic mean labeling it
there exists an assignment of labels to the edges that induces an assignment of labels to the
faces of the graph such that the mean weight of each face is constant. They proved that
the following graphs have F-face magic mean labelings: P2n + K1 , the one-point union of
m copies of Cn , mCn -snakes, and graphs obtained identifying the endpoints of any number
of copies Pn . In [235] and [2122] Arockiaraj and Meena Kumari investigated the existence [235] new
of (1, 0, 0) F-face magic mean labelings for paths, butterflies, and middle graphs of cycles, [2122] new
Pn + K1 , Cm × Pn , lattitude graphs, cyclic ladders, graphs obtained by duplicating every
edge of Pn (n > 2), even cycles, the middle graphs of cycles, and the middle graphs
of butterflies. In [2123] they investigated (0, 1, 0), (1, 1, 0)-F-face magic mean labelings of [2123] new
slanting ladders, Pm ×Pn , K2,n , and certain graphs obtained by applying graph operations.
Vani Shree and Dhanalakshmi [3337] investigated the existence of (1, 0, 0)-F-face magic [3337] new
mean labelings of ladders, tortoises, and the middle graph of paths. They also provided
(1,0,0)- and (1,1,0)-F-face magic mean labelings for ortho chain square cactus graphs,
para chain square cactus graphs, triangular snakes, and quadrilateral snakes.
Amara Jothi, Baskar Babujee, and David [173] investigated face magic labeling of
planar graphs of types (1, 0, 1), (1, 1, 0), (0, 1, 1) and (1, 1, 1) on duplication graphs.
For a graph G(V, E), Rajesh Kannan, Manivannan, and Durai Basker [1643] de-
fined an exponential labeling as injective function χ from V to {1, 2, 3, . . . , |E| + 1}
such that the induced function χ∗ from E to {1, 2, . . . , |E|} given by χ(uv)∗ =
b(1/e)(χ(v)χ(v) /χ(u)χ(u) )(1/χ(v)−χ(u)) c for all uv ∈ E is a bijection. A graph that allows
an exponential mean labeling is called an exponential. They investigated the exponential
mean labeling of graphs obtained by duplication of an edge or vertex of paths and path
related graphs.
In [509] Baskaran and Ganapathy introduced a new variant of mean labeling as follows.
A function h is said to be a C-exponential mean labeling of a graph G(V, E) if h : V →
{1, 2, . . . , |E| + 1} is injective and the induced function h∗ : E → {2, 3, . . . , |E| + 1}
defined by h∗ (uv) = d1/((h(v)h(v) /(h(u)h(u) ))1/(h(v)−h(u)) e is a bijection. They investigate
the exponential meanness of paths, triangular trees (see Section 3.1), Cm Pn , Pm × Pn ,
one-sided step graphs (the graph obtained by starting with the path Pn with cconsecutive

the electronic journal of combinatorics (2023), #DS6 356

edges e1 , e2 , . . . , en−1 and erecting a ladder that has that has n − i − 1 steps with ei at
the bottom) double-sided step graphs (the graph obtained by starting with the path P2n
with 2n − 1 edges e1 , e2 , . . . e2n−1 , where on every edge ei we erect a ladder that has i + 1
steps for i = 1, 2, . . . n, and on every edge and for i = n + 1, n + 2, . . . , 2n − 1 erect a
ladder on edge ei that has 2n + 1 − i steps), one-sided arrow graphs (the graphs obtained
from joining the vertices of the bottom row of Pm × Pn to a new vertex), double-sided
arrow graphs, graphs (the graphs obtained from joining the vertices of the bottom row of
Pm × Pn to a new vertex and by joining the vertices of the right column of Pm × Pn to a
new vertex), and subdivision of ladders.
A function f is said to be an absolute mean graceful of a graph G, if f :
V (G) → {0, ±1, ±2, . . . , ±|E|} is injective and the edge labeling function f ∗ : E(G) →
{1, 2, . . . , |E|} defined as f ∗ (uv) = d(f (u) − f (v))/2e is bijective. A graph that admits
such labeling is called absolute mean graceful graph. In [1583] and [1584] Kaneria, Chu-
dasama, and Andharia proved that the path unions of a finite number of copies of trees,
paths, cycles, complete bipertite graphs, grid graphs, step grid graphs, and double step
grid graphs are absolute mean graceful graphs. In [132] Akbari1, Kaneria, and Parmar
prove that jewel graphs, jelly fish graphs, and the extended jewel graphs admit absolute
mean graceful labelings.
In [2325] Palani and Shunmugapriya defined the concept of near mean labeling in [2325] new
digraphs as follows. Let D(V, A) be a digraph where V is the vertex is set and A is the
arc set. Let f l: V → {0, m 1, 2, . . . , q} be a 1-1 map. Define f ∗ : A → {1, 2, . . . , q} by
f ∗ (e = uv)~ = f (u)+f (v)
. Let f ∗ (v) = ∗
~ − w∈V f ∗ (wv) ~ . If f ∗ (v) 6 2 for
P P
2 w∈V f (vw)
all v ∈ A(D), f is said to be a near mean labeling of D and D is said to be a near mean
digraph. They investigated the existence of near mean labeling in dragon digraphs (the
one-point union of cycle and a path where the edges of a cycle are directed clockwise or
anti-clockwise and the edges of the path edges are directed towards the cycle). In [2326] [2326] new
they investigated the existence of near mean labelings for various dicyclic snakes.

7.12 Pair Sum and Pair Mean Graphs

For a (p, q) graph G Ponraj and Parthipan [2422] define an injective map f from V (G) to
{±1, ±2, . . . , ±p} to be a pair sum labeling if the induced edge function fem from E(G) to
the nonzero integers defined by fe (uv) = f (u) + f (v) is one-one and fe (E(G)) is either of
the form {±k1 , ±k2 , . . . , ±k 2q } or {±k1 , ±k2 , . . . , ±k q−1 }∪{k q+1 }, according as q is even or
2 2
odd. A graph with a pair sum labeling is called pair sum graph. In [2422] and [2424] they
proved the following are pair sum graphs: Pn , Cn , Kn if and only if n 6 4, K1,n , K2,n ,
bistars Bm,n , combs Pn K1 , Pn 2K1 , and all trees of order up to 9. Also they proved
that Km,n is not pair sum graph if m, n > 8 and enumerated all pair sum graphs of order
at most 5.
In [2426], [2427], [2428], and [2429] Ponraj, Parthipan, and Kala proved the following
are pair sum graphs: K1,n ∪ K1,m , Cn ∪ Cn , mKn if n 6 4, (Pn × K1 ) K1 , Cn K2 ,
dragons Dm,n for n even, Kn + 2K2 for n even, Pn × Pn for n even, Cn × P2 for n even,
(Pn ×P2 ) K1 , Cn K2 and the subdivision graphs of Pn ×P2 , Cn K1 , Pn K1 , triangular

the electronic journal of combinatorics (2023), #DS6 357

snakes, and quadrilateral snakes. Ponraj, Parthipan, and Kala [2423] prove the following
graphs are pair sum graphs: the union of two stars, the union of a path and a star,
ladders, Cn K1 , Cm ∪ Cm , mKn if and only if n 6 4, quadrilateral snake Qn (n odd), and
triangular snakes.
A (p, q)-graph G is said to be a super pair sum if there exists a bijection f from
V (G) ∪ E(G) to {0, ±1, ±2, . . . , ±( p+q−1 2
)} when p + q is odd and from V (G) ∪ E(G) to
{±1, ±2, . . . , ±( p+q
2
)} when p + q is even such that f (uv) = f (u) + f (v). A graph that
admits a super pair sum labeling is called a super pair sum graph. Vasuki, Velmurugan,
and Sugirtha [3367] prove that the graphs Hn mK1 , (Hn is obtained from two copies of
Pn (n > 3) with vertices v1 , v2 , . . . , vn and u1 , u2 , . . . , un by joining v(n+1)/2 and u(n+1)/2
if n is odd and vn/2 and u(n+2)/2 if n is even); (P2n ; Sm ), S 0 (P2n ), < Bm,n : Pk > for
m > 1, n > 1, k ≡ 2 (mod 4), < B(m) : Pk > for m > 1 k ≡ 0, 2 (mod 4) and
2Bm,n (m > 1, n > 1) are super pair sum graphs.
Jeyanthi and Sarada Devi [1507] define an injective map f from E(G) to
{±1, ±2, . . . , ±q} as an edge pair sum labeling of a graph P G(p, q) if the induced func-
∗ ∗
tion of f from V (G) to Z − {0} defined by f (v) = f (e) taken over all edges e
incident to v is one-one and f ∗ (V (G)) is either of the form {±k1 , ±k2 , . . . , ±kp/2 } or
{±k1 , ±k2 , . . . , ±k(p−1)/2 } ∪ {kp/2 } according as p is even or odd. A graph with an edge
pair sum labeling is called an edge pair sum graph. They proved that Pn , Cn , triangular
snakes, Pm ∪ K1,n , and Cn Km are edge pair sum graphs.
Jeyanthi, Sarada Devi, and Lau [1517] proved that the following graphs have edge pair
sum labelings: triangular snakes Tn , Cn ∪ Cn , K1,n ∪ K1,m , and bistars Bm,n . They also
proved that every graph is a subgraph of a connected edge pair sum graph. Jeyanthi and
Sarada Devi [1508] showed that P2n × P2 and the graphs Pn (+)Nm obtained from a path
Pn by joining its endpoints to m isolated vertices are edge pair sum graphs. Jeyanthi
and Sarada Devi [1510] proved that the following graphs have edge pair sum labeling:
shadow graphs S2 (Pn ), S2 (K1,n ), total graphs T (C2n ) and T (Pn ), the one-point union of
2
any number of copies of Cn , the one-point union of Cm and Cn , P2n−1 , and full binary
trees in which all leaves are at the same level and every parent has two children. Jeyanthi
and Sarada Devi [1509] proved the spiders SP (1m , 2t ), SP (1m , 2t , 3), SP (1m , 2t , 4), and
for t even SP (1m , 3t , 3) are edge pair sum graphs. In [1508] Jeyanthi and Sarada Devi
prove some cycle related graphs are edge pair sum graphs. In [1510] they prove that the
one point union of cycles, perfect binary trees, shadow graphs, total graphs, and Pn2 admit
edge pair sum graph. In [1516] Jeyanthi and Sarada provide edge pair sum labelings for
jewel graphs, gears, triangular ladders, balanced lobsters, and double wheels 2Cn + K1 .
The tree W T (n) is obtained from K1,n+2 with central vertex c1 and end vertices xi :
1 6 i 6 n+2 and another K1,n+2 with central vertex c2 and end vertices yj : 1 6 j 6 n+2
by identifying vertex xn+2 and yn+2 and denoting the identified vertices by w. A w-tree
W T (n : k) is obtained from k copies of W T (n) by joining a new vertex a to vertex w
of each copy of W T (n). Jeyanthi, Sarada Devi, and Lau [1518] proved that the graphs
W T (n : k) trees have edge pair sum labelings (see also [1519]).
In [1512], [1518], [1511], [1515] Jeyanthi and Sarada Devi prove the following graphs
are edge pair sum graphs: shell graphs; some butterfly graphs; jelly fish; Y -trees; theta

the electronic journal of combinatorics (2023), #DS6 358

graphs; wheels with subdivided spokes, Pm + 2K1 ; C4 × Pm ; Pn K m ; (P2 × Pm ) Kn ;
Pm × C3 ; books; graphs obtained from the path Pn having an even fixed even number
quadrilaterals on each edge of the path; K2 +mK1 ; graphs obtained by identifying one end
point from each of m copies of Pn ; closed helms; graphs that are two copies of generalized
Petersen graphs joined by a path Pn , n > 5; and graphs that two copies of fan Pn K1
joined by a path Pn , n > 5.
In [1513] Jeyanthi and Sarada Devi prove the following graphs admit edge pair sum
labelings: K2,n , double triangular snakes, wheels, flowers, hCm , K1,n i (m > 4, n odd)
obtained from Cm and K1,n by identifying any vertex of Cm with the central vertex of
K1,n , and hCm ∗ K1 i (m > 4) the graphs obtained from Cm and K1,n by identifying any
vertex of Cm with an endpoint vertex of K1,n . In [1514] they prove that the subdivision
of graph of bistars Bm,n , Pn K1 , triangular snakes when the path has an odd num-
ber of verticies, double triangular snakes, double quadrilateral snakes, double alternative
triangular snakes, and double alternative quadrilateral snakes are edge pair sum graph.
In [177] Amudha and Jayapriya introduced the notion of labeling pair sum modulo
labelings as follows. An undirected simple graph G with p vertices and q edges is said to be
a pair sum modulo graph if there is an injective function f from V (G) to {±1, ±2, . . . , ±p}
such that the induced edge labeling g from E(G) to {0, 1, 2, . . . , q − 1} defined by g(uv) =
(f (u) + f (v))(mod q) is injective. They proved the Petersen graphs, a certain family of
coconut trees, K2,n , and bistars have pair sum modulo labelings. Jayapriya [1368] proved
spider graphs with at most five legs admit pair sum modulo labelings. Ponraj, Parthipan,
and Kala [2423] prove the following graphs are pair sum graphs: the union of two stars,
the union of a path and a star, ladders, Cn K1 , Cm ∪ Cm , mKn if and only if n 6 4,
quadrilateral snake Qn (n odd), and triangular snakes.
For a (p, q) graph G Ponraj and Parthipan [2425] define an injective map f from
V (G) to {±1, ±2, . . . , ±p} to be a pair mean labeling if the induced edge function fem
from E(G) to the nonzero integers defined by fem (uv) = (f (u) + f (v))/2 if f (u) +
f (v) is even and fem (uv) = (f (u) + f (v) + 1)/2 if f (u) + f (v) is odd is one-one and
fem (E(G)) = {±k1 , ±k2 , . . . , ±kq/2 } or
fem (E(G)) = {±k1 , ±k2 , . . . , ±k(q−1)/2 } ∪ {k(q+1)/2 }, according as q is even or odd. A
graph with a pair mean labeling is called a pair mean graph. They proved the following
graphs have pair mean labelings: Pn , Cn if and only if n 6 3, Kn if and only if n 6 2,
K2,n , bistars Bm,n , Pn K1 , Pn 2K1 , and the subdivision graph of K1,n . Also they found
the relation between pair sum labelings and pair mean labelings.
The graph G@Pn is obtained by identifying an end vertex of a path Pn with any
vertex of G. A graph G(V, E) with q edges is called a (k + 1)-equitable mean graph if
there is a function f from V to {0, 1, 2, . . . , k} (1 6 k 6 q) such that the induced edge
that labeling f ∗ from E to {0, 1, 2, . . . , k} given by f ∗ (uv) − d(f (u) + f (v))/2e has the
properties |vf (i) − vf (j)| 6 1 and |ef ∗ (i) − ef ∗ (j)| 6 1 for i, j = 0, 1, 2, . . . , k where vf (x)
and ef ∗ (x) are the number of vertices and edges of G respectively with the label x. In
[1423] Jeyanthi proved the following: a connected graph with q edges is a (q + 1)-equitable
mean graph if and only if it is a mean graph; a graph is 2-equitable mean graph if and only
if it is a product cordial graph; for every graph G, the graph 3mG is a 3-equitable mean

the electronic journal of combinatorics (2023), #DS6 359

graph; for every 3-equitable mean graph G, the graph (3m + 1)G is a 3-equitable mean
graph; Cn is a 3-equitable mean graph if and only if n 6≡ 0 (mod 3); Pn is a 3-equitable
mean graph for all n > 2; if G is a 3-equitable mean graph then G@Pn is a 3-equitable
mean graph for n ≡ 1 (mod 3); the bistar B(m, n) with m > n is a 3-equitable mean
graph if and only if n > bq/3c; K1,n is a 3-equitable mean graph if and only if n 6 2; and
for any graph H and 3m copies H1 , H2 , . . . , H3m of H, the graph obtained by identifying
a vertex of Hi with a vertex of Hi+1 for 1 6 i 6 3m − 1 is a 3-equitable mean graph.
In [1794] Lakshmi and Nagarajan introduced the notion of geometric mean cordial
labeling of graphs as follows. Let G = (V, E) be a graph and f be a mapping from V (G)
to {0, 1, 2}.pThe graph G is called geometric mean cordial if each edge uv can be assigned
the label d f (u)f (v)e in such a way that and |vf (i) − vf (j)| 6 1 and |ef (i) − ef( j)| 6 1,
where vf (x) and ef (x) denote the number of vertices and edges labeled with x and x ∈
{0, 1, 2} They proved that Pn , Cn (n ≡ 1, 2 (mod 3)) and K1,n are geometric mean cordial
graphs and Kn (n > 2), K2,n (n > 2), Kn,n (n > 2) and wheels are not geometric mean
cordial graphs. In [1611] Kaneria, Meera, and Maulik call these graphs geometric mean
3-equitable. They proved: Kmn (m, n > 4) is not a geometric mean 3-equitable graph,
caterpillars S(x1 , x2 , . . . , xt ) and Cn K1 (t > 2) are geometric mean 3-equitable graphs,
and Cn K1 is a geometric mean 3-equitable graph if and only if n ≡ 1, 2 (mod 3).

7.13 Irregular Total Labelings

In 1988 Chartrand, Jacobson, Lehel, Oellermann, Ruiz, and Saba [682] defined an irregular
labeling of a graph G with no isolated vertices as an assignment of positive integer weights
to the edges of G in such a way that the sums of the weights of the edges at each
vertex are distinct. The minimum of the largest weight of an edge over all irregular
labelings is called the irregularity strength s(G) of G. If no such weight exists, s(G) = ∞.
Chartrand et al. gave a lower bound for s(mKn ). Faudree and Lehel [918] obtained
s(G) 6 dn/2e + 9 for regular graphs. For every graph G of order n > 4 and with
finite irregularity strength, Nierhoff [2276] proved s(G) 6 n − 1. Using deterministic
and mostly probabilistic techniques, Frieze, Gould, Karonski, and Pfender [961] obtained
the following bounds: s(G) 6 c1 · n/δ) if ∆ 6 n1/2 ; and s(G) 6 c2 · (log n)n/δ if ∆ >
n1/2 , where c1 and c2 are explicit constants. Bohman √ and Kravitz found an infinite
sequence of trees with strength converging to (11 − 5)/8. Faudree, Jacobson, and Lehel
[920] gave an upper bound for s(mKn ) when n > 5 and proved that for graphs G with
δ(G) > n − 2 >p1, s(G) 6 3. They also proved that if G has order n and δ(G) = n − t
and 1 6 t 6 n/18, s(G) 6 3. Aigner and Triesch proved s(G) 6 n + 1 for any
graph G with n > 4 vertices for which s(G) is finite. In [2526] Przybylo proved that
s(G) < 112n/δ + 28, where δ is the minimum degree of G and G has n vertices. The
best bound of this form is currently due to Kalkowski, Karońki, and Pfender, who showed
in [1567] that s(G) 6 6dn/δe < 6n/δ + 6. In Przybylo [2524] showed that for d-regular
graphs s(G) < 16n/d + 6. In 1991 Cammack, Schelp, and Schrag [654] proved that the
irregularity strength of a full d-ary tree (d = 2, 3) is its number of pendent vertices and
conjectures that the irregularity strength of a tree with no vertices of degree two is its
number of pendent vertices. This conjecture was proved by Amar and Togni [172] in

the electronic journal of combinatorics (2023), #DS6 360

1998. Muthu Guru Packiam, Manimaran, and Thuraiswamy [2232] prove the following:
s(Cn mK1 ) = mn, s(Pn K2 ) = n + 1, s(Cn K2 ) = n + 1, s(Pn K3 ) = n + 1, and
sCn K3 ) = n + 1. In [1550] Jinnah and Kumar determined the irregularity strength of
triangular snakes and double triangular snakes. Hasni, Tarawneh, Siddiqui, Raheem, and
Asim [1195] determined the exact value of edge irregularity strength of disjoint union of
cycles and generalized prisms. These results provide an upper bound Hashi, Tarawneh,
and Husin [1194] determined the edge irregularity strength of Pn Pm for n > 2 and [1194] new
m = 3, 4, and 5. Imran, Aslam, Zafar, and Nazeer [1317] determined the exact value [1317] new
of the edge irregularity strength of caterpillars, n-star graphs, (n, t)-kite graphs, cycle
chains, and friendship graphs. Tarawneh, Hasni, Ahmad, and Asim [3192] determined
the exact value of the edge irregularity strength for some classes of plane graphs. In [109]
Ahmad, Khan, Ahmad, Nadeem, and Siddiqui determined the exact value of the edge
irregularity strength for categorical product of two paths.
For R be a commutative ring R with the set of all zero divisor set Z(R) of R the
zero divisor graph of R, Γ(R), has vertex set Z(R) and (x, y) is an edge if and only if
xy = 0. Ahmad [79] determined the total vertex irregularity strength of zero divisor
graphs associated with the commutative rings Zp2 × Zq where p and q are distinct primes.
Motivated by the notion of the irregularity strength of a graph and various kinds of
other total labelings, Bača, Jendroľ, Miller, and Ryan [341] introduced the total edge
irregularity strength of a graph as follows. For a graph G(V, E) a labeling ∂ : V ∪
E → {1, 2, . . . , k} is called an edge irregular total k-labeling if for every pair of distinct
edges uv and xy, ∂(u) + ∂(uv) + ∂(v) 6= ∂(x) + ∂(xy) + ∂(y). Similarly, ∂ is called
an
P vertex irregular total k-labeling if for everyP pair of distinct vertices u and v, ∂(u) +
∂(e) over all edges e incident to u 6= ∂(v) + ∂(e) over all edges e incident to v. The
minimum k for which G has an edge (vertex) irregular total k-labeling is called the total
edge (vertex) irregularity strength of G. The total edge (vertex) irregular strength of G
is denoted by tes(G) (tvs(G)). They prove: for G(V, E), E not empty, d(|E| + 2)/3e 6
tes(G)6 |E|; tes(G)> d(∆(G) + 1)/2e and tes(G)6 |E| − ∆(G), if ∆(G) 6 (|E| − 1)/2;
tes(Pn ) = tes(Cn )= d(n + 2)/3e; tes(Wn )= d(2n + 2)/3e; tes(C3n ) (friendship graph)
= d(3n + 2)/3e; tvs(Cn ) = d(n + 2)/3e; for n > 2, tvs(Kn )= 2; tvs(K1,n ) = d(n + 1)/2e;
and tvs(Cn × P2 )= d(2n + 3)/4e. Ahmad, Nurdin, and Baskoro [113] determined the
exact value of the total edge (vertex) irregularity strength of generalized Halin graphs.
Al-Mushayt, Ahmad, and Siddiqui [163] determined the exact values of the total edge
irregular strength of hexagonal grid graphs. The (m, n)-lollipop graph denoted by Lm,n is a
graph obtained by joining a complete graph Km to a path graph Pn with a bridge. Ni’mah
and Indriati [2277] determined tvs(Lm,n ) for m > 3 and n > 1. Aftiana and Indriati [61]
proved that for n > 3 the total edge irregularity strength of the graph obtained by joining
two copies of Kn (barbell graph) with an edge is d(n2 − n + 3)/3e. In [2308] Nurdin and
Hye consider the splitting graph of stars as a land transportation system and give the
exact value of their total vertex irregularity strength. For m, n > 3 Indriati, Widodo,
and Sugeng [1332] determined the exact value of the total vertex irregularity strength for
generalized helm graphs Hnm (obtained from Wn by attaching Pm vertices at each vertex
of the n-cycle) and for prisms with outer pendent edges. Nurdin [2309] determined the [2309] new

the electronic journal of combinatorics (2023), #DS6 361

total vertex irregularity strength of banana trees and quad trees. Susanti, Puspitasari
and Khotimah [3151] determined the exact value of total edge irregularity strength for
staircase graphs, double staircase graphs, and mirror-staircase graphs. In [3152] Susanti,
Wahyuni, Sutjijana, Sutopo, and Ernanto provide the total edge irregularity strength of
generalized arithmetic staircase graphs and generalized double-staircase graphs.
In [105] Ahmad, Ibrahim, and Siddiqui determined the total irregularity strength of
generalized Petersen graphs. In [165] Al-Mushayt, Ahmad, and Siddiqui [165] determined
the total edge (vertex) irregularity strength for convex polytope graphs having the same
diameter. In [2950] Siddiqui determined the irregularity strength of six classes of convex
polytope graphs with pendent edges. Ramdani, Salman, Assiyatum, and Semaničová-
Feňovčı́ková [2582] establish upper bounds for the total vertex (edge) irregularity strength
and total irregularity strength for disjoint union of arbitrary graphs. Naeem and Siddiqui
[2244] determined the total irregularity strength of disjoint union of isomorphic copies of
the generalized Petersen graph. In [3517] Yang, Siddiqui, Ibrahim, Ahmad, and Ahmad
determined the exact value of the total irregularity strength of three planar graphs. In
[2673] Salama introduced three kinds of snake graphs and investigated their total irreg-
ularity strength. Ibrahim, Khan, Asim, and Waseem [1281] determined the exact value
of the total irregularity strength of cubic graphs. Tilukay, Tomasouw, and Rumlawang
[3215] determined the total irregularity strength of complete graphs and complete bipar-
tite graphs.
Jendroľ, Miškul, and Soták [1375] (see also [1376]) proved: tes(K5 ) = 5; for n > 6,
tes(Kn )= d(n2 − n + 4)/6e; and that tes(Km,n )= d(mn + 2)/3e. They conjecture that
for any graph G other than K5 , tes(G) = max{d(∆(G) + 1)/2e, d(|E| + 2)/3e}. Ivančo
and Jendroľ [1343] proved that this conjecture is true for all trees. Jendroľ, Mis̆kuf, and
Soták [1375] prove the conjecture for complete graphs and complete bipartite graphs. The
conjecture has been proven for the categorical product of two paths [90], the categorical
product of a cycle and a path [2948], the categorical product of two cycles [98], the
Cartesian product of a cycle and a path [387], the subdivision of a star [2949], and the
toroidal polyhexes [348]. In [116] Ahmad, Siddiqui, and Afzal proved the conjecture is true
for graphs obtained by starting with m vertex disjoint copies of Pn (m, n > 2) arranged in
m horizontal rows with the jth vertex of row i + 1 directly below the jth vertex row i for
1 = 1, 2, . . . , m − 1 and joining the jth vertex of row i to the j + 1th vertex of row i + 1 for
1 = 1, 2, . . . , m − 1 and j = 1, 2, . . . , n − 1 (the zigzag graph). Siddiqui, Ahmad, Nadeem,
and Bashir [2952] proved the conjecture for the disjoint union of p isomorphic sun graphs
(i. e., Cn K1 ) and the disjoint union of p sun graphs in which the orders of the n-cycles
are consecutive integers. They pose as an open problem the determination of the total
edge irregularity strength of disjoint union of any number of sun graphs. Brandt, Misškuf,
and Rautenbach [607] proved the conjecture for large graphs whose maximum degree is
not too large relative to its order and size. In particular, using the probabilistic method
they prove that if G(V,p E) is a multigraph without loops and with nonzero maximum
3
degree less than |E|/10 8|V |, then tes(G) = (d|E| + 2)/3e. As corollaries they have: if
G(V, E) satisfies |E| > 3 · 103 |V |3/2 , then tes(G) = d(|E| + 2)/3e;
p if G(V, E) √ has minimum
degree δ > 0 and maximum degree ∆ such that ∆ < δ |V |/103 · 4 2 then tes(G)

the electronic journal of combinatorics (2023), #DS6 362

= d(|E| + 2)/3e; and for every positive integer ∆ there is some n(∆) such that every
graph G(V, E) without isolated vertices with |V | > n(∆) and maximum degree at most
∆ satisfies tes(G) = d(|E| + 2)/3e. Notice that this last result includes d-regular graphs
of large order. They also prove that if G(V, E) has maximum degree ∆ > 2|E|/3, then G
has an edge irregular total k-labeling with k = d(∆ + 1)/2e. Pfender [2388] proved the
conjecture for graphs with at least 7 × 1010 edges and proved for graphs G(V, E) with
∆(G) 6 E(G)/4350 we have tes(G) = (d|E| + 2)/3e. Susanti and Haq [3148] determined
the minimum k such that an odd staircase graph can be labeled by an edge irregular
total k-labeling. Murhu Guru Packiam, Manimaran, and Thuraiswamy [2210] investigate
how the addition of a new edge affects the total edge irregularity strength of a graph.
Laurence and Kathiresan [1818] determined the total edge irregular strength of path
union of cycles. Sivakumar, Vidyanandini, Sreedevi, Nayak, and Bhoi [2991] determined
the total edge irregularity strength of complete tripartite graphs.
In [1532] Jeyanthi and Sudha investigated the total edge irregularity strength of the
disjoint union of wheels. They proved the following: tes(2Wn ) = d(4n + 2)/3e , n > 3;
for n > 3 and p > 3 the total edge irregularity strength of the disjoint union of p
isomorphic wheels is d(2(pn + 1)/3e; for n1 > 3 and n2 = n1 + 1, tes(Wn1 ∪ Wn2 ) =
d(2(n1 + n2 + 1)/3)e; for n1 , n2 , n3 where n1 > 3 and ni+1 = n1 + i for i = 1, 2, tes(Wn1 ∪
Wn2 ∪Wn3 ) = d(2(n1 + n2 + n3 + 1)/3)e ; the total edge irregularity strength ofP the disjoint
union of p > 4 wheels Wn1 ∪ Wn2 ∪ · · · ∪ Wnp with ni+1 = n1 + i and N = pj=1 nj + 1
is d2N/3)e ; and the total edge P irregularity strength of p > 3 disjoint union of wheels
Wn1 ∪Wn2 ∪· · ·∪Wnp and N = pj=1 nj +1 is d(2N/3e if max{ni | 1 6 i 6 p} 6 21 d(2N/3e .
In [2201] Mughal and Jamil determined the tight lower bounds for the total face
irregular strength of type (1, 1, 0) of grids and wheels.
A k-labeling φ of a planar graph G is defined to be a face irregular k-labeling of type
(α, β, γ) if for every two different faces f and g of G we have wtφ(α,β,γ) (f ) 6= wtφ(α,β,γ) (g).
The face irregularity strength of type (α, β, γ) of a planar graph G, denoted fs(α, β, γ)(G),
is the smallest integer k such that G admits a face irregular k-labeling of type (α, β, γ).
In [380] Bača, Ovais, Semaničová-Feňovčı́ková, and Nengah Suparta, estimated the lower
bounds and the upper bounds of the face irregularity strength of type (α, β, γ) for 2-
connected planar graphs, where α, β, γ ∈ {0, 1}, and determined the precise values of
these parameters for ladders and fan graphs and proved the sharpness of the lower bounds.
The complete star of a graph G is the graph obtained from p + 1 copies of the graph G
by joining each vertex of G(0) with all corresponding vertices of all the copies G1) , . . . , G(p) .
Susanti, Khotimah, Hidayati, and Wahyujati [3149] deterimined the total edge irregularity
strength of snowflake graphs, water bears graphs, the complete star of Cn , and two other
families of ladder related graphs.
In [1535], [1537], [1538], and [1536] Jeyanthi and Sudha determine the total edge irreg-
ularity strength of fans, helms, closed helms, webs, flowers, gears, sun flowers, tadpoles,
armed crowns, split graphs of cycles, split graph of paths, disjoint unions of isomorphic
double wheels, and disjoint unions of consecutive non-isomorphic double wheels. Bokhary,
Ali, and Maqbool [592] determined the exact values for the total vertex and edge irreg-
ularity strength of three wheel related families of graphs. Bokhary, Imran, and Ali [594]

the electronic journal of combinatorics (2023), #DS6 363

determined the exact value of convex polytopes generated by prisms and antiprisms and
determined their total vertex irregularity strength and total edge irregularity strength.
Ibrahim, Asif, Ahmad, and Siddiqui [1279] investigated the total irregularity strength
of fans, helms, closed helms, webs, flower graphs, gears, and sunflowers. In [2607] Rat-
nasari1, Wahyuni1, Susanti1, and Palupi1 determined the total edge irregularity strength
of book graphs, double and triple book graphs, and gave the exact value of the total edge
irregularity strength of quadruplet book graphs and quintuplet book graphs. Nurdini,
Rosyida, and Mulyono [2313] determined the total edge irregularity strength of the chain
graph that consists of tadpole graph T (6, n) on each block and constructed an algorithm
to find it.
A generalized helm Hnm is a graph obtained by inserting m vertices in every pendent
edge of a helm Hn . Indriati, Widodo, and Sugeng [1330] proved that for n > 3,
tes(Hn1 ) = d(4n + 2)/3e, tes(Hn2 ) = d(5n + 2)/3e, and tes(Hnm ) = d((m + 3)n + 2))/3e for
m ≡ 0 mod 3. They conjecture that tes(Hnm ) = d((m + 3)n + 2))/3e, for all n > 3 and
m > 10.
A cactus graph G is a connected graph where no edge lies in more than one cycle. A
cactus graph consisting of some blocks where each block is Cn with same n is called an n-
uniform cactus graph. If each cycle of the cactus graph has no more than two cut-vertices
and each cut-vertex is shared by exactly two cycles, then G is called n-uniform cactus
chain graph. Rosyida and Indriati [2657] determined the tes of n-uniform cactus chain
graphs of length r for some n ≡ 0 mod 3. They also investigated the tes of tadpole chain
graphs. Rosyida and Indriati [2656] determined the total edge irregularity strength of the
triangular cactus chain with length r and r + 1 pendant vertices (T Crr+1 ) is d(4r + 3)/3e.
A para-squares cactus is a graph each of whose blocks is a 4-cycle and two or more squares
share a cut vertex. The para-squares cactus chain graph is a cactus graph such that each
of the two squares has one common cut vertex. Rosyida and Indriati determined that
total edge irregularity strength of para square cactus chain graph with length r and r
pendant vertices (Qrr ) is d(5r + 2)/3e. Rosyida, Ningrum, Mulyono, and Indriati [2658]
determined the total edge irregularity strength of general uniform cactus chain graphs
having (n − 2)r pendant vertices and length r.
Nurdin, Baskoro, Salman, and Gaos [2311] determine the total vertex irregularity
strength of trees with no vertices of degree 2 or 3; improve some of the bounds given in
[341]; and show that tvs(Pn ) = d(n+1)/3)e. In [2314] Nurdin, Salman, Gaos, and Baskoro
prove that for t > 2, tvs(tP1 )= t; tvs(tP2 )= t + 1; tvs(tP3 )= t + 1; and for n > 4,
tvs(tPn )= d(nt + 1)/3)e. Ahmad, Bača, and Bashir [91] proved that for n > 3 and t > 1,
tvs((n, t)-kite) = d(n + t)/3e, where the (n, t)-kite is a cycle of length n with a t-edge
path (the tail) attached to one vertex. In [1163] Guo, Chen, Wang, and Yao give the total
vertex irregularity strength of certain complete m-partite graphs. In [3159] Susilawati, [3159] new
Baskaro, and Simanjuntak determined the total vertex irregularity strength of a particular
subdivision of any tree. In [3161], [3162], and [3160] Susilawati, Baskoro and Simanjuntak [3161] new
determined the total vertex irregularity strength for trees with maximum degree four or [3162] new
five, for subdivision of several classes of caterpillars, for the subdivision of fire crackers,
and for the subdivision of an amalgamation of stars. In [3163] they studied the vertex [3160] new
[3163] new
the electronic journal of combinatorics (2023), #DS6 364
irregularity strength for trees having many vertices of degree 2. Nurdin, Baskoro, Salman
and Gaos [2312] determined the total vertex irregularity strength for firecrackers and [2312] new
banana trees.
Anholcer, Kalkowski, and Przybylo [211] prove that for every graph with δ(G) > 0,
tvs(G)6 d3n/δe + 1. Majerski and Przybylo [2068] prove that the total vertex irregularity
strength of graphs with n vertices and minimum degree δ > n0.5 ln n is bounded from
above by (2 + o(1))n/δ + 4. Their proof employs a random ordering of the vertices
generated by order statistics. Anholcer, Karonński, and Pfender [210] prove that for
every forest F with no vertices of degree 2 and no isolated vertices tvs(F )= d(n1 + 1)/2e,
where n1 is the number of vertices in F of degree 1. They also prove that for every forest
with no isolated vertices and at most one vertex of degree 2, tvs(F ) = d(n1 + 1)/2e.
Anholcer and Palmer [212] determined the total vertex irregularity strength Cnk , which
is a generalization of the circulant graphs Cn (1, 2, . . . , k). They prove that for k > 2
and n > 2k + 1, tvs(Cnk = d(n + 2k)/(2k + 1)e. Przybylo [2526] obtained a variety of
upper bounds for the total irregularity strength of graphs as a function of the order and
minimum degree of the graph.
In [3220] Tong, Lin, Yang, and Wang give the exact values of the total edge irreg-
ularity strength and total vertex irregularity strength of the toroidal grid Cm × Cn . In
[2953] Siddiqui, Miller, and Ryan determine the exact values of the total edge irregu-
larity strength of octagonal grid graph. In [99] Ahmad, Bača, and Siddiqui gave the
exact value of the total edge and total vertex irregularity strength for disjoint union of
prisms
Sm and for disjoint
Pmunion of cycles.SmIn [96] Ahmad, Bača, Pm and Numan showedSm that
tes( j=1 Fnj ) = 1 + j=1 nj and tvs( j=1 Fnj ) = d(2 + 2 j=1 nj )/3e, where j=1 Fnj
denotes the disjoint union of friendship graphs. Chunling, Xiaohui, Yuansheng, and Lip-
ing, [727] showed tvs(Kp ) = 2 (p > 2) and for the generalized Petersen graph P (n, k)
they proved tvs(P (n, k)) = dn/2e + 1 if k 6 n/2 and tvs(P (n, n/2))= n/2 + 1. They
also obtained the exact values for the total vertex strengths for ladders, Möbius ladders,
and Knödel graphs. For graphs with no isolated vertices, Przybylo [2524] gave bounds
for tvs(G) in terms of the order and minimum and maximum degrees of G. For d-regular
(d > 0) graphs, Przybylo [2526] gave bounds for tvs(G) in terms d and the order of G.
Ahmad, Ahtsham, Imran, and Gaig [81] determined the exact values of the total
vertex irregularity strength for five families of cubic plane graphs. In [88] Ahmad and
Bača determine that the total edge-irregular strength of the categorical product of Cn
and Pm where m > 2, n > 4 and n and m are even is d(2n(m − 1) + 2)/3e. They leave the
case where at least one of n and m is odd as an open problem. In [98] and [99] Ahmad,
Bača, and Siddiqui determine the exact values of the total edge irregularity strength of
the categorical product of two cycles, the total edge (vertex) irregularity strength for
the disjoint union of prisms, and the total edge (vertex) irregularity strength for the
disjoint union of cycles. In [87] Ahmad, Awan, Javaid, and Slamin study the total vertex
irregularity strength of flowers, helms, generalized friendship graphs, and web graphs.
Indriati, Widodo, Wijayanti, Sugeng, and Bača [1329] determine the exact value of the
total edge irregularity strength of the generalized web graph W (n, m) and two families of
related graphs. Ahmad, Bača, and Numan [96] determined the exact values of the total

the electronic journal of combinatorics (2023), #DS6 365

vertex irregularity strength and the total edge irregularity strength of a disjoint union of
friendship graphs. Bokhary, Ahmad, and Imran [591] determined the exact value of the
total vertex irregularity strength of cartesian and categorical product of two paths. Koam
and Ahmad [1708] determined the total vertex irregularity strength for all theta graphs
and certain values of the total vertex irregularity strength of the centralized uniform
theta graphs. They provide a conjecture for the lower bound of total vertex irregularity
strength of the centralized uniform theta graphs. In [593] Bokhary and Faheem proved
the conjecture of Bokhary, Ahmam, and Imran [591] that the tvs(Pm Pn ) = b mn+2 5
c for
m, n > 2 for 5 6 m 6 10 and n > 1. the state graph for Tower of Hanoi problems with
three towers. Farida and Indriati [917] determined the total edge irregularity strength of
the state graph for Tower of Hanoi problems with three towers.
In [2310] Nurdin, Salman, and Baskoro determine the total edge-irregular strength of
the following graphs: for any integers m > 2, n > 2, tes(Pm Pn )= d(2mn + 1)/3e;
for any integers m > 2, n > 3, tes(Pm Cn )= d((2n + 1)m + 1)/3e; for any integers
m > 2, n > 2, tes(Pm K1,n )= d(2m(n + 1) + 1)/3e; for any integers m > 2 and
n > 3, tes(Pm Gn )= d(m(5n + 2) + 1)/3e where Gn is the gear graph obtained from
the wheel Wn by subdividing every edge on the n-cycle of the wheel; for any integers
m > 2, n > 2, tes(Pm Fn )= dm(5n + 2) + 1e, where Fn is the friendship graph obtained
from W2m by subdividing every other rim edge; for any integers m > 2 and n > 3; and
tes(Pm Wn )= d((3n + 2)m + 1)/3e.
In [2560], [2561], and [2559] Rajasingh, Rajan, Teresa Arockiamary, and Quadras
provide the total edge irregularity strengths of honeycomb mesh networks, hexagonal
networks, butterfly networks, benes networks, and series compositions of uniform theta
graphs. Ratnasari and Susanti [2596] determined the exact value of the total edge irregu-
larity strength of triangular ladders, diagonal ladders, and circular triangular ladders. In
[2312] Nurdin, Baskoro, Salman, and Gaos proved: the total vertex-irregular strength of
the complete k-ary tree (k > 2) with depth d > 1 is d(k d + 1)/2e and the total vertex-
irregular strength of the subdivision of K1,n for n > 3 is d(n+1)/3e. They also determined
that if G is isomorphic to the caterpillar obtained by starting with Pm and m copies of
Pn denoted by Pn,1 , Pn,2 , . . . , Pn,m , where m > 2, n > 2, then joining the i-th vertex of
Pm to an end vertex of the path Pn,i , tvs(G)= d(mn + 3)/3e. They conjectured that
the total vertex irregularity strength of any tree T is determined only by the number of
vertices of degrees 1, 2 and 3 in T . This conjecture was confirmed by Susilawati, Baskoro,
and Simanjuntak [3158] by considering all trees with maximum degree five. They also
characterized all suchPitrees having the total vertex irregularity strength either t1 , t2 , or
t3 , where ti = d(1 + j=1 nj )/(i + 1)e and ni is the number of vertices of degree i.
Ahmad and Bača [89] proved tvs(Jn,2 )= d(n + 1)/2)e (n > 4) and conjectured that for
n > 3 and m > 3, tvs(Jn,m )= max{d(n(m − 1) + 2)/3e, d(nm + 2)/4e}. They also proved
that for the circulant graph (see §5.1 for the definition) Cn (1, 2), n > 5, tvs(Cn (1, 2))=
d(n + 4)/5e. They conjecture that for the circulant graph Cn (a1 , a2 , . . . , am ) with degree r
at least 5 and n > 5, 1 6 ai 6 bn/2c, tvs(Cn (a1 , a2 , . . . , am )= d(n + r)/(1 + r)e. Ahmad,
Arshadb, and Iz̆arı́ková [86] determine tes(G) where G is the generalized helm and tvs(G)
where G is the generalized sun graph.

the electronic journal of combinatorics (2023), #DS6 366

 Slamin, Dafik, and Winnona [2997] consider the total vertex irregularity strengths of
the disjoint union of isomorphic sun graphs, the disjoint union of consecutive nonisomor-
phic sun graphs, tvs(∪ti=1 Si+2 ), and disjoint union of any two nonisomorphic sun graphs.
(Recall Sn = Cn K1 .) Rajasingh and Annamma [2558] determine the total vertex irregu-
larity strength of 1-fault tolerant Hamiltonian graphs CH(n), H(n), and W (m). Indriati,
Widodo, Wijayanti, Sugeng, Bača, and Semaničová-Feňovčı́ková [1331] determine the ex-
act value of the total vertex irregularity strength for generalized helm graphs and for
prisms with outer pendent edges. In [260] Asim and Hasni provided an upper bound for
es(Kn ) that is far better than the previously known upper bound.
In [76] Ahmad shows that the total vertex irregularity strength of the antiprism graph
An (n > 3) is d(2n + 4)/5e (see §5.7 for the definition) and gives the vertex irregularity
strength of three other families convex polytope graphs. Al-Mushayt, Arshad, and Sid-
diqui [164] determined an exact value of the total vertex irregularity strength of some
convex polytope graphs. Ahmad, Baskoro, and Imran [102] determined the exact value
of the total vertex irregularity strength of disjoint union of helm graphs.
For n > 3, m > 2 Jeyanthi and Sudha [1539] determine the total vertex irregularity
strength of Pn K1 , Pn K2 , Cn K2 , Ln K1 , P2 Cn , Pn Km , (Cn × P2 ) K1 ,
and Cn Km . In [1540] they determine the total vertex irregularity strength for the
graph obtained from a cycle by identifying the endpoint of a path and the vertex of
a cycle, Cn Pm , the split graph of a cycle, and split graph of a path. In [1540] they
determine the total vertex irregularity strength for quadrilateral snakes, sunflowers, double
wheels, triangular books, quadrilateral books, and graphs obtained from the wheel Wn
and attaching n pendent edges to the center. In [1542] Jeyanthi and Sudha determined the
total irregularity strength of the n-crossed prism, m copies of crossed prism, necklace and
m copies of necklace graph and that these graphs admit totally irregular total k-labeling.
Tilukay, Tomasouw, Rumlawang, and Salman in [3216] proved that Kn and Kn,n are
both totally irregular total graphs with their ts equal to their tes. Tilukay, Taihuttu,
Salman, Rumlawang, and Leleury [3214] proved that Km,n is a totally irregular total
graph for any positive integer m and n.
A total edge Fibonacci irregular labeling f : V (G) ∪ E(G) → {1, 2, . . . , k} of a graph
G is a labeling of vertices and edges of G in such a way that for disinct edges xy and x0 y 0
their weights f (x) + f (xy) + f (y) and f (x0 ) + f (x0 y 0 ) + f (y 0 ) and are distinct Fibonacci
numbers. A graph that has a total edge Fibonacci irregular labeling is called a total
edge Fibonacci irregular graph. Karthikeyan, Navanaeethakrishnan, and Sridevi [1658] [1658] new
proved that stars, bistars Bn,n (n > 2), and two particular families of star related and
bistar related graphs are total edge Fibonacci irregular graphs. The total edge Fibonacci
irregularity strength, tefs(G) is the minimum k for which G has total edge Fibonacci
irregular labeling. Amutha and Uma Devi [181] determined the exact values of the total [181] new
edge Fibonacci irregularity strength of fans, double fans, umbrella, and wheels.
In [70] Agustin, Dafik, Marsidi, and Albirri introduced a natural extension of the
notation of the total H-irregularity strength of graphs by considering the evaluation of
the weight that is not only for each edge but also the weight on each subgraph H of
G. They say a total α-labeling is a total H-irregular α-labeling of the graph G if for

the electronic journal of combinatorics (2023), #DS6 367

 P P
a subgroup H of G, the total H-weights W (H) = v∈V (H) f (v) + e∈E(H) f (e) are
distinct. The minimum α for which the graph G has a total H-irregular α-labeling is
called the total H-irregularity strength of G, denoted by tHs(G). They study the tHs
of shackles and amalgamations of any graphs and their bounds. In [257] Ashraf, Bača,
Semaničová-Feňovčı́ková, and Siddiqui determined the exact value of the total (vertex,
edge) H-irregularity strengths for the ladders and fan graphs.
The notion of an irregular labeling of an Abelian group Γ was introduced Anholcer,
Cichacz and Milanič in [204]. They defined a Γ-irregular labeling of a graph G with no
isolated vertices as an assignment of elements of an Abelian group Γ to the edges of G
in such a way that the sums of the weights of the edges at each vertex are distinct. The
group irregularity strength of G, denoted sg (G), is the smallest integer s such that for every
Abelian group Γ of order s there exists Γ-irregular labeling of G. They proved that if G
is connected, then sg (G) = n + 2 when ∼ = K1,32q+1 −2 for some integer q > 1; sg (G) = n + 1
when n ≡ 2 (mod 4) and G 6∼ = 1,3 −2 for any integer q > 1; and sg (G) = n otherwise.
K 2q+1

Moreover, Anholcer and Cichacz [200] showed that if G is a graph of order n with no
component of order less than 3 and with all the bipartite components having both color
classes of even order. Then sg (G) = n if n ≡ 1 (mod 2); sg (G) = n + 1 if n ≡ 2 (mod
4); and sg (G) 6 n + 1 if n ≡ 0 (mod 4). In [203] Anholcer, Cichacz, Jura, Marczyk
presented some upper bound on group the irregularity strength for all graphs. Moreover,
they gave the exact values and bounds on sg (G) for disconnected graphs without a star
as a component. Anholcer, Cichacz, and Przybylo [208] proved that that sg (G) 6 2n.
They also considered locally irregular labelings where only sums of adjacent vertices are
required to be distinct. For the corresponding graph invariant they proved the general
upper bound: ∆(G) + col(G) − 1 (where col(G) is the coloring number of G) in the
case when the identity element is not used as an edge label, and a slightly worse one if
additionally the identity is forbidden as the sum of labels around a vertex. In the both
cases they provided a sharp upper bound for trees and a constant upper bound for planar
graphs. In [746] Cichacz and Krupińska gave a bound and exact values of the group [746] new
irregular strength for graphs without small stars as components.
Marzuki, Salman, and Miller [2109] introduced a new irregular total k-labeling of a
graph G called total irregular total k-labeling, denoted by ts(G), which is required to
be at the same time both vertex and edge irregular. They gave an upper bound and
a lower bound of ts(G); determined the total irregularity strength of cycles and paths;
and proved ts(G) > max{tes(G), tvs(G)}. For n > 3, Ramdani and Salman [2578]
proved ts(Sn × P2 ) = n + 1; ts((Pn + P1 ) × P2 ) = d(5n + 1)/3e, ts(Pn × P2 ) = n; and
ts(Cn × P2 ) = n. In [2579] Ramdani, Salman, and Assiyatun prove that for a regular
graph G ts(mG) 6 m(ts(G)) − b(m − 1)/2b, ts(mCn ) = d(mn + 2)/3c for n ≡ 3 mod
3, and ts(m(Cn × P2 ) = mn + 1. In [2580] Ramdani, Salman, Assiyatun, Semaničová-
Feňovčı́ková, and Bača estimate the upper bound of the total irregularity strength of
graphs and determine the exact value of the total irregularity strength for three families
of graphs. In [1471] Jeyanthi and Sudha determined the total irregularity strength of
double fans DFn (n > 3), double triangular snakes DTp (p > 3), joint-wheel graphs
W Hn (n > 3), and Pm + Km (m > 3). In addition, they show that these graphs admit

the electronic journal of combinatorics (2023), #DS6 368

totally irregular total k-labeling and they determined the exact ts value for each. In [1328]
Indriati, Widodo, Wijayanti, and Sugeng provided the total irregularity strength of some
caterpillars.
In [3213] Tilukay, Salman, and Persulessy proved that fans, wheels, triangular books,
friendship graphs, double fans DFn , (n > 3), double triangular snakes DTp (p > 3),
joint-wheel graphs, Pm + Km (m > 3), stars, double-stars, and caterpillars (see also
[2581]) are totally irregular total graphs. Ramdani, Salman, Assiyatun, Semaničová-
Feňovčı́ková, and Bača [2580] proved that for any positive integer n > 2, ts(Kn,n ) =
d(n2 + 2)/3e. Tilukay, Taihuttu, Salman, Rumlawang, and Leleury [3214] proved that
Km,n is a totally irregular total graph for any positive integer m and n. In [3213] Tilukay,
Salman, and Persulessy proved that fans, wheels, triangular books, friendship graphs
are totally irregular total graphs, double fans DFn , (n > 3), double triangular snakes
DTp , (p > 3), joint-wheel graphs, Pm + Km (m > 3), stars, double-stars, and caterpillars
(see also [2581]).
In [2231] Muthgu Guru Packiam defines a face irregular total k-labeling f from V ∪E∪F
to {1, 2, . . . , k} of a 2-connected plane graph G(V, E, F ) as a labeling of vertices and edges
such that different faces have different weigths. The minimum k for which a plane graph
G has a face irregular total k-labeling is called total face irregularity strength of G and
is denoted by tf s(G). He provides a bound on this parameter and the exact values
for shell graphs and a family of planar graphs consisting of an even number of 5-sided
faces and one external infinite face. In [346] Bača, Lascsḱová, Naseem, and Semaničová-
Feňovčı́ková estimate the lower and upper bounds of the entire face irregularity strength
for the disjoint union of multiple copies of a plane graph and prove the sharpness of the
lower bound in two cases. Tilukay, Salman, Ilwaru, and Rumlawang [3217] estimated
the bounds of tf s(G) and prove that the lower bound is sharp for cycles, books with m
polygonal pages, and wheels.
For a graph G, Tanna, Ryan, and Semaničová-Feňovčı́ková [3188] define a k-labeling
ρ as a labeling such that the edges of G are labeled with {1, 2, . . . , ke } and the vertices of
G are labeled with {0, 2, . . . , 2kv }, where k = max{ke , 2kv }. The labeling ρ is called an
edge irregular reflexive k-labeling if distinct edges have distinct weights, where the edge
weight is defined as the sum of the label of that edge and the labels of its endpoints.
The smallest k for which such a labeling exists is called the reflexive edge strength of G.
The authors give exact values for the reflexive edge strength for prisms, wheels, baskets
(graphs obtained by removing a spoke from a wheel), and fans. Guirao, Ahmad, Siddiqui,
and Ibrahim [1162] investigated the exact value of the reflexive edge strength for disjoint
union of s isomorphic copies of generalized Peterson graphs. Zhang, Ibrahim, ul Haq
Bokhary, and Siddiqui [3581] provided exact value of the reflexive edge strength for disjoint
union of gears and prisms. Bača, Irfan, Ryan, Semaničová-Feňovčı́ková, and Tanna [339]
determined the exact value of the reflexive edge strength for cycles, the Cartesian product
of two cycles, and for join graphs of the path and cycle with 2K2 . Wang, Khan, Ibrahim,
Bonyah, Siddiqui, and Khalid [3412] determined the reflexive edge irregularity strength
for the Cartesian product of a path and a cycle. In [3538] Yoong, Hasni, Lau, Asim,
and Ahmad obtained the exact reflexive edge strength for antiprisms, two kinds of convex

the electronic journal of combinatorics (2023), #DS6 369

polytopes, and Cn Pm (n > 3, m > 2). Yoong, Hasni, Lau, and Irfan [3539] provided the [3539] new
exact value of the reflexive edge strength of three clssess of plane graphs. In [290] Basher [290] new
examined two types of eight-sided and four-faced or six-sided and four-faced planar maps
that have an edge irregular reflexive k-labeling. He gave the precise value of the reflexive
edge strength for these two classes. In [338] Bača, Irfan, Ryan, Semaničová-Feňovčı́ková, [338] new
and Tanna provided the precise values of the reflexive edge strength for the generalized
friendship graphs fn,m for n = 3, 4, 5, m > 1 and made a conjecture of the value for the
remaining cases. In [339] they determined the exact value of the reflexive edge strength [339] new
for cycles, the Cartesian product of two cycles, and for join graphs of the path and cycle
with 2K2 . Bača, Kovář, and Semaničová-Feňovčı́ková [1334] provided the precise value of [1334] new
the reflexive edge strength of Cn × Pm where n > 3 and m > 2. Basher [480] determined [480] new
the exact value of reflexive edge strength of toroidal polyhexes.
A vertex irregular reflexive k-labeling of a graph G is total k-labeling such that for
every two distinct vertices the sums of labels of edges that are incident to each vertex
and the vertex label itself are distinct. The reflexive vertex strength of a graph G is a
minimum k such that G has a vertex irregular reflexive k-labeling. Agustin, Iman Utoyo,
Dafik, and Venkatachalam [74] determined the exact value of reflexive vertex strength of
ladders and K2,n .
A total k-labeling of a graph is a function fe from the edge set to {1, 2, . . . , ke } and
a function fv from the vertex set to {0, 2, 4, . . . , 2kv }, where k = max ke , 2kv . A distance
irregular reflexive k-labeling of graph G is a total k-labeling if for every two distinct vertices
u and u0 of G, wt(u) 6= wt(u0 ), where wt(u) = fv (u) + the sum of fe (uv) over all edges
uv of G. The minimum k for graph G that has a distance irregular reflexive k-labeling is
called the distance reflexive strength of the graph G. In [71] Agustin, Dafik, Mohanapriya, [71] new
Marsidi, and Cangul determine the lower bound of distance reflexive strength of any graph
and the exact value of distance reflexive strength of paths, stars, and friendship graphs.
Recall that an edge-covering of G is a family of subgraphs H1 , H2 , . . . , Ht such that
each edge of E(G) belongs to at least one of the subgraphs Hi , i = 1, 2, . . . , t. In this
case we say that G admits an (H1 , H2 , . . . , Ht )-(edge) covering. If every subgraph Hi
is isomorphic to a given graph H, we say that G admits an H-covering. Motivated
by the irregularity strength and the edge irregularity strength of a graph G, Ashraf,
Bača, Kimáková, and Semaničová-Feňovčı́ková [253] introduced two new parameters, edge
(vertex) H-irregularity strengths, as the natural extensions of the parameters s(G) and
es(G) as follows. Let G be a graph admitting an H-covering. For the subgraph H of
G under the edge k-labeling
P β from E(G) to {1, 2, . . . , k}, the associated H-weight is
defined as wtβ (H) = β(e) over all edges e. An edge k-labeling β is called an H-
irregular edge k-labeling of the graph G if for every two different subgraphs H 0 and H 00
isomorphic to H we have wtβ (H 0 ) 6= wtβ (H 00 ). The edge H-irregularity strength of a graph
G, denoted by ehs(G, H), is the smallest integer k such that G has an H-irregular edge
k-labeling. Ibrahim, Gulzar, Fazil, and Azhar [1280] compute the exact value of edge
H-irregularity strength of hexagonal and octagonal grid graphs. Ashraf et al. define the
vertex H-irregularity strength of a graph G, vhs(G, H), analogously. They estimate the
bounds of the parameters ehs(G, H) and vhs(G, H) and determine the exact values of

the electronic journal of combinatorics (2023), #DS6 370

the edge (vertex) H-irregularity strength for paths, ladders, and fans in order to prove
the sharpness of lower bounds of these parameters. Nisviasari, Dafik, and Agustin [2280]
determined the total H-irregularity strength of triangular ladders when H is a windmill
or triangular ladder.
In [255] Ashraf, Bača, Semaničová-Feňovčı́ková, and Saputro determined the ex-
act value of the cycle-irregularity strength of ladders and fan graphs. Ashraf, Bača,
Lascsáková, and Semaničová-Feňovčı́ková [254] estimated the bounds for the total H-
irregularity strength of a graph and determind the exact values of the total H-irregularity
strength for paths ladders and fans. Ashrafa, Bača, Semaničová-Feňovčı́ková, and Shab-
birc [256] investigated the total (respectively, edge and vertex) G-irregularity strengths
of the graphs that contains exactly n subgraphs isomorphic to G. Ahmad, Bača, and
Semaničová-Feňovčı́ková [97] determined the exact values of ehs(G, C4 ) for grids and gen-
eralized prisms.
In [84] Ahmad, Al-Mushayt, and Bača define a vertex k-labeling φ of a graph G from
V (G) to {1, 2, . . . , k} to be edge irregular k-labeling if for every two distinct edges e and
f , there is wφ (e) 6= wφ (f ), where the weight of an edge e = xy is wφ (xy) = φ(x) + φ(y).
The minimum k for which the graph G has an edge irregular k-labeling is called the
edge irregularity strength of G, denoted by es(G). They estimated the bounds of the
edge irregularity and determined its exact values for paths, cycles, stars, double stars and
Pm × Pn . Tarawneh, Hasni, and Ahmad [3190] determined the exact value of the edge
irregularity strength of the corona product of graphs with paths. Tarawneh, Hasni, and
Ahmad [3191] determine the exact value of edge irregularity strength of corona graphs
Cn mK1 (m > 2). Ahmad [77] determined the exact value of es(Cn K1 ). In [94]
Ahmad, Bača, and Nadeen determine the exact value of the edge irregularity strength for
several classes of Toeplitz graphs. Tarawneh, Hasni, Siddiqui, and Asim [3194] determined
the exact value of edge irregularity strength of disjoint union of zigzag graphs, grids, and
generalized sun graphs. Ahmed, Omar, and Bača [114] obtained estimations of the edge [114] new
irregularity strength of graphs and determined the precise values for paths, stars, double
stars, and the Cartesian product of two paths. Suparta and Suharta [3146] determined [3146] new
the edge irregularity strength of the chain graph mK3 -path for m > 3 (mod 4) and the
(m)
chain graph C[Cn ] for n = 0 (mod 4) and provided bounds for the edge irregularity
strength of Pm + Kn for m, n > 3. In [3584] Zhang, Mehmood, Rehman, Hussain, and [3584] new
Zhang provided the exact values of the edge irregularity strengths of C4 -snakes, complete
m-partite graphs, and the middle graphs of paths and cycles.
A chain graph C[B1 , B2 , . . . , Bn ] is a graph with blocks B1 , B2 , . . . , Bn such that Bi
and Bi+1 have a common vertex in such a way that the block-cut vertex graph is a path.
(n)
Ahmad, Gupta, and Simanjuntak [103] prove the following: es(C[C4 ]) = 2n + 1; if
Hm is an mK3 -path, then es(Hm ) has lower bound d 3m+3 2
e and upper bound 2m + 1;
es(mK4 -path) = 3m + 2; and es(K1,n + K1 ) = n + 2 for n > 3. They obtained bounds for
es(Pm + Kn ) and determined that the edge irregularity strength of a graph obtained by
joining the vertex of degree m in K1,m to each vertex in K1,n , and the vertex of degree n
in K1,n to each vertex in K1,m is m + n + 2. They posed the open problems of determining
es(mK3 -path), es(mKn -path) (m > 2) and n > 5, and es(Pm + Kn ) for n > 1 and

the electronic journal of combinatorics (2023), #DS6 371

m > 7. Tarawneh, Hasni, and Asim [3193] determined the exact value of edge irregularity
strength for disjoint union of a star graph and the subdivision of a star graph.
The strong product of graphs G1 and G2 has as vertices the pairs (x, y) where x ∈ V (G1 )
and y ∈ V (G2 ). The vertices (x1 , y1 ) and (x2 , y2 ) are adjacent if either x1 x2 is an edge
of G1 and y1 = y2 or if x1 = x2 and y1 y2 is an edge of G2 . For m, n > 2 Ahmad, Bača,
Bashir, Siddiqui [92] proved that the total edge irregular strength of the strong product of
Pm and Pn is d4(mn + 1)/3e − (m + n). Al-Mushayt [162] determined the edge irregularity
strength of cartesian product of a star and P2 and a cycle and P2 , and the strong product
of path Pn with P2 . Conjectures for the exact value of K1,n × Pm and Cn × Pm are stated.
Bača and Siddiqui [388] determine the exact value of the total edge irregularity strength
of the strong product of any two cycles.
An edge e ∈ G is called a total positive edge or total negative edge or total stable edge
of G if tvs(G + e) > tvs(G) or tvs(G + e) < tvs(G) or tvs(G + e) = tvs(G), respectively.
If all edges of G are total stable (total negative) edges of G, then G is called a total stable
(total negative) graph. Otherwise G is called a total mixed graph.
Muthu Guru Packiam and Kathiresan [2324] showed that K1,n n > 4, and the disjoint
union of t > 2 copies of K3 are total negative graphs and that the disjoint union of t > 2
copies of P3 is a total mixed graph.
For a simple graph G with no isolated edges and at most one isolated vertex Anholcer
[198] callsQa labeling w : E(G) → {1, 2, . . . , m} product-irregular, if all product degrees
pdG (v) = e3v w(e) are distinct. Analogous to the notion of irregularity strength the goal
is to find a product-irregular labeling that minimizes the maximum label. This minimum
value is called the product irregularity strength of G and is denoted by ps(G). He provides
bounds for the product irregularity strength of paths, cycles, cartesian products of paths,
and cartesian products of cycles. In [199] Anholcer gives the exact values of ps(G) for
Km,n where 2 6 m 6 n 6 (m + 2)(m + 1)/2, some families of forests including complete
d-ary trees, and other graphs with d(G) = 1. Darda and Hujdurović [783] proved that
ps(X) 6 |V (X)| − 1 for any graph X with more than 3 vertices and gave a connection
between the product irregularity strength and the multidimensional multiplication table
problem. Skowronek-Kaziów [2994] proves that for the complete graphs ps(Kn ) = 3. In
2023 Bensmail, Hocquard, Lajou, and Sopena [534] proved that the product version of [534] new
the 1-2-3 conjecture, raised by Skowronek-Kazió [2994] in 2012, that for every connected
graph with order at least 3, there is an assignment of the labels 1, 2, 3 to the edges in
such a way that no two adjacent vertices are incident to the same product of labels.
In [6] Abdo and Dimitrov P introduced the total irregularity of a graph. For a graph G,
they define irrt (G) = (1/2) u,v∈V |dG (u)−dG (v)|, where dG (w) denotes the vertex degree
of the vertex w. For G with n vertices they proved irrt (G) 6 (1/12)(2n3 − 3n2 − 2n + 3).
For a tree G with n vertices they prove irrt (G) 6 (n − 1)(n − 2) and equality holds if and
only if G ≈ Sn . You, Yang, and You [3540] determined the graph with the maximal total
irregularity among all unicyclic graphs.
Inspired by the concept of distant chromatic numbers Przybylo [2527] calls a labeling
f from the edges of a graph G to {1, 2, 3, . . . , k} r-distant irregular, if for every vertex v,
the weights of the set of all vertices that are at distance less than or equal to r from v

the electronic journal of combinatorics (2023), #DS6 372

are pairwise distinct, where the weight of the vertex is the sum of the labels of the edges
that are incident with that vertex. The minimum k for which there exists an r-distant
irregular labeling of G is called r-distant irregularity strength of G and is denoted by
sr (G). Muthu Guru Packiam, Manimaran, and Thuraiswamy [2233] proved the following:
s1 (Pn ) = 2 for n = 3, 4, 5; s1 (Pn ) = 3 if n > 5; s1 (Cn ) = 3; s1 (Km,n ) = s(Km,n ); s1 (Fn ) =
s(Fn ) = d(n + 1)/3e for n > 2; s1 (Km,n ) = 3 when 1 < n/2 6 m < n; s1 (Pn × K2 ) = 3;
s1 (Cn × K2 ) = 3; s1 (Km,n ) = 3 when 1 < n/2 6 m < n; and provide the exact value for
s1 (Pm Kn ) for all m and n. They also prove that if G is d-regular with n vertices, then
s1 (G) = s(G) 6 dn/2e + 1 for d > n/2. Susanto, Wijaya, Purnama, and Slamin [3155]
derived a new lower bound of distance irregularity strength for graphs with pendant
vertices. They also determined the distance irregularity strength of some families of
disjoint unions of paths, suns, helms and friendships graphs. In [533] Bensmail proved
that determining the distant irregularity strengths are NP-hard problems.
In a preprint [3473] Wijayanti, Noor, Indriati, Alghofari, and Slamin defined a distance [3473] new
vertex irregular total k-labeling of a simple undirected graph G(V, E), as a function f :
V (G) ∪ E(G) → {1, 2, . . . , k} such that for every pair of distinct vertices u, v ∈ V (G)
the weights of u and v are distinct. The weight of vertex v ∈ V (G) is the sum of the
labels of vertices in neighborhood of v and the labels of all incident edges to v. The
total distance vertex irregularity strength of G (denoted by tdis(G)) is the minimum k
for which G has a distance vertex irregular total k-labeling. In [3474] Wijayanti et al. [3474] new
generalized to distance D where D is any subset of {1, 2, . . . , diam(G)}. Wijayanti, Noor,
Indriati, Alghofari [3474] determined the exact total distance vertex irregularity strength [3474] new
of fan and wheel graphs for D = {1} In [3472] Wijayanti, Noor, Indriati, Alghofari, and [3472] new
Slamin determined the exact value of the total distance vertex irregularity strength of
Km Kn , Cn K1 , and Pn K1 .
An inclusive distance vertex irregular labeling of a graph G is an assignment of elements
of the set {1, 2, . . . , k} to the vertices of G such that the sums of numbers assigned to
the closed neighborhoods of all verticies are distinct. The minimum number k for which
there exists an inclusive distance vertex irregular labeling of G is denoted by dis(G). c
Bača, Semaničová-Feňovčı́ková, Slamin, and Sugeng [383] establish a lower bound for
the inclusive distance vertex irregularity strength for any graph and determine the exact
value of this parameter for several families of graphs. Cichacz, Gömrlich, and Semaničová-
Feňovčı́ková [736] prove that for a simple graph G on n vertices in which no two vertices
have the same closed neighborhood is dis(G) c 6 n2 .
A mapping φ : V (G) → {1, 2, . . . , k} of a simple graph G is said to be an non-
inclusive distance vertex irregular k-labeling of G if the sums of labels of vertices in the open
neighborhood of every vertex are distinct. The minimum k for which G has a non-inclusive
distance vertex irregular k-labeling is called a non-inclusivedistance irregularity strength
and is denoted by dis(G)). Susanto, Wijaya, Slamin, and Semanic̆ová-Fen̆ovc̆ı́ková [3156]
developed new lower bounds for non-inclusive distance irregularity strength of graphs and
proved that such bounds are sharp for some classes of graphs with pendant vertices. They
also discussed some properties for non-inclusive distance irregularity strength of trees.
Susanto, Wijaya, Sudarsana, and Slamin [3157] studied non-inclusive and inclusive

the electronic journal of combinatorics (2023), #DS6 373

distance irregularity strength for the join product of two given graphs. They gave bounds
on non-inclusive and inclusive distance irregularity strength for G + H and showed that in
some conditions, the bounds are achievable. They determined the exact value of dis(G +
K1 ) for any given graph G and developed an algorithm for calculating the upper bound
on inclusive distance irregularity strength of complete multipartite graphs.
Susanto, Betistiyan, Halikin, and Wijaya [3154] derived new lower bounds on inclusive
distance irregularity strength for arbitrary graph and showed that the bounds are sharp
for two stars 2K1,n and three stars 3K1,n . For a integer m > 2 and non-trivial connected
graph G of order p and size q, the m-shadow of a graph G, denoted by Dm (G), is the
graph obtained by taking m copies of G, say G1 , G2 ,. . . , Gm , and joining each vertex u
in Gi , i = 1, 2, . . . , m − 1, to the neighbors of the corresponding vertex u0 in Gi+1 .
For a graph G and an integer m > 3, the closed m-shadow of a graph G, denoted by
CDm (G), is a graph obtained from the m-shadow of G by joining an edge from every
vertex u in G1 to the neighbors of the corresponding vertex u0 in Gm .
Inayah, Susanto and Semaničová-Feňovčı́ková [1326] proved the following: for every
non-trivial connected graph G of order p and size q, and integers m, t with 2 6 t 6 m − 1,
Dm (G) is super (a, d)-Dt (G)-antimagic for d ∈ {0, 2, . . . , p+3q} when p+q is even and for
d ∈ {1, 3, . . . , p + 3q} when p + q is odd; for every non-trivial connected graph G of order p
and size q, and integers m, t with 2 6 t 6 m−1 and gcd(m, t) = 1, CDm (G) is super (a, d)-
Dt (G)-antimagic for d ∈ {0, 2, . . . , p + q} when p + q is even and for d ∈ {1, 3, . . . , p + q}
when p + q is odd; for every non-trivial connected graph G of order p and size q, and for
any integer m > 3, CDm (G) is super (a, d)-Dm (G)-antimagic for d ∈ {0, 2, . . . , 2q}.
A natural modification of an irregular labeling is a modular irregular labeling intro-
duced by Muthugurupackiam and Ramya [2211] in 2018. They call an edge k-labeling
φ : E(G) → {1, 2, . . . , k} of positive integers to the edges of a graph G of order n
a modular irregularPlabeling of G if the weight function θ : V (G) → Zn defined by
θ(v) = wtφ(v) = φ(uv) over all u ∈ N (v) is bijective. The modular irregularity
strength is defined as the minimum k for which G has a modular irregular labeling. If
there is no such labeling for a graph then its modular irregularity strength is defined as
∞. They proved the modular irregularity of the tadpole graph and double-cycle graph.
Bača, Muthugurupackiam, Kathiresan, and Ramya in [374] gave a lower bound of the
modular irregularity strength, and the exact values for paths, cycles, stars, triangular
graphs, and gear graphs are determined. In [343] Bača, Kimáková, Lascsáková, and
Semaničová-Feňovčikovǎ determine the exact value of the irregularity strength and the
modular irregularity strength of fan graphs. Bačca, Imran, and Semaničovǎ-Feňovčcı́kovǎ
showed the existence of an irregular labeling scheme that proves the exact value of the
irregularity strength of wheels. By modifying this irregular mapping in six cases, they
obtained labelings that determine the exact value of the modular irregularity strength of
wheels as a natural modification of the irregularity strength. Ali, Bača, Lascsaková, Se-
maničová-Feňovčıková, ALoqaily, and Mlaiki [151] obtained estimations on the modular [151] new
total vertex irregularity strength, and gave the precise values of this invariant for cer-
tain graphs. In [3079] Sugeng, Barack, Hinding, and Simanjuntak constructed a modular
irregular labeling and determined its modular irregularity strength of regular double-

the electronic journal of combinatorics (2023), #DS6 374

star graphs and friendship graphs. Haryeni, Awanis, Bača, and Semaničová-Feňovčikovǎ
[1190] estimated the bounds of the (modular) edge irregularity strength for Pn + Km and [1190] new
Cn + Km and determined the corresponding exact value of the (modular) edge irregularity
strength for some fans and wheels in order to prove the sharpness of the presented bounds.

7.14 Geometric Labelings

If a and r are positive integers at least 2, we say a (p, q)-graph G is (a, r)-geometric if its
vertices can be assigned distinct positive integers such that the value of the edges obtained
as the product of the endpoints of each edge is {a, ar, ar2 , . . . , arq−1 }. Hegde [1214] has
shown the following: no connected bipartite graph, except the star, is (a, a)-geometric
where a is a prime number or square of a prime number; any connected (a, a)-geometric
graph where a is a prime number or square of a prime number, is either a star or has a
triangle; Ka,b , 2 6 a 6 b is (k, k)-geometric if and only if k is neither a prime number nor
the square of a prime number; a caterpillar is (k, k)-geometric if and only if k is neither a
prime number nor the square of a prime number; Ka,b,1 is (k, k)-geometric for all integers
k > 2; C4t is (a, a)-geometric if and only if a is neither a prime number nor the square of
a prime number; for any positive integers t and r > 2, C4t+1 is (r2t , r)-geometric; for any
positive integer t, C4t+2 is not geometric for any values of a and r; and for any positive
integers t and r > 2, C4t+3 is (r2t+1 , r)-geometric. Hegde [1216] has also shown that every
Tp -tree and the subdivision graph of every Tp -tree are (a, r)-geometric for some values of
a and r (see Section 3.2 for the definition of a Tp -tree). He conjectures that all trees are
(a, r)-geometric for some values of a and r.
Hegde and Shankaran [1226] prove: a graph with an α-labeling (see §3.1 for the def-
inition) where m is the fixed integer that is between the endpoints of each edge has an
(am+1 , a)-geometric for any a > 1; for any integers m and n both greater than 1 and m
odd, mPn is (ar , a)-geometric where r = (mn + 3)/2 if n is odd and (ar , a)-geometric
where r = (m(n + 1) + 3)/2 if n is even; for positive integers k > 1, d > 1, and odd n, the
generalized closed helm (see §5.3 for the definition) CH(t, n) is (k r , k d )-geometric where
r = (n − 1)d/2; for positive integers k > 1, d > 1, and odd n, the generalized web graph
(see §5.3 for the definition) W (t, n) is (k r , a)-geometric where a = k d and r = (n − 1)d/2;
for positive integers k > 1, d > 1, the generalized n-crown (Pm × K3 ) K1,n is (a, a)-
geometric where a = k d ; and n = 2r + 1, Cn P3 is (k r , k)-geometric.
If a and r are positive integers and r is at least 2 Arumugan, Germina, and Anadavally
[243] say a (p, q)-graph G is additively (a, r)-geometric if its vertices can be assigned
distinct integers such that the value of the edges obtained as the sum of the endpoints
of each edge is {a, ar, ar2 , . . . , arq−1 }. In the case that the vertex labels are nonnegative
integers the labeling is called additively (a, r)∗-geometric. They prove: for all a and r
every tree is additively (a, r)∗-geometric; a connected additively (a, r)-geometric graph is
either a tree or unicyclic graph with the cycle having odd size; if G is a connected unicyclic
graph and not a cycle, then G is additively (a, r)-geometric if and only if either a is even
or a is odd and r is even; connected unicyclic graphs are not additively (a, r)∗-geometric;
if a disconnected graph is additively (a, r)-geometric, then each component is a tree or a
unicyclic graph with an odd cycle; and for all even a at least 4, every disconnected graph

the electronic journal of combinatorics (2023), #DS6 375

for which every component is a tree or unicyclic with an odd cycle has an additively
(a, r)-geometric labeling.
Vijayakumar [3382] calls a graph G (not necessarily finite) arithmetic if its vertices
can be assigned distinct natural numbers such that the value of the edges obtained as
the sum of the endpoints of each edge is an arithmetic progression. He proves [3381] and
[3382] that a graph is arithmetic if and only if it is (a, r)-geometric for some a and r.

7.15 Strongly Multiplicative Graphs

Beineke and Hegde [528] call a graph with p vertices strongly multiplicative if the vertices
of G can be labeled with distinct integers 1, 2, . . . , p such that the labels induced on the
edges by the product of the end vertices are distinct. They prove the following graphs
are strongly multiplicative: trees; cycles; wheels; Kn if and only if n 6 5; Kr,r if and only
if r 6 4; and Pm × Pn . They then consider the maximum number of edges a strongly
multiplicative graph on n vertices can have. Denoting this number by λ(n), they show:
λ(4r) 6 6r2 ; λ(4r + 1) 6 6r2 + 4r; λ(4r + 2) 6 6r2 + 6r + 1; and λ(4r + 3) 6 6r2 + 10r + 3.
Adiga, Ramaswamy, and Somashekara [58] give the bound λ(n) 6 n(n + 1)/2 + n − 2 −
b(n + 2)/4c − ni=2 i/p(i) where p(i) is the smallest prime dividing i. For large values
P
of n this is a better upper bound for λ(n) than the one given by Beineke and Hegde. It
remains an open problem to find a nontrivial lower bound for λ(n).
Seoud and Zid [2804] prove the following graphs are strongly multiplicative: wheels;
rKn for all r and n at most 5; rKn for r > 2 and n = 6 or 7; rKn for r > 3 and n = 8 or 9;
K4,r for all r; and the corona of Pn and Km for all n and 2 6 m 6 8. In [2782] Seoud and
Mahran [2782] give some necessary conditions for a graph to be strongly multiplicative.
In Kanani and Chhaya [1575] and [1576] prove the following graphs are strongly multi-
plicative: the total graph, splitting graph, and shadow graph of paths; triangular snakes;
splitting graphs of stars and bistars, the degree splitting graph of the bistars Bn,n , and
2
restricted square graph Bm,n . In [1579] and [1580] Kanani and Chhaya prove the following
graphs are strongly multiplicative: helms, flowers, fans, friendship graphs, bistars, gears,
double triangular snakes, double fans, double wheels, snakes, double alternate quadrilat-
eral snakes, double quadrilateral snakes, braid graphs, and triangular ladders.
Germina and Ajitha [1071] (see also [37]) prove that K2 + Kt , quadrilateral snakes,
Petersen graphs, ladders, and unicyclic graphs are strongly multiplicative. Acharya, Ger-
(n)
mina, and Ajitha [37] have shown that Ck (see §2.2 for the definition) is strongly mul-
tiplicative and that every graph can be embedded as an induced subgraph of a strongly
multiplicative graph. Germina and Ajitha [1071] define a graph with q edges and a strongly
multiplicative labeling to be hyper strongly multiplicative if the induced edge labels are
{2, 3, . . . , q + 1}. They show that every hyper strongly multiplicative graph has exactly
one nontrivial component that is either a star or has a triangle and every graph can be
embedded as an induced subgraph of a hyper strongly multiplicative graph.
Vaidya, Dani, Vihol, and Kanani [3271] prove that the arbitrary supersubdivisions of
tree, Kmn , Pn × Pm , Cn Pm , and Cnm are strongly multiplicative. Vaidya and Kanani
[3277] prove that the following graphs are strongly multiplicative: a cycle with one chord;
a cycle with twin chords (that is, two chords that share an endpoint and with opposite

the electronic journal of combinatorics (2023), #DS6 376

endpoints that join two consecutive vertices of the cycle; the cycle Cn with three chords
that form a triangle and whose edges are the edges of two 3-cycles and a n − 3-cycle.
duplication of an vertex in cycle (see §2.7 for the definition); and the graphs obtained
from Cn by identifying of two vertices vi and vj where d(vi , vj ) > 3. In [3280] the same
authors prove that the graph obtained by an arbitrary supersubdivision of path, a star,
a cycle, and a tadpole (that is, a cycle with a path appended to a vertex of the cycle.
Krawec [1732] calls a graph G on n edges modular multiplicative if the vertices of G
can be labeled with distinct integers 0, 1, . . . , n − 1 (with one exception if G is a tree)
such that the labels induced on the edges by the product of the end vertices modulo n
are distinct. He proves that every graph can be embedded as an induced subgraph of a
modular multiplicative graph on prime number of edges. He also shows that if G is a
modular multiplicative graph on prime number of edges p then for every integer k > 2
there exist modular multiplicative graphs on pk and kp edges that contain G as a subgraph.
In the same paper, Krawec also calls a graph G on n edges k-modular multiplicative if
the vertices of G can be labeled with distinct integers 0, 1, . . . , n + k − 1 such that the
labels induced on the edges by the product of the end vertices modulo n + k are distinct.
He proves that every graph is k-modular multiplicative for some k and also shows that
if p = 2n + 1 is prime then the path on n edges is (n + 1)-modular multiplicative. He
also shows that if p = 2n + 1 is prime then the cycle on n edges is (n + 1)-modular
multiplicative if there does not exist α ∈ {2, 3, . . . , n} such that α2 + α − 1 ≡ 0 mod p.
He concludes with four open problems. In [1733] Krawec shows that every graph is a
subgraph of a modular multiplicative graph. He also defines k-modular multiplicative
graphs and proves that certain families of paths and cycles admit such a labeling.
In [2261] Nasir, Idrees, Sadiq, Farooq, Kanwal, and Imran show that the join of K1
and a triangular ladder T Ln (n > 3), umbrella graphs, and generalized Petersen graphs
GP (n, k) for (n 6 3) and 1 6 k 6 n/2, double combs, and sunflower planar graphs
(obtained by appending one edge to each vertex of the rim of a wheel) admit strongly
multiplicative labelings.

7.16 Line-graceful Labelings

Gnanajothi [1104] has defined a concept similar to edge-graceful. She calls a graph with
n vertices line-graceful if it is possible to label its edges with 0, 1, 2, . . . , n such that when
each vertex is assigned the sum modulo n of all the edge labels incident with that vertex the
resulting vertex labels are 0, 1, . . . , n − 1. A necessary condition for the line-gracefulness
of a graph is that its order is not congruent to 2 (mod 4). Among line-graceful graphs are
(see [pp. 132–181][1104]) Pn if and only if n 6≡ 2 (mod 4); Cn if and only if n 6≡ 2 (mod 4);
K1,n if and only if n 6≡ 1 (mod 4); Pn K1 (combs) if and only if n is even; (Pn K1 ) K1
if and only if n 6≡ 2 (mod 4); (in general, if G has order n, G H is the graph obtained
by taking one copy of G and n copies of H and joining the ith vertex of G with an edge
to every vertex in the ith copy of H); mCn when mn is odd; Cn K1 (crowns) if and
only if n is even; mC4 for all m; complete n-ary trees when n is even; K1,n ∪ K1,n if and
only if n is odd; odd cycles with a chord; even cycles with a tail; even cycles with a tail
of length 1 and a chord; graphs consisting of two triangles having a common vertex and

the electronic journal of combinatorics (2023), #DS6 377

tails of equal length attached to a vertex other than the common one; the complete n-ary
tree when n is even; trees for which exactly one vertex has even degree. She conjectures
that all trees with p 6≡ 2 (mod 4) vertices are line-graceful and proved this conjecture for
p 6 9.
Gnanajothi [1104] has investigated the line-gracefulness of several graphs obtained
from stars. In particular, the graph obtained from K1,4 by subdividing one spoke to form
a path of even order (counting the center of the star) is line-graceful; the graph obtained
from a star by inserting one vertex in a single spoke is line-graceful if and only if the star
has p 6≡ 2 (mod 4) vertices; the graph obtained from K1,n by replacing each spoke with
a path of length m (counting the center vertex) is line-graceful in the following cases:
n = 2; n = 3 and m 6≡ 3 (mod 4); and m is even and mn + 1 ≡ 0 (mod 4).
Gnanajothi studied graphs obtained by joining disjoint graphs G and H with an
edge. She proved such graphs are line-graceful in the following circumstances: G = H;
G = Pn , H = Pm and m + n 6≡ 0 (mod 4); and G = Pn K1 , H = Pm K1 and m + n 6≡ 0
(mod 4).
In [3284] and [3285] Vaidya and Kothari proved following graphs are line graceful: fans
Fn for n 6≡ 1 (mod 4); Wn for n 6≡ 1 (mod 4); bistars Bn,n if and only if for n ≡ 1, 3 (mod
4); helms Hn for all n; S 0 (Pn ) for n ≡ 0, 2 (mod 4); D2 (Pn ) for n ≡ 0, 2 (mod 4); T (Pn ),
M (Pn ), alternate triangular snakes, and graphs obtained by duplication of each edge of
Pn by a vertex are line graceful graphs.

7.17 k-sequential Labelings

In 1981 Bange, Barkauskas, and Slater [419] defined a k-sequential labeling f of a graph
G(V, E) as one for which f is a bijection from V ∪ E to {k, k + 1, . . . , |V ∪ E| + k − 1} such
that for each edge xy in E, f (xy) = |f (x) − f (y)|. This generalized the notion of simply
sequential where k = 1 introduced by Slater. Bange, Barkauskas, and Slater showed that
cycles are 1-sequential and if G is 1-sequential, then G + K1 is graceful. Hegde and Shetty
[1225] have shown that every Tp -tree (see §4.4 for the definition) is 1-sequential. In [3000],
Slater proved: Kn is 1-sequential if and only if n 6 3; for n > 2, Kn is not k-sequential
for any k > 2; and K1,n is k-sequential if and only if k divides n. Acharya and Hegde
[42] proved: if G is k-sequential, then k is at most the independence number of G; P2n
is n-sequential for all n and P2n+1 is both n-sequential and (n + 1)-sequential for all n;
Km,n is k-sequential for k = 1, m, and n; Km,n,1 is 1-sequential; and the join of any
caterpillar and Kt is 1-sequential. Acharya [28] showed that if G(E, V ) is an odd graph
with |E| + |V | ≡ 1 or 2 (mod 4) when k is odd or |E| + |V | ≡ 2 or 3 (mod 4) when k is
even, then G is not k-sequential. Acharya also observed that as a consequence of results
of Bermond, Kotzig, and Turgeon [547] we have: mK4 is not k-sequential for any k when
m is odd and mK2 is not k-sequential for any odd k when m ≡ 2 or 3 (mod 4) or for
any even k when m ≡ 1 or 2 (mod 4). He further noted that Km,n is not k-sequential
when k is even and m and n are odd, whereas Km,k is k-sequential for all k. Acharya
points out that the following result of Slater’s [3001] for k = 1 linking k-graceful graphs
and k-sequential graphs holds in general: A graph is k-sequential if and only if G + v
has a k-graceful labeling f with f (v) = 0. Slater [3000] also proved that a k-sequential

the electronic journal of combinatorics (2023), #DS6 378

graph with p vertices and q > 0 edges must satisfy k 6 p − 1. Hegde [1211] proved
that every graph can be embedded as an induced subgraph of a simply sequential graph.
In [28] Acharya conjectured that if G is a connected k-sequential graph of order p with
k > bp/2c, then k = p − 1 and G = K1,p−1 and that, except for K1,p−1 , every tree in which
all vertices are odd is k-sequential for all odd positive integers k 6 p/2. In [1211] Hegde
gave counterexamples for both of these conjectures.
In [1223] Hegde and Miller prove the following: for n > 1, Kn is k-sequentially additive
if and only if (n, k) = (2, 1), (3, 1) or (3,2); K1,n is k-sequentially additive if and only if
k divides n; caterpillars with bipartition sets of sizes m and n are k-sequentially additive
for k = m and k = n; and if an odd-degree (p, q)-graph is k-sequentially additive, then
(p+q)(2k +p+q −1) ≡ 0 (mod 4). As corollaries of the last result they observe that when
m and n are odd and k is even Km,n is not k-sequentially additive and if an odd-degree
tree is k-sequentially additive then k is odd.
In [2779] Seoud and Jaber proved the following graphs are 1-sequentially additive:
graphs obtained by joining the centers of two identical stars with an edge; Sn ∪ Sm if and
only if nm is even; Cn Km ; Pn Km ; kP3 ; graphs obtained by joining the centers of k
copies of P3 to each vertex in Km ; and trees obtained from K by replacing each edge by a
path of length 2 when n ≡ 0, 1 (mod 4). They also determined all 1-sequentially additive
graphs of order 6.

7.18 IC-colorings
For a subgraph H of a graph G with vertex set V and a coloring f from V to the natural
numbers define fs (H) = Σf (v) over all v ∈ H. The coloring f is called an IC-coloring if
for any integer k between 1 and fs (G) there is a connected subgraph H of G such that
fs (H) = k. The IC-index of a graph G, M (G), is max{fs | fs is an IC-coloring of G}.
Salehi, Lee, and Khatirinejad [2683] obtained the following: M (Kn ) = 2n − 1; for n >
2, M (K1,n ) = 2n + 2; if ∆ is the maximum degree of a connected graph G, then M (G) >
2∆ + 2; if ST (n; 3n ) is the graph obtained by identifying the end points of n paths of
length 3, then ST (n; 3n ) is at least 3n + 3 (they conjecture that equality holds for n > 4);
for n > 2, M (K2,n ) = 3 · 2n + 1; M (Pn ) > (2 + bn/2c)(n − bn/2c) + bn/2c − 1; for
m, n > 2, the IC-index of the double star DS(m, n) is at least (2m−1 + 1)(2n−1 + 1) (they
conjecture that equality holds); for n > 3, n(n + 1)/2 6 M (Cn ) 6 n(n − 1) + 1; and for
n > 3, 2n + 2 6 M (Wn ) 6 2n + n(n − 1) + 1. They pose the following open problems:
find the IC-index of the graph obtained by identifying the endpoints of n paths of length
b; find the IC-index of the graph obtained by identifying the endpoints of n paths; and
find the IC-index of Km,n . Shiue and Fu [2936] completed the partial results by Penrice
[2379] Salehi, Lee, and Khatirinejad [2683] by proving M (Km,n ) = 3 · 2m+n−2 − 2m−2 + 2
for any 2 6 m 6 n.

7.19 Minimal k-rankings

A k-ranking of a graph is a labeling of the vertices with the integers 1 to k inclusively
such that any path between vertices of the same label contains a vertex of greater label.

the electronic journal of combinatorics (2023), #DS6 379

The rank number of a graph G, χr (G), is the smallest possible number of labels in a
ranking. A k-ranking is minimal if no label can be replaced by a smaller label and
still be a k-ranking. The concept of the rank number arose in the study of the design
of very large scale integration (VLSI) layouts and parallel processing (see [788], [1922]
and [2754]). Ghoshal, Laskar, and Pillone [1099] were the first to investigate minimal
k-rankings from a mathematical perspective. Laskar and Pillone [1800] proved that the
decision problem corresponding to minimal k-rankings is NP-complete. It is HP-hard
even for bipartite graphs [803]. Bodlaender, Deogun, Jansen, Kloks, Kratsch, Müller,
Tuza [582] proved that the rank number of Pn is χr (Pn ) = blog2 (n)c + 1 and satisfies
the recursion χr (Pn ) = 1 + χr (Pd(n−1)/2e ) for n > 1. The following results are given in
[803]: χr (Sn ) = 2; χr (Cn ) = b log2 (n − 1)c + 2; χr (Wn ) = b log2 (n − 3)c + 3(n > 3);
χr (Kn ) = n; the complete t-partite graph with n vertices has ranking number n + 1 - the
cardinality of the largest partite set; and a split graph with n vertices has ranking number
n + 1 - the cardinality of the largest independent set (a split graph is a graph in which
the vertices can be partitioned into a clique and an independent set.) Wang proved that
for any graphs G and H χr (G + H) = min{|V (G)| + χr (H), |V (H) + χr (G)}.
In 2009 Novotny, Ortiz, and Narayan [2305] determined the rank number of Pn2 from
the recursion χr (Pn2 ) = 2+χr (P (d(n−2)/2e ) for n > 2. They posed the problem of determin-
ing χr (Pm × Pn ) and χ(Pnk ). In 2009 [170] and [169] Alpert determined the rank numbers
of Pnk , Cnk , P2 × Cn , Km × Pn , P3 × Pn , Möbius ladders and found bounds for rank num-
bers of general grid graphs Pm × Pn . About the same time as Alpert and independently,
Chang, Kuo, and Lin [667] determined the rank numbers of Pnk , Cnk , P2 × Pn , P2 × Cn .
Chang et al. also determined the rank numbers of caterpillars and proved that for any
graphs G and H χr (G[H]) = χr (H) + |V (H)|(χr (G) − 1).
In 2010 Jacob, Narayan, Sergel, Richter, and Tran [1350] investigated k-rankings of
paths and cycles with pendent paths of length 1 or 2. Among their results are: for any
caterpillar G χr (Pn ) 6 χr (G) 6 χr (Pn ) + 1 and both cases occur; if 2m 6 n 6 2m+1 then
for any graph G obtained by appending edges to an n-cycle we have m+2 6 χr (G) 6 m+3
and both cases occur; if G is a lobster with spine Pn then χr (Pn ) 6 χr (G) 6 χr (Pn ) + 2
and all three cases occur; if G a graph obtained from the cycle Cn by appending paths of
length 1 or 2 to any number of the vertices of the cycle then χr (Pn ) 6 χ(G) 6 χ(Pn ) + 2
and all three cases occur; and if G the graph obtained from the comb obtained from Pn by
appending one path of length m to each vertex of Pn then χr (G) = χr (Pn ) + χr (Pm+1 ) − 1.
Sergel, Richter, Tran, Curran, Jacob, and Narayan [2806] investigated the rank number
of a cycle Cn with pendent edges, which they denote by CCn , and call a caterpillar cycle.
They proved that χ(CCn ) = χr (Cn )) or χ(CCn ) = χr (Cn ))+1 and showed that both cases
occur. A comb tree, denoted by C(n, m), is a tree that has a path Pn such that every vertex
of Pn is adjacent to an end vertex of a path Pm . In the comb tree C(n, m) (n > 3) there are
2 pendent paths Pm+2 and n − 2 paths Pm+1 . They proved χr (C(n, m)) = χr (Pm+1 ) − 1.
They define a circular lobster as a graph where each vertex is either on a cycle Cn or
at most distance two from a vertex on Cn . They proved that if G is a lobster with
longest path Pn , then χr (Pn ) 6 χr (G) 6 χr (Pn ) + 2 and determined the conditions under
which each true case occurs. If G is circular lobster with cycle Cn , they showed that

the electronic journal of combinatorics (2023), #DS6 380

χr (Cn ) 6 χr (G) 6 χr (Cn ) + 2 and determined the conditions under which each true case
occurs. An icicle graph In (n > 3) has three pendent paths P2 and is comprised of a path
Pn with vertices v1 , v2 , . . . , vn where a path Pi−1 is appended to vertex vi . They determine
the rank number for icicle graphs.
Richter, Leven, Tran, Ek, Jacob, and Narayan [2623] define a reduction of a graph
G as a graph G∗S such that V (G∗S ) = V (G) \ S and, for vertices u and v, uv is an edge
of G∗S if and only if there exists a u − v path in G with all internal vertices belonging
to S. A vertex separating set of a connected graph G is a set of vertices whose removal
disconnects G. They define a bent ladder BLn (a, b) as the union of ladders La and Lb
(where Ln = Pn ×P2 ) that are joined at a right angle with a single L2 so that n = a+b+2.
A staircase ladder SLn is a graph with n − 1 subgraphs G1 , G2 , . . . , Gn−1 each of which
is isomorphic to C4 . (They are ladders with a maximum number of bends.) Richter et
al. [2623] prove: χr (BLn (a, b)) = χr (Ln ) − 1 if n = 2k − 1 and a ≡ 2 or 3 (mod 4) and is
equal to χr (Ln ) otherwise; χr (SLn ) = χr (Ln+1 ) if n = 2k + 2k−1 − 2 for some k > 3 and is
equal to χr (Ln ) otherwise; and for any ladder Ln with multiple bends, the rank number
is either χr (Ln ) or χr (Ln ) + 1).
The arank number of a graph G is the maximum value of k such that G has a minimal
k-ranking. Eyabi, Jacob, Laskar, Narayan, and Pillone [912] determine the arank number
of Kn × Kn , and investigated the arank number of Km × Kn .

7.20 Set Graceful and Set Sequential Graphs

The notions of set graceful and set sequential graphs were introduced by Acharaya in
1983 [29]. A graph is called set graceful if there is an assignment of nonempty subsets of
a finite set to the vertices and edges of the graph such that the value given to each edge is
the symmetric difference of the sets assigned to the endpoints of the edge, the assignment
of sets to the vertices is injective, and the assignment to the edges is bijective. A graph
is called set sequential if there is an assignment of nonempty subsets of a finite set to the
vertices and edges of the graph such that the value given to each edge is the symmetric
difference of the sets assigned to the endpoints of the edge and the the assignment of sets
to the vertices and the edges is bijective. The following has been shown: Pn (n > 3) is not
set graceful [1215]; Cn is not set sequential [43]; Cn is set graceful if and only if n = 2m − 1
[1217] and [29]; Kn is set graceful if and only if n = 2, 3 or 6 [2184]; Kn (n > 2) is set
sequential if and only if n = 2 or 5 [1217]; Ka,b is set sequential if and only if (a + 1)(b + 1)
is a positive power of 2 [1217]; a necessary condition for Ka,b,c to be set sequential is that
a, b, and c cannot have the same parity [1215]; K1,b,c is not set sequential when b and
c even [1217]; K2,b,c is not set sequential when b and c are odd [1215]; no theta graph
is set graceful [1215]; the complete nontrivial n-ary tree is set sequential if and only if
n + 1 is a power of 2 and the number of levels is 1 [1215]; a tree is set sequential if
and only if it is set graceful [1215]; the nontrivial plane triangular grid graph Gn is set
graceful if and only if n = 2 [1217]; every graph can be embedded as an induced subgraph
of a connected set sequential graph [1215]; every graph can be embedded as an induced
subgraph of a connected set graceful graph [1215], every planar graph can be embedded as
an induced subgraph of a set sequential planar graph [1217]; every tree can be embedded

the electronic journal of combinatorics (2023), #DS6 381

as an induced subgraph of a set sequential tree [1217]; and every tree can be embedded
as an induced subgraph of a set graceful tree [1217]. Hegde conjectures [1217] that no
path is set sequential. Hegde’s conjecture [1218] that every complete bipartite graph that
has a set graceful labeling is a star was proved by Vijayakumar [3383]. Shahida and
Sunitha [2849] prove that the concept of set-gracefulness is equivalent to topologically
set-gracefulness in trees and almost all finite trees are not set-graceful. Using this they
characterize topologically set-graceful stars and topologically set-graceful paths. In [34]
Acharya and Germina survey results on set-valuations of graphs and give open problems
and conjectures.
Germina, Kumar, and Princy [1070] prove: if a (p, q)-graph is set-sequential with
respect to a set with n elements, then the maximum degree of any vertex is 2n−1 − 1; if G
is set-sequential with respect to a set with n elements other than K5 , then for every edge
uv with d(u) = d(v) one has d(u) + d(v) < 2n−1 − 1; K1,p is set-sequential if and only if p
has the form 2n−1 − 1 for some n > 2; binary trees are not set-sequential; hypercubes Qn
are not set-sequential for n > 1; wheels are not set-sequential; and uniform binary trees
with an extra edge appended at the root are set-graceful and set graceful.
Vijayakumar [3383] and Gyri, Balister, and Schelp [328] proved that if a complete
bipartite graph G has a set-graceful labeling, then it is a star. Abhishek [8] described a
method for constructing a set-graceful bipartite graph of arbitrarily large order and size
beginning with a set-graceful bipartite graph. Acharya, Germina, Princy, and Rao [39]
proved that K1,m,n is set-graceful if and only if m = 2s − 1 and n = 2t − 1 and almost all
graphs are not set-graceful. In [9] Abhishek surveys results on set-valued graphs. Many
open problems and conjectures are included.
Acharya [29] has shown: a connected set graceful graph with q edges and q + 1 vertices
is a tree of order p = 2m and for every positive integer m such a tree exists; if G is a
connected set sequential graph, then G + K1 is set graceful; and if a graph with p vertices
and q edges is set sequential, then p + q = 2m − 1. Acharya, Germina, Princy, and Rao
[39] proved: if G is set graceful, then G ∪ Kt is set sequential for some t; if G is a set
graceful graph with n edges and n + 1 vertices, then G + Kt is set graceful if and only if
m has the form 2t − 1; Pn + Km is set graceful if n = 1 or 2 and m has the form 2t − 1;
K1,m,n is set graceful if and only if m has the form 2t − 1 and n has the form 2s − 1;
P4 + Km is not set graceful when m has the form 2t − 1 (t > 1); K3,5 is not set graceful;
if G is set graceful, then graph obtained from G by adding for each vertex v in G a new
vertex v 0 that is adjacent to every vertex adjacent to v is not set graceful; and K3,5 is not
set graceful.
Acharya, Germina, Abhishek, and Slater [36] prove Cm is set-graceful if and only if
m = (4n − 1)/3; mK2 is set-sequential if and only if m = (4n − 1)/3; and, for r + s = 2n−1
the bistar B(r, s) is set-sequential if and only if r and s are odd. They also prove that
connected planar graphs with an even number of faces, regular polyhedrons, and cacti
containing an odd number of cycles are not set-sequential.
Abhishek [8] proved that if G is a set-sequential bipartite graph and H is 2k-set-
sequential, then 4k G ∪ H is set-sequential. As a corollary, he gets mP3 is set-sequential if
and only if m = (16n − 1)/5. Abhishek and Agustine [11] characterized the set-sequential

the electronic journal of combinatorics (2023), #DS6 382

caterpillars of diameter four and give a necessary condition for a graph to be set-sequential.
Abhishek [10] characterized the set-sequential caterpillars of diameter five. Golowich and
Kim [1117] showed that all caterpillars T of diameter k such that k 6 18 or |V (T )| > 2k−1
are set-sequential, where T has only odd-degree vertices and |V (T )| = 2n−1 for some n.
They also provided a new method of recursively constructing set-sequential trees.
In [2130] Mehra and Puneet introduce a topological integer additive set-labeling of
signed graphs as follows. Let S = (V, E, s) be a signed graph with corresponding graph
G = (V, E) and the signature function s. Here, G is an integer additive set-labeled graph
having an injective function f : V (G) → P (X) − {∅} that produces another injective
function gf : E(G) → P (X) − {∅, {0}} defined by gf (uv) = f (u) + f (v) for every edge uv,
where X is the subset of non-negative integers, P (X) is its power set, and the signature
function defined as s : E(G) → {+, −} is such that s(uv) = −1|f (u)+f (v)| for all edges uv.
If f (V (G)) ∪ {∅} forms a topology on X then the signed graph S is called a topological
integer additive set-labeled signed graph (T-IASL). They proved the following graphs have
T-IASL labelings: paths, stars, double stars, tadpoles, and graphs obtained by identifying
an end of a path with the center of a star.

7.21 Vertex Equitable Graphs

Given a graph G with q edges and a labeling f from the vertices of G to the set
{0, 1, 2, . . . , dq/2e} define a labeling f ∗ on the edges by f ∗ (uv) = f (u) + f (v). If for
all i and j and each vertex the number of vertices labeled with i and the number of ver-
tices labeled with j differ by at most one and the edge labels induced by f ∗ are 1, 2, . . . , q,
Lourdusamy and Seenivasan [2016] call a f a vertex equitable labeling of G. They proved
the following graphs are vertex equitable: paths, bistars, combs, n-cycles for n ≡ 0 or
3 (mod 4), K2,n , C3 t for t > 2, quadrilateral snakes, K2 + mK1 , K1,n ∪ K1,n+k if and
only if 1 6 k 6 3, ladders, arbitrary super divisions of paths, and n-cycles with n ≡ 0
or 3 (mod 4). They further proved that K1,n for n > 4, Eulerian graphs with n edges
where n ≡ 1 or 2 (mod 4), wheels, Kn for n > 3, triangular cacti with q ≡ 0 or 6 or 9
(mod 12), and graphs with p vertices and q edges, where q is even and p < dq/2e + 2
are not vertex equitable. Lourdusamy and Patrick [2010] prove that triangular ladders
T Ln , Ln mK1 , Qn K1 , T Ln K1 , and alternate triangular snakes A(Tn ) are vertex
equitable graphs. In [52] Acharya, Jain, and Kansal introduced vertex equitable labelings
of signed graphs and studied vertex equitable behavior of signed paths, signed stars, and
signed complete bipartite graphs K2,n .
Jeyanthi and Maheswari [1463] proved that the following graphs have vertex equitable
labelings: the square of the bistar Bn,n ; the splitting graph of the bistar Bn,n ; C4 -snakes;
connected graphs for in which each block is a cycle of order divisible by 4 (they need
not be the same order) and whose block-cut point graph is a path; Cm Pn ; tadpoles;
the one-point union of two cycles; and the graph obtained by starting friendship graphs,
(2) (2) (2) (2)
Cn1 , Cn2 , . . . , Cnk where each ni ≡ 0 (mod 4) and joining the center of Cni to the center
(2)
of Ci+1 with an edge for i = 1, 2, . . . , k − 1. In [1454] Jeyanthi and Maheswari prove that
Tp trees, bistars B(n, n + 1), Cn Km , Pn 2 , tadpoles, certain classes of caterpillars, and

the electronic journal of combinatorics (2023), #DS6 383

T Kn where T is a Tp tree with an even number of vertices are vertex equitable. Jeyanthi
and Maheswari [1457] gave vertex equitable labelings for graphs constructed from Tp trees
by appending paths or cycles.
In [1453] Jeyanthi and Maheswari show a number of families of graphs have vertex eq-
uitable labelings. Their results include: armed crowns Cm Pn , shadow graphs D2 (K1,n );
the graph Cm ∗ Cn obtained by identifying a single vertex of a cycle graph Cm with a
single vertex of a cycle graph Cn if and only if m + n ≡ 0, 3 (mod 4); for n ≡ 0 (mod 4)
the graph obtained from m copies of Cn ∗ Cn and Pm by joining each vertex of Pm with
the cut vertex in one copy of Cn ∗ Cn ; and graphs obtained by duplicating an arbitrary
vertex and an arbitrary edge of a cycle; the total graph of Pn ; the splitting graph of Pn ;
and the fusion of two edges of Cn .
For a graph H with vertices v1 , v2 , . . . , vn and n copies of a graph G, H ob G is a
graph obtained by identifying a vertex ui of the ith copy of G with a vertex vi of H for
1 6 i 6 n. The graph H oe G is a graph obtained by joining a vertex ui of the ith copy of
G with a vertex vi of H by an edge for 1 6 i 6 n. Jeyanthi, Maheswari, and Laksmi prove
[1479] that the graphs Lm ô nC4 , Lm õ nC4 , Cm õ nC4 , and Pm õ nC4 are vertex equitable
graphs. The graph S ∗ (G) is obtained from a graph G by replacing every edge e of G with
K2,m (m > 2) with the endpoints of e merged with the two vertices of the 2-vertices part
of K2,m after removing the edge e from G. Jeyanthi, Maheswari, and Vijaya Laksmi [1475]
prove the graphs S ∗ (Pn · K1 ), S ∗ (B(n, n)), S ∗ (Pn × P2 ), and S ∗ (Qn ) of the quadrilateral
snake are vertex equitable.
In [1461] Jeyanthi and Maheswari proved the double alternate triangular snake DA(Tn )
obtained from a path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to two new
vertices vi and wi is vertex equitable; the double alternate quadrilateral snake DA(Qn )
obtained from a path u1 , u2 , . . . , un by joining ui and ui+1 (alternatively) to two new
vertices vi , xi and wi , yi respectively and then joining vi , wi and xi , yi is vertex equitable;
and N Q(m) the nth quadrilateral snake obtained from the path u1 , u2 , . . . , um by joining
ui , ui+1 with 2n new vertices vji and wji , 1 6 i 6 m − 1, 1 6 j 6 n is vertex equitable.
Jeyanthi and Maheswari [1473] prove DA(Tn ) K1 , DA(Tn ) 2K1 , DA(Tn ), DA(Qn )
K1 , DA(Qn ) 2K1 , and DA(Qn ) are vertex equitable.
Jeyanthi, Maheswari, and Vijayalaksmi [1474] proved the following graphs are ver-
tex equitable: jewel graphs Jn with vertex set {u, v, x, y, ui : 1 6 i 6 n} and edge
set {ux, uy, xy, xv, yv, uui , vui : 1 6 i 6 n}; jelly fish graphs (JF )n with vertex set
{u, v, ui , vj : 1 6 i 6 n, 1 6 j 6 n − 2} and edge set {uui : 1 6 i 6 n} ∪ {vvj : 1 6
j 6 n − 2} ∪ {un−1 un , vun , vun−1 }; lobsters constructed from the path a1 , a2 , . . . , an with
verticies ai1 and ai2 adjacent to ai for 1 6 i 6 n and pendent vertices a1ij , a2ij , . . . , akij
joining aij for 1 6 i 6 n and j = 1, 2; Ln Km ; and the graph obtained from ladder a
Ln and 2n copies of K1,m by identifying a non-central vertex of ith copy of K1,m with ith
vertex of Ln .
Jeyanthi, Mahewari, and Vijaya Laksmi [1470] prove the following graphs are vertex
equitable: graphs obtained by joining a vertex of a cycle to a degree 2 vertex of a comb
(Pn K1 ) with an edge; path unions of quadrilateral snakes; cycle unions of n copies of
mC4 -snakes where n ≡ 0, 3 mod 4; the graphs obtained from a path u1 , u2 , . . . , um by

the electronic journal of combinatorics (2023), #DS6 384

joining the end points of each edge ui ui+1 to 2n isolated vertices vji , wji for 1 6 m − 1, 1 6
j 6 n, where n is even (the nth quadrilateral snake).
Jeyanthi, Maheswari, and Vijaya Laksmi [1470] prove that subdivisions of double tri-
angular snakes S(D(T n)), subdivisions of double quadrilateral snakes S(D(Qn )), subdi-
visions of double alternate triangular snakes S(DA(Tn )), subdivisions of double alternate
quadrilateral snakes S(DA(Qn )), DA(Qm ) nK1 , and DA(Tm ) nK1 admit vertex eq-
uitable labelings.
The super subdivision graph S ∗ (G) of a graph G is the graph obtained from G by
replacing every edge uv of G by K2,m (m may vary for each edge) and identifying u and
v with the two vertices in K2,m that form the partite set with exactly two members.
Jeyanthi, Maheswari, and Vijayalaksmi [1475] prove that super subdivision graphs of
Pn K1 , bistars B(n, n), Pn × P2 , and quadrilateral snakes are vertex equitable.
For a graph H with vertices v1 , v2 , . . . , vn and n copies of a graph G, H ob G is a
graph obtained by identifying a vertex ui of the ith copy of G with a vertex vi of H for
1 6 i 6 n. The graph H oe G is a graph obtained by joining a vertex ui of the ith copy
of G with a vertex vi of H by an edge for 1 6 i 6 n. Jeyanthi, Maheswari, and Laksmi
[1479] prove that the graphs Lm ô nC4 , Lm õ nC4 , Cm õ nC4 and Pm õ nC4 are vertex
equitable graphs.
For a graph G with p vertices and q edges and A = {1, 3, . . . , q} if q is odd or A =
{1, 3, . . . , q + 1} if q is even, Jeyanthi, Maheswari and Vijaya Laksmi [1469] say a vertex
labeling f from V (G) to A is an odd vertex equitable even labeling if the induced edge
labeling f ∗ defined by f ∗ (uv) = f (u) + f (v) for all edges uv has the property that for all u
and v in A the number of vertices labeled with u and the number of vertices labeled with
v differ by at most 1 and the induced edge labels are 2, 4, . . . , 2q. A graph that admits
odd vertex equitable even labeling is called an odd vertex equitable even graph. They
show that the following graphs have odd vertex equitable even lableings: paths, graphs
obtained by identifying an endpoint of Pm with each vertex of Pn , K1,n if and only if
n = 1 or 2, K1,n ∪ K1,n−2 (n > 3), K2,n , Tp -trees, Cn when n ≡ 0 or 1 mod 4, quadrilateral
snakes, ladders Ln , Ln K1 , and arbitrary super subdivision of paths. They prove that
if every edge of a graph G is an edge of a triangle, then G is not an odd vertex equitable
even graph. As a corollary of this they get that the following are not odd vertex equitable
even graphs: Kn (n > 3), wheels, triangular snakes, double triangular snakes, triangular
ladders, flower graphs, fans Pn K1 (n > 2), double fans Pn K2 , (n > 2), friendship
graphs Cn3 , windmills Km n 2
(m > 3), K2 + mK1 , Bn,n , total graphs T (Pn ), and composition
graphs Pn [P2 ]. They also show that if G is a (p, q) graph with p 6 dq/2e + 1, then G is
not an odd vertex equitable even graph. Jeyanthi and Maheswari [1464] proved that the
subdivision of double triangular snakes and the subdivision of double quadrilateral snakes
are odd vertex equitable even graphs.
Lourdusamy and Patrick [2009] proved that Pn mK1 , the quadrilateral snake at-
tached to each vertex of path Pn , the super splitting graph S ∗ (Pn K1 ), the super
splitting graphs of ladders and the bistars Bn,n , Bn,n 2
, and the splitting S 0 (Bn,n ) ad-
mit even vertex equitable even labelings. Maheswari and Jeyanthi [2058] have shown
the following graphs admit odd vertex equitable even labelings: duplicate graphs of lad-

the electronic journal of combinatorics (2023), #DS6 385

ders; duplicate graphs of the subdivision of ladders; duplicate graphs of a quadrilater-
als; and P3 × Pn for odd n > 2. Lourdusamy, Wency, and Patrick [2024] prove that
S(D(Qn )), S(D(Tn )), DA(Qm ) nK1 , DA(Tm ) nK1 , S(DA(Qn )) and S(DA(Tn )) are an
even vertex equitable even graphs.
For graphs G1 and G2 that graph G1 ÔG2 is obtained from G1 and |V G1 )| copies of G2
by identifying one vertex of ith copy of G2 with ith vertex of G1 . Jeyanthi, Maheswari,
and Vijayalakshmi [1481] proved the following graphs have odd vertex equitable even
labelings: subdivision graphs of ladders, Lm ÔPn , Ln Km (m > 1), Cn if and only if
n ≡ 0 or 1 (mod 4), K1,n+k ∪ K1,n i if and only if k = 1, 2, and hLn ÔK1,m i.
Motivated by the concept of vertex equitable labeling first defined by Lourdusamy and
Seenivasan in [2016], Lourdusamy, Mary, and Patrick [2007] introduced the concept of even
vertex equitable even labeling as follows. Let G be a graph with p vertices and q edges
and A = {0, 2, 4, . . . , q + 1} if q is odd or A = {0, 2, 4, . . . , q} if q is even. A graph G is said
to be an even vertex equitable even labeling if there exists a vertex labeling f from V (G)
to A that induces an edge labeling f defined by f ∗ (uv) = f (u) + f (v) for all edges uv such
that for all a and b in A, |vf (a) − vf (b)| 6 1 and the induced edge labels are 2, 4, . . . , 2q,
where vf (a) is the number of vertices v with f (v) = a for a ∈ A. A graph that admits
even vertex equitable even labeling is called an even vertex equitable even graph. They
proved that paths, combs, complete bipartite graphs, cycles, K2 + mK1 , bistars, ladders,
(Pn × P2 ) K1 , and the subdivision graphs of ladders and bistars Bn,n admit an even
vertex equitable even labeling. In [2013] Lourdusamy and Patrick proved that Cm Pn ,
C4n and C4n+3 with a quadrilateral snake attached to each vertex of the cycle, the graphs
obtained by indentifying an edge of Cm and Cn , and the graphs obtained by duplicating
an arbitrary vertex and edge of a cycle admit an even vertex equitable even labeling.
Lourdusamy, Shobana Mary, and Patrick [2015] proved Pn2 , S(Pn K1 ), S 0 (Pn ), T (Pn ),
graphs obtained by duplication of an egde of a path, quadrilateral snakes, D(Qn ), A(Tn ),
and DA(Tn ) have even vertex equitable even labelings. Lourdusamy and Patrick [2009]
proved that Pn mK1 , the quadrilateral snake attached to each vertex of path Pn , the
super splitting graph S ∗ (Pn K1 ), the super splitting graphs of ladders and the bistars
2
Bn,n , Bn,n , and the splitting S 0 (Bn,n ) admit even vertex equitable even labelings.

7.22 Sequentially Additive Graphs

Bange, Barkauskas, and Slater [420] defined a k-sequentially additive labeling f of a graph
G(V, E) to be a bijection from V ∪ E to {k, . . . , k + |V ∪ E| − 1} such that for each
edge xy, f (xy) = f (x) + f (y). They proved: Kn is 1-sequentially additive if and only
if n 6 3; C3n+1 is not k-sequentially additive for k ≡ 0 or 2 (mod 3); C3n+2 is not k-
sequentially additive for k ≡ 1 or 2 (mod 3); Cn is 1-sequentially additive if and only if
n ≡ 0 or 1 (mod 3); and Pn is 1-sequentially additive. They conjecture that all trees are
1-sequentially additive. Hegde [1213] proved that K1,n is k-sequentially additive if and
only if k divides n.
Hajnal and Nagy [1171] investigated 1-sequentially additive labelings of 2-regular
graphs. They prove: kC3 is 1-sequentially additive for all k; kC4 is 1-sequentially ad-
ditive if and only if k ≡ 0 or 1 (mod 3); C6n ∪ C6n and C6n ∪ C6n ∪ C3 are 1-sequentially

the electronic journal of combinatorics (2023), #DS6 386

additive for all n; C12n and C12n ∪ C3 are 1-sequentially additive for all n. They conjecture
that every 2-regular simple graph on n vertices is 1-sequentially additive where n ≡ 0 or
1 (mod 3).
Acharya and Hegde [44] have generalized k-sequentially additive labelings by allowing
the image of the bijection to be {k, k + d, . . . , (k + |V ∪E| − 1)d}. They call such a labeling
additively (k, d)-sequential.

7.23 Difference Graphs

Analogous to a sum graph, Harary [1183] calls a graph a difference graph if there is
an bijection f from V to a set of positive integers S such that xy ∈ E if and only if
|f (x) − f (y)| ∈ S. Bloom, Hell, and Taylor [576] have shown that the following graphs
are difference graphs: trees, Cn , Kn , Kn,n , Kn,n−1 , pyramids, and n-prisms. Gervacio
[1075] proved that wheels Wn are difference graphs if and only if n = 3, 4, or 6. Sonntag
[3034] proved that cacti (that is, graphs in which every edge is contained in at most
one cycle) with girth at least 6 are difference graphs and he conjectures that all cacti
are difference graphs. Sugeng and Ryan [3089] provided difference labelings for cycles;
fans; cycles with chords; graphs obtained by the one-point union of Kn and Pm ; and
graphs made from any number of copies of a given graph G that has a difference labeling
by identifying one vertex the first with a vertex of the second, a different vertex of the
second with the third and so on. Vaithilingam [3334] proved that gears, ladders, fans, [3334] new
friendship graphs, helms, and wheels admit differnce labelings.
Hegde and Vasudeva [1238] call a simple digraph a mod difference digraph if there
is a positive integer m and a labeling L from the vertices to {1, 2, . . . , m} such that
for any vertices u and v, (u, v) is an edge if and only if there is a vertex w such that
L(v) − L(u) ≡ L(w) (mod m). They prove that the complete symmetric digraph and
unidirectional cycles and paths are mod difference digraphs.
In [2778] Seoud and Helmi provided a survey of all graphs of order at most 5 and
showed the following graphs are difference graphs: Kn , (n > 4) with two deleted edges
having no vertex in common; Kn , (n > 6) with three deleted edges having no vertex in
common; gear graphs Gn for n > 3; Pm × Pn (m, n > 2); triangular snakes; C4 -snakes;
dragons (that is, graphs formed by identifying the end vertex of a path and any vertex in
a cycle); graphs consisting of two cycles of the same order joined by an edge; and graphs
obtained by identifying the center of a star with a vertex of a cycle.

7.24 Square Sum Labelings and Square Difference Labelings

A bijective mapping f : V (G) to {0, 1, 2, . . . , |V (G)| − 1} is said to be a square sum
labeling if the induced function f ∗ from E(G) to the positive integers defined by f ∗ (xy) =
(f (x)2 +(f (y))2 is injective. A graph that has a square sum labeling is called a square sum
graph. A square differnce graph is defined the same way with f ∗ (xy) = (f (x)2 + (f (y))2
replaced with f ∗ (xy) = |(f (x)2 − (f (y))2 |. Maheswari and Srividya [2060] proved that
every cycle Cn (n > 6) with parallel P3 chords admit a vertex odd mean labeling, a vertex
even mean labeling, and a square sum labeling. Maheswari, Azhagarasi, and Samuvel

the electronic journal of combinatorics (2023), #DS6 387

[2055] proved cycles with at least 6 vertices with parallel P4 chords are vertex odd mean
graphs and vertex even mean graphs and they admit square sum labelings, and square
difference labelings. In [2059] they proved that the following graphs are square sum graphs:
cycles with parallel chords, graphs obtained by attaching an arbitrary number of pendant
edges at a vertex of degree 2 of a cycle with parallel chords, duplication of a vertex of
degree 2 of a cycle with parallel chords, crowns with parallel chords, chains of even cycles
with parallel chords, and graphs obtained from copies of Cn by joining a vertex from
each copy of Cn to a common vertex. Patel and Ghodasara [2359] proved that the graph
obtained by joining two copies of a specific graph by a path of arbitrary length admits a
square sum labeling. They gave some results about the square sum graphs of arbitrary
super subdivisions. Zhang, Naeem, Tariq, and Zhao [3585] investigated the square sum
labeling of generalized Petersen graphs and double generalized Petersen graphs. Shiama
[2887] proved that the total graph of paths and cycles, and the middle graphs of paths
and cycles, admit square sum labelings. Parameswari and Margret [2338] proved that [2338] new
the octopus graph and Vanessa graph admit square sum labelings. Kulli [1773] defined a [1773] new
semitotal-block graph Tb (G) of a graph G as the graph whose set of vertices is the union
of the set of vertices and blocks of G and in which two points are adjacent if and only
the corresponding vertices of G are adjacent or the corresponding blocks are incident.
Mirajkar and Sthavarmath [2154] proved the following graphs admit square sum and [2154] new
square difference labelings: Tb (Pn K1 ) (n > 3); Tb (Cn K1 ) (n > 3) except for n = 0
(mod 8); and Tb (Fn K1 ) (n > 4).
Ajitha, Arumugam, and Germina [161] prove the following graphs have square sum
(t)
labelings: trees; cycles; K2 + mK1 ; Kn if and only if n 6 5; Cn (the one-point union of
t copies of Cn ); grids Pm × Pn ; and Km,n if m 6 4. They also prove that every strongly
square sum graph except K1 , K2 , and K3 contains a triangle.
In [2886] Shiama proved that the total graphs of paths and cycles and the middle
graphs of paths and cycles are square sum graphs. A lilly graph is otained by identifying
one endpoint of each of two copies of Pn with the center of K1,2n (n > 1). Samuvel and
Kalaivani proved [2692] the following graphs are square sum graphs: the graph obtained by
the duplication of the center vertex and another vertex of a lilly graph; the graph obtained
by identifying any two verticies of a lilly graph, and the graph obtained by the switching of
the center vertex and another vertex of a lilly graph. Ghodasara and Patel [1084] proved
the following graphs are square sum graphs: restricted square graphs; splitting graphs and
shadow graphs of the bistar Bn,n ; the restricted total, the restricted middle, and the degree
splitting graph of Bn,n ; and the duplication of a vertex and arbitrary super subdivision
of Bn,n . Subhashini, Ramanathan, and Manimekalai [3062] proved that pyramids with at
least 3 rows, hanging pyramids, graphs obtained from starting with r copies of a hanging
pyramid and joining each copy with the next one with an edge, and the one point union
of r copies of a pyramid and hanging pyramids admit square sum labelings. Maheswari,
Azhagarasi, and Samuvel [2056] showed that the following graphs are square sum graphs:
the corona product of Pm (m > 2) and C2n (n > 3) with P3 parallel chords; the corona
product Pm (m > 2) and C2n+1 (n > 3) with P3 parallel chords; C2n K1 (n > 3) with
P3 parallel chords; C2n+1 K1 with P3 parallel chords; the chain of cycle C2n,m (n > 3)

the electronic journal of combinatorics (2023), #DS6 388

with P3 parallel chords (a chain of m copies of C2n with P3 parallel chords where each
copy shares exactly one vertex of the next copy); and edge connected cycle C2n (n > 3)
with P3 chords.
In [67] Agasthi and Narvathi provided ways to construct square sum, square differ- [67] new
ence, root mean square, strongly multiplicative, even mean and odd mean labelings for
triangular snakes, and the central graph of triangular snake graphs.
In [1085] Ghodasara and Patel gave a counterexample to the conjecture by Germina
and Sebastian[1074] that if G1 and G2 are square sum graphs then G1 ∪ G2 is a square
sum graph. They proved that the duplication graphs of any vertex of the following graphs
are square sum graphs: Kn if and only if n 6 7, the Petersen graph P (5, 2), K1,n , and Cn
They also proved that cycle Cn with [ n2 ] concurrent chords is a square sum graph.
In [1081] Ghodasara and Patel proved that the following constructions based on the
bistar Bn,n are square sum graphs: the restricted square, the splitting graph, the shadow
graph, the degree splitting graph, the arbitrary super subdivision graph, and the du-
plication of any vertex of Bn,n . They defined restricted total graph of Bn,n as a graph
with vertex set = V (Bn,n ) ∪ E(Bn,n ) = {u, v, w, ui , vi , u0i , vi0 /1 6 i 6 n}, where u and v
are apex vertices, ui and vi are pendent vertices, w, u0i and vi0 are vertices corresponding
to the edges of Bn,n and edge set = E(Bn,n ) ∪ {uw, vw, wu0i , wvi0 , uu0i , vvi0 , ui u0i , vi vi0 , /1 6
i 6 n}. They also defined restricted middle graph of Bn,n as a graph with vertex set
= V (Bn,n ) ∪ E(Bn,n ) = {u, v, w, ui , vi , u0i , vi0 /1 6 i 6 n}, where u and v are apex vertices,
ui and vi are pendent vertices, w, u0i and vi0 are vertices corresponding to the edges of
Bn,n and edge set = {uw, vw, wu0i , wvi0 , uu0i , vvi0 , ui u0i , vi vi0 , /1 6 i 6 n}. They proved that
restricted total graph and restricted middle graph of Bn,n are square sum graphs.
Germina and Sebastian [1073] proved that the following graphs are square sum graphs:
trees; unicyclic graphs; mCn ; cycles with a chord; the graphs obtained by joining two
copies of cycle Cn by a path Pk ; and graphs that are a path union of k copies of Cn and
the path is P2 . In [2766] Seoud and Al-Harere give several necessary conditions for a
graph to be a square sum graph and show that 2Cn , P2n , and C2n are square sum graphs.
Huilgol and Sriram [1274] prove that if G1 and G2 are square sum, then G1 ∪ G2 ∪ G3 is
also square sum, where G3 is a set of isolated vertices.
In [3021] Somashekara and Veena used the term “square sum labeling” to mean
“strongly square sum labeling.” They proved that the following graphs have strongly
square sum labelings: paths, K1,n1 ∪ K1,n2 ∪ · · · ∪ K1,nk , complete n-ary trees, and lobsters
obtained by joining centers of any number of copies of a star to a new vertex. They
observed that that if every edge of a graph is an edge of a triangle then the graph does
not have strongly square sum labeling. As a consequence, the following graphs do not
have a strongly square sum labelings: Kn , n > 3; wheels; fans Pn + K1 (n > 2); double
(n) (n)
fans Pn + K2 (n > 2); friendship graphs C3 ; windmills Km (m > 3); triangular ladders;
triangular snakes; double triangular snakes; and flowers. They also proved that helms are
not strongly square sum graphs and the graphs obtained by joining the centers of two
wheels to a new vertex are not strongly square sum graphs.
Govindan, Pinelas, and Dhivya [1142] introduced the notion a cube sum graph as [1142] new
a graph G(V, E) with p vertices and q edges such that if there exists a bijection f :

the electronic journal of combinatorics (2023), #DS6 389

V → {0, 1, 2, . . . , p − 1}, then the induced function f ∗ : E → N , defined by f (∗ uv) =
(f (u))3 + (f (v))3 , is injective. They proved that paths, cycle, stars, wheels, and fans are
cube sum graphs. Pate and Ghodasara [2356] proved that the following graphs are cube [2356] new
sum graphs: trees, gears, shell graphs, helms, Kn if and only if n is at most 11, and K2,n
for all n.
In [3030] Sonchhatra and Ghodasara call a (p, q)-graph G = (V, E) sum perfect square
if there exists a bijection f from V to {0, 1, 2, . . . , p − 1} such that the function f ∗ from E
defined by f ∗ (uv) = (f (u)) + (f (v))2 for all edges uv is an injection. Such an f is called a
sum perfect square labeling of G. In a series of four papers the following graphs are proved
to be sum perfect square graphs: cycles, cycles with one chord, cycles with twin chords,
trees [3030]; several snake related graphs [3031]; K1,n + K1 , K2 + mK1 , Cn K1 , graphs
obtained from K1,n with endpoint verticies v1 , v2 , . . . , vn by joining vi and vi+1 with an
edge for i = 1, 2, . . . , vbn/2c (“half wheel”), the middle graphs of paths, the total graphs of
paths [3032]; P 2 (n > 1), mK1,n , mCn ,, and the splitting graph and the shadow graph
of a star [3029]. In [3032] they prove that the union of two stars and that for any sum
perfect square graph G, G ∪ Pn is sum perfect square. They conjecture that the union of
any two sum perfect square graphs is sum perfect square.
Ajitha, Princy, Lokesha, and Ranjini [127] defined a graph G(p, q) to be a square differ-
ence graph if there exist a bijection f from V (G) to {0, 1, 2, . . . , p−1} such that the induced
function f ∗ from E(G) to the natural numbers given by f ∗ (uv) = |(f (u))2 − (f (v))2 | for
every edge uv of G is a bijection. Such a the function is called a square difference label-
ing of the graph G. They proved that following graphs have square difference labelings:
(n)
paths, stars, cycles, Kn if and only if n 6 5, Km,n if m 6 4, friendship graphs C3 ,
triangular snakes, and K2 + mK1 . They also prove that every graph can be embedded
as a subgraph of a connected square difference graph and conjecture that trees, complete
(n)
bipartite graphs and Ck are square difference graphs.
Tharmaraj and Sarasija [3204] proved that following graphs have square difference
labelings: fans Fn (n > 2); Pn + K2 ; the middle graphs of paths and cycles; the total
graph of a path; the graphs obtained from m copies of an odd cycle and the path Pm with
consecutive vertices v1 , v2 , . . . , vm by joining the vertex vi to a vertex of the ith copy of
the odd cycle; and the graphs obtained from m copies of the star Sn and the path Pm by
joining the vertex vi of Pm to the center of the ith copy of Sn . Sebastian and Germina
[2731] proved that certain planar graphs and higher order level joined planar grid admit
square sum labeling. They also study square sum properties of several classes of graphs
with many odd cycles.
In [1066] Geetha and Kalamani showed that the following graphs have square difference
labelings: two copies of the same star whose centers are joined by a path; and two copies
of the same cycles whose centers are joined by a path, the restricted square of bistar
Bn,n ; the restricted total graph of bistar Bn,n ; the restricted middle graph of Bn,n Shiama
[2889] showed that cycles, complete graphs, cycle cacti, ladders, lattice grids, quadrilateral
snakes, K2 + mK1 admit square difference labelings.
Vaghela and Parmar [3239] say a graph G admits a difference perfect square cordial
labeling if there is a bijection f : V (G) → {1, 2, . . . , |V (G|} such that for each edge

the electronic journal of combinatorics (2023), #DS6 390

uv the induced map f ∗ : E(G) → {0, 1} defined by f ∗ (uv) = 1 if u2 − 2uv + v 2 = 1,
and 0 otherwise, has the property that the number of edges labeled with 0 and the
number of edges labeled with 1 difference by at most 1. A graph that admits a difference
perfect square cordial labeling is said to be a difference perfect square cordial graph. They
obtained difference perfect square cordial labelings for paths, cycles, wheels, fans, combs,
crowns, (Cm K1 )∪(Pn K1 ), D2 (Pn ), Pn2 , K2 Cn , graphs consisting of two copies of Cn
that share a common edge, the vertex switching of Cn , and the graph obtained by starting
with Pn (n > 6) and two new vertices u and v of Pn and joining v to first two vertices and
last two vertices of Pn and joining u to the remaining vertices of Pn (called the shipping
graph) In [3240] Vaghela and Parmar provided difference perfect square cordial labelings
of the H-graphs of paths, some corona graphs, total graphs of paths, and graphs obtained
from Pn × P2 where Pn has conscutive vertices v1 , v2 , . . . , vn by joining vi in left Pn to vi+1
in the right copy of Pn with an edge for i = 1, 2, . . . , n − 1. In [3241] Vaghela and Parmar
obtain difference perfect square cordial labeling of triangular snake graphs, quadrilateral
snake graphs, alternate triangular snake graphs, alternate quadrilateral snake graphs,
irregular triangular snake graphs, irregular quadrilateral snake graphs, double triangular
snake graphs, double quadrilateral snake graphs, double alternate triangular snake graphs,
and double alternate quadrilateral snake graphs.
A graph G is said to admit a square difference labeling if there exists a injection
f : V (G) → {0, 1, 2, . . . , n − 1} for some n such that when each edge of G is assigned
the absolute square difference of its end-vertices, the resulting labels are distinct. Cube
difference labeling are defined analogously.
Shiana [2888] proved that paths, cycles, stars, fans, wheels, crowns, helms, dragons,
coconut trees, and shell graphs admit cube difference labelings. Sharon Philomena and
(3)
Thirusangu [2871] proved the cycle cactus graph Cn , the tree of diameter 4 obtained
from the bistar Bn,n by subdividing the middle edge with a new vertex, and the graph
obtained by joining one vertex of a cycle and one vertex of degree 2 of a comb by an
edge have square and cube difference labelings (that is, the absolute cube difference of
end-vertices of the edges are distinct). Sherman [2885] proved the path union of nC3 and
the disjoint union of m stars K1,n1 , K1,n2 , . . . , K1,nm are square difference graphs
Subashini, Bhuvaneswari, and Manimekalai [3059] proved the following graphs have
square difference labelings: theta graphs, the duplication of any vertex of degree 3 in the
cycle of a theta graph, the one point union of any number of theta graphs, the path union
of any number of copies of a theta graph, the fusion of any two vertices in the cycle of a
theta graph, and the switching of a central vertex of a theta graph.

7.25 Permutation and Combination Graphs

Hegde and Shetty [1232] define a graph G with p vertices to be a permutation graph if
there exists a injection f from the vertices of G to {1, 2, 3, . . . , p} such that the induced
edge function gf defined by gf (uv) = f (u)!/|f (u) − f (v)|! is injective. They say a graph
G with p vertices is a combination graph if there exists a injection f from the vertices of
G to {1, 2, 3, . . . , p} such that the induced edge function gf defined as gf (uv) =
f (u)!/|f (u) − f (v)|!f (v)! is injective. They prove: Kn is a permutation graph if and only

the electronic journal of combinatorics (2023), #DS6 391

if n 6 5; Kn is a combination graph if and only if n 6 5; Cn is a combination graph
for n > 3; Kn,n is a combination graph if and only if n 6 2; Wn is a not a combination
graph for n 6 6; and a necessary condition for a (p, q)-graph to be a combination graph
is that 4q 6 p2 if p is even and 4q 6 p2 − 1 if p is odd. They strongly believe that
Wn is a combination graph for n > 7 and all trees are combinations graphs. Baskar
Babujee and Vishnupriya [507] prove the following graphs are permutation graphs: Pn ;
Cn ; stars; graphs obtained adding a pendent edge to each edge of a star; graphs obtained
by joining the centers of two identical stars with an edge or a path of length 2); and
complete binary trees with at least three vertices. Seoud and Salim [2790] determine all
permutation graphs of order at most 9 and prove that every bipartite graph of order at
most 50 is a permutation graph. Seoud and Mahran [2781] give an upper bound on the
number of edges of a permutation graph and introduce some necessary conditions for a
graph to be a permutation graph. They show that these conditions are not sufficient for
a graph to be a permutation graph.
Ghodasara and Patel [1083] proved that the following graphs are permutation graphs:
the Petersen graph P (5, 2), trees, K3,n (n > 1) for n+3 prime, Wn (n > 3) for n+1 prime,
shell graph Sn (n > 3) for prime n, dumbbell graph Dn,k,2 (n, k > 3), Cn K1 (n > 3),
(k)
and the one point union Cn (k > 2, n > 3) of k copies of cycle Cn . A t-ply Pt (u, v)
is a graph with t paths, each of length at least two and such that no two paths have a
vertex in common except for the end vertices u and v. Ghodasara and Patel defined t∗ -ply
Pt∗ (u, v) as a special case of t-ply Pt (u, v) graph with every t path have same length and
proved that t∗ -ply Pt∗ (u, v) is a permutation graph.
The graph obtained from two copies of an (m, n) kite graph by connecting the degree
1 vertex of one copy to the vertex of degree 3 and the second coppy is called the 1-join
(m,n) kite. The graph ontained by repeating this construction with t copies of an (m, n)
kite is called a is called the t-join (m,n) kite. Sriramr and Govindarajan [3047] proved
t-join (m, n) kites are permutation graphs.
Ghodasara and Patel [1082] proved that the following graphs are combination graphs:
Cn × P2 for n > 6, umbrella graph U (m, n) for m, n > 2, armed crown Cn ⊕ Pm for
n > 4 and m > 1, the graphs obtained by joining C2m (m > 2) to each pendent vertex of
K1,n (n > 2), the duplication of any rim vertex of Wn for n > 7, Cn with [ n−4 2
] concurrent
chords for n > 6, and the duplication of vertex in Cn for n > 5.
Hegde and Shetty [1232] say a graph G with p vertices and q edges is a strong k-
combination graph if there exists a bijection f from the vertices of G to {1, 2, 3, . . . , p}
such that the induced edge function gf from the edges to {k, k + 1, . . . , k + q − 1} defined
by gf (uv) = f (u)!/|f (u) − f (v)|!f (v)! is a bijection. They say a graph G with p vertices
and q edges is a strong k-permutation graph if there exists a bijection f from the vertices
of G to {1, 2, 3, . . . , p} such that the induced edge function gf from the edges to {k, k +
1, . . . , k + q − 1} defined by gf (uv) = f (u)!/|f (u) − f (v)|! is a bijection. Seoud and Anwar
[2768] provided necessary conditions for combination graphs, permutation graphs, strong
k-combination graphs, and strong k-permutation graphs.
Seoud and Al-Harere [2767] showed that the following families are combination graphs:
graphs that are two copies of Cn sharing a common edge; graphs consisting of two cycles

the electronic journal of combinatorics (2023), #DS6 392

of the same order joined by a path; graphs that are the union of three cycles of the same
order; wheels Wn (n > 7); coronas Tn K1 , where Tn is the triangular snake; and the
graphs obtained from the gear Gm by attaching n pendent vertices to each vertex which
is not joined to the center of the gear. They proved that a graph G(n, q) having at least 6
vertices such that 3 vertices are of degree 1, n − 1, n − 2 is not a combination graph, and
a graph G(n, q) having at least 6 vertices such that there exist 2 vertices of degree n − 3,
two vertices of degree 1 and one vertex of degree n − 1 is not a combination graph.
Seoud and Al-Harere [2765] proved that the following families are combination graphs:
unions of four cycles of the same order; double triangular snakes; fans Fn if and only if
n > 6; caterpillars; complete binary trees; ternary trees with at least 4 vertices; and
graphs obtained by identifying the pendent vertices of stars Sm with the paths Pni , for
1 6 ni 6 m. They include a survey of trees of order at most 10 that are combination
graphs and proved the following graphs are not combination graphs: bipartite graphs
with two partite sets with n > 6 elements such that n/2 elements of each set have degree
n; the splitting graph of Kn,n (n > 3); and certain chains of two and three complete
graphs. Seoud and Anwar [2768] proved the following graphs are combination graphs:
dragon graphs (the graphs obtained from by joining the endpoint of a path to a vertex
of a cycle); triangular snakes Tn (n > 3); wheels; and the graphs obtained by adding k
pendent edges to every vertex of Cn for certain values of k.
In [2764] and [2765] Seoud and Al-Harere proved the following graphs
are non-combination graphs: G1 + G2 if |V (G1 )|, |V (G2 )| > 2 and at
least one of |V (G1 )| and |V (G2 )| is greater than 2; the double fan K2 +
Pn ; Kl,m,n ; Kk,l,m,n ; P2 [G]; P3 [G]; C3 [G]; C4 [G]; Km [G]; Wm [G]; the splitting graph
of Kn (n > 3); Kn (n > 4) with an edge deleted; Kn (n > 5) with three edges deleted;
and Kn,n (n > 3) with an edge deleted. They also proved that a graph G(n, q) (n > 3) is
not a combination graph if it has more than one vertex of degree n − 1.
In [3206] and [3205] Tharmaraj and Sarasija defined a graph G(V, E) with p vertices
to be a beta combination graph if there exist a bijection f from V (G) to {1, 2, . . . , p}
such that the induced function Bf from E(G) to the natural numbers given by Bf (uv) =
(f (u) + f (v))!/f (u)!f (v)! for every edge uv of G is injective. Such a function is called a
beta combination labeling. They prove the following graphs have beta combination label-
ings: Kn if and only if n 6 8; ladders Ln (n > 2); fans Fn (n > 2); wheels; paths; cycles;
friendship graphs; Kn,n (n > 2); trees; bistars; K1,n (n > 1); triangular snakes; quadrilat-
eral snakes; double triangular snakes; alternate triangular snakes (graphs obtained from
a path v1 , v2 , . . . , vn , where for each odd i 6 n − 1, vi and vi+1 are joined to a new vertex
ui,i+1 ; alternate quadrilateral snakes (graphs obtained from a path v1 , v2 , . . . , vn , where
for each odd i 6 n − 1, vi and vi+1 are joined to two new vertices ui,i+1,1 and ui,i+1,2 );
helms; gears; combs Pn K1 ; and coronas Cn K1 .

7.26 Strongly *-graphs

A variation of strong multiplicity of graphs is a strongly *-graph. A graph of order n
is said to be a strongly *-graph if its vertices can be assigned the values 1, 2, . . . , n in
such a way that, when an edge whose vertices are labeled i and j is labeled with the

the electronic journal of combinatorics (2023), #DS6 393

value i + j + ij, all edges have different labels. Adiga and Somashekara [59] have shown
that all trees, cycles, and grids are strongly *-graphs. They further consider the problem
of determining the maximum number of edges in any strongly *-graph of given order
and relate it to the corresponding problem for strongly multiplicative graphs. In [2783]
and [2784] Seoud and Mahan give some technical necessary conditions for a graph to be
strongly *-graph,
Baskar Babujee and Vishnupriya [507] have proved the following are strongly *-graphs:
(n)
Cn × P2 , (P2 ∪ K m ) + K 2 , windmills K3 , and jelly fish graphs J(m, n) obtained from a
4-cycle v1 , v2 , v3 , v4 by joining v1 and v3 with an edge and appending m pendent edges to
v2 and n pendent edges to v4 .
Baskar Babujee and Beaula [489] prove that cycles and complete bipartite graphs are
vertex strongly *-graphs. Baskar Babujee, Rajesh Kannan, and Vishnupriya [500] prove
that wheels, paths, fans, crowns, (P2 ∪ mK1 ) + K2 , and umbrellas (graphs obtained by
appending a path to the central vertex of a fan) are vertex strongly *-graphs.
In [2785] Seoud, Roshdy, and AboShady gave an upper bound for the number of edges
of any graph in terms of the number of vertices to be a strongly ∗ -graph and some new
families to be strongly∗ - graphs. They also provided an algorithm for checking if a graph
is a strongly ∗ -graph or not.

7.27 Triangular Sum Graphs

Hegde and Shankaran [1227] call a labeling of graph with q edges a triangular sum labeling
if the vertices can be assigned distinct non-negative integers in such a way that, when an
edge whose vertices are labeled i and j is labeled with the value i + j, the edges labels
are {k(k + 1)/2| k = 1, 2, . . . , q}. They prove the following graphs have triangular sum
labelings: paths, stars, complete n-ary trees, and trees obtained from a star by replacing
each edge of the star by a path. They also prove that Kn has a triangular sum labeling if
(t)
and only if n is 1 or 2 and the friendship graphs C3 do not have a triangular sum labeling.
They conjecture that Kn (n > 5) are forbidden subgraphs of graph with triangular sum
labelings. They conjectured that every tree admits a triangular sum labeling. They
show that some families of graphs can be embedded as induced subgraphs of triangular
sum graphs. They conclude saying “as every graph cannot be embedded as an induced
subgraph of a triangular sum graph, it is interesting to embed families of graphs as an
induced subgraph of a triangular sum graph”. In response, Seoud and Salim [2787] showed
the following graphs can be embedded as an induced subgraph of a triangular sum graph:
trees, cycles, nC4 , and the one-point union of any number of copies of C4 (friendship
graphs).
Vaidya, Prajapati, and Vihol [3298] showed that cycles, cycles with exactly one chord,
and cycles with exactly two chords that form a triangle with an edge of the cycle can
be embedded as an induced subgraph of a graph with a triangular sum labeling. They
proved that several classes of graphs do not have triangular sum labelings. Among them
are: helms, graphs obtained by joining the centers of two wheels to a new vertex, and
graphs in which every edge is an edge of a triangle. As a corollary of the latter result

the electronic journal of combinatorics (2023), #DS6 394

they have that Pm + Kn , Wm + Kn , wheels, friendship graphs, flowers, triangular ladders,
triangular snakes, double triangular snakes, and flowers. do not have triangular sum
labelings.
Seoud and Salim [2787] proved the following are triangular sum graphs: Pm ∪ Pn , m >
4; the union of any number of copies of Pn , n > 5; Pn Km ; symmetrical trees; the graph
obtained from a path by attaching an arbitrary number of edges to each vertex of the
path; the graph obtained by identifying the centers of any number of stars; and all trees
of order at most 9.
For a positive integer i the ith pentagonal number is i(3i − 1)/2. Somashekara and
Veena [3022] define a pentagonal sum labeling of a graph G(V, E) as one for which there is a
one-to-one function f from V (G) to the set of nonnegative integers that induces a bijection
f + from E(G) to the set of the first |E| pentagonal numbers. A graph that admits such
a labeling is called a pentagonal sum graph. Somashekara and Veena [3022] proved that
the following graphs have pentagonal sum labelings: paths, K1,n1 ∪ K1,n2 ∪ · · · ∪ K1,nk ,
complete n-ary trees, and lobsters obtained by joining centers of any number of copies of
a star to a new vertex. They conjecture that every tree has a pentagonal sum labeling
and as an open problem they ask for a proof or disprove that cycles have pentagonal
labelings. They observed that if every edge of a graph is an edge of a triangle then the
graph does not have pentagonal sum labeling. As was the case for triangular sum labelings
the following graphs do not have a pentagonal sum labeling: Pm + Kn , and Wm + Kn
wheels, friendship graphs, flowers, triangular ladders, triangular snakes, double triangular
snakes, and flowers. Somashekara and Veena [3022] also proved that helms and the graphs
obtained by joining the centers of two wheels to a new vertex are not pentagonal sum
graphs.

7.28 Divisor Graphs

Santhosh and Singh [2715] call a graph G(V, E) a divisor graph if V is a set of integers
and uv ∈ E if and only if u divides v or vice versa. They prove the following are divisor
graphs: trees; mKn ; induced subgraphs of divisor graphs; cocktail party graphs Hm,n (see
Section 7.1) for the definition); the one-point union of complete graphs of different orders;
complete bipartite graphs; Wn for n even and n > 2; and Pn + Kt . They also prove that
Cn (n > 4) is a divisor graph if and only if n is even and if G is a divisor graph then for
all n so is G + Kn .
Chartrand, Muntean, Saenpholphat, and Zhang [685] proved complete graphs, bipar-
tite graphs, complete multipartite graphs, and joins of divisor graphs are divisor graphs.
They also proved if G is a divisor graph, then G × K2 is a divisor graph if and only if G
is a bipartite graph; a triangle-free graph is a divisor graph if and only if it is bipartite;
no divisor graph contains an induced odd cycle of length 5 or more; and that a graph G
is divisor graph if and only if there is an orientation D of G such that if (x, y) and (y, z)
are edges of D then so is (x, z).
In [141] and [143] Al-Addasi, AbuGhneim, and Al-Ezeh determined precisely the values
of n for which Pnk (k > 2) are divisor graphs and proved that for any integer k > 2, Cnk
is a divisor graph if and only if n 6 2k + 2. In [25] they gave a characterization of the

the electronic journal of combinatorics (2023), #DS6 395

graphs G and H for which G × H is a divisor graph and a characterization of which block
graphs are divisor graphs. (Recall a graph is a block graph if every one of its blocks is
complete.) They showed that divisor graphs form a proper subclass of perfect graphs and
showed that cycle permutation graphs of order at least 8 are divisor graphs if and only
if they are perfect. (Recall a graph is perfect if every subgraph has chromatic number
equal to the order of its maximal clique.) In [142] Al-Addasi, AbuGhneim, and Al-Ezeh
proved that the contraction of a divisor graph along a bridge is a divisor graph; if e is an
edge of a divisor graph that lies on an induced even cycle of length at least 6, then the
contraction along e is not a divisor graph; and they introduced a special type of vertex
splitting that yields a divisor graph when applied to a cut vertex of a given divisor graph.
AbuHijleh, AbuGhneim, and Al-Ezeh [25] prove that for any tree T, T 2 is a divisor
graph if and only if T is a caterpillar and the diameter of T is less than six. For any
caterpillar T and a positive integer k with diam(T ) < 2k, they show that T k is a divisor
graph. Moreover, for a caterpillar T and k > 3 with diam(T ) = 2k or diam(T ) = 2k + 1,
they show that T k is a divisor graph if and only if the centers of T have degree two. In
[26] AbuHijleh, AbuGhneim, and Al-Ezeh prove that the k-th power Qkn of Qn is a divisor
graph if and only if n = 2, 3 or n > 4 and k > n − 1 hold. In the case of the n-dimensional
folded-hypercube F Qn (that is, the graph obtained from Qn by adding to it a perfect
matching that connects opposite pairs of the vertices of Qn ) they show that F Qn is a
divisor graph for odd n, but not for even n > 4. They also prove (F Qn )k is not a divisor
graph if and only if 2 6 k 6 dn/2e, where n > 5.
Ganesan and Uthayakumar [1012] proved that G H is a divisor graph if and only if
G is a bipartite graph and H is a divisor graph. Frayer [953] proved Kn × G is a divisor
graph for each n if and only if G contains no edges and Kn × K2 (n > 3) is a divisor graph.
Vinh [3402] proved that for any n > 1 and 0 6 m 6 n(n − 1)/2 there exists a divisor
graph of order n and size m. She also gave a simple characterization of divisor graphs due
to Chartrand, Muntean, Saenpholphat, and Zhang [685]. Gera, Saenpholphat, and Zhang
[1068] established forbidden subgraph characterizations for all divisor graphs that contain
at most three triangles. Tsao [3230] investigated the vertex-chromatic number, the clique
number, the clique cover number, and the independence number of divisor graphs and
their complements. In [2774] Seoud, El Sonbaty, and Mahran discuss here some necessary
and sufficient conditions for a graph to be a divisor graph.
In [1660] Kasthuri, Karuppasamy, and Nagarajan introduced the notions of SD-divisor
labelings and SD-divisor cordial labelings as follows. Let G be finite, simple graph G with
n vertices and f be a bijection from V (G) to {1, 2, . . . , n}. Define a function f 0 induced
by f by assigning f 0 (uv) = 1 if S = f (u) + f (v) divides D = |f (u) − f (v)| and f 0 (uv) = 0,
otherwise. They say that f 0 is a SD-divisor labeling if f 0 (uv) = 1 for all edges uv. In
[2620] Revathi and Mary Jeya Jothi [2620] provided SD-divisor labelings for paths and
cycles and certain path and cycle related graphs. They further find SD-divisor labelings
of some subdivision graphs, coronas, and splitting graphs, and prove that stars, complete
graphs, and wheels do not admit SD-divisor labelings.
A graph G with n vertices has a modular multiplicative divisor (MMD) labeling if there
exist a bijection f from vertices of G to the set of all natural numbers from 1 to n such that

the electronic journal of combinatorics (2023), #DS6 396

when the edge uv is labeled f (u)f (v)(mod n), then n divides the sum of all edge labels
of G. They prove that r-dimensional butterfly networks admit MMD labengs. Revathi,
Dharmakkan, and Jeya Jothi [2618] proved that Kl,m,n admits a modular multiplicative
divisor labeling. Revathi and Rajeswari [2621] proved Pn , Pa,b (the graph that connects [2621] new
two vertices by means of b internally disjoint paths of length a each), the shadow graph
of a path, and Pn × P1 , (where n is not a multiple of 6) admit modular multiplicative
divisor labelings. They also discuss the upper bound for the number of edges in a modular
multiplicative divisor graphs. In [2619] Revathi and Rajeswari proved that the split graphs [2619] new
of cycles, helms, and flower graphs admit modular multiplicative divisor labelings.
A divisor 3-equitable labeling of a graph G is a bijection d : V (G) → {1, 2, . . . , |V (G)|}
such that induced map d∗ defined on the edges of G by, for any edge uv with d(u) 6
d(v), d∗ (uv)) = 1 if d(v)/d(u) = 1; d∗ (uv) = 2 if d(v)/d(u) = 2; and d∗ (uv) = 0,
otherwise, has the property that the number of edges labeled with i and the number of
edges labeled with j differ by at most 1 for all i and j. A graph that admits a divisor
3-equitable labeling is called a divisor 3-equitable graph. The existence and non-existence
of divisor 3-equitable labelings have been determined for wheels [1373], complete graphs [1373] new
and stars [1374], ladders, triangular snakes, and lollipop graphs [2706], and the degree [1374] new
splitting graph of ladders [2591].
[2706] new
7.29 Other Kinds of Labelings [2591] new
Zumkeller labelings
A positive integer n is said to be a Zumkeller number if all the positive factors of n can
be partitioned into two disjoint parts so that the sum of the two parts are equal. (For
example, 6 partitions as {1, 2, 3} and {6} and 20 partitions as {2, 12} and {1, 3, 4, 6}.
An injective function f from the vertices of a graph G to the natural numbers N is
said to be a Zumkeller labeling of G, if the induced function f ∗ : E(G) → N defined
by f ∗ (xy) = f (x)f (y) is a Zumkeller number for all edges xy. A graph that admits a
Zumkeller labeling is called a Zumkeller graph. Balamurugan, Thirusangu, Thomas, and
Murali [403] investigated the existence of Zumkeller labelings of paths, cycles, and ladders. [403] new
Wilson and Bebincy [3478] proved that the splitting graph of paths, the total graphs of [3478] new
paths, the shadow graphs of paths, and the middle graphs of paths admit Zumkeller
labelings. Wilson and Bebincy investigated the existence of Zumkeller labelings for closed
helms, double wheels, sunflowers, flower graphs, and the prisms of wheels. Patodia and
Saikia [2370] provided algorithms to label complete bipartite graphs, wheels, cycles, and [2370] new
paths with m-Zumkeller numbers.
A simple graph G(V, E) is said to be a k-Zumkeller graph if there is an injection f
from the vertices of G to the natural numbers such that when each edge xy is assigned the
label f (x)f (y), the resulting edge labels are k distinct Zumkeller numbers. Balamurugan,
Thirusangu, and Thomas [402] proved that twig graphs admit a 4-Zumkeller labelings. [402] new
Basher [478] showed that the super subdivision of paths, cycles, combs, ladders, crowns, [478] new
circular ladders, grids, and prism are k-Zumkeller graphs. An injection is called a t-
m-Zumkeller labeling of a graph G if, for every edge uv, the induced function defined
by f ∗ (uv) = f (u)f (v) is an m-Zumkeller number and |f ∗ (E)| = t, where t denotes the

the electronic journal of combinatorics (2023), #DS6 397

number of distinct m-Zumkeller numbers on the edges of G. A graph that admits a t − m-
Zumkeller labeling is called a t-m-Zumkeller graph.. In [2371] Patodia and Saikia gave [2371] new
t-m-Zumkeller labelings for paths, cycles, combs graphs, ladders graphs, and twigs.
A positive integer is said to be a half-Zumkeller number if its proper positive divisors
can be partitioned into two disjoint non-empty subsets of equal sum. A half-Zumkeller
labeling of a graph is an injective mapping f from the vertex set into the set of natural
numbers N such that the induced mapping f ∗ from the edges to N given by f ∗ (uv) =
f (u)f (v) is a half-Zumkeller number. A graph that admits a half-Zumkeller labeling is
called a half-Zumkeller graph. Zeen El Deen, Elmahdy, Elkholy, and El Sherbiny [3574] [3574] new
gave half-Zumkeller labelings for stacked books (Km,1 × Pn ), Pm × Pn , prisms of ladders,
grids, gears, and flowers. They also showed that if G is a half-Zumkeller graph and H is
a non-totally disconnected subgraph of G, then H is a half-Zumkeller graph.
In 2015 Murali, Thirusangu, and Meenakshi [2209] introduced Zumkeller cordial [2209] new
labeling of graphs as an injective function f from the vertices to the natural numbers
such that the induced function f ∗ from the edges to {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 that the
number of edges labeled with 1 and the number labeled with 0 differ by at most 1. They
proved the existence of Zumkeller cordial labeling for paths, cycles, and stars. Murali,
Thirusangu, and Balamurugan [2207] showed the existence of Zumkeller cordial labelings [2207] new
for helms, wheels, flower graphs, and crowns.

Lucky labelings
A labeling of the verticies of a graph with natural numbers is said to be lucky if the
sum of labels over all neighbors of vertex v and the sum of labels over all neighbors of
vertex u are distinct whenever u and v are adjacent. (An isolated vertex is defined to
have sum 0). The smallest nonzero label of a lucky labeling of a graph G is called the
lucky number of the graph and is denoted by η(G). A lucky labeling of a graph that is
injective is called a proper lucky graph. The proper lucky number of graph G is denoted
by ηp (G). Sateesh Kumar and Meenakshi [2719] determined the proper lucky numbers [2719] new
for Km,n , friendship graphs, certain triangular books, and certain rectangular books.
Chiranjilal Kujur, Xavier, and Raja [1770] gave proper lucky labelings for K-identified [1770] new
triangular meshs and K-identified Sierpinski gasket graphs. Ahadi, Dehghan, Kazemi,
and Mollaahmadi [75] proved that for a given planar 3-colorable graph G, determining [75] new
whether η(G) = 2 is NP-complete, and that for every k > 2, it is NP-complete to
decide whether η(G) = k for a given graph G. Using algebraic methods Czerwiński,
Grytczuk, and Zelazny [770] proved that η(T ) 6 2 for every tree T , and η(G) 6 3 for [770] new
every bipartite planar graph G. They obtained a bound for the lucky number in terms
of the acyclic chromatic number and conjecture that for every graph G, η(G) 6 χ(G).
In [1769] Kujur gave the lucky number and proper lucky number for the bloom graph (a [1769] new
particular planar, tripartite, 4-regular graph). Elrokh, Sateesh Kumar, and Meenaksh
[820] computed the lucky numbers for jelly fish graphs, cocktail party graphs, and crowns. [820] new
Sateesh Kumar and Meenakshi [2718] determined the lucky numbers and proper lucky [2718] new
numbers for quadrilateral snakes, double quadrilateral snakes, alternate quadrilateral

the electronic journal of combinatorics (2023), #DS6 398

snakes, and double alternate quadrilateral snakes. Xavier and Rathi [3494] determined [3494] new
the proper lucky numbers of hexagonal meshes and honeycomb networks. Indira, Selvam,
and Thirusangu [1327] gave proper lucky labelings for extended duplicate graphs of [1327] new
quadrilateral snakes.
A labeling of the vertices of a graph with natural numbers is said to be a lucky edge
labeling if for any two adjacent edges the sums of the vertex labels incident to the two
edges are distinct. Thesmallest positive integer k for which a graph G has a lucky edge
labeling from the set {1, 2, . . . , k} is called the lucky number of G and denoted by η(G).
A graph that admits a lucky edge labeling is called a lucky edge graph. Esakkiammal,
Thirusangu, and Seethalakshmi [896] showed that the super subdivisions of stars and [896] new
wheels are lucky edge labeled graphs and determined their lucky numbers. In [2212] [2212] new
Murugan and Chitra [2212] provided lucky edge labelings for Pn , Cn and Pn Cn . In
[2214] they proved that triangular snakes, book with triangular pages, and Pn × C3 [2212] new
(triangular prisms) are lucky edge graphs. Indira, Selvam, and Thirusangu [1327] gave [2214] new
lucky edge labelings for extended duplicate graphs of quadrilateral snakes. Chitra and [1327] new
Murugan proved that graphs obtained from two copies Pn in which the ith vertex of one
path is joined with the (i + 1)th vertex of the second copy, fish graphs
subindexgraphsfish (the one-point union of a vertex of Cn and a vertex of K3 ), butterfly
graphs, double triangular snakes, flower graphs, and Pn2 are lucky edge graphs. Nagarajan
and Priyadharsini [2253] provided lucky edge labelings and lucky numbers for lotus [2253] new
graphs, prisms, and C2m @Pt . Mohana priya and S Santhiya [2182] gave lucky edge [2182] new
labelings for graphs obtained by joining Cm and Cn with an edge, bistars, wheels, fans,
and butterfly graphs. Murugan and Chitra [2213] gave lucky edge labeling of fans, spider, [2213] new
and twig graphs. Aishwarya [128] provided lucky edge labelings and luck numbers for [128] new
ladders, shell graphs, and books with triangular pages.

S3 cordial remainder labelings

In [2025] Lourdusamy, Jenifer Wency, and Patrick introduced the concept of the group
S3 cordial remainder labeling as follows. Let G(V, E) be a graph and let g : V → S3 be
a function. For each edge xy assign the label r where r is the remainder when o(g(x))
is divided by o(g(y)) or o(g(y)) is divided by o(g(x)) according as |g(x)| > |g(y)| or
|g(y)| > |g(x)|. The function g is called a group S3 cordial remainder labeling of G if
|vg (x) − vg (y)| 6 1 and |eg (1) − eg (0)| 6 1, where vg (x) denotes the number of vertices
labeled with x and eg (i) denotes the number of edges labeled with i (i = 0, 1). A
graph G that admits a group S3 cordial remainder labeling is called a group S3 cordial
remainder graph . They prove the following graphs admit a group S3 cordial remainder
labeling: paths, cycles, stars, bistars, complete bipartite graphs, wheels, fans, combs,
crowns, the lotus inside a circle, double fans, ladders, slanting ladders, and triangular
ladders. In [1377] they proved that shadow graph of cycle and path, splitting graph of
cycle, armed crown, umbrella graphs, and dumbbell graphs admit a group S3 cordial
remainder labeling. Also they proved that certain snake related graphs are a group S3
cordial remainder graphs. In [2026, 2027, 2028], they investigated the behavior of group
S3 cordial remainder labelings of subdivision of stars, subdivision of bistars, subdivision

the electronic journal of combinatorics (2023), #DS6 399

of wheels, subdivision of combs, subdivision of crowns, subdivision of fans, subdivision
of ladders, helms, flower graphs, closed helms, gears, sunflowers, triangular snakes,
quadrilateral snakes, square of paths, the duplication of a vertex by a new edge in path
and cycle graphs, the duplication of an edge by a new vertex in paths and cycles, and
total graphs of cycles and paths.

Even sum labelings

Andharia and Kaneria [194] introduced the concept of even sum labeling as follows.
A graph G = (V, E) is said to admit even sum labeling if there exist an injective
function f : V (G) → {0, ±2, ±4, . . . , ±2|V (G)|} such that the induced mapping
f ∗ : E(G) → {2, 4, . . . , 2|E(G)|} defined by f ∗ (uv) = f (u) + f (v), ∀uv ∈ E(G) is
bijective. The function f is called an even sum labeling of G. The graph that admits
even sum labeling is called an even sum graph. In [194], [1581], [1582], and [195]
Andharia and Kaneria proved the following graphs are even sum graphs: slanting ladders
SLn (1 < n < 9), Pn , C4n , the complete bipartite graphs, Pm × Pn , mirror graphs M (Pn )
(2 6 n 6 6), jelly fish graphs, the splitting graph of stars, the degree splitting graph
of stars, the splitting graph of K2,n , the splitting graph of K1,n,n , jewel graphs, trian-
gular books, the triangular book graph with a bookmark, Pm (+) Kn , and (Kn ∪P3 )+2K1 .

Odd-even sum labelings

Monika and Murugan [2186] proved the graphs obtained by the following duplications [2186] new
admit odd-even sum labelings: the apex vertex of stars, the pendent vertices of stars, the
apex vertex of stars by an edge, a vertex of Pn (n > 2), an edge by a vertex of Pn (n > 3),
a pendant vertex by an edge of Pn (n > 2), and a pendent edge of Pn (n > 2) by edge,
They also proved that C3 is not an odd-even sum graph.

Prime distance labelings

Eggleton, Erdős, and Skilton, [866] call a graph a prime distance graph if its vertices can
be labeled with distinct integers in such a way that for any two adjacent vertices, the
absolute difference of their labels is a prime number. Laison, Starr, and Walker [1797]
prove that trees, cycles, and bipartite graphs are prime distance graphs, and that Dutch
windmill graphs and paper mill graphs are prime distance graphs if and only if the Twin
Prime Conjecture and the Polignac’s Conjecture that for every positive even integer n
there are infinitely many cases of two consecutive prime numbers with difference n are
true, respectively. Parthiban and David [2349] proved the following graphs admit prime
distance labelings: the graph obtained by the duplication of every vertex by an edge in
any prime distance graph H if the Twin prime conjecture is true; the graph obtained
by fusing any two vertices vi and vj , where d(vi , vj ) > 3, of Cn ; the graph obtained by
duplicating any vertex of Cn (n > 6); and the graph obtained from m copies of Cn by
joining a vertex in the ith copy of Cn to a vertex in the (i + 1)th copy of Cn where
1 6 i 6 m − 1.

2-odd labelings Laison, Starr, and Walker [1797] say a graph G is a 2-odd graph

the electronic journal of combinatorics (2023), #DS6 400

if its vertices can be labeled with distinct integers such that for any two adjacent
vertices, the absolute difference of their labels is either an odd integer or 2. They give a
characterization of 2-odd graphs in terms of edge colorings and use this characterization
to determine which circulant graphs of a particular form are 2-odd and to prove results
on circulant prime distance graphs.
Pir and Parathiban [2400] proved that diamonds, double fans, double alternate trian-
gular snakes, king graphs, which consist of the m × n chessboard with edges being the
moves that a king chess piece can make, and antiprisms admit 2-odd labelings.
In [16] Abirami, Parthiban, and Srinivasan prove the following graphs admit 2-odd
labelings: Wn (n > 4), fans, graphs with 2n verticies obtained from an n-cycle and
joining every two consecutive edges to a new vertex, and shell graphs C(n, n − 3) (n > 4).
Abirami, Parthiban, and Srinivasan [15] proved the following graphs admit 2-odd
labelings: helms Hn (n > 4), double wheels, umbrellas, graphs obtained by performing
the duplication of a vertex by an edge at all the vertices of 2-odd graph if the Twin Prime
conjecture is true, Ka + mK1 , butterfly graphs Bn,m (n > 3) if Goldbach’s conjecture is
true, and graphs obtained from a cycle by performing duplication of a vertex by a vertex
at all the vertices of the cycle if Goldbach’s conjecture is true.

Absolute difference labelings

In [2857] Shalini and Dhayaran introduced the notion of absolute differences of cubic
and square difference labelings of a graph as labelings for which every edge label is
the absolute difference of the cubes of the vertices and the difference of the squares of
the vertices. They proved that paths, stars, cycles, fans, windmills, and wheels admit
differences of cubic and squared labelings. They also observed that the labels of the
edges must be even. Shalini, Gowri, and Dhayabaran [2858] proved that barbells, cycle
cactuses, coconut trees, shells, and dragons admit absolute differences of cubic and
squared labelings. In [3345], [3346], [3347], [3348], [3349], [3350], [3351], [3352], [3143],
[3353], and [3354] Mathew Varkey and Sunoj proved that planar grids, web graphs, kayak
paddle graphs, snake graphs, armed crowns, fans, friendship graphs, windmill graphs,
cycles, wheels, gears, helms, 2-tuple graphs, middle graphs, total graphs, shadow graphs
(m)
barbells, K2,n , and K1,n 2Pm admit absolute difference of cubic and square sum labelings.

Quotient labelings
In [3122] Sumathi and Rathi introduced the notion of quotient labeling as follows. Let
G(V, E) be a finite, non-trivial, simple,undirected graph. For a one-one assignment
f : V → {1, 2, . . . , |V |} let f ∗ (uv) = bf (u)/f (v)c. Then f ∗ is a said to be a quotient
labeling of G if f ∗ : E → {1, 2, . . . , |V |} and f (u) > f (v). (The edge labels need not
be distinct.) The maximum value of f ∗ (E(G)), denoted ql(f ∗ ), is called the q-labeling
number of G. The quotient labeling number of G, QL(G), is the minimum value among
all ql(f ∗ ). They found the quotient labeling number of the following graphs: the graph
obtained by duplicating an arbitrary vertex of a cycle by an edge, the graph obtained by
duplicating an arbitrary edge of cycle by a vertex, two copies Cn sharing a common edge,
the twig graphs, the splitting graph of a path, the composition graph Pm [P2 ] and joint

the electronic journal of combinatorics (2023), #DS6 401

sum of two copies of Cn . In [3123] Sumathi and Rathi determine the quotient number
of various families of ladder-related graphs. In [3124] Sumathi and Rathi provided the
quotient labeling number of quadrilateral snakes, double quadrilateral snakes, alternate
triangular snakes, alternate double triangular snakes, and the subdivision of triangular
and quadrilateral snakes along the main path.

Oblong labelings
Oblong numbers are the numbers of dots that can be placed in rows and columns in a
rectangular array, each row containing one more dot than each column. (The first five
oblong numbers are 2, 6, 12, 20, and 30.) In [2518] Prema and Murugan proved the
following graphs have oblong labelings: H-graphs, jelly fish, shrubs, G K1 where G is an
H-graph that has an oblong labeling, banana trees, and graphs obtained by identifying
an endpoint of K1,3 with an end vertex of Pn . Muthumanickavel and Murugan [2234]
investigated the existence of oblong sum labelings of the union of graphs involving stars
and subdivisions of stars and bistars. They also prove that helms do not admit oblong
labelings.

Signed cordial labelings

In 2011 two versions of cordial labelings utilizing −1 and 1 as vertex and edge labels
were introduced. Devaraj and Delphy [810] defined the notion of signed cordial graphs [810] new
as follows. A graph G(V, E) is called signed cordial if the edges can be assigned −1 and
1 in such a way that when each vertex v is assigned the product of the labels of the
edges incident with v the resulting graph has the property that the number of vertices
labeled with i and the number of edges labeled with i differ by at most 1 for i = −1
and 1. A graph is called a signed cordial graph if it admits a signed cordial labeling.
Similarly, Babujee and Loganathan [501] say graph G(V, E) is signed product cordial if [501] new
the verticies can be assigned −1 and 1 in such a way that when each edge assigned the
product of its endpoints, the number of vertices labeled with i and the number of edges
labeled with i differ by at most 1 for i = −1 and 1. A graph is called signed product
cordial if it admits a signed product cordial labeling. In [2240] Nada, Elrokh, Elmshtaye, [2240] new
and El-hay gave necessary and sufficient conditions for which cones (Kn + Cm ) and their
second powers are signed product cordial. In [501] Babujee and Loganathan proved that [501] new
paths, cycles, stars, and bistars are signed product cordial. Devaraj and Delphy [810] [810] new
investigated signed-cordiality of complete graphs, books, Jahangir graphs, flower graphs,
and Petersen graphs. Cynthia and Padmavathy [768] proved that Cn × Pn and certain [768] new
banana trees admit signed cordial and signed product cordial labelings.

k-vertex weighting
In [2900] Shiu, Laub, and Ng [2900] introduced the following notion. For a simple, finite [2900] new
and undirected graph G(V, E) of order n, a k-vertex weighting of a graph G is a mapping [2900] new
w : V (G) → {1, . . . , k}. A k-vertex weighting induces an edge labeling fw : E(G) → N
such that fw (uv) = w(u) + w(v). Such a labeling is called an edge-coloring k-vertex
weighting if fw (e) 6= fw (e0 ) for any two adjacent edges e and e0 . They determined the

the electronic journal of combinatorics (2023), #DS6 402

minimum k that admit an edge-coloring k-vertex weighting for the following graphs:
wheels, gears, grids, P2 × Cn , lollipops, theta graphs, and two cycles joined by a path
(long dumbells).

SD-harmonious
For a graph G with q edges, an injection f : V (G) → {0, 1, 2, . . . , q} is said to be
SD-harmonious labeling if the induced function f ∗ : E(G) → {0, 2, . . . , 2q − 2} defined
by f (uv) = S + D (mod 2q) is bijective, where S = f (u) + f (v) and D = |f (u) − f (v)|,
for every edge uv in E(G). In [2023] Lourdusamy, Wency, and Patrick investigated SD- [2023] new
harmonious labelings of paths, trees, star related graphs, and the disjoint union of graphs.

Dividing graceful labeling

Zahraa, Nabeel, and Fawzi [3568] say a graph G(V, E) has a dividing graceful labeling [3568] new
if there is a one-to-one mapping φ from V to {1, 2, 3, . . . , |E|} such that for every edge
uv the induced function φ∗ defined by φ∗ (uv) = d(φ(u) + φ(v))/|E|e has the property
that φ∗ (E) = {1, 2, 3, . . . , |E|}. They showed the following graph have dividing graceful
labelings: stars, graphs obtained by joining the centers of two copies of K1,t , and spiders
with diameter 4.

Square product labeling

In [2156] Mirajkar and Sthavarmath introduced the notion a square product graph as one [2156] new
for which there exists a bijection f from V (G) to {1, 2, 3, . . . , p} that induces an injective
labeling f ∗ from E(G) to N defined by f ∗ (uv) = f (u)2 f (v)2 . In [2155] they proved that [2155] new
Cn K1 and certain kinds of cactus graphs are square product graphs.

E-super arithmetic graceful

In [2738] Sekar and Varatharajaperumal define a (p, q) graph G to be E-super arith- [2738] new
metic graceful if there exists a bijection f from V (G) ∪ E(G) to {1, 2, . . . , p + q} such
that f (E(G)) = {1, 2, . . . , q}, f (V (G) = {q + 1, q + 2, . . . , q + p}, and the induced
mapping f ∗ given by f ∗ (uv) = f (u) + f (v) − f (uv) for uv ∈ E(G) has the range
{p + q + 1, p + q + 2, . . . , p + 2q}. They provided E-super arithmetic graceful lablings for
four families of cycle related graphs.

Numbering of graphs
In [1286] Ichishima, Oshima, and Takahashi define a numbering f of a graph G of order [1286] new
n as a labeling that assigns distinct elements of the set {1, 2, . . . , n} to the vertices of G.
The strength strf (G) of a numbering f : V (G) → {1, 2, . . . , n} of G is defined by
strf (G) = max{f (u) + f (v) | uv ∈ E(G)}, that is, strf (G) is the maxi-
mum edge label of G and the strength str(G) of a graph G itself is str(G) =
min{strf (G) | f is a numbering of (G)}. They proved necessary and sufficient conditions
for the strength of a graph G of order n to meet str(G) = 2n − 2β(G) + 1 and
str(G) = n + δ(G) = 2n − 2β(G) + 1, where β(G) and δ(G) denote the independence
number and the minimum degree of G, respectively. They answer open problems posed

the electronic journal of combinatorics (2023), #DS6 403

by Gao, Lau and Shiu, and the earlier result leads us to determine a formula for the
strength of graphs containing a particular class of graphs as a subgraph. They also extend
what is known in the literature about k-stable properties. In [1285] Ichishima, López, [1285] new
Muntaner-Batle, Takahashi present a sharp lower bound for the strength of a graph in
terms of its domination number as well as its (edge) covering and (edge) independence
number. They also provide a necessary and sufficient condition for the strength of a
graph to attain the earlier bound in terms of their subgraph structure and establish a
sharp lower bound for the domination number of a graph under certain conditions.
In [1287] Ichishima, Oshima, and Takahashi define an edge numbering f of a graph [1287] new
G of size m as a labeling that assigns distinct elements of the set {1, 2, . . . , m} to the
edges of G. The edge-strength, estr(G), of G is defined as the minimum estrf (G) where
estrf (G) = max{f (e1 ) + f (e2 ) | e1 , e2 are adjacent edges of G} over all edge numberings
of G. They present formulas for estr(G) when G is the forest whose components are stars
of order at least three and the complete bipartite graph whose partite sets consist of at
least two vertices. The edge-strength of a graph G is the strength of the line graph of G,
and thus this work extends what was known about the edge-strength and strength.

Fibonacci range labelings

A simple finite graph G with p vertices and q edges is said to be a Fibonacci range graph if
there is a bijective f : V (G) → {F2 , F3 , F4 , . . . , Fp+1 }, where Fi is the ith Fibonacci num-
ber, such that the induced edge labels given by f ∗ (uv) = d(f (u)2 + f (v)2 )/(f (a) + f (b))e
or f ∗ (uv) = b(f (u)2 + f (v)2 )/(f (a) + f (b))c can be assigned subscripts 1, 2, . . . , n in such
a way that the ratios e − 1/e2 , e2 /e3 , . . . , en−1 /en approach the golden ratio φ = 1.618 . . .
. In [2318] Odyuo and Mercy classified k-copies of shell graph C[n, (n − 3)]k with a union [2318] new
of K2 for n = 4, 2K2 for n = 6, and 3K2 for n = 8 having a common end vertex joined
to the apex of the shell are Fibonacci range graphs.

the electronic journal of combinatorics (2023), #DS6 404

’

References
[1] M. Aasi, M. Asif, T. Iqbal, and M. Ibrahim, Radio labelings of lexicographic
product of some graphs, J. Math., (2021) Art. ID 9177818, 6 pp. https://www.
hindawi.com/journals/jmath/2021/9177818/
[2] M. E. Abdel-Aal, Odd harmonious labelings of cyclic snakes, Internat. J. Appl.
Graph Theory Wireless Adhoc Networks and Sensor Networks, 5 (3) (2013) 1-13.
doi:10.5121/jgraphoc.2013.5301
[3] M. E. Abdel-Aal, New classes of odd graceful graphs, Internat. J. Appl. Graph
Theory in Wireless ad hoc Networks and Sensor Networks, 5(2) (2013) 1-12.
doi:10.5121/jgraphoc.2013.5201
[4] M. E. Abdel-Aal, New families of odd harmonious graphs, Internat. J. Soft Com-
put., Math. Control, 3(1) (2014) 1-13.
[5] M. E. Abdel-Aal1 and M. A. Seoud, Further results on odd harmonious graphs,
Internat. J. Appl. Graph Theory in Wireless Adhoc Networks and Sensor Networks,
8(3/4) (2016) 1-14. doi:10.5121/jgraphoc.2016.8401
[6] H. Abdo and D. Dimitrov, The total irregularity of a graph, arXiv:1207.5267v1
July 2012.
[7] R. J. R. Abel and M. Buratti, Some progress on (v, 4, 1) difference fami-
lies and optical orthogonal codes, J. Combin. Theory Ser. A, 106 (2004) 59-
75. https://www.researchgate.net/publication/220078766_Some_progress_
on_v_4_1_difference_families_and_optical_orthogonal_codes
[8] K. Abhishek, A note on set-indexed graphs, J. Disc. Math. Sci. Crypt. 18 (2015)
31-40.
[9] K. Abhishek, Set-valued graphs: a survey, J. Disc. Math. Sci. Crypt. 18 (2015)
55-80.
[10] K. Abhishek, Set-valued graphs II, J. Fuzzy Set Valued Analysis, 2013 (2013) 1-16.
[11] K. Abhishek and G. K. Agustine, Set-valued graphs, J. Fuzzy Set Valued Analysis,
2012 (2012) 17 pages.
[12] V. J. Abhyankar, Direct Methods of Gracefully Labeling Graphs, Ph. D. Thesis,
University of Mumbai, 2002.
[13] V. J. Abhyankar and V. N. Bhat-Nayak, Easiest graceful labeling of olive trees,
Bull., Bombay Math. Coll., 14 (2000) 16-25.
[14] V. J. Abhyankar and V. N. Bhat-Nayak, personal communication (2001).
[15] P. Abirami, A. Parthiban, and N. Srinivasan, On 2-odd labeling of
graphs, European J. Molecular & Clinical Medicine, 07(07) (2020) 3914-3918.
doi:https://doi.org/10.1016/0012-365X(93)E0095-L

the electronic journal of combinatorics (2023), #DS6 405

 [16] P. Abirami, A. Parthiban, and N. Srinivasan, Some results on 2-odd label-
ing of graphs, Internat. Recent Tech. Eng., (IJRTE), 8(5) (2020) 5644-5646.
doi:DOI:10.35940/ijrte.E7041.018520
[17] T. Abraham and S. Jose, Fibonacci product cordial graphs, J. Emerging Tech.
Innovative Res., 6(1) (2019) 58-63.
[18] J. Abrham, Perfect systems of difference sets-A survey, Ars Combin., 17A (1984)
5-36.
[19] J. Abrham, Graceful 2-regular graphs and Skolem sequences, Discrete Math., 93
(1991) 115-121.
[20] J. Abrham, M. Carter, and K. Eshghi, personal communication (circa 1995).
[21] J. Abrham and A. Kotzig, Extensions of graceful valuations of 2-regular graphs
consisting of 4-gons, Ars Combin., 32 (1991) 257-262.
[22] J. Abrham and A. Kotzig, Two sequences of 2-regular graceful graphs consist-
ing of 4-gons. Fourth Czechoslovakian Symposium on Combinatorics, Graphs and
Complexity (Prachatice, 1990), 1-4, Ann. Discrete Math., 51, North-Holland, Am-
sterdam, 1992.
[23] J. Abrham and A. Kotzig, All 2-regular graphs consisting of 4-cycles are grace-
ful, Discrete Math., 135 (1994) 1-14. https://doi.org/10.1016/0012-365X(93)
E0095-L
[24] J. Abrham and A. Kotzig, Graceful valuations of 2-regular graphs with two
components, Discrete Math., 150 (1996) 3-15. https://doi.org/10.1016/
0012-365X(95)00171-R
[25] E. A. AbuHijleh, O. A. AbuGhneim, and H. Al-Ezeh, Characterizing when powers
of a caterpillar are divisor graphs, Ars Combin., 113A (2014) 85-89.
[26] E. A. AbuHijleh, O. A. AbuGhneim, and H. Al-Ezeh, Characterizing which powers
of hypercubes and folded hypercubes are divisor graphs, Discuss. Math. Graph
Theory, 35(2) (2015) 301-311. doi:10.7151/dmgt.1801
[27] B. D. Acharya, Construction of certain infinite families of graceful graphs from a
given graceful graph, Def. Sci. J., 32 (1982) 231-236.
[28] B. D. Acharya, On d-sequential graphs, J. Math. Phy. Sci., 17 (1983) 21-35.
[29] B. D. Acharya, Set valuations of a graph and their applications, MRI Lecture Notes
in Applied Mathematics, No. 2, Mehta Research Institute, Allahabad, 1983.
[30] B. D. Acharya, Are all polyominoes arbitrarily graceful?, Proc. First Southeast
Asian Graph Theory Colloquium, Ed. K. M. Koh and H. P. Yap, Springer-Verlag,
N. Y. 1984, 205-211.
[31] B. D Acharya and S. Arumugarn, Labeling of discrete structures in Labeling of
Discrete Structures and Applications, Narosa Publishing House, New Delhi, 2008,
1-14.
[32] B. D. Acharya, S. Arumugarn, and A. Rosa, Labeling of Discrete Structures and
Applications, Narosa Publishing House, New Delhi, 2008.

the electronic journal of combinatorics (2023), #DS6 406

 [33] B. D. Acharya and K. A. Germina, Strongly k-indexable unicyclic graphs, Graph
Theory Notes N. Y., 55 (2008) 45-49.
[34] B. D. Acharya and K. A. Germina, Set-valuations of graphs and their appli-
cations: A survey, Annals Pure Appl. Math., 4(1) (2013) 8-42. https://pdfs.
semanticscholar.org/e438/81bc8a4f04508693916f527945ac0b7b1b6a.pdf
[35] B. D. Acharya and K. A. Germina, Maximal strongly k-indexable graphs, J.
Combin. Math. Combin. Comput., 76 (2011) 75-99.
[36] B. D. Acharya, K. A. Germina, K. Abhishek, and P. J. Slater, Some new results
on set-graceful and set-sequential graphs, Combin. System Sci., 37(2-4) (2012)
229-239.
[37] B. D. Acharya, K. A. Germina, and V. Ajitha, Multiplicatively indexable graphs,
in Labeling of Discrete Structures and Applications, Narosa Publishing House,
New Delhi, 2008, 29-40.
[38] B. D. Acharya, K. A. Germina, and T. M. K. Anandavally, Some new perspectives
on arithmetic graphs, in Labeling of Discrete Structures and Applications, Narosa
Publishing House, New Delhi, 2008, 41-46.
[39] B. D. Acharya, K. A. Germina, K. L. Princy, and S. B. Rao, On set-valuations
of graphs, in Labeling of Discrete Structures and Applications, Narosa Publishing
House, New Delhi, 2008, 47-56.
[40] B. D. Acharya, K. A. Germina, K. L. Princy, and S. B. Rao, Graph labellings,
embedding and N P -completeness theorems, J. Combin. Math. Combin. Comput.,
67 (2008) 163-180.
[41] B. D. Acharya and M. K. Gill, On the index of gracefulness of a graph and the
gracefulness of two-dimensional square lattice graphs, Indian J. Math., 23 (1981)
81-94.
[42] B. D. Acharya and S. M. Hegde, Further results on k-sequential graphs, Nat. Acad.
Sci. Lett., 8 (1985) 119-122.
[43] B. D. Acharya and S. M. Hegde, Set sequential graphs, Nat.Acad. Sci. Lett., 8
(1985) 387-390.
[44] B. D. Acharya and S. M. Hegde, Arithmetic graphs, J. Graph Theory, 14 (1990)
275-299.
[45] B. D. Acharya and S. M. Hegde, Strongly indexable graphs, Discrete Math., 93
(1991) 123-129.
[46] B. D. Acharya and S. M. Hegde, On certain vertex valuations of a graph I, Indian
J. Pure Appl. Math., 22 (1991) 553-560.
[47] B. D. Acharya, S. B. Rao, and S. Arumugan, Embeddings and NP-complete
problems for graceful graphs, in Labeling of Discrete Structures and Applications,
Narosa Publishing House, New Delhi, 2008, 57-62.

the electronic journal of combinatorics (2023), #DS6 407

 [48] B. D. Acharya, S. B. Rao, T. Singh, and V. Parameswaran, Some sigma labelled
graphs, Presented at 19th Annual Conference of Ramanujan Mathematical Society,
held at Dr. B. R. Ambedkar University, Agra, July 21-24, 2004.
[49] B. D. Acharya, S. B. Rao, T. Singh, and V. Parameswaran, Neighborhood magic
graphs, 2004, unpublished.
[50] M. Acharya and V. Bhat-Nayak, Minimal 4-equitability of C2n K1 , Ars Combin.,
65 (2002) 209-236.
[51] M. Acharya and V. Bhat-Nayak, k-equitability of C2n K1 , k = 2, 2n and associ-
ated graphs. Util. Math., 68 (2005) 109-130.
[52] M. Acharya, R. Jain, and S. Kansal, Vertex equitable labeling of signed graphs,
Elect. Notes Discr. Math., 63 (2017) 461-468.
[53] M. Acharya and T. Singh, Graceful signed graphs, Czechoslovak Math. J., 54(129)
(2004) 291-302.
[54] D. G. Adalja and G. V. Ghodasara, Sum divisor cordial labeling in the context of
duplication of graph elements, Mathematics Today, 35 (2019) 61-83.
[55] M. Adamaszek, Efficient enumeration of graceful permutations, J. Combin. Math.
Combin. Comput., 87 (2013) 191-197. https://arxiv.org/pdf/math/0608513.
pdf
[56] R. Adawiyah, I. I. Makhfudloh, and R. M. Prihandini, Local edge
(a, d)-antimagic coloring on sunflower, umbrella graph and its ap-
plication, Alifmatika J. Pendidikan dan Pembelajaran Matematika,
https://www.researchgate.net/publication/371884100_Local_edge_a_d_
-antimagic_coloring_on_sunflower_umbrella_graph_and_its_application
[57] T. C. Adefokun and D. O. Ajayim On the bounds of the radio num-
bers of stacked-book graph, Internat. J. Math. Combin., 4 (2022) 66-73.
https://www.researchgate.net/publication/370937821_Vol42022_of_
International_Journal_of_Mathematical_Combinatorics/
[58] C. Adiga, H. Ramashekar, and D. Somashekara, A note on strongly multiplicative
graphs, Discuss. Math., 24 (2004) 81-83.
[59] C. Adiga and D. Somashekara, Strongly ?-graphs, Math. Forum, 13 (1999/00)
31-36.
[60] C. Adiga, C. K. Subbaraya, A. S. Shrikanth and M. A. Sriraj, On vertex balance
index set of some graphs, Bull. Iran. Math. Soc., 39 (4) (2013) 627-634.
[61] M. Aftiana and D. Indriati, On edge irregular total k-labeling and total edge irreg-
ularity etrength of barbell graphs, J. Physics Conference Ser., (2019) 1306:012031
1-7.
[62] H. U. Afzal On super edge-magicness of two special families of graphs, Util. Math.
97 (2015) 97-108.
[63] H. U. Afzal, M. Ather, A. Q. Baig, and A. Maheshwari, Further results on super
edge-magic graphs, Util. Math., 110 (2019) 283-291.

the electronic journal of combinatorics (2023), #DS6 408

 [64] H. U. Afzal and M. Aslam, On the deficiency of disjoint union of further planar
classes of graphs, Util. Math., 105 (2017) 207-218.
[65] H. U. Afzal, M. Javaid, A. M. Alanazi, and M. G. Alshehri, Computing edge
weights of symmetric classes of networks, Mathematical Problems in Engineer-
ing, 2021 2021 Article ID 5562544, 22 pages. https://doi.org/10.1155/2021/
5562544
[66] A. Agarwal and M. Lopez, Representation number for complete graphs minus stars,
J. Combin. Math. Combin. Comput., 87 (2013) 33-41.
[67] P. Agasthi and N. Narvathi, On some labeling of triangular snake and
central graph of triangular snake graph, In: Nat. Conf. Math. Tech.
Appl., (NCMTA) (2018) 1-19. https://iopscience.iop.org/article/10.1088/
1742-6596/1000/1/012170
[68] A. Aguado and S. El-Zanati, On σ-labeling the union of three cycles, J. Combin.
Math. Combin. Comput., 64 (2008) 33-48.
[69] A. Aguado, S. El-Zanati, H. Hake, J. Stob, and H. Yayla, On ρ-labeling the
union of three cycles, Australas. J. Combin., 37 (2007) 155-170.
[70] I. H. Agustin, Dafik, Marsidi, E. R. Albirri, On the total H-irregularity
strength of graphs: A new notion, J. Physics: Conf. Series, 855 (2017) 012004
doi:10.1088/1742-6596/855/1/012004
[71] I. H. Agustin, D. Dafik, N. Mohanapriya, M. Marsidi, and I. N. Cangul, The
distance irregular reflexive k-labeling of graphs, CAUCHY –J. Mat. Murni dan
Aplikasi, 7(4) (2023) 622-630. https://www.researchgate.net/publication/
371005283_The_Distance_Irregular_Reflexive_k-Labeling_of_Graphs
[72] I. H. Agustin, M. Hasan, Dafik, R. Alfarisi and R. M. Prihandini, Local edge
antimagic colorings of graphs, Far East J. Math. Sci., (FJMS) 102(9) (2017) 1925-
1941. doi:10.17654/MS102091925
[73] I. H. Agustin, F. Susanto, Dafik, R. M. Prihandini, R. Alfarisi, and I. Sudarsana,
On H-supermagic labelings of m-shadow of paths and cycles, Int. J. Math. Math.
Sci., (2019) Art. ID 8780329, 7 pp. https://doi.org/10.1155/2019/8780329
[74] I. H. Agustin, M. Iman Utoyo, Dafik, and M. Venkatachalam, The reflexive edge
strength on some almost regular graphs, Heliyon 7 (2021) https://doi.org/10.
1016/j.heliyon.2021.e06991
[75] A. Ahadi, A. Dehghan, M. Kazemi, and E. Mollaahmadi, Computation of lucky
number of planar graphs is NP-hard. Inform. Process. Let., 112(4) (2012) 109-112.
[76] A. Ahmad, On vertex irregular total labeling of convex polytope graphs, Util.
Math., 89 (2012) 69-78.
[77] A. Ahmad, Computing the edge irregularity strength of certain unicyclic graphs,
unpublished.
[78] A. Ahmad, Computing 3-total edge product cordial labeling of generalized Petersen
graphs P (n, m), Ars Combin., 137 (2018) 263-271.

the electronic journal of combinatorics (2023), #DS6 409

 [79] A. Ahmad, Computing the total vertex irregularity strength associated with zero
divisor graph of commutative ring, Kragujevac J. Math., 46(5) (2022) 711-719.
https://imi.pmf.kg.ac.rs/kjm/pub/kjom465/kjm_46_5-4.pdf
[80] S. Ahmad, On the evaluation of a subdivision of the ladder graph, Punjab Univ. J.
Math. (Lahore), 47(1) (2015) 15-19. http://pu.edu.pk/images/journal/maths/
PDF/1_4-02-09.pdf
[81] A. Ahmad, S. Ahtsham, H. B. M. Imran, and A. Q. Baig, Vertex irregular labelings
of cubic graphs, Util. Math., 91 (2013) 287-299.
[82] Y. Ahmad, U. Ali, M. Bilal, S. Zafar, Z. Zahid, Some new standard graphs labeled
by 3-total edge product cordial labeling, Appl. Math. Nonlinear Sci.,2(1) (2017)
61-72.
[83] A. Ahmad, K. Ali, M. Bača, P. Kovář, and A. Semaničová-Feňovčı́ková,
Vertex-antimagicness of regular graphs, Acta Math. Sinica, English series, 28(9)
(2012) 1865-1874. https://www.researchgate.net/publication/257481499_
Vertex-antimagic_labelings_of_regular_graphs
[84] A. Ahmad, O. Al-Mushayt, M. Bača, On edge irregular strength of graphs, Appl.
Math. Comput., 243 (2014) 607-610.
[85] A. Ahmad, K. Ali, and E. Baskoro, On super edge-magic total labelings of a forest
of banana trees, Util. Math., 83 (2010) 323-332
[86] A. Ahmad, M. Arshadb, and G. Iz̆arı́ková, Irregular labelings of helm and sun
graphs, AKCE Internat. J. Graphs Combin., 12 (2015) 161-168. https://doi.
org/10.1016/j.akcej.2015.11.010
[87] A. Ahmad, K. M. Awan, I. Javaid, and Slamin, Total vertex irregularity strength
of wheel related graphs, Australas. J. Combin., 51 (2011) 147-156. https://ajc.
maths.uq.edu.au/pdf/51/ajc_v51_p147.pdf
[88] A. Ahmad and M. Bača, On edge irregular total labeling of cer-
tain family of graphs, AKCE J. Graphs Combin., 6 (2009) 21-29.
https://www.researchgate.net/publication/261951606_Edge_irregular_
total_labeling_of_certain_family_of_graphs#fullTextFileContent
[89] A. Ahmad and M. Bača, On vertex irregular total labeling, Ars Combin., 112
(2013) 129-139.
[90] A. Ahmad and M. Bača, Total edge irregularity strength of the cat-
egorical product of two paths, Ars Combin., 114 (2014) 203-212.
https://www.researchgate.net/publication/262685108_Total_edge_
irregularity_strength_of_a_categorical_product_of_two_paths
[91] A. Ahmad, M. Bača, and Y. Bashir, Total vertex irregularity strength of certain
classes of unicyclic graphs, Bull. Math. Soc. Sci. Math. Roumanie, 57(2) (2014)
147-152. https://www.researchgate.net/publication/262933043_Total_
vertex_irregularity_strength_of_certain_classes_of_unicyclic_graphs

the electronic journal of combinatorics (2023), #DS6 410

 [92] A. Ahmad, M. Bača, Y. Bashir, and M. K. Siddiqui, Total edge irregularity
strength of strong product of two paths, Ars Combin., 106 (2012) 449-459.
[93] A. Ahmad, M. Bača, M. Lascsáková, and A. Semaničová-Feňovčı́ková, Super
magic and antimagic labelings of disjoint union of plane graphs, Science In-
ternat., 24(1) (2012) 21-25. https://www.researchgate.net/publication/
262692776_Super_magic_and_antimagic_labelings_of_disjoint_union_of_
plane_graphs
[94] A. Ahmad, M. Bača, and M. F. Nadeen, On edge irregularity strength of Toeplitz
graphs, U.P.B. Sci. Bull., Series A, 78(4) (2016) 155-162.
[95] A. Ahmada, M. Bača, M. Naseem, and A. Semaničová-Feňovčı́ková, On 3-total
edge product cordial labeling of honeycomb, AKCE Internat. J. Graphs Combin.,
14 (2017) 149-157. https://doi.org/10.1016/j.akcej.2017.02.002
[96] A. Ahmad, M. Bača and M. Numan, On irregularity strength of disjoint union of
friendship graphs, Elect. J. Graph Th. App., 1(2) (2013) 100-108.
[97] A. Ahmad, M. Bača, and A. Semaničová-Feňovčı́ková, Computation of edge C4 -
irregularity strength of Cartesian product of graphs, J. Discrete Math. Sci. and
Crypt., (2022)
[98] A. Ahmad, M. Bača, and M. K. Siddiqui, On edge irregular total labeling of
categorical product of two cycles, Th. Comp. Systems, 54 (2014) 1-12. https:
//link.springer.com/article/10.1007/s00224-013-9470-3
[99] A. Ahmad, M. Bača, and M. K. Siddiqui, Irregular total labeling of dis-
joint union of prisms and cycles, Australas. J. Combin., 59(1) (2014)
98-106. https://www.researchgate.net/publication/261913345_Irregular_
total_labeling_of_disjoint_union_of_prisms_and_cycles
[100] A. Ahmad, A. Q. Baig, and M. Imran, On super edge-magicness of graphs,
Util. Math., 89 (2012) 373-380. https://www.researchgate.net/publication/
267145329_On_Super_Edge-magicness_of_Graphs
[101] M. A. Ahmed and J. B. Babujee, On face bimagic labeling of graphs, IOSR J.
Math., 12(6) VI (2016) 1-7. http://www.iosrjournals.org/iosr-jm/papers/
Vol12-issue6/Version-6/A1206060107.pdf
[102] A. Ahmad, E. T. Baskoro, and M. Imran, Total vertex irregularity strength of
disjoint union of Helm graphs, Discuss. Math. Graph Theory, 32(3) (2012) 427-
434. https://www.researchgate.net/publication/257922360_Total_vertex_
irregularity_strength_of_disjoint_union_of_Helm_graphs
[103] A. Ahmad, A. Gupta, and R. Simanjuntak, Computing the edge irregularity
strengths of chain graphs and the join of two graphs, Electron. J. Graph Theory
Appl., (EJGTA) 6(1) (2018) 201-207.
[104] A. Ahmad, R. Hasni, M. Irfan, M. Naseem, and M. K. Siddiqui, On 3-total
edge product cordial labeling of grid, Asian-Eur. J. Math., 4(6) (2021) Paper
No. 2150096, 10 pp. https://doi.org/10.1016/j.akcej.2017.02.002

the electronic journal of combinatorics (2023), #DS6 411

 [105] A. Ahmad, M. Ibrahim, and M. K. Siddiqui, On the total irregularity strength
of generalized Petersen graph, Math. Rep. (Bucur.), 18(68) no. 2 (2016) 197-204.
http://imar.ro/journals/Mathematical_Reports/Pdfs/2016/2/5.pdf
[106] A. Ahmad, M. Imran, and A. Semaničová-Feňovčı́ková, Relation between mean
labeling and (a; d)-edge antimagic vertex labeling, Sci. Internat., 24(1)(2012) 7-9.
[107] A. Ahmad, I. Javaid, and M. F. Nadeem, Further results on super edge magic
deficiency of unicyclic graphs, Ars Combin., 99 (2011) 129-138.
[108] A. Ahmad, I. Javaid, M. F. Nadeem, and R. Hasni, On super edge magic deficiency
of some families related to ladder graphs, Australas. J. Combin., 51 (2011) 201-208.
http://ajc.maths.uq.edu.au/pdf/51/ajc_v51_p201.pdf
[109] A. Ahmad, S. S. Khan, S. Ahmad, M. F. Nadeem, and M. K. Siddiqui, Edge
irregularity strength of categorical product of two paths, Ital. J. Pure Appl.
Math., 45 (2021) 801-813. https://ijpam.uniud.it/online_issue/202145/63%
20Siddiqui_et_all_(edge).pdf
[110] A. Ahmad, S.C. López, F.A. Muntaner-Batle, and M. Rius-Font, Enumerating
super edge-magic labeling for the union of non-isomorphic graphs, Bull. Aust.
Math. Soc., 84 (2011)(2) 310-321.
[111] A. Ahmad and R. Marinescu-Ghemeci, Radio labeling of some ladder-related
graphs, Math. Rep. (Bucur.) 19(69) (2017), no. 1, 107-119. http://imar.ro/
journals/Mathematical_Reports/Pdfs/2017/1/11.pdf
[112] A. Ahmad, M. Nadeem, and A. Gupta, On super edge-magic deficiency of certain
Toeplitz graphs, Hacet. J. Math. Stat., 47(3) (2018) 513-519. http://www.hjms.
hacettepe.edu.tr/uploads/45dfc139-090e-4fde-b21f-6a880aef6761.pdf
[113] A. Ahmad, Nurdin, and E. T. Baskoro, On total irregularity strength
of generalized Halin graph, Ars Comb., 122 (2015) 319-332. https:
//www.researchgate.net/publication/296415305_On_total_irregularity_
strength_of_generalized_Halin_graph
[114] A. Ahmed, Al-M. Omar, and M. Bač, On edge irregularity strength of graphs, On
edge irregularity strength of graphs, Appl. Math. Comput. 1 (2014) 16-28.
[115] A. Ahmad, A. Semaničová-Feňovčı́ková, and M. K. Siddiqui, Construction of α-
tree from smaller graceful trees, Util. Math., 99 (2016) 175-186.
[116] A. Ahmad, M. K. Siddiqui, and D. Afzal, On the total edge irregularity strength
of zigzag graphs, Australas. J. Combin., 54 (2012) 141-149.
[117] A. Ahmad, M. K. Siddiqui, M. F. Nadeem, and M. Imran, On su-
per edge magic deficiency of kite graphs, Ars Combin., 107 (2012)
201-208. https://www.researchgate.net/publication/265504052_On_super_
edge_magic_deficiency_of_kite_graphs
[118] A. Ahmad and I. Tomescu, On vertex-magic total labelings of some fam-
ilies of rotationally-symmetric graphs, Util. Math., 86 (2011) 347-357.

the electronic journal of combinatorics (2023), #DS6 412

 https://www.researchgate.net/publication/268442776_On_vertex-magic_
total_labeling_of_some_families_of_rotationally-symmetric_graphs
[119] M. A. Ahmed, J. Babujee, M. Bača, and A. Semaničová-Feňovčı́ková, On totally
antimagic, edge-magic and vertex-antimagic total graphs, Util. Math., 111 (2019)
161-173. http://www.rjm-cs.ro/Ahmed_Babujee_2017_3.pdf
[120] M. A. Ahmed and J. Baskar Babujee, Totally antimagic total labeling of complete
bipartite graphs, Rom. J. Math. Comput. Sci., 7(1) (2017) 21-28.
[121] M. A. Ahmed, and J. Baskar Babujee, Encryption through labeled graphs using
strong face bimagic labeling, Internat. Math. Forum, (2017) 151-158.
[122] M. A. Ahmed and J. B. Babujee, On face antimagic labeling of strong face plane
graphs, Appl. Math. Sci., (2017) 11 77-91. doi:10.12988/AMS.2017.610262
[123] M. A. Ahmed, A. Semaničová-Feňovčı́ková, M. Bača, J. Baskar Babujee, and L.
Shobana, On graceful antimagic graphs, Aequat. Math., Springer Nature Switzer-
land AG 2022. https://doi.org/10.1007/s00010-022-00930-1
[124] T. Ahmed and H. Snevily, The α-labeling number of comets is 2, Bull. Inst. Com-
bin. Appl., 72 (2014) 25-40.
[125] M. Aigner and E. Triesch, Irregular assignments of trees and forests, SIAM J.
Discrete Math., 3(4) (1990) 439-449.
[126] D. O. Ajayi and T. C. Adefokun, On bounds of radio number of certain product
graphs, J. Nigerian Math. Soc., 48(2) (2018) 71-78. https://ojs.ictp.it/jnms/
index.php/jnms/article/view/330/57
[127] V. Ajitha. K. L. Princy, V. Lokesha, and P. S. Ranjini, On square difference graphs,
Math. Combin. Internat. Book Ser., 1 (2012) 31-40.
[128] A. Aishwarya, Lucky edge labeling of certain graphs, IJIRSET, 4 (2015) 469-471.
https://docslib.org/doc/4217723/lucky-edge-labeling-of-certain-graphs
doi:10.15680/IJIRSET.2015.0401099
[129] S. Akbari, N. Ghareghani, G. Khosrovshahi, and S. Zare, A note on zero-sum
5-flows in regular graphs, Electron. J. Combin., 19(2) (2012), Paper 7, 5 pp.
[130] S. Akbari, M. Kano, S. Zare, 0-Sum and 1-sum flows in regular graphs, Electronic
J. Combin., 23(2) (2016) #P2.37 10pp. https://www.combinatorics.org/ojs/
index.php/eljc/article/view/v23i2p37/pdf
[131] S. Akbari, F. Rahmati, and S. Zare, Zero-sum magic labelings and null sets of
regular graphs. Electronic J. Combin., 21(2) (2014) Paper 2.17, 9 pp.
[132] P. Z. Akbari1, V. J. Kaneria, and N. A. Parmar, Absolute mean graceful labeling
of jewel graph and jelly fish graph, Internat. J. Math. Trends Tech., 68(1) (2022)
86-93. 10.14445/22315373/IJMTT-V68I1P510
[133] K. Akilandeswari, k-Super root square mean labeling of some graphs, Internat. J.
Sci. Res., (IJSR) 6(2) (2017). https://bit.ly/2YxOkZB
[134] K. Akilandeswari and M. Tamilselvi, On k-Heronian mean labeling, Internat. J.
Innovative Res. Sci., Eng. Tech. 6(9) (2017) 18019-18023.

the electronic journal of combinatorics (2023), #DS6 413

 [135] K. Akilandeswari and M. Tamilselvi, k-Heronian mean labeling of some graphs,
Internat. J. Pure Appl. Math., 117(12) (2017) 173-180.
[136] D. G. Akka and N. S. Warad, Super magic strength of a graph, Indian J. Pure
Appl. Math., 41(4) (2010) 557-568.
[137] R. Akhtar, A. B. Evans, and D. Pritikin, Representation numbers of stars, Integers,
10 (2010), A54, 733-745.
[138] R. Akhtar, A. B. Evans, and D. Pritikin, Representation numbers of complete
multipartite graphs, Discrete Math., 312(6) (2012) 1158-1165.
[139] R. Akhtar, The representation number of some sparse graphs, Discrete Math.,
312(22) (2012) 3417-3423.
[140] A. D. Akwu and D. O. A. Ajayi, On totally antimagic total lableings of
complete bipartite graphs, Roman. J. Math. Comput. Sci., 7(1) 21-28.
arXiv:1601.02112v1 [math. CO] 9 Jan 2016. https://www.researchgate.
net/publication/290263695_On_totally_antimagic_total_labeling_of_
complete_bipartite_graphs
[141] S. Al-Addasi, O. A. AbuGhneim and H. Al-Ezeh, Divisor orientations
of powers of paths and powers of cycles. Ars Combin. 94 (2010) 371-
380. https://www.researchgate.net/publication/264964064_Divisor_
orientations_of_powers_of_paths_and_powers_of_cycles
[142] S. Al-Addasi, O. A. AbuGhneim and H. Al-Ezeh, Merger and vertex
splitting in divisor graphs, Internat. Math. Forum, 5(38) (2010) 1861-
1869. https://www.researchgate.net/publication/260351030_Merger_and_
Vertex_Splitting_in_Divisor_Graphs
[143] S. Al-Addasi, O. A. AbuGhneim and H. Al-Ezeh, Characterizing powers of cycles
that are divisor graphs, Ars Combin., 97A (2010) 447-451.
[144] S. Al-Addasi, O. A. AbuGhneim and H. Al-Ezeh, Further new properties of divisor
graphs, J. Combin. Math. Combin. Comput., 81 (2012) 261-272.
[145] K. A. Azizu, L. Yulianti, S. Sy, and N. Narwen, On super edge magic total labeling
of the branched-prism graph, Internat. J. Progressive Sci. Tech., 16(2) (2019) 203-
206. https://ijpsat.org/index.php/ijpsat/article/view/1288/659
[146] K. Al Azizu, L. Yulianti, N. Narwen, and S. Sy, On super (a, d)-edge antimagic
total labeling of branched-prism graph, Indonesian J. Combin., 5(1) (2021) 11-16.
doi:10.19184/ijc.2021.5.1.2
[147] R. E. L. Aldred and B. D. McKay, Graceful and harmonious labellings of trees.
http://users.cecs.anu.edu.au/~bdm/papers/graceful.pdf
[148] R. E. L. Aldred, J. Širáň and M. Širáň, A note on the number of graceful labelings
of paths, Discrete Math., 261 (2003) 27-30.
[149] M. Alfalayleh, L. Brankovic, H. Giggins, M. Z. Islam, Towards the Graceful Tree
Conjecture: A survey, In: Proceed. AWOCA 2004, 7-9 July, Ballina, Austrtalia
(2004).

the electronic journal of combinatorics (2023), #DS6 414

 [150] G. Ali, M. Bača, F. Bashir, and A. Semaničová, On super vertex-antimagic labeling
of disjoint union of paths, AKCE J. Graphs Combin., 6 (2009) 11-20.
[151] G. Ali, M. Bača, M. Lascsaková, A Semaničová-Feňovčıková, A. ALoqaily, and N.
Mlaiki, Modular total vertex irregularity strength of graphs, AIMS Mathematics,
8(4) (2023) 7662-7671 doi:10.3934/math.2023384
[152] G. Ali, M. Bača, F. Bashir, and A. Semaničová, On face antimagic labeling of
disjoint union of prisms, Util. Math., 85 (2011) 97-112.
[153] G. Ali, M. Bača, Y. Lin, and A. Semaničová-Feňovčiková, Super-vertex-antimagic
total labelings of disconnnected graphs, Discrete Math., 309 (2009) 6048-6054.
[154] K. Ali, M. Hussain, A. Ahmad and M. Miller, Magic Labelings of type (a, b, c) of
families of wheels, Math. Computer Sci., 7 (2013) 315-319.
[155] K. Ali, M. Hussain, and Razzaq, Super edge-magic total labeings of a tree, Util.
Math., 91 (2013) 355-364.
[156] K. Ali, M. Hussain, H. Shaker, and M. Javaid, Super edge-magic total labeling of
subdivided stars, Ars Combin., 120 (2015) 161-167.
[157] K. Ali, S. T. R. Rizvi, and A. Semaničová-Feňovčiková, C4 -supermagic labelings
of disjoint union of prisms, Math. Rep. (Bucur.), 18(68) (2016) no. 3, 315-320.
[158] M. Ali, M.T Rahim, G. Ali, and M. Farooq, An upper bound for the radio number
of generalized gear graph, Ars Combin., 107 (2012) 161-168.
[159] S. Alikhani, W. Kocay, G.-C. Lau, and S.-M. Lee, On the k-edge magic graphs,
Elect. Notes Disc. Math., 45 (2014) 35-41.
[160] M. M. Ali Al-Shamiri, A. ELrokh, Y. El–Mashtawye, and S. Euat Tallah, The
cordial labeling for the Cartesian product between paths and cycles, Internat. J.
Res.,- Granthaalayah, 8(3) (2020) 331-341. https://doi.org/10.5281/zenodo.
3742934.
[161] V. Ajtha, S. Arumugam, and K. A. Germina, On square sum graphs, AKCE J.
Graphs Combin., 6 (2009) 1-10.
[162] O. Al-Mushayt, On the edge irregularity strength of products of certain families
with P2 , Ars Combin., 135 (2017) 323-334.
[163] O. Al-Mushayt, A. Ahmad, and M. K. Siddiqui, On the total edge irregularity
strength of hexagonal grid graphs, Australas. J. Combin., 53 (2012) 263-271.
[164] O. Al-Mushayt, A. Arshad, and M. K. Siddiqui, Total vertex irregularity strength
of convex polytope graphs, Acta Math. Univ. Comenian. (N.S.), 82(1) (2013) 29-
37.
[165] O. Al-Mushayt, A. Ahmad, and M. K. Siddiqui, Irregular total labelings of convex
polytope graphs having the same diameter, Util. Math., 101 (2016) 295-307.
[166] N. Alon, Combinatorial nullstellensatz, Combinatorics, Probabability and Comput-
ing, 8 (1999) 7-29.

the electronic journal of combinatorics (2023), #DS6 415

 [167] N. Alon, G. Kaplan, A. Lev, Y. Roditty, and R. Yuster, Dense graphs are an-
timagic, J. Graph Theory, 47 (2004) 297-309.
[168] N. Alon and E. Scheinerman, Generalized sum graphs, Graphs and Combin., 8
(1992) 23-29.
[169] H. Alpert, Rank numbers of grid graphs, Discrete Math., 310 (2010) 3324-3333.
[170] H. Alpert, Rank numbers of path powers and grid graphs, personal communication
(2013).
[171] F. Alyani, F. Firmansah, W. Giyarti, and K. A. Sugeng, The odd harmonious
labeling of kCn snake graphs for spesific values, that is, for n = 4 and n = 8.
Proceed. IICMA 2013 Graph Combin., (2013) 225-230.
https://www.researchgate.net/publication/282355295_THE_ODD_
HARMONIOUS_LABELING_OF_kCn-_SNAKE_GRAPHS_FOR_SPESIFIC_VALUES_OF_
n_THAT_IS_FOR_n_4_AND_n_8
[172] D. Amar and O. Togni, Irregularity strength of trees, Discrete Math., 190(1-3)
(1998) 15-38.
[173] A. Amara Jothi, J. Baskar Babujee, and N. G. David, On face magic labeling of
duplication graphs. http://oaji.net/articles/2017/296-1504963989.pdf
[174] A. Amara Jothi, N. G. David, J. Baskar Babujee, Super edge bimagic labeling
graphs, Int. J. Math. Sci. Comput., 5(1) (2015) 39-43.
[175] B. Ambili and G. Suresh Singh, Graceful labeling of arbitrary strong supersubdi-
visions of graphs, Graph Theory Notes N. Y., 61 (2011) 31-36.
[176] M. Amini and K. Eshghi, Constraint programming models and population-based
simulated annealing algorithm for finding graceful and α-labeling of quadratic
graphs, Iran J. Comput. Sci., 1(3) (2018) 155-164.
[177] P. Amudha and J. Jayapriya, Pair sum modulo labeling of graph, Adv. Math.: Sci.
J., 10(2) (2021) 723-727. DOI:https://doi.org/10.37418/amsj.10.2
[178] P. Amudha, J. Jayapriya, and J. Gowri, An algorithmic approach for encryption
using graph labeling,
textitJ. Phys.: Conf. Ser., (2021) 1770 012072, 1-10. https://downloads.
hindawi.com/journals/mpe/2021/5562544.pdf
[179] S. Amutha and K. M. Kathiresan, Pendant edge extensions of two families of
graphs, Proceed. of the National Seminar on Algebra and Discrete Math., Univ.
Kerala, Thiruvananthapuram, India, 146-150.
[180] S. Amutha and M. Uma Devi, Super graceful labeling for some fam-
ilies of fan graphs, J. Comput. Math. Sci., 10(8) (2019) 1551-1562.
http://www.compmath-journal.org/dnload/S-Amutha-and-M-Uma-Devi-/
CMJV10I08P1551.pdf
[181] S. Amutha and M. Uma Devi, Total edge Fibonacci irregular labeling for fan,
wheel and umbrella graph, J. Comp. Math. Sci, 10(12) (2019) 1654-1664.

the electronic journal of combinatorics (2023), #DS6 416

 http://www.compmath-journal.org/dnload/S-Amutha-and-M-Uma-Devi-/
CMJV10I12P1654.pdf
[182] K. Amuthavalli, Graph Labeling and its Applications-Some Generalization of Odd
Mean Labelings, Ph. D. Thesis, (2010) Mother Teresa Women’s University, Ko-
daikanal Tamilnadu, India.
[183] D. Amuthavalli and M. Premkumar, Super Fibonacci graceful labeling of
some cycle related graphs, Internat. J. Math. Trends Tech.,38(3) (2016)
https://www.researchgate.net/publication/348002618_Super_Fibonacci_
Graceful_Labeling_Of_Some_Cycle_Related_Graphs
[184] K. Amuthavalli and S. Dineshkumar, k-Odd edge mean labeling of some ba-
sic graphs, J. Informatics Math. Sci., 9(3) (2017) 915-921. https://www.
rgnpublications.com/journals/index.php/jims/article/view/1012/757
[185] K. Amuthavalli and P. Sugapriya, Reverse super edge-trimagic labeling label-
ing for star related graphs, Malaya J. Mat., 7(3) (2019) 519-525. https://www.
malayajournal.org/articles/MJM07030025.pdf
[186] S. Anusa, S. S. Sandhya, and S. Somasundaram, New classes of mean graphs,
J. Disc. Math. Sci. Crypt.,, 22(3) (2019) 351-360. DOI:10.1080/09720529.2018.
1534369
[187] M. Andar, S. Boxwala, and N. Limaye, Cordial labelings of some wheel related
graphs, J. Combin. Math. Combin. Comput., 41 (2002) 203-208.
[188] M. Andar, S. Boxwala, and N. Limaye, A note on cordial labelings of multiple
shells, Trends Math., (2002) 77-80.
[189] M. Andar, S. Boxwala, and N. Limaye, On the cordiality of the t-uniform
homeomorphs–I, Ars Combin., 66 (2003) 313-318.
[190] M. Andar, S. Boxwala, and N. Limaye, On the cordiality of the t-uniform
homeomorphs–II (Complete graphs), Ars Combin., 67 (2003) 213-220.
[191] M. Andar, S. Boxwala, and N. Limaye, New families of cordial graphs, J. Combin.
Math. Combin. Comput., 53 (2005) 117-154.
[192] M. Andar, S. Boxwala, and N. Limaye, On the cordiality of the t-ply Pt (u, v), Ars
Combin., 77 (2005) 245-259.
[193] M. Andar, S. Boxwala, and N. Limaye, On the cordiality of corona graphs, Ars
Combin., 78 (2006) 179-199.
[194] P. P. Andharia and V. J. Kaneria, Even sum labeling of some graphs, Int. J. Comp.
Math. Sci., 7(5) (2018) 199-202.
[195] P. P. Andharia and V. J. Kaneria, Even sum property of Jn , B(3, n), T Bn , Pm (+)
Kn and (Kn ∪ P3 ) + 2K1 , IOSR J. Math., 18(1) Ser. II (2022) 24-30.
[196] D. A. Angel Sherin and V. Maheswari, Encoding and decryption process
using edge magic labeling, J. Physics Conf. Series 1362:012024 (2019)
doi:10.1088/1742-6596/1362/1/012024

the electronic journal of combinatorics (2023), #DS6 417

 [197] D. A. Angel Sherin, V. Maheswari, and V. Balaji, Encryption of dual num-
bers using edge injective labeling, Internat. J. Multidisciplnary Res. Arts,
Sci. Commerce, (IJMRASC) 1(40 (2021) 54-60. https://www.sdnbvc.edu.in/
wp-content/uploads/2022/01/PAPERID7.pdf
[198] M. Anholcer, Product irregularity strength of graphs, Discrete Math., 309 (2009)
6434-6439.
[199] M. Anholcer, Product irregularity strength of certain graphs, Ars Math. Contemp.,
7(1) (2014) 23-29.
[200] M. Anholcer and S. Cichacz, Group irregular labelings of disconnected graphs,
Contributions Discrete Math., 12(2) (2017) 158-166.
[201] M. Anholcer, S. Cichacz, Note on distance magic products G ◦ C4 , Graphs and
Combin., 31(5) (2015) 1117-1124. doi:10.1007/s00373-014-1453-x.
[202] M. Anholcer, S. Cichacz, D. Froncek, R. Simanjuntak, and J. Qiu, Group distance
magic and antimagic hypercubes,Discrete Math. (2021) http://kbo.ue.poznan.
pl/anholcer/publ/20210829_hypercubes.pdf
[203] M. Anholcer, S. Cichacz, R. Jura, A. Marczyk, Note on group irreg-
ularity strength of disconnected graphs, Open Math., 16 (2018) 154-160,
doi:10.1515/math-2018-0017.
[204] M. Anholcer, S. Cichacz, and M. Milanič, Group irregularity strength
of connected graphs, J. Combin. Optim., (2013) 30(1) (2015) 1-17.
doi:10.1007/s10878-013-9628-6
[205] M. Anholcer, S. Cichacz, I. Peterin, and A. Tepeh, Distance magic labeling
and two products of graphs, Graphs and Combin., 31(5) (2015) 1117-1124.
doi:10.1007/s00373-014-1455-8
[206] M. Anholcer, S. Cichacz, I. Peterin, and A. Tepeh, Distance magic labeling and
two products of graphs, Graphs Combin., 31(5) (2015) 1125-1136.
[207] M. Anholcer, S. Cichacz, I. Peterin, and A. Tepeh, Group distance magic labeling
of direct product of graphs, Ars Math. Contemp. 9 (2015) 93-108.
[208] M. Anholcer, S. Cichacz, and J. Przybylo, Linear bounds on nowhere-zero group ir-
regularity strength and nowhere-zero group sum chromatic number of graphs, Appl.
Math. Comput., Appl. Math. Comput., 343 (2019) 149-155. arXiv:1805.05204v1
[209] M. Anholcer, S. Cichacz, I. Peterin, and A. Tepeh, Group distance magic labeling
of direct product of graphs, Ars Math. Contemp., 9(1) (2015) 93-107.
[210] M. Anholcer, M. Karoński, and F. Pfender, Total vertex irregularity strength of
forests, Discrete Math., 312(2) (2012) 229-237. arXiv:1103.2087v1 [math.CO] 10
Mar. 2011.
[211] M. Anholcer, M. Karoński, and J. Przbylo, A new bound for the total vertex
irregularity strength of graphs, Discrete Math., 309 (2009) 6316-6317.
[212] M. Anholcer and C. Palmer, Irregular labelings of circulant graphs, Discrete Math.,
312(23) (2012) 3461-3466.

the electronic journal of combinatorics (2023), #DS6 418

 [213] D. J. Anick, Counting graceful labelings of trees: a theoretical and empirical study,
Discrete Appl. Math., 198 (2016) 65-81.
[214] K. Anitha, B. Selvam, and K. Thirusangu, Mean, odd mean and even mean la-
beling for the extended duplicate graph of kite graph, Inter. J. Math. Trends
Tech., 42(1) (2017) 39-44. http://www.ijmttjournal.org/2017/Volume-42/
number-1/IJMTT-V42P506.pdf
[215] K. Anitha, B. Selvam, and K. Thirusangu, k-Graceful, odd-even graceful, Heronian
mean and analytic mean labeling for the extended duplicate graph of kite graph,
Internat. J. Engin. Tech. 7(4.10) (2018) 355-359.
[216] K. Annathurai, R. Ponraj, and R. Kala, Some 3-remainder cordial graphs,Global
J. Engin. Sci. Res., 5(6) (2018) 169-175.
[217] K. Annathurai, R. Ponraj, and R. Kala, Further results on 3-remainder cordial
labeling of graphs, Internat. J. Management, IT Engin., 8(8) (2018) 120-129.
[218] A. Anto Kinsley and P. Siva Ananthi, DdDistance in graphs, Imperial J. Interdisc.
Res., 3(2) (2017) 2454-1362.
[219] S. Anusa, S. S. Sandhya, and S. Somasundaram, New classes of mean graphs, J.
Discrete Math. Sci. Cryptogr., 22(3) (2019) 351-360.
[220] R. Aravamudhan and M. Murugan, Numbering of the vertices of Ka,1,b , unpub-
lished.
[221] I. C. Arkut, R. C. Arkut, and A. Basak, Topology constrained label switching
for multicast routing, Proceed. Eighth IEEE Internat. Sympos. Comput. Comm.
(ISCC’03), 1530-1346/03 1-8. http://www.academia.edu/4370947/
[222] I. Arkut, R. Arkut, N. Ghani, Graceful label numbering in optical MPLS net-
works, In: Proc. SPIE, 4233 (2000) 1-8 OptiComm 2000: Optical Networking and
Communications. Imrich Chlamtac: Ed (2000).
[223] A. Armstrong and D. McQuillan, Vertex-magic total labelings of even complete
graphs, Discrete Math., 311 (2011) 676-683.
[224] S. T. Arockiamary, J. Baskar Babujee, and G. Vijayalakshmi, k-prime total label-
ing of graphs, Advances Appl. Disc. Math., 35 (2022) 45-59. http://dx.doi.org/
10.17654/0974165822051
[225] S. T. Arockiamary and G. Vijayalakshmi, Vertex k-prime labeling of cyclic
snakes, Comm. Math. Appl., 14(1) (2023) 9-20. https://www.researchgate.net/
publication/370927885_Vertex_k-Prime_Labeling_of_Cyclic_Snakes
[226] T. Arockiamary and G. Vijayalakshmi, Vertex k-prime labeling on graphs, Eu-
ropean Chem. Bull., 12(4) (2023) 9627-9633. https://www.researchgate.net/
publication/370927953_Vertex_k-Prime_Labeling_on_graphs
[227] S. Arockiaraj, A. Durai Baskar and A. Rajesh Kannan, F -root square mean label-
ing of graphs obtained from paths, Internat. J. Math. Combin., 2(2017), 92-104.
[228] S. Arockiaraj, A. Durai Baskar and A. Rajesh Kannan, F -root square mean label-
ing of line graph of some graphs, Utilitas Math., 112(2019), 11-32.

the electronic journal of combinatorics (2023), #DS6 419

 [229] S. Arockiaraj and P. Mahalakshmi, On odd sum graphs, Internat. J. Math. Com-
bin., 4 (2013) 59-78.
[230] S. Arockiaraj, P. Mahalakshmi, and P. Namasivayam, Odd sum labeling of some
subdivision graphs, Kragujevac J. Math., 38(1) (2014) 203-222. http://elib.mi.
sanu.ac.rs/files/journals/kjm/42/kjom3801-16.pdf
[231] S. Arockiaraj, P. Mahalakshmi, and P. Namasivayam, Odd sum labelings of some
splitting graphs, Util. Math., 105 (2017) 53-73.
[232] S. Arockiaraj, P. Mahalakshmi, and P. Namasivayam, Odd sum labeling of graphs
obtained by duplicating any edge of some graphs. Electron. J. Graph Theory Appl.
(EJGTA), 3(2) (2015) 197-215.
[233] S. Arockiaraj, P. Mahalakshmi, and P. Namasivayam, Odd sum labeling of graphs
obtained from some graph operations, J. Graph Labeling, 2(2) (2015) 217-233.
[234] S. Arockiaraj and A. Meena, On F-face magic mean labeling of some planar graphs,
Internat. J. Pure Appl. Math., 117(6) (2017) 1-8. https://acadpubl.eu/jsi/
2017-117-5-6/articles/6/1.pdf
[235] S. Arockiaraj and A. Meena Kumari, On F-face magic mean labeling of some
duplicated graphs, Internat. J. Appl. Math., 31(2) (2018) 231-240.
[236] S. Arockiaraj, A. Rajesh Kannan, and A. Durai Baskar, Super F -centroidal mean
graphs, Internat. J. Math. Combin., 3 (2019) 113-127.
[237] S. Arockiaraj, A. Rajesh Kannan, and A. Durai Baskar, F -centroidal mean labeling
of graphs obtained from paths, Internat. J. Math. Combin., 4 (2019) 122-135.
[238] S. Arockiaraj, A. R. Kannan, P. Manivannan, and A. Durai Baskar, FCM labeling
of some graphs and its line graph, J. Physics: Confer. Ser., 1597 (2020) 012033
1-8. DOI:10.26637/MJM0703/0025
[239] S. Arockiamary and G. Vijayalakshmi, k-prime total labeling of shell related
graphs, Adv. Appl. Discr. Math., 39(1) (2023) 1-27. http://dx.doi.org/10.
17654/0974165823033
[240] S. Arumugam and J. Bagga, Graceful labeling algorithms and complexity—a sur-
vey, Indones. Math. Soc., Special Edition (2011) 1-9.
[241] S. Arumugam, D. Fronček, and N. Kamatchi, Distance magic graphs—a survey, J.
Indonesian Math. Soc., Special Edition, 11–26 (2011).
[242] S. Arumugam and K. Germina, On indexable graphs, Discrete Math., 161 (1996)
285-289.
[243] S. Arumugam, K. Germina, and T. Anandavally, On additively geometric graphs,
J. Combin. Math. Combin. Comput., 70 (2009) 207-216.
[244] S. Arumugam and N. Kamatchi, On (a, d)-distance antimagic graphs, Australas.
J. Combin., 54 (2012) 279-287.
[245] S. Arumugam, N. Kamatchi, and P. Kovář, Distance magic graphs, Util. Math.,
99 (2016) 131-142. https://www.researchgate.net/publication/305426259_
Distance_Magic_Graphs/link/58df56cf4585153bfe947e3e/download

the electronic journal of combinatorics (2023), #DS6 420

 [246] S. Arumugam, Y.-C. Lee, K. Premalatha, T.-M. Wang, On local antimagic vertex
coloring for corona products of graphs, arXiv:1808.04956.pdf.
[247] S. Arumugam, M. Miller, O. Phanalasy, and J. Ryan, Antimagic labeling
of generalized pyramid graphs, English Series Acta Mathematica Sinica, 30
(2) (2014) 283-290. https://actamath.cjoe.ac.cn/Jwk_sxxb_en/EN/10.1007/
s10114-014-2381-7
[248] S. Arumugam and M. Nalliah, Super (a, d)-edge antimagic total labelings of friend-
ship and generalized friendship graphs, The Eighth International Workshop on
Graph Labelings (IWOGL 2014), 103-110,
[249] S. Arumugam and M. Nalliah, Super (a, d)-edge antimagic total labelings of
friendship graphs, Australas. J. Combin., 53 (2012) 237-243.
https://www.researchgate.net/publication/269010612_Super_
ad-edge_antimagic_total_labelings_of_friendship_graphs/link/
5779f9d708ae4645d611f51d/download
[250] S. Arumugam and M. Nalliah, Super (a, 3)-edge-antimagic total labelings for union
of two stars, Util. Math., 101 (2016) 337-349.
[251] S. Arumugam, K. Premalatha, M. Bača, and A. Semaničová-Feňovčı́ková, Local
antimagic vertex coloring of a graph, Graphs Combin., 33(2) (2017) 275-285.
[252] Y. F. Ashari and A. N. M. Salman, (H1 , H2 )-supermagic labelings for some shackles
of connected graphs H1 and H2 , (2019) J. Phys.: Conf. Ser., 1127 012059. https:
//iopscience.iop.org/article/10.1088/1742-6596/1127/1/012059/pdf
[253] F. Ashraf, M. Bača, Z. Kimáková, and A. Semaničová-Feňovčı́ková, On vertex and
edge H-irregularity strengths of graphs, Discrete Math. Algorithms Appl., 8(4)
(2016) 1650070, 13 pp.
[254] F. Ashraf, M. Bača, M. Lascsáková, and A. Semaničová-Feňovčı́ková, On H-
irregularity strengths of graphs, Disc. Math. Graph Th., 37 (2017) 1067-1078.
[255] F. Ashraf, M. Bača, A. Semaničová-Feňovčı́ková, and S. W. Saputro,
On cycle-irregularity strength of ladders and fan graphs, Elect. J. Graph
Th. Appl., 8(1) (2020) 181-194. https://www.ejgta.org/index.php/ejgta/
article/view/449/pdf_133
[256] F. Ashraf, M. Bača, A. Semaničová-Feňovčı́ková, A. Shabbirc, On H-irregularity
strengths of G-amalgamationm of graphs, Elect. J. Graph Th. Appl., 5 (2) (2017)
325-334.
[257] F. Ashraf, M. Bača, A. Semaničová-Feňovčı́ková, and M. K. Siddiqui, On H-
irregularity strength of ladders and fan graphs, AKCE Int. J. Graphs Comb., 17(1)
(2020) 213-219. https://doi.org/10.1016/j.akcej.2019.04.002
[258] Y. F. Ashari, A. N. M. Salman, and R. Simanjuntak, On forbidden subgraphs of
(K2 , H)-sim-(super) magic graphs, Symmetry 13 (2021) 1346. https://doi.org/
10.3390/sym13081346

the electronic journal of combinatorics (2023), #DS6 421

 [259] M. Asif, G. Ali, M. Numan, and A. Semaničová-Feňovčı́ková, Cycle-supermagic
labeling for some families of graphs, Util. Math., 103 (2017) 51-59.
[260] M. A. Asim and R. Hasni, Iteractive algorithm for computing irregularity strength
of complete graph, Ars Combin., 138 (2018) 17-24.
[261] J. Asplund and N. B. Fox, Minimum coprime labelings for operations on graphs,
Integers. 19 (2019) Paper No. A24, 26 pp.
[262] E. Asumpta, Purwanto, and T. D. Chandra, Odd harmonious labeling of some
family of snake graphs, AIP Conference Proceedings 2639(1):040002 (2022)
7 pp. Conference: Proceedings of the II International Scientific Conference
on Advances in Science, Engineering,and Digital Education: (ASEDU-II 2021
doi:10.1063/5.0111278
[263] S. Avadayappan, P. Jeyanthi, and R. Vasuki, Super magic strength of a graph,
Indian J. Pure Appl. Math., 32 (2001) 1621-1630.
[264] S. Avadayappan, R. Vasuki, and P. Jeyanthi, Magic strength of a graph, Indian
J. Pure Appl. Math., 31 (2000) 873-883.
[265] S. Avadayappan and R. Vasuki, New families of mean graphs, Internat. J. Math.
Combin., 2 (2010) 68-80.
[266] J. Ayel and O. Favaron, Helms are graceful, in Progress in Graph Theory (Water-
loo, Ont., 1982), Academic Press, Toronto, Ont. (1984) 89-92.
[267] A. Azaizeh, R. Hasni, G. C. Lau, and A. Ahmad, 3-total edge product cordial
labeling of complete, bipartite and generalized friendship graphs, Util. Math., 106
(2018) 259-270.
[268] S. Babitha and J. Baskar Babujee, Prime cordial labeling on graphs, Internat.
Scholarly Sci. Res. Innovation 7(5) (2013) 848-853.
https://www.semanticscholar.org/paper/Prime-Cordial-Labeling-on-Graphs-Babitha-
422aff9b3081b135bc04190ec7a117ed37f67197
[269] M. Baća, P. Jeyanthi, P. Selvagopal, N. T. Muthu Raja, and A. Semaničová-
Feňovčı́ková, Ladders and fan graphs are cycle-antimagic, Hacettepe J. Math. &
Stat., 49(3) (2020) 1093-1106. https://www.researchgate.net/publication/
338275842_Ladders_and_fan_graphs_are_cycle-antimagic
[270] E. M. Badr, On graceful labeling of the generalization of cyclic snakes, J. Discrete
Math. Sci. Cryptogr., 18(6) (2015) 773-783.
[271] E. M. Badr and M. I. Moussa, An upper bound of radio k-coloring problem and its
integer linear programming model, Wireless Networks, 26(7) (2020) 4955-4964.
https://www.researchgate.net/publication/331842382_An_upper_bound_
of_radio_k-coloring_problem_and_its_integer_linear_programming_
model
[272] E. M. Badr, M. I. Moussa, and K. Kathiresan, Crown graphs and subdivision of
ladders are odd graceful, Internat. J. Computer Math., 88(17) (2011) 3570-3576.
]urlDOI:10.1080/00207160.2011.610893

the electronic journal of combinatorics (2023), #DS6 422

 [273] E. M. Badr, S. Nada, M. Al-Shamiri, A. Abdel-Hay, and A. ELrokh, A novel
mathematical model for radio mean square labeling problem, J. Math., 2022, Art.
ID 3303433, 9 pp. https://doi.org/10.1155/2022/3303433
[274] A. Q. Baig and H. U. Afzal, Some super edge-magic (p, q)-graphs with magic
constant 3p, Util. Math., 98 (2015) 53-63.
[275] A. Q. Baig, H. U. Afzal, M. Imran, and I. Javaid, Super edge-magic labeling of
volvox and pancyclic graphs, Util. Math., 93 (2014) 49-56.
[276] A. Q. Baig, E. T. Baskoro, and A. Semaničová-Feňovčı́ková, On the super edge-
magic deficiency of a star forest, Ars Combin., 115 (2014) 3-12.
[277] S. Balamoorthy, S. V. Bharanedhar, and N. Kamatchi, On the products of group
vertex magic graphs, AKCE Int. J. Graphs Comb., 19(3) (2022) 268-275. https:
//www.tandfonline.com/doi/full/10.1080/09728600.2022.2136021
[278] D. Bantva, Further results on the radio number of trees, Elect. Notes Discr. Math.,
63 (2017) 85-91.
[279] D. Bantva, Radio number for middle graph of paths, Elect. Notes Discr. Math.,
63 (2017) 93-100.
[280] D. Bantva, A lower bound for the radio number of graphs, Algorithms and Discrete
Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science, vol
11394, 161-173. Springer, Cham
[281] D. Bantva, Optimal radio labelings of graphs, arXiv:2212.13578v1
[282] D. Bantva and D. Der-Fen Liu, Radio number for the cartesian product of two
trees, arXiv:2202.13983
[283] M. V. Bapat, Some vertex prime graphs and a new type of graph labeling, Internat.
J. Math. Trends and Tech., 47(1) (2017) 49-55.
[284] M. V. Bapat, Some complete-graph related families of product cordial (pc) graphs,
Aryabhatta J. Math. Informatics, 09(02) (2017) 133-140.
[285] M. V. Bapat, Product cordial labeling of some fusion graphs, Internat. J. Math.
Trends and Tech., 50(2) (2017) 125-129.
[286] M. V. Bapat, Extended vertex edge additive cordial (EVEAC) labeling-a new
labeling method for graphs, Internat. J. Stat. Appl. Math., 2(6) (2017) 92-94.
[287] M. V. Bapat, Extended edge vertex cordial labelings of graph, Internat. J. Math.
Archive, 8(9) (2017) 17-19.
[288] A. Basak, MPLS multicasting using caterpillars and a graceful labelling scheme,
IEEE Conference Publications, Information Visualisation, 2004. IV 2004. Proceed-
ings. Eighth International Conference. 382-387. doi:10.1109/IV.2004.1320172
[289] S. S. Basha, Reverse super edge-magic strength of banana trees, Int. J. Comput.
Sci. Math., 9(5) (2018) 515-523.

the electronic journal of combinatorics (2023), #DS6 423

 [290] M. Basher, On the edge irregular reflexive labeling for some classes of plane
graphs, Soft Comput., (2023). https://link.springer.com/article/10.1007/
s00500-023-07973-9
[291] M. Bača, On magic and consecutive labelings for the special classes of plane graphs,
Util. Math., 32 (1987) 59-65.
[292] M. Bača, Labelings of two classes of convex polytopes, Util. Math., 34 (1988)
24-31.
[293] M. Bača, Labelings of m-antiprisms, Ars Combin., 28 (1989) 242-245.
[294] M. Bača, On magic labelings of Möbius ladders, J. Franklin Inst., 326 (1989)
885-888.
[295] M. Bača, On magic labelings of type (1, 1, 1) for three classes of plane graphs,
Math. Slovaca, 39 (1989) 233-239.
[296] M. Bača, On certain properties of magic graphs, Util. Math., 37 (1990) 259-264.
[297] M. Bača, On magic labelings of m-prisms, Math. Slovaca, 40 (1990) 11-14.
[298] M. Bača, On consecutive labelings of plane graphs, J. Franklin Inst., 328 (1991)
249-253.
[299] M. Bača, On magic labelings of honeycomb, Discrete Math., 105 (1992) 305-311.
https://doi.org/10.1016/0012-365X(92)90153-7
[300] M. Bača, On magic labelings of grid graphs, Ars Combin., 33 (1992) 295-299.
[301] M. Bača, On magic labelings of type (1, 1, 1) for the special class of plane graphs,
J. Franklin Inst., 329 (1992) 549-553.
[302] M. Bača, On magic labellings of convex polytopes, Ann. Disc. Math., 51 (1992)
13-16.
[303] M. Bača, Labelings of two classes of plane graphs, Acta Math. Appl. Sinica, 9
(1993) 82-87.
[304] M. Bača, Face antimagic labelings of convex polytopes, Util. Math., 55 (1999)
221-226.
[305] M. Bača, Antimagic labelings of antiprisms, J. Combin. Math. Combin. Comput-
ing, 35 (2000) 217-224.
[306] M. Bača, Special face numbering of plane quartic graphs, Ars Combin., 57 (2000)
285-292.
[307] M. Bača, Consecutive-magic labeling of generalized Petersen graphs, Util. Math.,
58 (2000) 237-241.
[308] M. Bača, On face antimagic labelings of plane graphs, J. Combin. Math. Combin.
Comput., 53 (2005) 33-38.
[309] M. Bača and C. Barrientos, Graceful and edge-antimagic labelings, Ars Combin.,
96 (2010) 505-513.
[310] M. Bača and C. Barrientos, On super edge-antimagic total labelings of mKn , Dis-
crete Math., 308 (2008) 5032-5037.

the electronic journal of combinatorics (2023), #DS6 424

 [311] M. Bača and F. Bashir, On super d-antimagic labelings of disjoint union of prisms,
AKCE J. Graphs Combin., 6 (2009) 31-39.
[312] M. Bača, Y. Bashir, M. F. Nadeem, and A. Shabbir, On super edge-antimagic
total labeling of Toeplitz graphs. Mathematics in the 21st century, 1–10, Springer
Proc. Math. Stat., 98, Springer, Basel, 2015.
[313] M. Bača, F. Bashir, and A. Semaničová, Face antimagic labeling of antiprisms,
Util. Math., 84 (2011) 209-224.
[314] M. Bača1 E. T. Baskoro, L. Brankovic, S. Jendrol’, Y. Lin, O. Phanalasy, J. Ryan,
A. Semaničová-Feňovčı́ková, Slamin, K. A. Sugeng, A survey of face-antimagic
evaluations of graphs, Australa. J. Combin., 69(3) (2017) 382-393.
[315] M. Bača, B. Baskoro, and Y. Cholily, Face antimagic labelings for a special class
of plane graphs Cab , J. Combin. Math. Combin. Comput., 55 (2005) 5-15.
[316] M. Bača, B. Baskoro, and Y. Cholily, On d-antimagic labelings for a special class
of plane graphs, J. Combin. Math. Combin. Comput., 61 (2007) 21-32.
[317] M. Bača, B. Baskoro, Y. Cholily, S. Jendroľ, Y. Lin, M. Miller, J. Ryan, R. Siman-
juntak, Slamin, and K. Sugeng, Conjectures and open problems in face antimagic
evaluations of graphs, J. Indonesian Math. Soc. (MIHMI), 11 (2005) 175-192.
[318] M. Bača, B. Baskoro, S. Jendroľ and M. Miller, Antimagic labelings of hexagonal
plane maps, Util. Math., 66 (2004) 231-238.
[319] M. Bača, B. Baskoro, and M. Miller, On d-antimagic labelings of honeycomb,
Proceedings 12th Australian Workshop on Combinatorial Algorithms, Bandung,
Indonezia (2001) 45-50.
[320] M. Bača, E. T. Baskoro, and M. Miller, Antimagic valuations for the special class
of plane graphs, Lecture Note Computer Science-LNCS, 3330 (2005) 58-64.
[321] M. Bača, E. T. Baskoro, M. Miller, J. Ryan, R. Simanjuntak, and K. A. Sugeng,
Survey of edge antimagic labelings of graphs, J. Indonesian Math. Soc., (MIHMI)
12 (2006) 113-130.
[322] M. Bača, E. T. Baskoro, R. Simanjuntak, and K. A. Sugeng, Super edge-antimagic
labelings of the generalized Petersen graph P (n, (n − 1)/2), Util. Math., 70 (2006)
119-127.
[323] M. Bača, F. Bertault, J. MacDougall, M. Miller, R. Simanjuntak, and Slamin,
Vertex-antimagic total labelings of graphs, Discuss. Math. Graph Theory, 23
(2003) 67-83.
[324] M. Bača, F. Bertault, J. MacDougall, M. Miller, R. Simanjuntak, and Slamin,
Vertex-antimagic total labelings of (a, d)-antimagic and (a, d)-face antimagic
graphs, preprint.
[325] M. Bača and L. Brankovic, Edge antimagicness for a class of disconnected graphs,
Ars Combin., 97A (2010) 145-152.

the electronic journal of combinatorics (2023), #DS6 425

 [326] M. Bača, L. Brankovic, M. Lascsáková, O. Phanalasy, and A. Semaničová-
Feňovčı́ková, On d-antimagic labelings of plane graphs, Electronic J. Graph Theory
Appl., 1(1) (2013) 28-39.
[327] M. Bača, L. Brankovic, and A. Semaničová-Feňovčikovǎ, Labelings of plane graphs
with determined face eights, Acta Mechanica Slovaca, 13(2) (2009) 64-71.
[328] M. Bača, L. Brankovic, and A. Semaničová-Feňovčikovǎ, Labelings of plane graphs
containing Hamilton path, Acta Math. Sinica, 27(4) (2011) 701-714.
[329] M. Bača, Dafik, M. Miller, and J. Ryan, Edge-antimagic total labeling of disjoint
unions of caterpillars, J. Combin. Math. Combin. Computing, 65 (2008) 61-70.
[330] M. Bača, Dafik, M. Miller, and J. Ryan, Antimagic labeling of disjoint unions of
s-crowns, Util. Math., 79 (2009) 193-205.
[331] M. Bača and I. Hollánder, Prime-magic labelings of Kn,n , J. Franklin Inst., 327
(1990) 923-926.
[332] M. Bača and I. Hollánder, Labelings of a certain class of convex polytopes, J.
Franklin Inst., 329 (1992) 539-547.
[333] M. Bača and I. Holländer, On (a, d)-antimagic prisms, Ars Combin., 48 (1998)
297-306.
[334] M. Bača and I. Holländer, On (a, b)-consecutive Petersen graphs, Acta Math. Appl.
Sinica (English Ser.), 14 (1998) 265-270.
[335] M. Bača, I. Holländer, and K. W. Lih, Two classes of super-magic quartic graphs,
J. Combin. Math. Combin. Comput., 23 (1997) 113-120.
[336] M. Bačca, M. Imran, and A. Semaničovǎ-Feňovčcı́kovǎ, Irregularity and modular
irregularity strength of wheels, Mathematics, 9(2710) (2021) 1-14. https://doi.
org/10.1016/j.akcej.2018.01.013
[337] M. Bača, M. Irfan, A. Javad, and A. Semaničová-Feňočová, On total edge product
cordial labeling of fullerenes, Electron. J. Graph Theory Appl., (EJGTA) 6(2)
(2018) 238-249. http://www.ejgta.org/index.php/ejgta/article/view/395/
pdf_79
[338] M. Bača, M. Irfan, J. Ryan, A. Semaničová-Feňovčı́ková, and D. Tanna, On edge
irregular ´reflexive labellings for the generalized friendship graphs, Mathematics,
5(4) (2017) 67. doi:10.3390/math5040067
[339] M. Bača, M. Irfan, J. Ryan, A. Semaničová-Feňovčı́ková, and D. Tanna, Note on
edge irregular reflexive labelings of graphs, AKCE Internat. J. Graphs Combin.,
16(2) (2019) 145-157. https://doi.org/10.1016/j.akcej.2018.01.013
[340] M. Bača, J. Jendrol, M. Miller, and J. Ryan, Antimagic labelings of generalized
Petersen graphs that are plane, Ars Combin., 73 (2004) 115-128.
[341] M. Bača, J. Jendrol, M. Miller, and J. Ryan, On irregular total labellings, Discrete
Math., 307 (2007) 1378-1388.

the electronic journal of combinatorics (2023), #DS6 426

 [342] M. Bača, P. Jeyanthi, P. Selvagopal, N. T. Muthu Raja, A. Semaničová-
Fen̆ovčıková, Ladders and fans are cycle-antimagic, Hacettepe J. Math. Stat., 49(3)
(2020) 1093-1106.
[343] M. Bača, Z. Kimáková, M. Lascsáková, and A. Semaničová-Feňovčiková, The irreg-
ularity and modular irregularity strength of fan graphs, Symmetry 13(605) (2021)
1-13. https://doi.org/10.3390/sym13040605
[344] M. Bača, Z. Kimáková, A. Semaničová-Feňovčikovǎ, and M. A. Umar, Tree-
antimagicness of disconnected graphs, Math. Probl. Eng., 2015, Art. ID 504251,
4 pp.
[345] M. Bača, P. Kovář, A. Semaničová, and M. K. Shafiq, On super (a, 1)- edge-
antimagic total labelings of regular graphs, Discrete Math., 310 (2010) 1408-1412.
[346] M. Bača, M. Lascsḱová, M. Naseem, A. Semaničová-Feňovčı́ková, On entire face
irregularity strength of disjoint union of plane graphs, Appl. Math. Comput., 307
(2017) 232-238.
[347] M. Bača, M. Lascsáková, and A. Semaničová, On connection between α-labelings
and edge-antimagic labeling of disconnected graphs, Ars Combin., 106 (2012) 321-
336.
[348] M. Bača, M. Lascsáková and M. K. Siddiqui, Total edge irregularity strength of
toroidal fullerene, Math. Comput. Sci., 7, (2013) 487-492.
[349] M. Bača, Y. Lin, and M. Miller, Valuations of plane quartic graphs, J. Combin.
Math. Combin. Computing, 41 (2002) 209-221.
[350] M. Bača, Y. Lin, and M. Miller, Antimagic labelings of grids, Util. Math., 72
(2007) 65-75.
[351] M. Bača, Y. Lin, M. Miller, and J. Ryan, Antimagic labelings of Möbius grids, Ars
Combin., 78 (2006) 3-13.
[352] M. Bača, Y. Lin, M. Miller, and R. Simanjuntak, New constructions of magic and
antimagic graph labelings, Util. Math., 60 (2001) 229-239.
[353] M. Bača, Y. Lin, M. Miller, and M. Z. Youssef, Edge-antimagic graphs, Discrete
Math., 307 (2007) 1232-1244.
[354] M. Bača, Y. Lin, and F. A. Muntaner-Batle, Super edge-antimagic of path-like
trees, Util. Math., 73 (2007) 117-128.
[355] M. Bača, Y. Lin, and F. A. Muntaner-Batle, A note on even disjoint union of
paths, AKCE Int. J. Graphs Comb., 6(1) (2009) 41-46.
[356] M. Bača, Y. Lin, F. Muntaner-Batle, and M. Rius-Font, Strong labeling of linear
forests, Acta Math. Sinica, English Series, 25 (2009) 1951-1964.
[357] M. Bača, Y. Lin, and F. Muntaner-Batle, Edge-antimagic labeling of forests, Util.
Math., 81 (2010) 31-40.
[358] M. Bača, J. MacDougall, M. Miller, Slamin, and W. Wallis, Survey of certain
valuations of graphs, Discussiones Mathematicae Graph Theory, 20 (2000) 219-
229.

the electronic journal of combinatorics (2023), #DS6 427

 [359] M. Bača, Y.Lin, and A. Semaničová-Feňovčı́ková, Note on super antimagicness of
disconnected graphs, AKCE J. Graphs Combin., 6 (2009) 47-55.
[360] M. Bača and M. Miller, Antimagic face labeling of convex polytopes based on
biprisms, J. Combin. Math. Combin. Comput., 36 (2001) 229-236.
[361] M. Bača and M. Miller, Valuations of a certain class of convex polytopes, J. Com-
bin. Math. Combin. Comput., 43 (2002) 207-218.
[362] M. Bača and M. Miller, On d-antimagic labelings of type (1, 1, 1) for prisms, J.
Combin. Math. Combin. Comput., 44 (2003) 199-207.
[363] M. Bača and M. Miller, Super Edge-Antimagic Graphs: A Wealth of Problems
and Some Solutions, BrownWalker Press, 2007, Boca Raton, FL, USA
[364] M. Bača, M. Miller, O. Phanalasy, J. Ryan, A. Semaničová-Feňovčı́ková, and A.
Abildgaard Sillasen, Totally antimagic total graphs, Australas. J. Combin., 61
(2015) 42-56. https://www.academia.edu/es/66812029/Totally_antimagic_
total_graphs
[365] M. Bača, M. Miller, O. Phanalasy, and A. Semaničová-Feňovčı́ková, Super d-
antimagic labelings of disconnected plane graphs, Acta Math. Sin. (Engl. Ser.),
26 (2010) 2283-2294.
[366] M. Bača, M. Miller, O. Phanalasy, and A. Semaničová-Feňovčı́ková, Constructions
of antimagic labelings for some families of regular graphs, J. Algor. Computation,
44, (2013) 1-7.
[367] M. Bača, M. Miller, O. Phanalasy and A. Semaničová-Feňočová, Antimagic label-
ing of join graphs,Math. Comput. Sci., 9(2) (2015) 139-143.
[368] M. Bača, M. Miller, and J. Ryan, On d-antimagic labelings of prisms and an-
tiprisms, Proceedings 12th Australian Workshop on Combinatorial Algorithms,
Bandung, Indonezia (2001) 51-58.
[369] M. Bača, M. Miller, J. Ryan, and A. Semaničová-Feňovčı́ková, On H-antimagicness
of disconnected graphs, Bull. Aust. Math. Soc., 94(92) (2016) 201-207.
[370] M. Bača, M. Miller, J. Ryan, and A. Semaničová-Feňovčı́ková, Edge-magic total
labelings. In: Magic and Antimagic Graphs. Developments in Mathematics, 60
(2-19). Springer, Cham.
[371] M. Bača, M. Miller, J. Ryan, and A. Semaničová-Feňovčı́ková, Magic and An-
timagic Graphs Attributes, Observations, and Challenges in Graph Labelings, 60
Springer Nature Switzerland AG 2019.
[372] M. Bača, M. Miller, and Slamin, Vertex-magic total labeling of generalized Petersen
graphs, Int. J. Comput. Math., 79 (2002) 1259-1263.
[373] M. Bača, F. Muntaner-Batle, A. Semaničová-Feňovčı́ková, and M. K. Shafiq, On
super (a, 2)-antimagic total labeling of disconnected graphs, Ars Combin., 113,
(2014) 129-137.
[374] M. Bača, K. Muthugurupackiam, K. M. Kathiresan, and S. Ramya, Modular ir-
regularity strength of graphs, Electron. J. Graph Theory Appl. 8 (2020) 435-443.

the electronic journal of combinatorics (2023), #DS6 428

 [375] M. Bača, M. Numan, and A. Semaničová-Feňovčı́ková, Super d-antimagic labelings
of generalized prism, Util. Math., 99 (2016) 101-119.
[376] M. Bača, M. Numan, and A. Semaničová-Feňovčı́ková, Super d-antimagic labelings
of disjoint union of generalized prisms, Util. Math., 103 (2017) 299-310.
[377] M. Bača, M. Numan, and A. Shabbir, Labelings of type (1, 1, 1) for toroidal
fullerenes, Turkish J. Math., 37 (2013) 899-907.
[378] M. Bača, M. Numan, and M. K. Siddiqui, Super face antimagic labelings of union
of antiprisms, Math. Comput. Sci., 7(2) (2013) 245-253.
[379] M. Bača and M. Murugan, Super edge-antimagic labelings of cycle with a chord,
Australas. J. Combin., 35 (2006) 253-261.
[380] M. Bača, A. Ovais, A. Semaničová-Feňovčı́ková, and I. Nengah Suparta, On face
irregular evaluations of plane graphs, Discuss. Math. Graph Th., 42(2) (2022)
549-568. https://doi.org/10.7151/dmgt.2294
[381] M. Bača, A. Semaničová-Feňovčı́ková, R.-T. Lai, and T.-M. Wang, On local an-
timagic vertex coloring for complete full t-ary trees, Fundamenta Informaticae,
XXI (2020) 1001-1015 1001. arXiv:2204.04479. https://fi.episciences.org/
9349/pdf
[382] M. Bača, A. Semaničová-Feňovčı́ková, and M. K. Shafiq, A method to generate
large classes of edge-antimagic trees, Util. Math., 86 (2011) 33-43.
[383] M. Bača, A. Semaničová-Feňovčı́ková, S. Slamin, and K. A. Sugeng, On inclusive
distance vertex irregular labelings, Electron. J. Graph Theory Appl., 6(1) (2018)
61-83. https://www.ejgta.org/index.php/ejgta/article/view/463/pdf_65
[384] M. Bača, A. Semaničová-Feňovčikovǎ, M. A. Umar, and D. Welyyanti, On H-
antimagicness of Cartesian product of graphs, Turkish J. Math., 42(1) (2018)
339-348.
[385] M. Bača, A. Semaničová-Feňovčı́ková, T. M. Wang, and G. H. Zhang, On (a, 1)-
vertex-antimagic edge labeling of regular graphs, J. Appl. Math., (2015), Art. ID
320616, 7 pp.
[386] M. Bača, and A. Shabbir, Total labelings of toroidal polyhexes, Science Internat.,
24(3,) (2012) 239-241.
[387] M. Bača, and M. K. Siddiqui, Total edge irregularity strength of generalized prism,
Applied Math. Comput., 235 (2014) 168-173.
[388] M. Bača and M. K. Siddiqui, On total edge irregularity strength of strong product
of two cycles, Util. Math., 104 (2017) 255-275.
[389] M. Bača and M. Z. Youssef, Further results on antimagic graph labeling, Australas.
J. Combin., 38 (2007) 163-172.
[390] M. Bača and M. Z. Youssef, On harmonious labelings of corona graphs, J. Appl.
Math., 2014 Art. ID 627248, 4 pp.

the electronic journal of combinatorics (2023), #DS6 429

 [391] J. Bagga, L. P. Fotso, P. B. Max, and S. Arumugam, New classes of graceful
unicyclic graphs, The Eighth International Workshop on Graph Labelings (IWOGL
2014), Electron. Notes Discrete Math., 48 (2015) 27-32.
[392] J. Bagga and A. Heinz, Graceful labelings of unicyclic graphs. Advances in discrete
mathematics and applications: Mysore, 2008, 69–79, Ramanujan Math. Soc. Lect.
Notes Ser., 13, Ramanujan Math. Soc., Mysore, 2010.
[393] P. Bahl, S. Lake, and A. Wertheim, Gracefulness of families of spiders, Involve, 3
(2010) 241-247.
[394] A. Q. Baig, A. Ahmad, E. Baskoro, and R. Simanjuntak, On the super edge-magic
deficiency of forests, Util. Math., 86 (2011) 147-159.
[395] A. Q. Baig, E. Baskoro, and A. Semaničová-Feňovčiková, On the su-
per edge-magic deficiency of a star forest, Ars Combin., 115 (2014) 3-
12. https://www.researchgate.net/publication/287059730_On_the_super_
edge-magic_deficiency_of_a_star_forest
[396] A. Q. Baig, M. Imran, I. Javaid, and A. Semaničová-Feňovčiková, Super edge-
magic deficiency of graphs, Util.Math., 87 (2012) 355-364.
[397] S. Bailey and C. Barrientos, Operations with mean graphs, Congr. Numer., 217
(2013) 5-19.
[398] S. Bala, S. Sundarraj, and K. Thirusangu, Cordial labelings for comb related graph,
Bull. Pure Appl. Sci. Sect. E Math. Stat., 38E (Special Issue) (2S) (2019) 92-
98. https://bpasjournals.com/admin/upload/dynamic2/92-98-bpas-e-dec.
2019-special%20issue.pdf
[399] V. Balaji and V. Maheswari, Some results on relaxed mean la-
beling, Math. Combin., 3 (2015) 73-80. http://fs.unm.edu/IJMC/
SomeResultsOnRelaxedMeanLabeling.pdf
[400] S. Bala, V. Krithika Devi, and K. Thirusangu, Some cordial labelings on square
graph of a comb, Bull. Pure Appl. Sci. Sect. E Math. Stat., 38E (Special Is-
sue)(2S) (2019) 112-118. https://bpasjournals.com/admin/upload/dynamic2/
112-118-bpas-e-dec.2019-special%20issue.pdf
[401] S. Bala, S. Sundarraj, and K. Thirusangu, Cordial labelings for comb re-
lated graph, Bull. Pure Appl. Sci. Sect. E Math. Stat., 38E (Special Issue)
(2S) (2019) 92-98 (2019) https://bpasjournals.com/admin/upload/dynamic2/
92-98-bpas-e-dec.2019-special%20issue.pdf
[402] B. J. Balamurugan, K. Thirusangu, and D. G. Thomas, Zumkeller labeling for twig
graphs, Electron. Notes Disc. Math., 48 (2015) 119-126.
[403] B. J. Balamurugan, K. Thirusangu, and D. G. Thomas, B. J. Murali, k-Zumkeller
labeling of graphs, Int. J. Eng. Technol., 7(4) (2018) 460-463.
[404] V. Balaji, D. S. T. Ramesh, and S. Sudhakar, Further results on relaxed mean
labeling, Int. J. Adv. Appl. Math. Mech., 3(3) (2016) 92-99.

the electronic journal of combinatorics (2023), #DS6 430

 [405] V. Balaji, Solution of a conjecture on Skolem mean graph of stars K1,l ∪K1,m ∪K1,n ,
Internat. J. Math. Combin., 4 (2011) 115-117.
[406] V. Balaji, D. S. T. Ramesh and A. Subramanian, Skolem mean labeling, Bull. Pure
and Applied Sci., 26E (2) (2007) 245-248.
[407] V. Balaji, D. S. T. Ramesh and A. Subramanian, Some results on Skolem mean
graphs, Bull. Pure and Applied Sci., 27E (1)(2008) 67-74.
[408] R. Balakrishnan, Graph labelings, unpublished.
[409] C. Balbuena, E. Barker, K. C. Das, Y. Lin, M. Miller, J. Ryan, Slamin, K. Sugeng,
and M. Tkac, On the degrees of a strongly vertex-magic graph, Discrete Math.,
306 (2006) 539-551.
[410] C. Balbuena, E. Barker, Y. Lin, M. Miller, and K. Sugeng, Consecutive magic
graphs, Discrete Math., 306 (2006) 1817-1829.
[411] C. Balbuena, P. Garcı́a-Vázquez, X. Marcote, and J. C. Valenzuela, trees having an
even or quasi even degree sequence are graceful, Applied Math. Letters, 20 (2007)
370-375.
[412] R. Balakrishnan and R. Kumar, Decomposition of complete graphs into isomorphic
bipartite subgraphs, Graphs and Combin., 10 (1994) 19-25.
[413] R. Balakrishnan and
W R. Kumar, Existence and nonexistence of certain labellings
c
for the graph Kn 2K2 , Util. Math., 46 (1994) 97-102.
[414] R. Balakrishnan and R. Sampathkumar, Decompositions of regular graphs into
c
W
Kn 2K2 , Discrete Math., 156 (1996) 19-28.
[415] R. Balakrishnan, A. Selvam, and V. Yegnanarayanan, On felicitous labelings of
graphs, Proceed. National Workshop on Graph Theory and its Appl. Manonmaniam
Sundaranar Univ., Tiruneli (1996) 47-61.
[416] R. Balakrishnan, A. Selvam, and V. Yegnanarayanan, Some results on elegant
graphs, Indian J. Pure Appl. Math., 28 (1997) 905-916.
[417] C. Balbuena, E. Barker, Y. Lin, M. Miller, and K. Sugeng, Consecutive magic
graphs, Discrete Math., 306 (2006) 1817-1829.
[418] D. Bange and A. E. Barkauskas, Fibonacci graceful graphs, Fibonacci Quarterly,
71(3) (1983) 174-188. https://www.fq.math.ca/Scanned/21-3/bange.pdf
[419] D. Bange, A. Barkauskas, and P. Slater, Simply sequential and graceful graphs,
Proc. of the 10th S.E. Conf. on Combinat., Graph Theory, and Computing, (Util.
Math. Winnipeg, 1979) 155-162.
[420] D. Bange, A. Barkauskas, and P. Slater, Sequentially additive graphs, Discrete
Math., 44 (1983) 235-241. https://www.sciencedirect.com/science/article/
pii/0012365X83901875?via%3Dihub
[421] J. Bao, L. Zhao, Y. Yang, W. Feng, and Jirimutu, The generalized Peterson graph
P (n, 7) is 3n+6
2
, 3)-antimagic, Util. Math., 100 (2016) 33-41.

the electronic journal of combinatorics (2023), #DS6 431

 [422] M. V. Bapat and N. B. Limaye, Some families of 3-equitable graphs, J. Combin.
Math. Combin. Comput., 48 (2004) 179-196.
[423] M. V. Bapat and N. B. Limaye, A note on 3-equitable labelings of multiple shells,
J. Combin. Math. Combin., Comput. 51 (2004) 191-202.
[424] M. V. Bapat and N. B. Limaye, Edge-three cordial graphs arising from complete
graphs, J. Combin. Math. Combin. Comput., 56 (2006) 147-169.
[425] M. V. Bapat and N. B. Limaye, E3 -cordiality of some helm-related graphs, Ars
Combin., 119 (2015) 429-443.
[426] C. M. Barasara, Edge and total edge product cordial labeling of some new graphs,
Internat. J. Engineering, Sci. Math., 7(2) (2018) 263-273.
[427] C. M. Barasara, Edge product cordial and total edge product cordial labeling of
some wheel related graphs. In: N. P. Shrimali N. H. Shah (eds.), Recent Adv. Graph
Th., (1st ed.), CRC Press, 2020.
[428] C. M. Barasara, Edge and total edge product cordial labeling of some new graphs,
Internat. Engin., Sci. Math., 7(2) (2018) 263-273.
https://www.ijesm.co.in/uploads/68/4847_pdf.pdf
[429] C. M. Barasara and Y. B. Thakkar, Divisor cordial labeling of graphs in the context
of some graph operations, Adv. Appl. Discrete Math., 28(1) (2021) 31-48.
[430] C. M. Barasara and P. J. Prajapati, Prime cordial labeling for some path, cycle
and wheel graphs, Adv. Appl. Discr. Math., 30 (2022) 35-58.
https://www.mililink.com/upload/article/25925498aams_vol_217_
may_2022_a1_p3577-3594_c._m._barasara_and_y._b._thakkar.pdf
http://dx.doi.org/10.17654/0974165822018
[431] C. M. Barasara and Y. B. Thakkar, Divisor cordial labeling for ladders and total
graph of some graphs, Adv. Appl. Math. Sci., 21(7) (2022) 3577-3594.
https://www.mililink.com/upload/article/25925498aams_vol_217_may_
2022_a1_p3577-3594_c._m._barasara_and_y._b._thakkar.pdf
[432] C. M. Barasara and Y. B. Thakkar, Divisor cordial labeling for some cy-
cle and wheel related graphs, Malaya J. Mat., 8(3) (2020) 966-972. http://
malayajournal.org/articles/MJM08030041.pdf
[433] C. M. Barasara, S. K. Vaidya, and P. L. Vihol, 3-equitable labeling in the context
of some graph operations, J. Applied Computer Science & Math., 11(5) (2011)
69-75.
[434] C. Barrientos, New families of equitable graphs, Util. Math., 60 (2001) 123-137.
[435] C. Barrientos, Graceful labelings of cyclic snakes, Ars Combin., 60 (2001) 85-96.
[436] C. Barrientos, Equitable labelings of corona graphs, J. Combin. Math. Combin.
Comput., 41 (2002) 139-149.
[437] C. Barrientos, Graceful labelings of chain and corona graphs, Bull. Inst. Combin.
Appl., 34 (2002) 17-26.

the electronic journal of combinatorics (2023), #DS6 432

 [438] C. Barrientos, Difference Vertex Labelings, Ph.D. Thesis, Universitat Politécnica
de Catalunya, Barcelona, 2004.
[439] C. Barrientos, The gracefulness of unions of cycles and complete bipartite graphs,
J. Combin. Math. Combin. Comput. 52 (2005) 69-78.
[440] C. Barrientos, Graceful graphs with pendant edges, Australas. J. Combin. 33
(2005) 99-107.
[441] C. Barrientos, Graceful arbitrary supersubdivisions of graphs, Indian J. Pure
Appl. Math., 38 (2007) 445-450.
[442] C. Barrientos, Odd-graceful labelings, unpublished.
[443] C. Barrientos, Unicylic graceful graphs, unpublished.
[444] C. Barrientos, On graceful chain graphs, Util. Math., 78 (2009) 55-64.
[445] C. Barrientos, Odd-graceful labelings of trees of diameter 5, AKCE Int. J. Graphs
Comb., 6 (2009) 307-313.
[446] C. Barrientos, Alpha graphs with different pendent paths, Elect. J. Graph
Th. Appl., (EJGTA) 8(2) (2020) 301-317. https://www.ejgta.org/index.php/
ejgta/article/view/1036/pdf_143
[447] C. Barrientos, On additive vertex labelings, Indonesian J. Combin., 4(1) (2020)
34-52.
[448] C. Barrientos, On the generation of alpha graphs, J. Algebra Combin. Discrete
Struct. Appl., 9(2) (2022) 101-114. https://doi.org/10.13069/jacodesmath.
1111733
[449] C. Barrientos, Mean trees, Bull. Inst. Combin. Appl., 75 (2015) 8-18.
[450] C. Barrientos, M. E. Abdel-Aal, S. Minion, and D. Williams, The mean labeling
of some crowns, J. Algorithms and Comput., 45 (2014) 43-54.
[451] C. Barrientos and S. Barrientos, On graceful supersubdivisions of graphs, Bull.
Inst. Combin. Appl., 70 (2014) 77-85.
[452] C. Barrientos, I. Dejter, and H. Hevia, Equitable labelings of forests, Combin. and
Graph Theory, 1 (1995) 1-26.
[453] C. Barrientos and H. Hevia, On 2-equitable labelings of graphs, Notas de la So-
ciedad de Matemática de Chile, XV (1996) 97-110.
[454] C. Barrientos and E. Krop, Mean graphs, AKCE Int. J. Graphs Comb., 11(1)
(2014) 13-26. https://www.researchgate.net/publication/268640068_Mean_
graphs
[455] C. Barrientos and E. Krop, Improved bounds for relaxed graceful trees, Graphs
Combin., 33 (2017) 287-305. arXiv:1402.0196
[456] C. Barrientos and S. Minion, Alpha labelings of snake polyominoes and hexagonal
chains, Bull. Inst. Combin. Appl., 74 (2015) 73-83.
[457] C. Barrientos and S. Minion, Three graceful operations, J. Algorithms and Com-
put., 45 (2014) 13-24.

the electronic journal of combinatorics (2023), #DS6 433

 [458] C. Barrientos and S. Minion, Enumerating families of labeled graphs, J. Inte-
ger Sequences, 18 (2015) Article 15.1.7, 14 pages. https://cs.uwaterloo.ca/
journals/JIS/VOL18/Minion/minion3.pdf
[459] C. Barrientos and S. Minion, New attack on Kotzig’s Conjecture, Electron. J.
Graph Theory Appl., 4(2) (2016) 119-131.
[460] C. Barrientos and S. Minion, On the graceful Cartesian product of alpha-trees,
Theory Appl. Graphs, 4(1) (2017) Art. 3, 12 pp. https://digitalcommons.
georgiasouthern.edu/cgi/viewcontent.cgi?article=1030&context=tag
[461] C. Barrientos and S. Minion, on the number of α-labeled graphs, Discuss. Math.
Graph Th., 38(1) (2018) 177-188.
[462] C. Barrientos and S. Minion, Constructing graceful graphs with caterpillars, J.
Algor. Computation, 48 (2016) 117-125.
[463] C. Barrientos and S. Minion, New α-trees and graceful unions of α-graphs and
linear forests, J. Combin. Math. Combin. Comput., 108 (2019) 205-220.
[464] C. Barrientos and S. Minion, Snakes: from graceful to harmonious, Bull. Institute
Combin. Appl., CA 79 (2017) 95-107.
[465] C. Barrientos and S. Minion, Snakes and caterpillars in graceful graphs, J. Algo-
rithms and Comput., 50 (2018) 37-47.
[466] C. Barrientos and S. Minion, Folding trees gracefully, AKCE Int. J. Graphs Comb.,
17(3) (2020) 796-800.
[467] C. Barrientos, Special graceful labelings of irregular fences and lobsters, Universal
J. Math. Appl., 2(1) (2019) 1-10.
[468] C. Barrientos and S. Minion, New advances in Kotzig’s conjecture, Fundamental
J. Math. Appl., 2(2) (2019) 186-194.
[469] C. Barrientos and S. Minion, The graceful coalescence of alpha cycles, Comm. Adv.
Math. Sc.,, 2(2) (2019) 114-120.
[470] C. Barrientos and S. Minion, Series-parallel operations with alpha-graphs, Theory
Appl. Graphs, 6(1), Article 4 (2019).
[471] C. Barrientos and S. Minion, Counting and labeling grid related graphs, Electron.
J. Graph Th. Appl., 7(2) (2019) 349-363.
[472] C. Barrientos and S. Minion, Some families of α-labeled subgraphs of the integral
grid, Commun. Comb. Optim., to appear.
[473] C. Barrientos and S. Minion, Broader families of cordial graphs, Indonesian J.
Combin., 4(1) (2020) 34-52.
[474] C. Barrientos and S. Minion, Harmonious graphs from α-trees, J. Graph Th. Appl.,
9(2) (2021) 357-375.
[475] C. Barrientos, M. Z. Youssef, Relaxing the injectivity constraint on arithmetic
and harmonious labelings, Electronic Graph Th. Appl., 10(2) (2022) 523-539.
doi:http://dx.doi.org/10.5614/ejgta.2022.10.2.13

the electronic journal of combinatorics (2023), #DS6 434

 [476] M. Barrus, Antimagic labeling and canonical decomposition of graphs, Inform.
Process. Lett., 110 (2010) 261-263.
[477] M. Basher, On even vertex odd mean labeling of the calendula graphs, Proyec-
ciones, 39(6) (2020) 1515-1535. https://www.researchgate.net/publication/
346871598_On_even_vertex_odd_mean_labeling_of_the_calendula_graphs#
fullTextFileContent
[478] M. Basher, k-Zumkeller labeling of super subdivision of some graphs, J. Egypt
Math. Soc., 29(12) (2021). https://doi.org/10.1186/s42787-021-00121-y
[479] M. Basher, Even vertex odd mean labeling of some cycle related graphs, J. Discrete
Math. Sci. Crypt., (2021)
[480] M. Basher, The reflexive edge strength of toroidal fullerene, AKCE Internat. J.
Graphs Combin., DOI:10.1080/09728600.2022.2150587
[481] M. Basher and M. Kamran Siddiqui, On even-odd meanness of su-
per subdivision of some graphs, Proyecciones (Antofagasta) 41(5) (2022)
1213-1228. https://www.revistaproyecciones.cl/index.php/proyecciones/
article/view/5302/4150
[482] J. Baskar Babujee, Bimagic labelings in path graphs, Math. Education, 38 (2004)
12-16.
[483] J. Baskar Babujee, On edge bimagic labeling, J. Combin. Inf. Syst. Sci., 28 (2004)
239-244.
[484] J. Baskar Babujee, Euler’s phi function and graph labeling, Int. J. Contemp.
Math. Sci., 5 (2010) 977-984.
[485] J. Baskar Babujee, Prime labelings on graphs, Proc. Jangjeon Math. Soc., 10
(2007) 121-129.
[486] J. Baskar Babujee and S. Babitha, Encrypting and decrypting number using la-
beled graphs, European J. Sci. Res., (2012) 14-24.
[487] J. Baskar Babujee and S. Babitha, On 1-vertex bimagic vertex labeling, Tamkang
J. Math., 45 (2014)(3) 259-272.
[488] J. Baskar Babujee, S. Babitha, and V. Vishnupriya, New constructions of super
edge bimagic labeling, Proceed. Inter. Conf. Math. and Comput. Sci. ICMCS 2010,
5-6 Feb. 2010 79-82.
[489] J. Baskar Babujee and C. Beaula, On vertex strongly? -graph, Proceed. Internat.
Conf. Math. and Comput. Sci., 25-26 July 2008, Loyola College, Chennai.
[490] J. Baskar Babujee and R. Jagadesh, Super vertex total edge bimagic labeling for
graphs with cycles, Pacific-Asian J. Math., 2 (2008) 113-122.
[491] J. Baskar Babujee and R. Jagadesh, Super edge bimagic labeling for disconnected
graphs, Inter. Journal Appl. Math. Eng. Sci., 2 (2008) 171-175.
[492] J. Baskar Babujee and R. Jagadesh, Super edge bimagic labeling for trees, Inter.
J. Analyzing Methods Components Combin. Biol. Math., 1 (2008) 107-116.

the electronic journal of combinatorics (2023), #DS6 435

 [493] J. Baskar Babujee and R. Jagadesh, Super edge bimagic labeling for some classes
of connected graphs derived from fundamental graphs, Inter. J. Combin. Graph
Theory Appl., 1 (2008) 85-92.
[494] J. Baskar Babujee and R. Jagadesh, Vertex consecutive edge bimagic labeling for
star like graphs Global J. Appl. Math. and Math. Sci., 1 (2008) 197-202.
[495] J. Baskar Babujee and R. Jagadesh, Prime labeling for some class of acyclic graphs,
Internat. J. Analyzing of Components and Combin. Biology in Math, 1 (2009) 27-
35.
[496] J. Baskar Babujee and R. Jagadesh, On a-vertex consecutive edge bimagic total
labeling for graphs with cycles, Indian J. Math. and Math. Sci., 5 (2009) 149-158.
[497] J. Baskar Babujee and R. Jagadesh, On a-vertex consecutive edge bimagic total
labeling for certain classes of graphs, Internat. J. Math. Sci., 9 (2010) 49-61.
[498] J. Baskar Babujee and R. Jagadesh, On edge vertex prime labeling, Int. J. Pure
Appl. Math.. 114 (6) (2017) 209-218. https://acadpubl.eu/jsi/2017-114-5/
articles/2/24.pdf
[499] J. Baskar Babujee, R. Jagadesh, and V. Vishnupriya, On a-vertex consecutive edge
bimagic total labeling for some class of graphs derives from fundamental graphs,
Pacific-Asian J. Math., 3 (2009) 283-291.
[500] J. Baskar Babujee, K. Kannan, and V. Vishnupriya, Vertex strongly∗ -graphs, In-
ternat. J. Analyzing Components and Combin. Biology in Math., 2 19-25.
[501] J. Baskar Babujee and S. Loganathan, On signed product cordial label-
ing, Applied Math., (2011) 2(12) 1525-1530. https://www.scirp.org/pdf/
AM20111200015_85335006.pdf
[502] J. Baskar Babujee and N. Rao, Edge-magic trees, Indian J. Pure Appl. Math., 33
(2002) 1837-1840.
[503] J. Baskar Babujee and L. Shobana, Prime cordial labelings, Int. Review on Pure
and Appl. Math., 5 (2009) 277-282.
[504] J. Baskar Babujee and L. Shobana, Prime and prime cordial labeling for some
special graphs, Int. J. Contemp. Math. Sciences, 5 (2010) 2347-2356.
[505] J. Baskar Babujee and L. Shobana, On Z3 -magic labeling and Cayley digraphs,
Int. J. Contemp. Math. Sciences, 5 (2010) 2357-2368.
[506] J. Baskar Babujee and V. Vishnupriya, Prime labelings on trees, Internat. Review
Pure Appl. Math., 2 (2006) 159-162.
[507] J. Baskar Babujee and V. Vishnupriya, Permutation labelings for some trees, In-
ternat. J. Math. Comput. Sci., 3 (2008) 31-38.
[508] J. Baskar Babujee, V. Vishnupriya, and R. Jagadesh, On a-vertex consecutive edge
bimagic labeling for trees, Internat. J. Comput. Math. and Numerical Simulation,
2 67-78.

the electronic journal of combinatorics (2023), #DS6 436

 [509] T. Baskaran and R. Ganapathy, A study on C-exponential mean labeling of graphs,
J. Math., (7-8) (2022) 1-7. https://www.researchgate.net/publication/
364248905_A_Study_on_C_-Exponential_Mean_Labeling_of_Graphs
[510] E. Baskoro and Y. Cholily, Expanding super edge-magic graphs, J. Math. Fund.
Sci., [S.l.], 36(2) (2013) 117-125.
[511] E. Baskoro and A. A. G. Ngurah, On super edge-magic total labelings, Bull. Inst.
Combin. Appl., 37 (2003) 82-87.
[512] E. T. Baskoro, I. W. Sudarsana, and Y. M. Cholily, How to construct new super
edge-magic graphs from some old ones, J. Indones. Math. Soc., 11(2) (2005) 155-
162.
[513] J. Bass, personal communication (2013).
[514] D. Bantva, S. Vaidya, and S. Zhou, Radio number of trees, The Eighth Inter-
national Workshop on Graph Labelings (IWOGL 2014), Electron. Notes Discrete
Math., 48 (2015) 135-141.
[515] D. Bantva, S. Vaidya, and S. Zhou, Discrete Applied Math., 217 (2017) 110-122.
[516] R. Beals, J. Gallian, P. Headley, and D. Jungreis, Harmonious groups, J.
Combin. Th., Series A, 56 (1991) 223-238. https://deepblue.lib.umich.edu/
bitstream/handle/2027.42/29431/0000512.pdf;sequence=1
[517] A. F. Beardon, The maximum degree in a vertex-magic graph, Austral. J. Com-
bin., 30 (2004) 113-116.
[518] A. F. Beardon, Magic labellings of infinite graphs, Austral. J. Combin., 30 (2004)
117-132.
[519] A. F. Beardon, The average degree in vertex-magic graph, Austral. J. Combin., 35
(2006) 51-56.
[520] N. A. Beatress and P. B Sarasija, Even-odd harmonious graphs, Internat. J. Math.
Soft Comput., 5(1) (2015) 23-29.
[521] N. A. Beatress, P. B. Sarasija, Square harmonious graphs, Internat. J. Adv.
Res. Sci., Engin. and Tech., 3(2) (2016) 1428-1430. http://www.ijarset.com/
upload/2016/february/10_IJARSET_sarasija.pdf
[522] B. Beavers, Golomb rulers and graceful graphs, http://webcourse.cs.
technion.ac.il/236801/Spring2009/ho/WCFiles/Golomb_Rulers_and_
Graceful_Graphs.pdf
[523] M. Beck and M. Farahmand, Partially magic labelings and the antimagic graph
conjecture, Sém. Lothar. Combin., 78B (2017) Art. 86, 11 pp.
[524] M. Beck and M. Jackanich, Bipartite graphs are weakly antimagic,
arXiv:1306.1763v2 [math.CO] 18 Jun 2013.
[525] S. Beena, On Σ and Σ0 labelled graphs, Discrete Math., 309 (2009) 1783-1787.
https://www.sciencedirect.com/science/article/pii/S0012365X08001489

the electronic journal of combinatorics (2023), #DS6 437

 [526] R. Raziya Begam, M. Palanivelrajan, K. Gunasekaran, and A. R. Shahul Hameed,
Graceful labeling of some theta related graphs, Internat. J. Fuzzy Mathematical
Archives, 2 (2013) 78-84.
[527] A. K. Behera, D. Mishra, and P. C. Nayak, Some new classes of even-even and odd-
even graceful graphs, Internat. J. Appl. Engin. Res., 10(19) (2015) 40171-40176.
[528] L. W. Beineke and S. M. Hegde, Strongly multiplicative graphs, Discuss. Math.
Graph Theory, 21 (2001) 63-75.
[529] J. R. Bell, Products of graceful bipartite graphs, Aequat. Math., 93 (2019) 1245-
1260.
[530] J. R. Bell and D. F. Cummins, Graceful pairings, Australas. J. Combin., 75 (2019)
343-356.
[531] A. Benini and A. Pasotti, Decompositions of complete multipartite graphs, via
generalized graceful labelings, Australasian J. Combin., 59(1) (2014) 120-143.
[532] A. Benini and A. Pasotti, α-labelings of a class of generalized Petersen graphs,
Discuss. Math. Graph Th., 35 (2015) 43-53.
[533] J. Bensmail, On the hardness of determining the irregularity strength of graphs,
Theoretical Computer Sci., 937 (2022) 96-107. https://www.sciencedirect.
com/science/article/abs/pii/S0304397522005746
[534] J. Bensmail, H. Hocquard, D. Lajou, and E. Sopena, A proof of the mul-
tiplicative 1-2-3 conjecture, Combinatorica, (2023) https://doi.org/10.1007/
s00493-023-00003-0
[535] K. Benson, M. Porter, and M. Tomova, The radio numbers of all graphs of order
n and diameter n − 2, Matematiche (Catania), 68(2) (2013) 167-190.
[536] M. Benson and S. M. Lee, On cordialness of regular windmill graphs, Congr.
Numer., 68 (1989) 45-58.
[537] K. Bérczi, A. Bernäth, and M. Vizer, Regular graphs are antimagic, Electron. J.
Combin., 22(3) (2015) Paper 3.34, 1-6. arXiv:1504.08146
[538] C. Berge, Regularisable graphs II, Discrete Math., 23 (1978) 91-95. https://www.
sciencedirect.com/science/article/pii/0012365X78901085
[539] D. Bergstrand, F. Harary, K. Hodges, G. Jennings, L. Kuklinski, and J. Wiener,
The sum numbering of a complete graph, Bull. Malaysian Math. Soc., 12 (1989)
25-28.
[540] D. Bergstrand, K. Hodges, G. Jennings, L. Kuklinski, J. Wiener, and F. Harary,
Product graphs are sum graphs, Math. Magazine, 65 (1992) 262-264.
[541] Z. Berikkyzy, A. Brandt, S. Jahanbekam, V. Larsen, and D. Rorabaugh, List-
antimagic labeling of vertex-weighted graphs, Discrete Math. Theor. Comput. Sci.,
23(3) (2021), Paper No. 5, 12 pp. https://dmtcs.episciences.org/8792/pdf
[542] O. Berkman, M. Parnas, and Y. Roditty, All cycles are edge-magic, Ars Combin.,
59 (2001) 145-151.

the electronic journal of combinatorics (2023), #DS6 438

 [543] A. H. Berliner, N. Dean, J. Hook, A. Marr, A. Mbirika, and C. D. McBee, Coprime
and prime labelings of graphs, J. Integer Seq., 19(5) (2016) article 16.5.8, 14 pp.
[544] J. C. Bermond, Graceful graphs, radio antennae and French windmills, Graph
Theory and Combinatorics, Pitman, London (1979) 18-37.
[545] J. C. Bermond, A. E. Brouwer, and A. Germa, Systemes de triplets et differences
associèes, Problems Combinatories et Thèorie des Graphs, Colloq. Intern. du Cen-
tre National de la Rech. Scient., 260, Editions du Centre Nationale de la Recherche
Scientifique, Paris (1978) 35-38.
[546] J. C. Bermond and G. Farhi, Sur un probleme combinatoire d’antennes en radioas-
tronomie II, Annals of Discrete Math., 12 (1982) 49-53.
[547] J. C. Bermond, A. Kotzig, and J. Turgeon, On a combinatorial problem of antennas
in radioastronomy, in Combinatorics, A. Hajnal and V. T. Sós, eds., Colloq. Math.
Soc. János Bolyai, 18, 2 vols. North-Holland, Amsterdam (1978) 135-149.
[548] J. C. Bermond and D. Sotteau, Graph decompositions and G-design, Proc. 5th
British Combin. Conf., 1975, Congr. Numer., XV (1976) 53-72.
[549] F. Bertault, M. Miller, H. Pé-Rosés, R. Feria-Puron, and E. Vaezpour, A heuristic
for magic and antimagic graph labellings, Proceed. VII Spanish Congress on Meta-
heuristics, and Evolutive and Bioinspired Algorithms, (MAEB 2010) V. Campos,
A. Duarte, M. Gallego, F. Cortazar, R. Marti (eds). Ibergarceta Publicaciones,
S.L., Madrid. 677-684. arXiv:1305.1880
[550] M.-L. Beste, J.-H. de Wiljes, and M. Kreh, Sum and mod sum graphs of arithmetic
sets, Integers 22 (2022) #51 23pp. http://math.colgate.edu/~integers/w51/
w51.pdf
[551] D. Beutner and H. Harborth, Graceful labelings of nearly complete graphs, Result.
Math., 41 (2002) 34-39.
[552] L. Bezegová and J. Ivančo, An extension of regular supermagic graphs, Discrete
Math., 310(24) (2010) 3571-3578. https://www.sciencedirect.com/science/
article/pii/S0012365X10003481
[553] L. Bezegová and J. Ivančo, On conservative and supermagic graphs, Discrete
Math., 311(21) (2011) 2428-2436. https://www.sciencedirect.com/science/
article/pii/S0012365X11003232
[554] L. Bezegová and J. Ivančo, A characterization of complete tripartite degree-magic
graphs, Discuss. Math. Graph Theory 32(2) (2012) 243-253.
[555] L. Bezegová and J. Ivančo, Number of edges in degree-magic graphs, Dis-
crete Math., 313 (2013) 1349-1357. https://www.sciencedirect.com/science/
article/pii/S0012365X13001039
[556] P. Bhals, S. Lake, and A. Werthem, Gracefulness of families of spiders, Involve,
3(3) (2010) 241-247.
[557] V. Bhat-Nayak and U. Deshmukh, New families of graceful banana trees, Proc.
Indian Acad. Sci. Math. Sci., 106 (1996) 201-216.

the electronic journal of combinatorics (2023), #DS6 439

 [558] V. Bhat-Nayak and U. Deshmukh, Gracefulness of C4t ∪K1,4t−1 and C4t+3 ∪K1,4t+2 ,
J. Ramanujan Math. Soc., 11 (1996) 187-190.
[559] V. Bhat-Nayak and U. Deshmukh, Skolem-graceful labelings of unions of paths,
personal communication (1998).
[560] V. Bhat-Nayak and U. Deshmukh, Gracefulness of C3 ∪ Pn , unpublished.
[561] V. Bhat-Nayak and U. Deshmukh, Gracefulness of C2x+1 ∪ Px−2θ , Proc. Interna-
tional Conf. on Graph Theory and Number Theory, Trichy 1996.
[562] V. N. Bhat-Nayak and S. K. Gokhale, Validity of Hebbare’s conjecture, Util. Math.,
29 (1986) 49-59.
[563] V. N. Bhat-Nayak and A. Selvam, Gracefulness of n-cone Cm ∨ Knc , Ars Combin.,
66 (2003) 283-298.
[564] V. N. Bhat-Nayak and S. Telang, Cahit-k-equitability of Cn ◦ K1 , k = n to 2n − 1,
n > 3, Congr. Numer., 155 (2002) 131-213.
[565] V. N. Bhat-Nayak and S. Telang, Cahit-equitability of coronas, Ars Combin., 71
(2004) 3-32.
[566] A. A. Bhatti, M. Javaid, and M. Hussain, On super (a, d)-edge-antimagic total
labeling of subdivided caterpillar, Util. Math., 98 (2015) 227-241.
[567] A. A. Bhatti, M. Tahir and M. Javaid, Super (a, d)-EAT labeling of some wheel
like graphs, J. Graph Labeling, 1(2) (2015) 137-149.
[568] A. A. Bhatti, Q. Zahra, and M. Javaid, Further results on super (a, d)-EAT labeling
of subdivided stars, Util. Math., 98 (2015) 113-126.
[569] M. P. Biatch, J. S. Baggab, and S. Arumugam, A survey and a new class of
graceful unicylic graphs, AKCE Inter. J. Graphs and Comb. 17 (2) 2020, 673-678.
https://doi.org/10.1080/09728600.2020.1832853
[570] A. Bigham, E.A. Donovan, J. Pack, J. Turley, and L. W. Wiglesworth, Prime
labelings of snake graphs, Pump J. Undergraduate research, 2 (2019) 131-149.
https://journals.calstate.edu/pump/article/view/1274
[571] R. Binthiya and P. B. Sarasija, Some new even harmonious graphs, Internat. Math.
Soft Comput., 4(2) (2014) 105-111.
[572] A. Blinco, S. El-Zanati, and C. Vanden Eynden, On the cyclic decomposition of
complete graphs into almost-bipartite graphs, Discrete Math., 284 (2004) 71-81.
https://www.sciencedirect.com/science/article/pii/S0012365X04001244
[573] G. S. Bloom, A chronology of the Ringel-Kotzig conjecture and the continuing
quest to call all trees graceful, Ann. N.Y. Acad. Sci., 326 (1979) 32-51.
[574] G. S. Bloom and S. W. Golomb, Applications of numbered undirected graphs,
Proc. IEEE, 65 (1977) 562-570.
[575] G. S. Bloom and S. W. Golomb, Numbered complete graphs, unusual rulers, and
assorted applications, in Theory and Applications of Graphs, Lecture Notes in
Math., 642, Springer-Verlag,New York (1978) 53-65.

the electronic journal of combinatorics (2023), #DS6 440

 [576] G. S. Bloom, P. Hell, and H. Taylor, Collecting autographs: n-node graphs that
have n-integer signatures, Annals N.Y. Acad. Sci., 319 (1979) 93-102.
[577] G. S. Bloom and D. F. Hsu, On graceful digraphs and a problem in network
addressing, Congr. Numer., 35 (1982) 91-103.
[578] G. S. Bloom and D. F. Hsu, On graceful directed graphs that are computational
models of some algebraic systems, Graph Theory with Applications to Algorithms
and Computer Science, Ed. Y. Alavi, Wiley, New York (1985) 89-102.
[579] G. S. Bloom and D. F. Hsu, On graceful directed graphs, SIAM J. Alg. Discrete
Meth., 6 (1985) 519-536.
[580] G. S. Bloom, A. Marr, W. D. Wallis, Magic digraphs, J. Combin. Math. Combin.
Comput., 65 (2008) 205-212.
[581] C. Bloomfield, D. D.-F. Liu, and J. Ramirez, Radio-k-labeling of cycles for large
k, Discrete Appl. Math., 316 (2022) 60-70. https://www.sciencedirect.com/
science/article/pii/S0166218X22000981
[582] H. Bodlaender, J. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, and Z.
Tuza, Rankings of graphs, SIAM J. Discrete Math., 11 (1998) 168-181.
[583] R. Bodendiek, H. Schumacher, and H. Wegner, Űber graziőse Graphen, Math.-
Phys. Semesterberichte, 24 (1977) 103-106.
[584] R. Bodendiek and G. Walther, Arithmetisch antimagische Graphen, Graphentheo-
rie III, K. Wagner and R. Bodendiek (eds.), Mannhein, 1993.
[585] R. Bodendiek and G. Walther, On number theoretical methods in graph labelings,
Res. Exp. Math., 21 (1995) 3-25.
[586] R. Bodendiek and G. Walther, (A, D)-antimagic parachutes, Ars Combin., 42
(1996) 129-149.
[587] R. Bodendiek and G. Walther, (a, d)-antimagic parachutes II, Ars Combin., 46
(1997) 33-63.
[588] R. Bodendiek and G. Walther, On arithmetic antimagic edge labelings of graphs,
Mitt. Math. Ges. Hamburg, 17 (1998) 85-99.
[589] R. Bodendiek, H. Schumacher, and H. Wegner, Űber eine spezielle Klasse groziőser
Eulerscher Graphen, Mitt. Math. Gesellsch. Hamburg, 10 (1975) 241-248.
[590] T. Bohman and D. Kravitz, On the irregularity strength of trees, J. Graph Theory,
45 (2004) 241-254.
[591] S. A. H. Bokhary, A. Ahmad, and M. Imran, On vertex irregular total labelings of
cartesian products of two paths, Util. Math., 90 (2013) 239-249.
[592] S. A. H. Bokhary, U. Ali, and S. Maqbool, Irregular total labeling of wheel related
graphs, Util. Math., 107 (2018) 231-242.
[593] S. A. Bokhary and H. Faheem, Vertex irregular total labeling of grid graph, Palest.
J. Math., 8(1) (2019) 52-62.

the electronic journal of combinatorics (2023), #DS6 441

 [594] S. A. Bokhary, M. Imran, and U. Ali, On the total irregularity strength of convex
polytope graphs, Proyecciones, 40(5) (2021) 1267-1277. https://www.scielo.cl/
pdf/proy/v40n5/0716-0917-proy-40-05-1267.pdf
[595] J. Boland, R. Laskar, C. Turner, and G. Domke, On mod sum graphs, Congr.
Numer., 70 (1990) 131-135.
[596] J. Bondy and U. Murty, Graph Theory with Applications, North-Holland, New
York (1976).
[597] C. P. Bonnington and J. Širáň, Bipartite labelings of trees with maximum degree
three, J. Graph Theory, 31 (1999) 79-91.
[598] R. Boonklurb, A. Narissayaporn, and S. Singhun, Super edge-magic labeling of m-
node k-uniform hyperpaths and m-node k-uniform hypercycles, AKCE Internat.
J. Graphs and Combin., 13 (2016) 218-229.
[599] R. Boonklurb, N. Ruamkaew, and S. Singhun, Directed edge-graceful labeling of
digraph consisting of c cycles of the same size, J. Discrete Math. Sci.Cryptography,
25(1) (2022) 53-72.
[600] I. Borosh, D. Hensley, and A. Hobbs, Vertex prime graphs and the Jacobsthal
function, Congr. Numer., 127 (1997) 193-222.
[601] D. Bouchard, P. Clark, S. M. Lee, S.-P. Lo, and H.-H. Su, On balance index sets
of generalized book and ear expansion graphs, 24th MCCCC. J. Combin. Math.
Combin. Comput., 82 (2012) 3-15.
[602] M. I. Bosmia and K. K. Kanani, Divisor cordial labeling in the context of corona
product, 9th National Level Science Symposium. February 14, 2016, Organized by
Christ College, Rajkot, Sponsored by GUJCOST, Gandhinagar, Mathematics &
Statistics, 3 (2016) 178-182.
[603] M. I. Bosmia and K. K. Kanani, Divisor cordial labeling in the context of graph
operations on bistar, Global J. Pure and Appl. Math., 12(3) (2016) 2605-2618.
[604] D. Bouchard, P. Clark, and H.-H. Su, On edge-balance index sets of L-product of
cycles, J. Indones. Math. Soc., Special Edition (2011) 27-38.
[605] D. Bouchard, P. Clark, and H.-H. Su, On edge-balance index sets of L-product of
cycles with stars, Part II, 24th MCCCC. J. Combin. Math. Combin. Comput., 82
(2012) 199-209.
[606] S. A. Boxwala and P. Vashishta, Some new families of graceful graphs, The Eighth
International Workshop on Graph Labelings (IWOGL 2014) 127-133, Electron.
Notes Discrete Math., 48, Elsevier Sci. B. V., Amsterdam, 2015.
[607] S. Brandt, J. Miškuf, and D. Rautenbach, On a conjecture about edge irregular
total labelings, J. Graph Theory, 57 (2008) 333-343.
[608] L. Brankovic, C. Murch, J. Pond, and A. Rosa, Alpha-size of trees with maxi-
mum degree three and perfect matching. In: Proceedings of AWOCA2005, 18-21
September, Ballarat, Australia, (2005) 47-56.

the electronic journal of combinatorics (2023), #DS6 442

 [609] L. Brankovic and M. J. Reynolds, Computer search for graceful labeling: a survey,
Elect. J. Graph Th. Appl., 10(1) (2022) 319-336. https://www.ejgta.org/index.
php/ejgta/article/view/1057/pdf_225
[610] L. Brankovic, A. Rosa, and J. Širáň, Labellings of trees with maximum degree
three-an improved bound., J. Combin. Math. Combin. Comput., 55 (2005) 159-
169.
[611] L. Brankovic and I. M. Wanless, Graceful labelling: State of the art, applications
and future directions, Math Comput. Sci., 5 (2011) 11-20.
[612] R. L. Bras, C. P. Gomes, and B. Selman, Double-wheel graphs are graceful, IJ-
CAI’13 Proceedings of the Twenty-Third International Joint Conference on Arti-
ficial Intelligence, AAAI Press (2013) 587-593.
[613] B. Brešar and S. Klavžar, Θ-graceful labelings of partial cubes, Discrete Math.
306 (2006) 1264-1271.
[614] G. Brinkmann, S. Crevals, H. Mélot, L.J. Rylands, and E. Steffan, α-labelings and
the structure of trees with nonzero α-deficit. Discrete Math. Theor. Comput. Sci.,
14(1) (2012) 159-174.
[615] H. Broersma and C. Hoede, Another equivalent of the graceful tree conjecture, Ars
Combin., 51 (1999) 183-192.
[616] C. Bu, Gracefulness of graph Kn + Km , J. Harbin Shipbuilding Eng. Inst., 15
(1994) 91-93.
[617] C. Bu, On edge-gracefulness of graphs, Heilongjiang Daxue Ziran Kexue Xuebao,
12 (1995) 18-20.
[618] C. Bu, Sequential labeling of the graph Cn K m , unpublished.
[619] C. Bu and C. Cao, The gracefulness for a class of disconnected graphs, J. Natural
Sci. Heilongjiang Univ., 12 (1995) 6-8.
[620] C. Bu and L. Chen, Some conclusions about graceful graphs, J. Harbin Shipbuilding
Eng. Inst., 14 (1993) 103-108.
[621] C. Bu and W. Feng, Some composite theory about graceful graphs, J. Harbin Eng.
Univ., 16 (1995) 94-97.
[622] C. Bu, Z. Gao, and D. Zhang, On k-gracefulness of r − pn × p2 , J. Harbin Ship-
building Eng. Inst., 15 (1994) 85-89.
[623] C. Bu and B. He, The k-gracefulness of some graphs, J. Harbin Eng. Univ., 14
(1993) 92-95.
[624] C. Bu and J. Shi, A class of (k, d)-arithmetic graphs, J. Harbin Eng. Univ., 16
(1995) 79-81.
[625] C. Bu and J. Shi, Some conclusions about indexable graphs, J. Harbin Eng. Univ.,
16 (1995) 92-94.
[626] C. Bu and J. Zhang, The properties of (k, d)-graceful graphs, unpublished.

the electronic journal of combinatorics (2023), #DS6 443

 [627] C. Bu, D. Zhang, and B. He, k-gracefulness of Cnm , J. Harbin Shipbuilding Eng.
Inst., 15 (1994) 95-99.
[628] R. Bunge, S. El-Zanati, W. O’Hanlon, and C. Vanden Eynden, On γ-labeling
almost-bipartite graphs, Ars Combin., 107 (2012) 65-80.
[629] R. Bunge, A. Chantasartrassmee, S. El-Zanati, and C. Vanden Eynden, On cyclic
decompositions of complete graphs into tripartite graphs, J. Graph Theory, 72
(2013) 90-111.
[630] M. Buratti and A. Del Fra, Existence of cyclic k-cycle systems of the complete
graph, Discret. Math., 261 (2003) 113-125.
https://www.sciencedirect.com/science/article/pii/S0012365X02004636
[631] M. Buratti, G. Rinaldi, and T. Traetta, Some results on 1-rotational Hamiltonian
cycle systems, J. Combin. Designs, 22(6) (2014) 231-251.
[632] A. C. Burgess, P. Danziger, and T. Traetta, On the Oberwolfach problem for
single-flip 2-factors via graceful labelings, J. Combin. Theory, Series A, 189 (2022),
105611, 39 pages. arXiv:2010.07231
[633] M. Burzio and G. Ferrarese, The subdivision graph of a graceful tree is a graceful
tree, Discrete Math., 181 (1998) 275-281.
[634] S. I. Butt, M. Numan, I. A. Shah, and S. Ali, Face labelings of type (1,1,1) for
generalized prism, Ars Combin., 137 (2018) 41-52.
[635] A. Byers and A. O’Mellan, An amalgamation of graceful and harmonious labelings,
Bull. Inst. Combin. Appl., 96 (2022) 53-67. http://bica.the-ica.org/Volumes/
96//Reprints/BICA2021-31-Reprint.pdf
[636] S. Cabaniss, R. Low, and J. Mitchem, On edge-graceful regular graphs and trees,
Ars Combin., 34 (1992) 129-142.
[637] L. Caccetta and R. Jia, Positive binary labelings of graphs, Austral. J. Combin.,
14 (1996) 133-148.
[638] R. Čada, J. Ekstein, P. Holub, and O. Togni, Radio labelings of
distance graphs, Discrete Appl. Math., 161(18) (2013) 2876-2884.
https://reader.elsevier.com/reader/sd/pii/S0166218X13003028?token=
38194F33AFD36CA52277D90EA2BA8E8853296016D60373B266576EB0757F27ACD6E40660242E6E97
originRegion=us-east-1&originCreation=20230318194442
[639] I. Cahit, Elegant valuation of the paths, Ars Combin., 16 (1983) 223-227.
[640] I. Cahit, Cordial graphs: a weaker version of graceful and harmonious graphs, Ars
Combin., 23 (1987) 201-207.
[641] I. Cahit, On cordial and 3-equitable labellings of graphs, Util. Math., 37 (1990)
189-198.
[642] I. Cahit, Status of graceful tree conjecture in 1989, in Topics in Combinatorics and
Graph Theory, R. Bodendiek and R. Henn (eds), Physica-Verlag, Heidelberg 1990.

the electronic journal of combinatorics (2023), #DS6 444

 [643] I. Cahit, Recent results and open problems on cordial graphs, Contemporary Meth-
ods in Graph Theory, R. Bodendiek (ed.), Wissenschaftsverlag, Mannheim, 1990,
209-230.
[644] I. Cahit, Equitable tree labellings, Ars Combin., 40 (1995) 279-286.
[645] I. Cahit, On harmonious tree labellings, Ars Combin., 41 (1995) 311-317.
[646] I. Cahit, H-cordial graphs, Bull. Inst. Combin. Appl., 18 (1996) 87-101.
[647] I. Cahit, Some totally modular cordial graphs, Discuss. Math. Graph Theory, 22
(2002) 247-258.
[648] I. Cahit, Graceful labelings of rooted complete trees, personal communica-
tion (circa 2002). https://www.academia.edu/4376717/Graceful_Labeling_
of_the_Rooted_Complete_Trees
[649] I. Cahit, A note on graceful directed trees, (2003) Science Direct Working Paper
No S1574-0358(04)70939-9, https://ssrn.com/abstract=3177648
[650] I. Cahit and R. Yilmaz, E3 -cordial graphs, Ars Combin., 54 (2000) 119-127.
[651] H. Cai, L. X. Wei, X. R. Lu, Gracefulness of unconnected graphs (P1 ∨ Pn ) ∪
Gr , (P1 ∨ Pn ) ∪ (P3 ∨ K r ) and Wn ∪ St(m), J. Jilin Univ. Sci., 45 (2007) 539-543.
[652] B. Calhoun, K. Ferland, L. Lister, and J. Polhill, Totally magic labelings of graphs,
Australas. J. Combin., 32 (2005) 47-59.
[653] N. Cairnie and K. Edwards, The computational complexity of cordial and equitable
labelling, Discrete Math., 216 (2000) 29-34.
[654] L. A. Cammack, Schelp and G. Schrag, Irregularity strength of full d-ary trees
Congr. Numer., 81 (1991) 113-119.
[655] D. Canales, M. Tomova, and C. Wyels, A gap in the achievable radio number line,
AKCE Int. J. Graphs Combin., 10(4) (2013) 349-357.
[656] M. R. Cerioli, C. G. Fernandes, O. Lee, C. N. Lintzmayer, On edge-magic labelings
of forests, Elect. Notes Theor. Comput. Sci., 346(30) (2019) 299-307.
[657] M. R. Cerioli, C. G. Fernandes, O. Lee, C. Lintzmayer, G. O. Mota, and C. N.
da Silva, On Edge-magic labelings of forests, Elect. Notes Th. Comput. Sci., 346
(2019) 299–307.
[658] K. Carlson, Generalized books and Cm -snakes are prime graphs, Ars Combin. 80
(2006) 215-221.
[659] Y. Caro, Y. Roditty, and J. Schőnheim, Starters for symmetric (n, G, 1)-designs.
ρ-labelings revisited, unpublished.
[660] H. Carter and N. B. Fox, Odd prime graph labelings, arXiv:2208.08488 22 pages.
[661] R. Cattell, Vertex magic total labelings of complete multipartite graphs, J. Com-
bin. Math. Combin. Computing, 55 (2005) 187-197.
[662] R. Cattell, Graceful labellings of paths, Discrete Math., 307 (2007) 3161-3176.
[663] N. Cavenagh, D. Combe, and A. M. Nelson, Edge-magic group labellings of count-
able graphs, Electronic J. Combin., 13 (2006) #R92 (19 pages).

the electronic journal of combinatorics (2023), #DS6 445

 [664] D. Chakraborty, S. Nandi, S. Sen, and D. K. Supraja, A linear algorithm for
radio k-coloring powers of paths having small diameter. In: Hsieh, SY., Hung, LJ.,
Lee, CW. (eds) Combin. Alg.,. IWOCA 2023. Lecture Notes in Computer Science,
13889 (2023) Springer, Cham. https://doi.org/10.1007/978-3-031-34347-6_
13
[665] W. H. Chan, R. M. Low, and W. C. Shiu, Group-antimagic labelings of graphs,
Congr. Numberrantim, 217 (2013) 21-31.
[666] B. Chandra and R. Kala, Group S3 cordial prime labeling of graphs,
Malaya J. Matematik, S(1) (2019) 403-407. https://www.researchgate.net/
publication/334700018_Group_S_3_cordial_prime_labeling_of_graphs
[667] C.-W. Chang, D. Kuo, and H.-C. Lin, Ranking numbers of graphs, Inform. Process.
Letters 110 (2010) 711-716.
[668] F.-H. Chang, H.-B. Chen, W.-T. Li, and Z. Pan, Shifted-antimagic la-
belings for graphs, https://www.researchgate.net/publication/325817202_
Shifted-antimagic_Labelings_for_Graphs
[669] F.-H. Chang, H.-B. Chen, W.-T. Li, and Z. Pan, Shifted-antimagic labelings for
graphs, Graphs Combin., 37 (2021) 1065–1182. arXiv:1806.06019.
[670] F.-H. Chang, P. Chin, W.-T. Li, and Z. Pan, The strongly antimagic labelings of
double spiders, arXiv:1712.09477
[671] F.-H. Chang, W.-T. Li, D.-F. Daphne Liu, and Z. Pan, On k-shifted antimagic
spider forests, arXiv:2112.13582
[672] F. Chang, Y.-C. Liang, Z. Pan, and X. Zhu, Antimagic labeling of regular graphs,
J. Graph Theory, 82 (2016) 339-349. arXiv:1505.07688
[673] G. J. Chang, Strong sum graphs, Bull. Inst. Combin. Appl., 7 (1993) 47-52.
[674] G. J. Chang, D. F. Hsu, and D. G. Rogers, Additive variations on a graceful theme:
some results on harmonious and other related graphs, Congr. Numer., 32 (1981)
181-197.
[675] Y.-W. Chang and S.-P. Liu, Cartesian products of some regular graphs admitting
antimagic labeling for arbitrary sets of real numbers, J. Math., 2021, Art. ID
4627151, 8 pp. https://www.researchgate.net/publication/357475062_
Cartesian_Products_of_Some_Regular_Graphs_Admitting_Antimagic_
Labeling_for_Arbitrary_Sets_of_Real_Numbers
[676] G. Chartrand, D. Erwin, D. VanderJagt, and P. Zhang, γ-labelings of graphs,
Bull. Inst. Combin Appl., 44 (2005) 51-68.
[677] G. Chartrand, D. Erwin, D. VanderJagt, and P. Zhang, On γ-labeling of trees,
Discuss. Math. Graph Theory, 25 (2005) 363-383.
[678] G. Chartrand, D. Erwin, and P. Zhang, Radio antipodal colorings of graphs, Math.
Bohem., 127 (2002) 57-69.
[679] G. Chartrand, D. Erwin, and P. Zhang, A graph labeling problem suggested by
FM channel restrictions, Bull. Inst. Combin. Appl., 43 (2005) 43-57.

the electronic journal of combinatorics (2023), #DS6 446

 [680] G. Chartrand, D. Erwin, P. Zhang, and F. Harary, Radio labelings of graphs, Bull.
Inst. Combin. Appl., 33 (2001) 77-85.
[681] G. Chartrand, H. Hevia, and O.R. Oellermann, The chromatic number of a fac-
torization of a graph, Bull. Inst. Combin. Appl., 20 (1997) 33-56.
[682] G. Chartrand, M. Jacobson, J. Lehel, O. Oellermann, S. Ruiz, and F. Saba, Irreg-
ular networks, Congr. Numer., 64 (1988) 187-192.
[683] G. Chartrand, S. M. Lee, and P. Zhang, Uniformly cordial graphs, Discrete Math.,
306 (2006) 726-737.
[684] G. Chartrand and L. Lesniak, Graphs & Digraphs 4th ed. CRC Press (2005).
[685] G. Chartrand, R. Muntean, V. Saenpholphat, and P. Zhang, Which graphs are
divisor graphs?, Congr. Numer., 151 (2001) 189-200.
[686] G. Chartrand, L. Nebesky, and P. Zhang, Radio k-colorings of paths, Discuss.
Math. Graph Theory, 24 (2004) 5-21.
[687] A. Chavez, P. Le, D. Der-Fen Liu, and M. Shurman, Antimagic labeling for unions
of graphs with many three-paths, arXiv:2203.14842v1 16 pages.
[688] P. D. Chawathe and V. Krishna, Odd graceful labelings of countably infinite locally
finite bipartite graphs, Conference on Graph Theory and its Applications, March
2001, School of Mathematics, Anna University, Chennai.
[689] P. D. Chawathe and V. Krishna, Antimagic labelings of complete m-ary trees,
Number theory and discrete mathematics (Chandigarh, 2000), 77-80, Trends
Math., Birkhäuser, Basel, 2002.
[690] T. T. Chelvam, N. M. Rilwan, and G. Kalaimurugan, Antimagic and magic label-
ings in Cayley digraphs, Australas. J. Combin., 55 (2013) 65-71.
[691] K.-J. Chen, S.-M. Lee, and Y.-C. Wang, On the edge-graceful indices of the
L−product of (p, p + 1) graphs and K2 , unpublished.
[692] W. C. Chen, H. I. Lü, and Y. N. Yeh, Operations of interlaced trees and graceful
trees, Southeast Asian Bull. Math., 21 (1997) 337-348.
[693] L.-C. Chen, On harmonious labelings of the amalgamation of wheels, Master’s
Thesis, Chung Yuan Christian University, Taiwan.
[694] Z. Chen, Harary’s conjectures on integral sum graphs Discrete Math., 160 (1996)
241-244.
[695] Z. Chen, Integral sum graphs from identification, Discrete Math., 181 (1998)
77-90.
[696] Z. Chen, On super edge-magic graphs. J. Combin. Math. Combin. Comput., 38
(2001) 55-64.
[697] Z. Chen, On integral sum graphs, Discrete Math., 306 (2006) 19-25.
[698] Z.-Z. Chen, A generalization of the Bodendiek conjecture about graceful graphs,
Topics in Combinatorics and Graph Theory, R. Bodendiek and R. Henn, eds.,
Physica-Verlag, Heidelberg, 1990, 737-746.

the electronic journal of combinatorics (2023), #DS6 447

 [699] Z. Chen, On integral sum graphs with a saturated vertex, Czechoslovak Math. J.,
60(135) (2010) 669-674.
[700] Y. Cheng, Lattice grids and prisms are antimagic, Theoret. Comput. Sci., 374
(2007) 66-73. arXiv:0603106 [math.CO].
[701] Y. Cheng, A new class of antimagic Cartesian product graphs, Discrete Math.,
308 (2008) 6441-6448.
[702] H. Cheng, B. Yao, X. Chen, and Z. Zhang, On graceful generalized spiders and
caterpillars, Ars Combin. 87 (2008) 181-191.
[703] C. Chithra, G. Marimuthu, and G. Kumar, Some cycle-supermagic labeling of
graphs, Internat. J. Comput. Eng. Res., (IJCER) 8(9) (2018) 79-83.
[704] G. Chitra, J. Priya, and Y. Vishnupriya, Odd Fibonacci mean labeling of some
special graphs, Int. J. Math. Trends Technol., 66(1) (2020) 115-126. http://www.
ijmttjournal.org/Volume-66/Issue-1/IJMTT-V66I1P515.pdf
[705] R. Chitra Devi and S. Saravana Kumar, Super root square mean label-
ing of some graphs, Internat. J. Math. Trends Tech., (IJMTT) 30(2) (2016)
92-94. https://www.researchgate.net/publication/317304532_Super_Root_
Square_Mean_Labeling_of_Some_Graphs
[706] A. M. Chitre and N. B. Limaye, On 5-equitabilty of one point union of shells,
AKCE J. Graphs Combin., 6 (2009) 57-68. https://www.tandfonline.com/doi/
epdf/10.1080/09728600.2009.12088872?needAccess=true&role=button
[707] A. M. Chitre and N. B. Limaye, On edge-3-equitability of Kn -union of gears, J.
Combin. Math. Combin. Comput., 83 (2012) 129-150.
[708] A. M. Chitre and N. B. Limaye, On edge-3-equitability of Kn -union of helms,
unpublished.
[709] J. O. Choi, J. P. Georges, and D. Mauro, David, Relating edge-coverings to the
classification of Z2k -magic graphs, Discrete Math., 312(19) (2012) 2938-2945.
[710] D. Chopra, R. Dios, and and S. M. Lee, On the edge-magicness of Zykov sum of
graphs, personal communication (2013).
[711] D. Chopra and S. M. Lee, On super edge-magic graphs which are weak magic, J.
Combin. Math. Combin. Comput., 62 (2007) 177-187.
[712] D. Chopra and S. M. Lee, On Q(a)P (b)-super edge-graceful graphs, J. Combin.
Math. Combin. Comput., 58 (2006) 135-152.
[713] D. Chopra and S. M. Lee, On the integer magic spectra of the generalized theta
graphs, unpublished.
[714] D. Chopra, S. M. Lee, and H. H. Su, On edge-balance index sets of fans and wheels,
unpublished.
[715] C.-C. Chou and S. M. Lee, On Z3 -magic graphs, unpublished.

the electronic journal of combinatorics (2023), #DS6 448

 [716] C.-C. Chou, M. Galiardi, M. Kong, S. M. Lee, D. Perry, and H.-H. Su, On edge-
balance index sets of L-product of cycles with stars, Part I. J. Combin. Math.
Combin. Comput., 78 (2011) 195-211.
[717] D. Chopra, S. M. Lee, and H. H. Su, On edge-balance index sets of fans and
broken fans, Proceedings of the Fortieth Southeastern International Conference
on Combinatorics, Graph Theory and Computing, Congr. Numer., 196 (2009)
183-201.
[718] S. A. Choudum and S. P. M. Kishore, All 5-stars are Skolem graceful, Indian J.
Pure and Appl. Math., 27 (1996) 1101-1105.
[719] S. A. Choudum and S. P. M. Kishore, Graceful labellings of the union of paths
and cycles, Discrete Math., 206 (1999) 105-117.
[720] S. A. Choudum and S. P. M. Kishore, On Skolem gracefulness of k-stars, Ra-
manujan Mathematical Society Inter. Conf. Discrete Math. and Number Theory,
1996.
[721] S. A. Choudum and S. P. M. Kishore, Graceful labelling of the union of cycles and
stars, unpublished.
[722] F. R. K. Chung and F. K. Hwang, Rotatable graceful graphs, Ars Combin., 11
(1981) 239-250.
[723] P.-T. Chung and S. M. Lee, On the super edge-graceful spiders of even order, J.
Combin. Math. Combin. Comput., 64 (2008) 3-17.
[724] P.-T. Chung and S. M. Lee, A note on the edge-balance index sets for graphs,
Cong. Numer., 203 (2010) 105-129.
[725] P.-T. Chung, S. M. Lee, W.-Y. Gao, More trees of even orders which are super
edge-graceful, Congr. Numer., 206 (2010) 41-58.
[726] P.-T. Chung, S. M. Lee, W.-Y. Gao, and K. Schaffer, On the super edge-graceful
tress of even orders, Proceedings of the Thirty-Seventh Southeastern International
Conference on Combinatorics, Graph Theory and Computing, Congr. Numer., 181
(2006) 5-17.
[727] T. Chunling, L. Xiaohui, Y. Yuansheng, and W. Liping, Irregular total labellings
of some families of graphs, Indian J. Pure Appl. Math., 40(3)(2006) 155-181.
[728] S. Cichacz, Group distance magic labeling of some cycle-related graphs, Australas.
J. Combin., 57 (2013) 235-243.
[729] S. Cichacz, Note on group distance magic complete bipartite graphs, Central Eu-
ropean J. Math., 12 (3) (2014) 529-533.
[730] S. Cichacz, Note on group distance magic graphs G[C4 ], Graphs Combin., 30 (3)
(2014) 565-571. doi:10.1007/s00373-013-1294-z
[731] S. Cichacz, Group distance magic graphs G × Cn , Discrete Appl. Math. 177 (20)
(2014) 80-87. doi:10.1016/j.dam.2014.05.044
[732] S. Cichacz, Distance magic (r, t)-hypercycles, Util. Math., 101 (2016) 283-294.

the electronic journal of combinatorics (2023), #DS6 449

 [733] S. Cichacz, A Γ-magic rectangle set and group distance magic labeling, Combina-
torial algorithms, 122-127, Lecture Notes in Comput. Sci., 8986, Springer, Cham,
2015. doi:10.1007/978-3-319-19315-1 11
[734] S. Cichacz, On zero sum-partition of Abelian groups into three sets and group
distance magic labeling, Ars Math. Contemporanea, 13(2) (2017) 417-425.
[735] S. Cichacz, Zero sum partition into sets of the same order and its applications,
Electronic J. Combin., 25(1) (2018) #P1.20.
[736] S. Cichacz, A. Gömrlich, and A. Semaničová-Feňovčǐková, Upper bounds on inclu-
sive distance vertex irregularity strength, Graphs Combin., 37(6) (2021) 2713-2721.
[737] S. Cichacz, On some graph-cordial Abelian groups, Disc. Math., 345(5) (2022)
112815
https://www.sciencedirect.com/science/article/abs/pii/
S0012365X22000218?via%3Dihub
[738] S. Cichacz, B. Freyberg, D. Fronček, Orientable ζn -distance magic graphs, Discuss.
Math. - Graph Theory, (2017), to appear. doi:10.7151/dmgt.2094.
[739] S. Cichacz and D. Fronček, Distance magic circulant graphs, Discrete
Math., 339(1) (2016) 84-94. http://www.ii.uj.edu.pl/documents/12980385/
26042491/MD_71.pdf
[740] S. Cichacz and D. Fronček, E. Krop, and C. Raridan, Distance magic Carte-
sian products of graphs, Discuss Math. Graph Theory, 36 (2016) 299-308.
doi:10.7151/dmgt.1852
[741] S. Cichacz, D. Fronček, I. Singgih, Vertex magic total label-
ings of 2-regular graphs,Discrete math., 340 (1) (2017) 3117-3124.
doi:10.1016/j.disc.2016.06.022
[742] S. Cichacz, D. Fronček, K. Sugeng, and S. Zhou, Group distance magic and an-
timagic graphs, Acta Math. Sinica, English Series 32(10) (2016) 1159-1176.
[743] S. Cichacz, D. Fronček, A. Khodkar, and W. Xu, Super edge-graceful paths and
cycles, Bull. ICA. 57 (2009) 79-90.
[744] S. Cichacz, A. Görlich, Constant sum partition of set of integers and distance magic
graphs, Discuss. Math. Graph Theory, 38(1) (2018) 97-106.
[745] S. Cichacz, A. Görich, and Z. Tuza, Cordial labeling of hypertrees, Disc. Math.,
313 (22) (2013) 2518-2524. doi:10.1016/j.disc.2013.07.025
[746] S. Cichacz and B. Krupińska, Group irregularity strength of disconnected graphs,
arXiv:2306.11914
[747] S. Cichacz and M. Nikodem, Union of distance magic graphs, Discuss. Math. Graph
The., 37(1) 2017 239-249.
[748] N. E. Clarke and A. Sanaei, Skolem labelling of generalised Dutch windmills, Aus-
tralasian J. Combin., 66(3) (2016) 407-419.

the electronic journal of combinatorics (2023), #DS6 450

 [749] B. Clemens, R. Coulibaly, J. Garvens, J. Gonnering, J. Lucas, and S. Winters,
An introduction to the gracefulness of one-point and two-point union of graphs,
Congr. Numer., 171 (2004) 167-171.
[750] A. Clifton and A. Khodkar Super edge-graceful labelings of kites, J. Combin. Math.
Combin. Comput., 102 (2017) 277-295.
[751] Z. Coles, A. Huszar, J. Miller, and Z. Szaniszlo, 4-equitable tree labelings, Con-
gressus Numerantium 228 (2017) 51-63.
[752] A. Collins, C. Magnant, H. Wang, Tight super-edge-graceful labelings of trees and
their applications, AKCE Internat. J. Graphs Combin., 12 (2015) 113-118.
[753] N. Cohen and Kovše, Not all partial cubes are Θ-graceful, Discrete Math., 343(10)
(2020) 112031 arXiv:1809.05320
[754] D. Combe, Magic labelings of graphs over finite abelian groups, Austral. J. Comb.
29 (2004) 259-271.
[755] D. Craft and E. H. Tesar, On a question by Erdős about edge-magic graphs,
Discrete Math., 207 (1999) 271-276.
[756] D. W. Cranston, Regular bipartite graphs are antimagic, J. Graph Theory, 60
(2009) 173-182.
[757] D. W. Cranston, Y. Liang and X. Zhu, Odd degree regular bipartite graphs are
anti-magic, J. Graph Theory, 80(1) (2015) 28-33.
[758] S. J. Curran, Prime labelings on planar grid graphs, Theory Appl. Graphs, 9(1), Ar-
ticle 6, (2022), 14 pages. https://digitalcommons.georgiasouthern.edu/cgi/
viewcontent.cgi?article=1224&context=tag
[759] S. J. Curran, C4 -face-magic labelings on odd order projective grid graphs, Aus-
tralas. J. Combin., to appear.
[760] S. J. Curran, Odd order C4 -face-magic projective grid graphs, arXiv:2206.03586.
[761] S. J. Curran and S. C. Locke, C4 -face-magic labelings on even order projective grid
graphs, Combinatorics, Graph Theory and Computing, F. Hoffman (ed.), Springer
Proceedings in Mathematics & Statistics, to appear.
[762] S. J. Curran and S. C. Locke, C4 -face-magic labelings on even order projective grid
graphs, preprint 2021.
[763] S. J. Curran and R. M. Low, C4 -face-magic torus labelings on C4 × C4 , Cong.
Numer., 233 (2019) 79-94.
[764] S. J. Curran, R. M. Low, and S. C. Locke, C4 -face-magic labelings on Klein bottle
grid graphs, preprint 2021.
[765] S. J. Curran, R. Low, and S. C. Locke, C4 -face-magic toroidal labelings on Cm ×Cn ,
Art Discr. Appl. Math., 4 (2021) #P1.04, 33 pages. https://adam-journal.eu/
index.php/ADAM/article/view/1368/1191
[766] S. J. Curran and M. A. Ollis, A comment on Dean’s construction of prime labelings
on ladders, arXiv:2306.04088v1

the electronic journal of combinatorics (2023), #DS6 451

 [767] N. J. Cutinho, S. Sudha, and S. Arumugam, Distance antimagic label-
ings of Cartesian product of graphs, AKCE Int. J. Graphs Comb., 17(3)
(2020) 940-942. https://www.tandfonline.com/doi/epub/10.1016/j.akcej.
2019.08.005?needAccess=true
[768] V. J. A. Cynthia and E. Padmavathy, Signed and signed product cordial labeling
of cylinder graphs and banana tree, Internat. J. Math. Trends Tech., 65(3) (2019)
36-43.
[769] J. Cyrile, G. Valdehueza, and A. C. Pedrano, On the total edge product cordial
labeling of some corona graphs, Internat. J. Math. Trends Tech., 67(10) (2021)
1-6. arXiv:2111.08838
[770] S. Czerwiński, J. Grytczuk, and W. Zelazny, Lucky labelings of graphs, Infor.
Process. Let.,, 109(18) (2009) 1078-1081.
[771] Dafik, M. Miller, and J. Ryan, Super edge-magic total labelings of mKn,n,n , Ars
Combin., 101 97-107.
[772] Dafik, M. Miller, J. Ryan, and M. Bača, On antimagic labelings of disjoint union of
complete s-partite graphs, J. Combin. Math. Combin. Comput., 65 (2008) 41-49.
[773] Dafik, M. Miller, J. Ryan, and M. Bača, On super (a, d)-edge-antimagic total
labelings of disconnected graphs, Discrete Math., 309 (2009) 4909-4915.
[774] Dafik, M. Miller, J. Ryan, and M. Bača, Super edge-antimagic labeling of mKn,n,n ,
Ars Combin., 101 (2011) 97-107.
[775] Dafik, M. Miller, J. Ryan, and M. Bača, Antimagic labelings of the union of two
stars, Australas. J. Combin., 42 (2008) 35-44.
[776] Dafik, Slamin, F. Eka, and L. Sya’diyah, Super antimagicness of trian-
gular book and diamond ladder graphs, Proceed. of IICMA 2013 Research
Topic, 8 pp. https://www.researchgate.net/publication/290998038_Super_
Antimagicness_of_Triangular_Book_and_Diamond_Ladder_Graphs
[777] Dafik, S. Slamin, R. W. Romdhani, and I. Y. Arianti, On super antimagicness of
generalized flower and disk brake graphs, Util. Math., 100 (2016) 127-135.
[778] Dafik, Slamin, D. Tana, A. Semaničová-Feňovčı́ková,and M. Bača, Constructions
of H-antimagic graphs using smaller edge-antimagic graphs, ArsComb., 133 (2017)
233-245.
[779] H. Dao, H. Hua, M. Ngo, and C. Raridan, On the edge-balanced index sets of
complete even bipartite graphs, J. Graph Labeling, 2(1) (2016) 79-87.
[780] S. N. Daoud, Edge odd graceful labeling of cylinder and torus grid graphs, IEEE,
7 (2019) 10568-10592.
[781] S. N. Daoud, Edge even graceful labeling of polar grid graphs, Symmetry, 11(38):22
(2019) 1-28. https://www.mdpi.com/2073-8994/11/1/38
[782] S. N. Daoud, Vertex odd graceful labeling, Ars Combin., 142 (2019) 65-87.
[783] R. Darda and A. Hujdurović, On bounds for the product irregularity strength of
graphs, Graphs and Combin., 31 (5) (2015) 1347-1357.

the electronic journal of combinatorics (2023), #DS6 452

 [784] D. Darmaji, S. Wahyudi, R. Rinurwatia, and S. W. Saputro, On the construction
of super edge-magic total graphs, Elect. J. Graph Th. Appl., 10(1) (2022) 301-309.
http://dx.doi.org/10.5614/ejgta.2022.10.1.21
[785] W. S. Darmaji and S. W. Saputro, On the construction of super edge-magic total
graphs, Electron. J. Graph Theory Appl., (EJGTA) 10(1) (2022) 301-309. http:
//dx.doi.org/10.5614/ejgta.2022.10.1.21
[786] S. Das, S. Ghosh, S. Nandi, S. Sen, A lower bound technique for radio k-coloring,
Discrete Math., 340 (2017) 855-861.
[787] G. K. Dayanand and S. Ahmed, The super magic properties of connected and
disconnected graphs, J. Inf. Optim. Sci., 36(3) (2015) 231-246.
[788] P. de la Torre, R. Greenlaw, and T. Przytycka, Optimal tree ranking is in NC,
Parallel Process. Lett., 2 (1992) 31-41.
[789] Daili, Z-H Wang, and Z. Xie, Gracefulness of P2r,2m , Ars Combin., 104 (2012)
185-191.
[790] J. W. Daykin, · C. S. Iliopoulos, ·M. Miller, and · O. Phanalasy, Antimagicness of
generalized corona and snowflake graphs, Math. Comput. Sci., 9(1) (2015) 105–111.
[791] N. Dean, Proof of the prime ladder conjecture, Integers, A40 (2017) 9 pages.
[792] P. Deb and N. B. Limaye, On elegant labelings of triangular snakes, J. Combin.
Inform. System Sci., 25 (2000) 163-172.
[793] P. Deb and N. B. Limaye, Some families of elegant and harmonius graphs, Ars
Combin., 61 (2001) 271-286.
[794] P. Deb and N. B. Limaye, On harmonius labelings of some cycle related graphs,
Ars Combin., 65 (2002) 177-197.
[795] N. S. Deepthi, Super edge-magic total strength of some unicyclic graphs, 2022
arXiv:2212.05329
[796] A. Delman, S. Koilraj, and P. L. Raj, A neighbourhood prime labeling of some spe-
cial graphs, Inter. J. Pure Appl. Math., 120(4) (2018) 601-607. https://ijpam.
eu/contents/2018-120-4/10/10.pdf
[797] C. Delorme, Two sets of graceful graphs, J. Graph Theory, 4 (1980) 247-250.
[798] C. Delorme, M. Maheo, H. Thuillier, K. M. Koh, and H. K. Teo, Cycles with a
chord are graceful, J. Graph Theory, 4 (1980) 409-415.
[799] K. Deng and Y. Li, Caterpillars with maximum degree 3 are antimagic, Discrete
Math., 342(6) (2019) 1799-1801.
[800] Y. X. Deng, Harmoniousness of the graphs Cn + K t , J. Math. Res. Exposition, 15
(1995), suppl., 79-81.
[801] G. Denham, M. G. Leu, and A. Liu, All 4-stars are Skolem graceful, Ars Comb.,
34 (1993) 183-191.

the electronic journal of combinatorics (2023), #DS6 453

 [802] B. Deepa and M. Veerasamy, An enhanced DNA structure for one-time pad to-
gether with graph labeling techniques, AIP Confer. Proceed., 2385, 130045 (2022)
1-9. https://aip.scitation.org/doi/pdf/10.1063/5.0071283
[803] D. Dereniowski, Rank Coloring of Graphs, in: M. Kubale (Ed.), Graph Colorings,
Contemporary Mathematics, 352, Amer. Math. Soc., (2004) 79-93.
[804] T. Deretsky, S. M. Lee, and J. Mitchem, On vertex prime labelings of graphs, in
Graph Theory, Combinatorics and Applications Vol. 1, J. Alavi, G. Chartrand,
O. Oellerman, and A. Schwenk, eds., Proceedings 6th International Conference
Theory and Applications of Graphs (Wiley, New York, 1991) 359-369.
[805] U. Derings and H. Hünten, Magic graphs - A new characterization, Report No.
83265 - OR, Universität Bonn April 1983, ISSN 0724-3138.
[806] U. Deshmukh, Skolem graceful graphs - A survey, in Labeling of Discrete Struc-
tures and Applications, Narosa Publishing House, New Delhi, 2008, 165-170.
[807] U. Deshmukh and V. Y. Shaikh, Mean cordial labelling of some star-related graphs,
Internat. J. Math. Combin.. 3 (2016) 146-157.
[808] J. Devaraj, On edge-cordial graphs, Graph Theory Notes of New York, XLVII
(2004) 14-18.
[809] J. Devaraj, On consecutive labelings of ladder graphs, Bull. Pure Appl. Sci. Sect.
E Math. Stat., 26 (2007) 1-10.
[810] J. Devaraj and P. Delphy, On signed cordial graph, Int. J. Math. Sci. Appl., (2011)
1(3) (2011) 1156-1167. https://ijmsa.yolasite.com/resources/14--sep.pdf
[811] M. Uma Devi, M. Kamaraj, and S. Arockiaraj, Odd Fibonacci edge irregular
labeling for some simple graphs, J. Alg. Stat., 13(3) (2022) 13(3) 1230-1238.
https://www.publishoa.com/index.php/journal/article/view/742
[812] S. A. Devi and R. S. Porchelvi, Pronic graceful labeling on special cases
of generalized Peterson graphs,Wesleyan J. Res., 13(58) (2021) 86-89.
https://www.researchgate.net/publication/367040868_Pronic_Graceful_
Labeling_on_Special_Cases_of_Generalized_Peterson_Graphs
[813] M. Uma Devi, M. Kamaraj, and S. Arockiaraj, Odd Fibonacci edge irregular label-
ing for some trees obtained from subdivision and vertex identification operations,
Baghdad Sci. J., 20(1)(SI)) (2023) 332-338. https://dx.doi.org/10.21123/bsj.
2023.8420
[814] J. DeVito, A. Niedzialomski, and J. Warren, Radio number of Ham-
ming graphs of diameter 3, Theory Appl. Graphs, 9(2) (2022) Art.
10, 13 pp. https://digitalcommons.georgiasouthern.edu/cgi/viewcontent.
cgi?article=1166&context=tag
[815] A. Dharman and O. V. Shanmuga Sundaram, Fibonacci graceful la-
belings for some special graphs, Advan. Engin. Sci., (2022). https:
//www.researchgate.net/publication/374053745_FIBONACCI_GRACEFUL_
LABELING_FOR_SOME_SPECIAL_GRAPHS

the electronic journal of combinatorics (2023), #DS6 454

 [816] A. A. El-hay, Y. Elmshtaye, and A. Elrokh, Solving singed product cor-
dial labeling of corona products of paths and the third power of lemniscate
graphs, Turkish J. Comput. Math. Edu., (TURCOMAT) 14(2) (2023)) 806-823.
https://www.researchgate.net/publication/371032848_Solving_Singed_
Product_Cordial_Labeling_of_Corona_Products_of_Paths_and_the_Third_
Power_of_Lemniscate_Graphs
[817] A. I. Elrokh, M. M. Ali Al-shamiri, A. A. El-hay, A novel problem for solving
cordial labeling of corona product between path and third order of cone graphs,
Turkish J. Comput. Math. Edu., 13(3) (2022) 970-986.
https://www.researchgate.net/publication/366138234_A_NOVEL_PROBLEM_
FOR_SOLVING_CORDIAL_LABELING_OF_CORONA_PRODUCT_BETWEEN_PATH_AND_
THIRD_ORDER_OF_CONE_GRAPHS
[818] A. I. Elrokh, Y. Elmshtaye, and Abd El-hay, The cordiality of cone and lem-
niscate graphs, Appl. Math. Inform. Sci. 16(6) (2022)) 1027-1034. https://www.
naturalspublishing.com/files/published/3rb6lq6p83nq33.pdf
[819] A. ELrokh, R. Ismail, A. A. El-hay, and Y. Elmshtaye, On cubic roots cordial
labeling for some graphs, Symmetry,15(5) (2023) 990. 10 pages. https://doi.
org/10.3390/sym15050990
[820] A. Elrokh, T. V. Sateesh Kumar, and S. Meenaksh, Lucky labeling of jelly fish
graph J(m, n), cocktail party graphs, and crowns. AIP Confer. Proceed. 2516,
210038 (2022). https://doi.org/10.1063/5.0108660
[821] S. A. Devi, R. S. Porchelvi, and T. Arjun, Pronic Heron mean labeling on special
cases of generalized Peterson graph P (n, k) and disconnected graphs, Malaya J.
Matematik, 9 (1) (2021) 262-266. https://doi.org/10.26637/MJM0901/0044
[822] S. K. Devi and B. Gayathri, k-even edge-graceful labeling of the graph Pn @K1,m ,
Bull. Pure Appl. Sci., 29 E(2) 387-407.
[823] E. Dhananjaya and W.-T. Li, Antimagic labeling of forests with sets of consecutive
integers, Discrete Appl. Math., 309 (2022) 75-84.
[824] S. Dhanalakshmi and N. Parvathi, Mean square cordial labeling re-
lated to some cyclic graphs, Indian J. Engin. Tech., 7, no. 4.10,
(2018), 797–800. https://www.researchgate.net/publication/332681831_
Mean_Square_Cordial_Labeling_of_Some_Cycle_Related_Graphs
[825] S. Dhanalakshmi and N. Parvathi, Mean square cordial labeling related to some
acyclic graphics and its rough approximations, J. Physics: Conference Series, 1000,
(2018), 012040 doi:10.1088/1742-6596/1000/1/01204.
[826] S Dhanalakshmi and N. Parvathi, Mean square cordial labeling on star related
graphs, J. Physics: Conference Series, 1377 (2019) 012027 14 pages,
doi:10.1088/1742-6596/1377/1/012027.
[827] S. Dhanalakshmi, Mean square cordial labeling of a shell-butterfly graph, Internat.
J. Math. Comp Sci., 15(4), (2020) 1235–1242, http://ijmcs.future-in-tech.
net/15.4/R-Dhanalakshmi.pdf

the electronic journal of combinatorics (2023), #DS6 455

 [828] S. Dhanalakshmi1 and S. Thirunavukkarasu, Mean square cordial labeling of some
pentagonal snake graphs, Proceed. First Internat. Confer. Comput. Communica-
tion and Control Sys., I3CAC 2021, 7-8 June 2021, Bharath University, Chennai,
India.
https://eudl.eu/doi/10.4108/eai.7-6-2021.2308859
[829] A. T. Diab, Study of some problems of cordial graphs, Ars Combin., 92 (2009)
255-261.
[830] A. T. Diab, On cordial labelings of the second power of paths with other graphs,
Ars Combin., 97A (2010) 327-343.
[831] A. T. Diab, On cordial labelings of wheels with other graphs, Ars Combin., 100
(2011) 265-279.
[832] A. T. Diab, Generalization of some results on cordial graphs, Ars Combin., 99
(2011) 161-173.
[833] A. T. Diab, On cordial labelings of the second power of cycles with other graphs,
Util. Math., 97 (2015) 65-84.
[834] A. T. Diab and E. Elsakhawi, Some results on cordial graphs, Proc. Math. Phys.
Soc. Egypt, No. 77 (2002) 67-87.
[835] A. T. Diab and S. A. E. Mohammed, On cordial labelings of fans with other graphs,
Ars Combin., 106 (2012) 263-275.
[836] A. T. Diab and S. Nada, Some results on specific graphs, Ars Combin. 132 (2017)
93-103.
[837] N. Diefenderfer, M. Hastings, L. N. Heath, H. Prawzinsky, B. Preston, J. Rushall,
E. White, and A. Whittemore, Prime vertex labelings of families of unicyclic
graphs, Rose-Hulman Undergrad. Math J., 16(1) (2015) 253-269.
[838] N. Diefenderfer, D. C. Ernst, M. G. Hastings, L. N. Heath, H. Prawzinsky, B.
Preston, E. White, and A. Whittemore, Prime vertex labelings of several families
of graphs, Involve, 9(4) (2016) 667-688.
[839] Dafik, A. I. Kristiana, S. Setiawani, and K. M. F. Azizah, Generalized shackle
of fans is a super (a, d)-edge-antimagic total graph, J. Graph Label., 2 (1) (2016)
59-68.
[840] J. Dinitz and P. Rodney, Disjoint difference families with block size 3, Util. Math.,
52 (1997) 153-160.
[841] D.M.T.B. Dissanayake, R.A.S.T. Abeysekara, K.D.E. Dhananjaya, A.A.I. Perera,
and P.G.R.S. Ranasinghe, Prime labeling of complete tripartite graphs of the form
K1,m,n , Elixir Appl. Math., 130 (2019) 53092-53094.
[842] K. Driscoll, E. Krop, and M. Nguyen, All trees are six-cordial, Elect. J. Graph
Theory Appl., 5(1) (2016) 21-35. https://www.researchgate.net/publication/
301875801_All_trees_are_six-cordial
[843] J. Doma, Unicyclic Graceful Graphs, M. S. Thesis, McMaster Univ., 1991.

the electronic journal of combinatorics (2023), #DS6 456

 [844] D. Donovan, S. El-Zanati, C. Vanden Eynden, and S. Sutinuntopas, Labelings of
unions of up to four uniform cycles, Australas. J. Combin., 29 (2004) 323-336.
[845] M. Doob, On the construction of magic graphs, Congr. Numer., 10 (1974) 361-374.
[846] M. Doob, Generalizations of magic graphs, J. Combin. Theory, Ser. B, 17 (1974)
205-217.
[847] M. Doob, Characterizations of regular magic graphs, J. Combin. Theory, Ser. B,
25 (1978) 94-104.
[848] S. Drajnová, J. Ivančo, A. Semaničová, Numbers of edges in supermagic graphs,
J. Graph Theory, 52 (2006) 15-26.
[849] K. Driscol, All trees are seven-cordial, arXiv:1909.12351.
[850] W. Dou, On the mod sum number of Hm,n , J. Comb. Optim., 26(3) (2013) 465-471.
[851] W. Dou and J. Gao, The (mod, integral) sum numbers of fans and Kn,n −E(nK2 ),
Discrete Math., 306 (2006) 2655-2669.
[852] W. Dou and J. Gao, Some results on mod (integral) sum graphs, Ars Combin.,
82 (2007) 3-31.
[853] G. M. Du, Cordiality of complete k-partite graphs and some special graphs,
Neimenggu Shida Xuebao Ziran Kexue Hanwen Ban, (1997) 9-12.
[854] G. M. Du, On the cordiality of the union of wheels, J. Inn. Mong. Norm. Univ.
Nat. Sci., 37 (2008) 180-181, 184.
[855] Z.-t. Du and H.-q. Sun, The gracefulness of the digraph n · C ~ 2p , J. Beijing Univ.
Posts and Telecommunications, 17 (1994) 85-88.
[856] G. Duan and Y. Qi, k-gracefulness of two classes of graphs, (Chinese) J. Zhengzhou
Univ. Nat. Sci. Ed., 34 (2002) 36-38, 49.
[857] M. Dufour, Sur la Decomposition d’un Graphe Complet en Arbres Isomorphes,
Ph.D. Thesis, Universite de Montreal, 1995.
[858] A. Durai Baskar and S. Arockiaraj, F -geometric mean graphs, Appl. Appl. Math.,
10(2) (2015) 937-952.
[859] A. Durai Baskar, S. Arockiaraj, and B. Rajendran, F -geometric mean labeling of
some chain graphs and thorn graphs, Kragujevac J. Math. 37(1) (2013) 163-186.
[860] A. Durai Baskar, S. Arockiyaraj, and B. Rajendran, Geometric meanness of graphs
obtained from paths, Util. Math., 101 (2016) 45-68.
[861] A. Durai Baskar and S. Arockiaraj, C-Geometric mean labeling of some
cycle related graphs, Internat. J. Math. Combin. 2 (2019) 69-85. https:
//search.proquest.com/openview/16137f5f82c5f19a9ad9700490d080e5/1?
cbl=51283&pq-origsite=gscholar
[862] D. Dyer, I. Payne, N. Shalaby, and B. Wicks, On the graceful conjecture for trian-
gular cacti, Australas. J. Combin., 53 (2012) 151-170.
[863] P. Dyrlaga, K. Szopa, Orientable Zn -distance magic regular graphs,
arXiv:1712.02676 [math.CO] (2017).

the electronic journal of combinatorics (2023), #DS6 457

 [864] T. Eccles, Graphs of large linear size are antimagic, J. Graph Theory, 81(3) (2016)
236-261.
[865] M. Edwards and L. Howard, A survey of graceful trees, Atlantic Elect.J. Math., 1
(2006) 5-30.
[866] R. B. Eggleton, P. Erdős, and D. K. Skilton, Colouring the real line, J. Combin.
Theory Ser. B, 39(1) (1985) 86-100.
https://reader.elsevier.com/reader/sd/pii/0095895685900395?token=
7F112C8B1EEB8BA4D4551FDFBF02251A3D021F203348A41135D32AF968D5B36A75C81BBEDE7C0659
originRegion=us-east-1&originCreation=20220727122943
[867] S. Ehard, S. Glock, and F. Joos, A rainbow blow-up lemma for almost optimally
bounded edge-colourings, arXiv:907.09950 [math.CO], 28 pages.
[868] P. Eldergill, Decomposition of the Complete Graph with an Even Number of Ver-
tices, M. Sc. Thesis, McMaster University, 1997.
[869] M. N. Ellingham, Sum graphs from trees, Ars Combin., 35 (1993) 335-349.
[870] A. ELrokh, M. M. Ali Al-Shamiri, S. Nada, and A. A. El-hay, Cordial and to-
tal cordial labeling of corona product of paths and second order of lemniscate
graphs, J. Math., (2022), Article ID 8521810, 9 pages. https://www.hindawi.
com/journals/jmath/2022/8521810/
[871] A. ELrokh, E. Badr, M. Al-Shamiri, and S. Ramadhan, Upper bounds of ra-
dio number for triangular snake and double triangular snake graphs, J. Math.,
2022, Art. ID 3635499, 8 pp. https://www.hindawi.com/journals/jmath/2022/
3635499/
[872] A. Elrokh and S. Elkom, The cordial labeling for the four-leaved rose graph, Appl.
Comput. Math., 7(4) (2018) 203-211. doi:10.11648/j.acm.20180704.14
[873] A. ELrokh, S. Nada, and E. El-Shafey, Cordial labeling of corona product of path
graph and second power of fan graph, Open J. Discr. Math., 11 (2021) 31-42.
https://www.scirp.org/journal/paperinformation.aspx?paperid=108431
[874] A. ELrokh and and A. Rabie, The cordiality of the sum and union of two fourth
power of paths and cycles, J. Egypt Math. Soc., (2021) 29(3), 1-13 https://doi.
org/10.1186/s42787-020-00111-6
[875] A. Elsonbaty and S. N. Daoud, Edge even graceful labeling of some path and cycle
related graphs, Ars Combin,. 30 (2017) 79-96.
[876] A. Elsonbaty and K. Mohamed, On some variants of gracefulness of cycle graphs,
Ars Combin., 135 (2017) 39-50.
[877] A. Elsonbaty and S. Nagy Daoud, Edge even graceful labeling of cylinder grid
graph, Symmetry (2019), 11, 584. 30 pages.
[878] A. Elumalai, On Graceful, Cordial and Elegant Labelings of Cycles Related and
Other Graphs, Ph. D. dissertation, Anna University, 2004, Chennai, India.
[879] A. Elumalai and G. Sethuraman, Cordialness of cycles with parallel Pk -chords and
multiple subdivision graphs, Ars Combin., 85 (2007) 85-98.

the electronic journal of combinatorics (2023), #DS6 458

 [880] A. Elumalai and G. Sethuraman, Gracefulness of union of cycle with parallel chords
and complete bipartite graphs or paths, J. Discrete Math. Sci. Cryptogr., 12 (2009)
245-252.
[881] A. Elumalai and G. Sethuraman, Elegant labeled graphs, J. Inform. Math. Sci.,
2(1) (2010) 45-49.
[882] A. Elumali and G. Sethuraman, Gracefulness of a cycle with parallel chords and
parallel Pk -chords of different lenghts, Ars Combin., 104 (2012) 143-148.
[883] S. El-Zanati, H.-L. Fu, and C.-L. Shiue, A note on the α-labeling number of bi-
partite graphs, Discrete Math., 214 (2000) 241-243.
[884] S. El-Zanati and D. I. Gannon, On ρ-labeling 2-regular graphs consisting of 5-
cycles, Int. J. Math. Comput. Sci., 6(1) (2011) 13-20.
[885] S. El-Zanati, M. Kenig, and C. Vanden Eynden, Near α-labelings of bipartite
graphs, Australas. J. Combin., 21 (2000) 275-285.
[886] S. El-Zanati and C. Vanden Eynden, Decompositions of Km,n into cubes, J. Com-
bin. Designs, 4 (1996) 51-57.
[887] S. El-Zanati and C. Vanden Eynden, On graphs with strong α-valuations, Ars
Combin., 56 (2000) 175-188.
[888] S. El-Zanati and C. Vanden Eynden, On α-valuations of disconnected graphs, Ars
Combin., 61 (2001) 129-136.
[889] S. El-Zanati and C. Vanden Eynden, On Rosa-type labelings and cyclic graph
decompositions, Math. Slovaca, 59 (2009) 1-18.
[890] S. El-Zanati, C. Vanden Eynden, and N. Punnim, On the cyclic decomposition of
complete graphs into bipartite graphs, Australas. J. Combin., 24 (2001) 209-219.
[891] H. Enomoto, A. S. Llado, T. Nakamigawa, and G. Ringel, Super edge-magic graphs,
SUT J. Math., 34 (1998) 105-109.
[892] H. Enomoto, K. Masuda, and T. Nakamigawa, Induced graph theorem on magic
valuations, Ars Combin., 56 (2000) 25-32.
[893] A. A. Ephremnath and A. Elumalai, Every cycle with chord Hamiltonian path is
harmonious and elegant, Int. J. Adv. Engg. Tech.,VII (II) (2016) 1-4.
[894] P. Erdős and A. B. Evans, Representations of graphs and orthogonal Latin squares,
J. Graph Theory, 13 (1989) 593-595.
[895] W. Q. Erickson, D. Herden, J. Meddaugh, M. R. Sepanski, I. Echols, C. Hammon,
J. Marchena-Menendez, J. Mohn, B. Radillo-Murguia, and I. Ruiz-Bolanos, Klein
cordial trees and odd cyclic cordial friendship graphs, (2022) arXiv:2211.10044
29 pages.
[896] E. Esakkiammal, K. Thirusangu, and S. Seethalakshmi, Lucky edge labeling of
super subdivision of star and wheel graphs, Internat. J. Pure Appl. Math., 113(7)
(2017) 84-92. https://acadpubl.eu/jsi/2017-113-pp/articles/7/11.pdf

the electronic journal of combinatorics (2023), #DS6 459

 [897] K. Eshghi, The Existence and Construction of α-valuations of 2-Regular Graphs
with 3 Components, Ph. D. Thesis, Industrial Engineering Dept., University of
Toronto, 1997.
[898] K. Eshghi, α-valuations of special classes of quadratic graphs, Bull. Iranian Math.
Soc., 28 (2002) 29-42.
[899] K. Eshghi, Holey α-labelings of graphs, Util. Math., 64 (2003) 139-147.
[900] K. Eshghi, Extension of α-labelings of quadratic graphs, IJMMS 11 (2004) 571-
578.
[901] K. Eshghi, An integer programming model and a Tabu search algorithm to generate
α-labeling of special classes of quadratic qraphs, Iranian J. Operations Res., 7(1)
(2016) 1-17.
[902] K. Eshghi, An introduction to the graceful graphs, Sharif University of Tech-
nology 2002) 65 pp. http://sharif.edu/~eshghi/Graceful%20Graphs-Final%
20Edition-89-12-15.pdf
[903] K. Eshghi and P. Azimi, Applications of mathematical programming in graceful
labeling of graphs, J. Appl. Math., 1(1) (2004) 1-8.
[904] K. Eshghi and P. Azimi, An algorithm for finding a feasible solution of graph
labeling problems, Util. Math., 72 (2007) 163-174.
[905] K. Eshghi and M. Carter, Construction of α-valuations of special classes of 2-
regular graphs, Topics in Applied and Theoretical Mathematics and Computer
Science, Math. Comput. Sci. Eng., WSEAS, Athens (2001) 139-154.
[906] K. Eshghi and M. Salarrezaie, Existence and construction of α-labeling for
quadratic graph Q(7, 4k) and its extensions, Int. J. Graph. Theory Appl., (IJGTA),
to appear.
[907] K. Eshghi and M. Salarrezaie, An integer programming model and a Tabu search
algorithm to generate α-labeling of special classes of quadratic graph, Iran. J.
Oper. Res.,, to appear.
[908] A. B. Evans, Representations of disjoint unions of complete graphs, unpublished.
[909] A. B. Evans, G. H. Fricke, C. C. Maneri, T. A. McKee, and M. Perkel, Represen-
tations of graphs modulo n, J. Graph Theory 18 (1994) 801-815.
[910] A. B. Evans, G. Isaak, and D. A. Narayan, Representations of graphs modulo n,
Discrete Math., 223 (2000) 109-123.
[911] G. Exoo, A. Ling, J. McSorley, N. Phillips, and W. Wallis, Totally magic graphs,
Discrete Math., 254 (2002) 103-113.
[912] G. Eyabi, J. Jacob, R. Laskar, D. Narayan, and D. Pillone, Minimal rankings of
the Cartesian product Kn Km , Discuss. Math. Graph Th., 32(4) (2012) 725-735.
[913] L. Fan and Z. Liang, On Lee’s conjecture and some results, Discuss. Math. Graph
Theory, 29 (2009) 481-498.

the electronic journal of combinatorics (2023), #DS6 460

 [914] W. Fang, A computational approach to the graceful tree conjecture,
arXiv:1003.3045v1 [cs.DM].
[915] W. Fang, New computational result on harmonious trees, arXiv:1106.3490v1
[cs.DM] 17 June 2011.
[916] A. Farida, R. P. Indah, and N. A. Sudibyo, Magic covering and edge magic labelling
and its application magic covering and edge magic labelling and its application, J.
Physics: Confer. Ser., 1657 (2020) 012051 1-5. https://iopscience.iop.org/
article/10.1088/1742-6596/1657/1/012051
[917] H. Farida and D. Indriati, On the total edge irregularity strength of three towers
hanoi graph, J. Physics Confer. Ser., (2019) 1211:012010 https://iopscience.
iop.org/article/10.1088/1742-6596/1211/1/012010/pdf
[918] R. J. Faudree and J. Lehel, Bound on the irregularity strength of regular graphs.
Combinatorics (Eger, 1987) 247-256, Colloq. Math. Soc. Jǎnos Bolyai, 52, North-
Holland, Amsterdam, 1988.
[919] R. J. Faudree, M. S. Jacobson, J. Lehel and R. H. Schelp, Irregular networks,
regular graphs and integer matrices with distinct row and column sums, Discrete
Math., 76 (1989) 223-240.
[920] R. J. Faudree, M. S. Jacobson, L. Kinch, and J. Lehel, Irregularity strength of
dense graphs. Discrete Math., 91(1) (1991) 45-59.
[921] W. Feng, C. Xu, and Jirimutu, A survey of the gracefulness of digraphs, Int. J.
Pure Appl. Math., 69 (2011) 245-253.
[922] W. Feng, X. Hong, Y. Yang, and Jirimutu, On (a, d)-antimagic labelings of gener-
alized Petersen graphs P (n, 5), Util. Math. 95 (2014) 349-356.
[923] H. Fernau and K. Gajjar, Sum labelling graphs of maximum degree two,
arXiv:2301.02178 26 pp.
[924] H. Fernau and K. Gajjar, The space complexity of sum labelling, Theory of Com-
puting Systems, (2023) https://doi.org/10.1007/s00224-023-10130-2
[925] B. Fern/’andez, R. H. Maleki, S. Miklavič, and A. S. Razafimahatratra, On closed
distance magic circulants of valency up to 5.arXiv:2212.12441 15 p.
[926] C. Fernandez, A. Flores, M. Tomova, and C. Wyels, The radio number of gear
graphs, arXiv:0809.2623
[927] H. Fernau, J. F. Ryan, and K. A. Sugeng, A sum labelling for the generalised
friendship graph, Discrete Math., 308 (2008) 734-740.
[928] J. Ferraro, G. Newkirk, and S. Shan, Antimagic orientation of subdivided cater-
pillars, Discrete Appl. Math., 313 (2022) 45-52. arXiv:2106.08430.
[929] R. Figueroa-Centeno and R. Ichishima, The n-dimensional cube is felicitous, Bull.
Instit. Combin. Appl., 41 (2004) 47-50.
[930] R. M. Figueroa-Centeno and R. Ichishima, On the sequential number and super
edge-magic deficiency of graphs, Ars Combin., 129 (2016) 157-163.

the electronic journal of combinatorics (2023), #DS6 461

 [931] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, Bertrand’s postulate
and magic product labelings, Bull. Instit. Combin. Appl., 30 (2000) 53-65.
[932] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, The place of super
edgemagic labelings among other classes of labelings, Discrete Math., 231 (2001)
153-168.
[933] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, On super edge-magic
graphs, Ars Combin., 64 (2002) 81-95.
[934] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, Magical coronations
of graphs, Australas. J. Combin., 26 (2002) 199-208.
[935] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, Labeling the vertex
amalgamation of graphs, Discuss. Math. Graph Theory, 23 (2003) 129-139.
[936] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, On edge-magic label-
ings of certain disjoint unions of graphs, Australas. J. Combin. 32 (2005) 225-242.
[937] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, Some new results on
the super edge-magic deficiency of graphs, J. Combin. Math. Combin. Comput.,
55 (2005) 17-31.
[938] R. Figueroa-Centeno, R. Ichishima, and F. Muntaner-Batle, On the super edge-
magic deficiency of graphs, Ars Combin., 78 (2006) 33-45.
[939] R. Figueroa-Centeno, R. Ichishima, F. Muntaner-Batle and A. Oshima, A magi-
cal approach to some labeling conjectures, Discussiones Math. Graph Theory, 31
(2011) 79-113.
[940] R. Figueroa-Centeno, R. Ichishima, F. Muntaner-Batle, and A. Oshima, Gracefully
cultivating trees on a cycle, Electron. Notes Discrete Math., 48 (2015) 143-150.
[941] R. Figueroa-Centeno, R. Ichishima, F. Muntaner-Batle, and M. Rius-Font, Label-
ing generating matrices, Labeling generating matrices, J. Combin. Math. Combin.
Comput., 67 (2008) 189-216.
[942] F. Firmansah, The odd harmonious labeling on variation of the double quadri-
lateral windmill graphs, Jurnal Ilmu Dasar, 18(2) (2017) 109-118. https://doi.
org/10.19184/jid.v18i2.5648
[943] F. Firmansah, Pelabelan armonis ganjil pada graf ular jaring berlipat, Sainmatika:
J. Ilmiah Mate. Dan Ilmu Pengetahuan Alam, 17(1) (202) 1–8. https://doi.org/
10.31851/sainmatika.v17i1.3182
[944] F. Firmansah, Odd harmonious labeling on some string graph classes,
BAREKENG: J. Ilmu Mat. Dan Terapan, 16(1) (2022) 315-322. https://doi.
org/10.30598/barekengvol16iss1pp313-320
[945] F. Firmansah, The odd harmonious labeling of layered graphs, JTAM (Jurnal
Teori Dan Aplikasi Matematika), 7(2) (2023) 339-348. https://journal.ummat.
ac.id/index.php/jtam/article/view/12506
[946] F. Firmansah and W. Giyarti, Odd harmonious labeling on the amalga-
mation of the generalized double quadrilateral windmill graph, Desimal: J.

the electronic journal of combinatorics (2023), #DS6 462

 Mat., 4(3) (2021) 373-378. http://ejournal.radenintan.ac.id/index.php/
desimal/article/view/10823
[947] F. Febriana and K. A. Sugeng, Odd harmonious labeling on squid graph and
double squid graph, J. Physics: Conference Ser., 1538(1) (2020) 1–5. https:
//iopscience.iop.org/article/10.1088/1742-6596/1538/1/012015/pdf
[948] F. Firmansah, Tasari, and M. R. Yuwono, Odd harmonious labeling of the zinnia
flower graphs, Jurnal Ilmiah Sains, 23(1) (2023) 40-46. https://doi.org/10.
35799/jis.v23i1.46771
[949] S. S. Sarasvati, I. Halikin, and K. Wijaya, Odd harmonious labeling of Pn D C4
and Pn D D2 (C4 ), Indonesian J. Combin., 5(2) (2021) 94-101. https://doi.org/
10.19184/ijc.2021.5.2.5
[950] F. Firmansah and T. Tasari, Odd harmonious labeling on edge amalgamation from
double quadrilateral graphs, Desimal: J. Mat., 3(1) (2020) 65-72. DOI:10.24042/
djm.v3i1.5712
[951] F. Firmansah and M. R. Yuwono, Odd harmonious labeling of pleated of the
Dutch windmill graphs, Cauchy J. Mate. Murni dan Aplikasi, 4(4) (2017) 161-
166. doi:10.18860/ca.v4i4.4043
[952] S. Francis and V. Balaji, On relaxed mean labeling for wheel graphs, Internat. J.
Pure Appl. Math,, 114 (2017) 173-182. https://acadpubl.eu/jsi/2017-114-5/
articles/21.pdf
[953] C. Frayer, Properties of divisor graphs, Technical Report, Depart. Math., Grand
Valley State University, Allandale, Michigan, USA.
[954] S. Freeda and R. S. Chellathurai, H- and H2 -cordial labeling of some graphs, Open
J. Discrete Math., 2 (2012) 149-155. doi:10.4236/ojdm.2012.24030
[955] B. J. Freyberg, Face-magic labelings of type (a, b, c) from edge-magic labelings of
type (α, β). Bull. Instit. Combin. Appl., 93 (2021) 81-103. http://bica.the-ica.
org/Volumes/93/Reprints/BICA2021-05-Reprint.pdf
[956] B. J. Freyberg, Corrigendum: Face-magic labelings of type (a, b, c) from edge-
magic labelings of type (α, β), Bull. Inst. Combin. Appl., 94 (2022) 71-72.
https://doi.org/10.26493/2590-9770.1658.c96
[957] Bryan Freyberg, On face-magic labelings of regular tesselations, The Art Disc.
Appl. Math., to appear, 9 pp. https://doi.org/10.26493/2590-9770.1658.c96
[958] B. Freyberg and M. Keranen, Orientable Zn -distance magic labeling of the Carte-
sian product of many cycles, Electron. J. Graph Theory Appl., 5(2) (2017) 304-311.
[959] B. Freyberg and M. Keranen, Orientable Zn -distance magic labeling of the Carte-
sian product of two cycles, Australas. J. Combin., 69 (2017) 222-235.
[960] B. Freyberg and M. Keranen, Orientable Zn -distance magic magic graphs via prod-
ucts, Australasian J. Combin., 70(3) (2018) 319-328.
[961] A. Frieze, R. J. Gould, M. Karonski and F. Pfender, On graph irregularity strength,
J. Graph Theory 41 (2002) 120-137.

the electronic journal of combinatorics (2023), #DS6 463

 [962] D. Fronček, Bi-cyclic decompositions of complete graphs into spanning trees, Dis-
crete Math., 307 (2007) 1317-1322.
[963] D. Fronček, Recent advances in Rosa-type labelings of graphs, AKCE J. Graphs
Combin., 6 (2009) 69-78.
[964] D. Fronček, α2 -labeling of graphs, Opuscula Math., 29 (2009) 393-397.
[965] D. Fronček, Group distance magic labeling of Cartesian product of cycles, Aus-
tralas. J. Combin., 55 (2013) 167-174.
[966] D. Fronček, Handicap distance antimagic graphs and incomplete tournaments,
AKCE Int. J. Graphs Comb., 16(2) (2013) 119-127.
[967] D. Fronček, Alpha labelings of full hexagonal caterpillars, AKCE Internat. J.
Graphs Combin., 13 (2016) 85-89.
[968] D. Fronček, Handicap incomplete tournaments and ordered distance antimagic
graphs, https://www.researchgate.net/publication/267092003_Handicap_
incomplete_tournaments_and_ordered_distance_antimagic_graphs
[969] D. Fronček, Regular incomplete tournaments with handicap two, Congr. Numer.,
227 (2016) 277-285.
[970] D. Fronček, Regular handicap graphs of odd order, J. Combin. Math. Combin.
Comput., 102 (2017) 253-266.
[971] D. Fronček, Full spectrum of regular incomplete 2-handicap tournaments of order
n ≡ 0 (mod 16), J. Combin. Math. Combin. Comput., 106 (2018) 175-184.
[972] D. Fronček, Supermagic labeling of Cn Cm , arXiv:2212.14836
[973] D. Fronček, O. Kingston, and K. Vezina, Alpha labelings of straight simple poly-
nomial caterpillars, Congr. Numer., 222 (2014) 57-64.
[974] D. Fronček, P. Kovář, and T. Kovářová, Vertex magic total labeling of products
of cycles, Australas. J. Combin., 33 (2005) 169-181.
[975] D. Fronček, P. Kovář, and T. Kovářová, Constructing distance magic graphs from
regular graphs, J. Combin. Math. Combin. Comput., 78 (2011) 349-354.
[976] D. Fronček and M. Kubesa, Factorizations of complete graphs into spanning trees,
Congr. Numer., 154 (2002) 125-134.
[977] D. Froncek and M. McKeown, Note on diagonal construction of Z2nm su-
permagic labeling of Cn Cm , AKCE Int. J. Graphs Comb., 17 (2020), no.
3, 952–954. https://www.tandfonline.com/doi/epub/10.1016/j.akcej.2019.
08.009?needAccess=true
[978] D. Fronček and J. Qiu, Supermagic graphs with many odd degrees, Combin. Algor.,
229–236, Lecture Notes in Comput. Sci., 11638, Springer, Cham, 2019.ivan
[979] D. Fronček and A. Shepanik, Regular handicap graphs of order n ≡ 0 (mod 8),
Electronic J. Graph Th. Appl. 6 (2) (2018) 208-218.

the electronic journal of combinatorics (2023), #DS6 464

 [980] D. Fronček and A. Shepanik, Regular handicap graphs of order n mod 4 (mod 8),
Elec. J. Graph Theory Appl., 10(1), (2022) 259-273. https://www.ejgta.org/
index.php/ejgta/article/view/1362
[981] D. Fronček and L. Tollefson, Decompositions of complete graphs into kayak pad-
dles, J. Indones. Math. Soc., Special Edition (2011) 30-44.
[982] D. Fronček and L. Tollefson, Decompositions of complete graphs into kayak paddles
with two odd cycles, Proceedings of the Forty-Second Southeastern International
Conference on Combinatorics, Graph Theory and Computing. Congr. Numer., 207
(2011) 161-169.
[983] D. Fronček and S. Winters, Another family of gracious bipartite graphs, Congr.
Numer., 170 (2004) 65-70.
[984] R. Frucht, Graceful numbering of wheels and related graphs, Ann. N.Y. Acad. Sci.,
319 (1979) 219-229.
[985] R. Frucht, On mutually graceful and pseudograceful labelings of trees, Scientia
Series A, 4 (1990/1991) 31-43.
[986] R. Frucht, Nearly graceful labelings of graphs, Scientia, 5 (1992-1993) 47-59.
[987] R. Frucht and J. A. Gallian, Labeling prisms, Ars Combin., 26 (1988) 69-82.
[988] R. Frucht and L. C. Salinas, Graceful numbering of snakes with constraints on the
first label, Ars Combin., 20 (1985), B, 143-157.
[989] C.-M. Fu, N.-H. Jhuang and Y.-L. Lin, Integer-magic spectra of sun graphs, Ars
Combin., 103 (2012) 55-64.
[990] H. L. Fu and K. C. Huang, On prime labelling, Discrete Math., 127 (1994) 181-186.
[991] H. L. Fu and S. L. Wu, New results on graceful graphs, J. Combin. Info. Sys. Sci.,
15 (1990) 170-177.
[992] Y. Fukuchi, Graph labelings in elementary abelian groups, Discrete Math., 189
(1998) 117-122.
[993] Y. Fukuchi, A recursive theorem for super edge-magic labelings of trees, SUT J.
Math., 36 (2000) 279-285.
[994] Y. Fukuchi, Edge-magic labelings of generalized Petersen graphs P (n, 2), Ars Com-
bin., 59 (2001) 253-257.
[995] Y. Fukuchi, Edge-magic labelings of wheel graphs, Tokyo J. Math., 24 (2001)
153-167.
[996] Y. Fukuchi and A. Oshima, Super-edge-magic labelings of a family of trees with
diameter 4, Adv. Appl. Discrete Math., 1 (2008) 149-157.
[997] Y. Fukuchi, and A. Oshima, Super-edge-magic labeling of trees with large diameter,
Far East J. Math. Sci., 28 (2008) 497-571.
[998] R. M. Gajjar and K. K. Raval, Some labeling of north star and lotus star
graphs, METSZET J. 7(12) (2023) 379-387. https://www.researchgate.net/

the electronic journal of combinatorics (2023), #DS6 465

 publication/371538693_Some_Labeling_of_North_Star_and_Lotus_Star_
Graphs
[999] S. J. Gajjar, Prime cordial labeling of generalized web graph W (t, n), Internat J.
Res. Analytical Reviews, (IJRAR) 6(2) (2019) 697-710.
[1000] S. J. Gajjar and A. K. Des, Cordial labeling of generalized Jahangir graph,
Internat. J. Math. Appl., 4(1–D) (2016) 21-33. https://www.researchgate.
net/publication/329626405_Cordial_Labeling_of_Generalized_Jahangir_
Graph
[1001] J. A. Gallian, Labeling prisms and prism related graphs, Congr. Numer.,
59 (1989) 89-100. https://www.researchgate.net/publication/265929297_
Labeling_prisms_and_prism_related_graphs#fullTextFileContent
[1002] J. A. Gallian, A survey: recent results, conjectures and open problems on labeling
graphs, J. Graph Theory, 13 (1989) 491-504.
[1003] J. A. Gallian, Open problems in grid labeling, Amer. Math. Monthly, 97 (1990)
133-135.
[1004] J. A. Gallian, A guide to the graph labeling zoo, Discrete Appl. Math.,
49 (1994) 213-229. https://www.researchgate.net/publication/222843108_
A_guide_to_the_graph_labeling_zoo
[1005] J. Gallian, unpublished.
[1006] J. A. Gallian and D. S. Jungreis, Labeling books, Scientia, 1 (1988) 53-57. https:
//www.researchgate.net/publication/265314475_Labeling_books
[1007] J. A. Gallian, J. Prout, and S. Winters, Graceful and harmonious labelings of
prisms and related graphs, Ars Combin., 34 (1992) 213-222.
[1008] J. A. Gallian and L. A. Schoenhard, Even harmonious graphs, AKCE J.
Graphs Combin., 11(1) (2014) 27-49. https://www.tandfonline.com/doi/pdf/
10.1080/09728600.2014.12088761
[1009] J. A. Gallian and D. Stewart, Properly even harmonious labelings of discon-
nected graphs, AKCE J. Graphs Combin., 12(2-3) (2015) 193-203. https://www.
tandfonline.com/doi/pdf/10.1016/j.akcej.2015.11.015
[1010] J. A. Gallian and D. Stewart, Even harmonious labelings of disjoint graphs with
a small component, AKCE J. Graphs Combin., 12(2-3) (2015) 204-215. https:
//www.tandfonline.com/doi/pdf/10.1016/j.akcej.2015.11.016
[1011] J. A. Gallian and D. Stewart, Properly even harmonious labelings of disjoint
unions with even sequential graphs, J. Graph Labeling, 1(1) (2015) 1-10. https:
//www-users.cse.umn.edu/~dkstewar/publications/GalSteP3.pdf
[1012] S. Ganesan and D. Uthayakumar, Corona of bipartite graphs with divisor graphs
produce new divisor graphs, Bull. Kerala Math. Assoc., 9(1) (2012) 219-226.
[1013] G. S. Ganeshwari and G. Sudhana, Even-odd average harmonious graph, Pro-
ceed. Internat. Virtual Confer., (2021) 165-176. https://www.researchgate.

the electronic journal of combinatorics (2023), #DS6 466

 net/profile/Ather-Raina/publication/355475969_Proceedings_of_
International_Virtual_Conference/links/6172866ca767a03c14919b5d/
Proceedings-of-International-Virtual-Conference.pdf#page=178
[1014] T. Gangopadhyay and S. P. Rao Hebbare, Bigraceful graphs-I, Util. Math., 17
(1980) 271-275.
[1015] D. I. Gannon and S. I. El-Zanati, All 2-regular graphs with uniform odd com-
ponents admit ρ-labelings, Australas. J. Combin., 53 (2012) 207-219. https:
//ajc.maths.uq.edu.au/pdf/53/ajc_v53_p207.pdf
[1016] A-B. Gao, X-D. Zhang, and L-J. Xu, On (super) vertex-graceful labeling of graphs,
Ars Combin., 126 (2016) 121-131.
[1017] M. Gao, The edge different sets of the direct product of two paths, MS thesis,
Fuzhou University, 2010.
[1018] Y. Z. Gao, On gracefulness of Cm ∪ P2 , J. Hebei Teachers College, No. 3 (1993)
13-21.
[1019] Y. Z. Gao and Z. H. Liang, private communication.
[1020] Y. Gao, Yuping, and S. Shan, Antimagic orientation of lobsters, Discrete Appl.
Math., 287 (2020) 21-26. https://www.sciencedirect.com/science/article/
abs/pii/S0166218X20303644
[1021] Z.-B. Gao, The labelings of a variation of banana trees, Ars Combin., 94 (2010)
175-181.
[1022] Z.-B. Gao, G. C. Lau, and S. M. Lee, On friendly index and product-cordial index
sets of Möbius-liked graph, J. Discrete Math. Sci. Crypt., 21(3) (2018) 647-659.
[1023] Z.-B. Gao, G.-Y. Sun, Y.-N. Zhang, Y. Meng, and G. C. Lau, Product cordial and
n
total product cordial labelings of Pn+1 , J. Discrete Math., (2015) Art. ID 512696,
6 pp.
[1024] Z.-B. Gao, Odd graceful labelings of some union graphs, J. Nat. Sci. Heilongjiang
Univ., 24 (2007) 35-39.
[1025] Z.-B. Gao, The super vertex-graceful labeling of graphs, Ars Combin., 124 (2016)
389-400.
[1026] Z.-B. Gao and C. Fan, Some discussion on super edge-magic labelings of
St(a1 , . . . , an ), Ars Combin., 108 (2013) 187-192.
[1027] Z.-B. Gao, G.-C. Lau, and S-.M. Lee, On friendly index and product-cordial index
sets of Möbius-liked graph, J. Discrete Math. Sci. Cryptogr., 21(3) (2018) 647-659.
[1028] Z.-B. H. Gao, Ruo-Yuan, S.-M. Lee, H.-N. Ren, and G.-Y. Sun, Discussions on full
friendly index sets of a class of cubic graphs, Ars Combin., 146 (2019) 375-389.
[1029] Z-B. Gao, G-Y. Sun, S-M. Lee, On full friendly index sets of 1-level and 2-levels
N -grids, Discrete Appl. Math., 211 (2016) 68-78.
[1030] Z.-B. Gao and X. Zhang, A note on super edge-graceful labelings of caterpilars, J.
Shanghai Jiaotong Univ., 42 (2008) 493-495.

the electronic journal of combinatorics (2023), #DS6 467

[1031] Z.- B. Gao, X.-D. Zhang, and L.-J. Xu, Odd graceful labelings of graphs, Discrete
Math. Algor. Appl., 1(3) (2009) 377-388.
[1032] M. Gardner, Mathematical games: the graceful graphs of Solomon Golomb, or how
to number a graph parsimoniously, Scientific Amer., 2263 (1972) 108-112; 2264
(1972) 104; 226(6) (1972) 118.
[1033] Gardner, Wheels, Life and Other Mathemaical Amusements, W. H. Freeman &
Company, 1983.
[1034] B. Gayathri and K. Amuthavalli, personal communication (2008).
[1035] B. Gayathri and K. Amuthavalli, k-odd mean labeling of the graph hK1,n : K1,m i,
Acta Ciencia Indica Math., XXIV M (2008) 827-834.
[1036] B. Gayathri and K. Amuthavalli, k-odd mean labeling of prism, Trans. Comb.,
4(1) (2015) 49-56.
[1037] B. Gayathri and S. K. Devi, k-edge-graceful labeling and k-global edge-graceful
labeling of some graphs, Internat. J. Engin. Sci., Adv. Comput. and Bio-Tech.,
2(1) (2010) 25-37.
[1038] B. Gayathri and S. K. Devi, k-even edge-graceful labeling of the bistar graph Bn,n ,
Proceed. Internat. Conf. Math. and Comput. Sci. ICMCS 2011, 525-532.
[1039] B. Gayathri and S. K. Devi, k-even edge-graceful labeling of some graphs, Internat.
J. Math. and Comput. Sci., 6(1) (2011) 27-34.
[1040] B. Gayathri and S. K. Devi, k-even edge-graceful labeling of some cycle related
graphs, Internat. J. Engin. Sci. Invention, 2(10) (2013) 1-17.
[1041] B. Gayathri and M. Duraisamy, personal communication (2008)
[1042] B. Gayathri, M. Duraisamy, and M. Tamilselvi, Even edge graceful labeling of
some cycle related graphs, Int. J. Math. Comput. Sci., 2 (2007) 179-187.
[1043] B. Gayathri and R. Gopi, k-even mean labeling of Dm,n @Cn , Internat. J. Enger.
Sci., Adv. Comput. Bio-Tech., 1(3) (2010) 137-145.
[1044] B. Gayathri and R. Gopi, k-even mean labeling of Dm,n , Acta Ciencia Indica,
XXXVII M(2) (2011) 291-300.
[1045] B. Gayathri and R. Gopi, k-even mean labeling of Tn,m,t , Internat. J. Enger. Sci.,
Adv. Comput. Bio-Tech.,1(3) (2011) 137-145.
[1046] B. Gayathri and R. Gopi, k-even mean labeling of Cn ∪ Pm , Elixir Appl. Math., 36
(2011) 3102-3105.
[1047] B. Gayathri and R. Gopi, (k, d)-even mean labeling of Pm ⊕ nK1 , Internat. J.
Math. Soft Comput., 1(1) (2011) 17-23.
[1048] B. Gayathri and R. Gopi, Necessary condition for mean labeling, Internat. J.
Engin. Sci., Adv. Comput. Bio-Tech., 4(3) July-Sept. (2013) 43-52.
[1049] B. Gayathri and R. Gopi, k-even mean labeling of some graph operations, Internat.
J. Engin. Sci., Adv. Comput. and Bio-Tech., 4(3) Oct-Dec. (2013) 59-70.

the electronic journal of combinatorics (2023), #DS6 468

[1050] B. Gayathri and R. Gopi, Cycle related mean graphs, Elixir Internat. J. Applied
Sci., No. 71, (2014) 25116-25124.
[1051] B. Gayathri and R. Gopi, Some properties of k-mean labeling, Internat. J. Multi-
disciplinary Res. Publication (IJMRAP), 1(3) (2018) 1-2.
[1052] B. Gayathri and R. Gopi, Some general results on restricted k-mean graph, J.
Discrete Math. Sci. Cryptography, (2019) 1-11.
[1053] B. Gayathri and V. Prakash, One modulo three mean labeling of some special
graphs, Math. Sci. Internat. Res. J., 4(2) (2015) 434-440.
[1054] B. Gayathri and V. Prakash, Necessary condition for one modulo three mean label-
ing of graphs, Internat. J. Engineering Sci., Adv. Comput. Bio-Tech., 6(2) (2015)
41-61.
[1055] B. Gayathri and V. Prakash, One modulo three mean labeling of some family of
trees, Internat. J. Engin. Sci., Adv. Comput. Bio-Tech., 6(4) (2015) 141-161
[1056] B. Gayathri and V. Prakash, One modulo three mean labeling of discon-
nected graphs, Jamal Acad. Res. J.: Interdecipilinary, Special Issue (2016)
21-26. https://www.researchgate.net/publication/363069935_ONE_MODULO_
THREE_MEAN_LABELING_OF_DISCONNECTED_GRAPHS
[1057] B. Gayathri and V. Prakash, k-one modulo three mean labeling of some
path related graphs, Inter. J. Res. Advent Tech., 6(10) (2018) 2790-
2795. https://www.researchgate.net/publication/368255121_ONE_MODULO_
THREE_MEAN_LABELING_OF_SOME_PATH_RELATED_GRAPHS
[1058] B. Gayathri and V. Prakash, k-one modulo three mean labeling of snake re-
lated graphs, Internat. J. Sci. Res. Review 7(9) (2018) 169-177. http://www.
dynamicpublisher.org/gallery/23-ijsrr-d817.pdf
[1059] B. Gayathri and V. Prakash, One modulo three mean labeling of some path
related graphs, Adalya J., 8(9) (2019) 176-181. https://www.researchgate.
net/publication/368255121_ONE_MODULO_THREE_MEAN_LABELING_OF_SOME_
PATH_RELATED_GRAPHS
[1060] B. Gayathri and V. Hemalatha, Even sequential harmonious graphs, personal com-
munication (2008).
[1061] B. Gayathri and D. Muthurramakrishnan, Some results on k-even sequential har-
monious labeling of graphs, Elixir Internat. J. Applied Sci., 47 (2012) 9054-9057.
[1062] B. Gayathri and M. Subbiah, Strong edge graceful labelings of some graphs, Bull.
Prue Appl. Sci., 27E (2008) 1-10.
[1063] B. Gayathri and M. Tamilselvi, personal communication (2008).
[1064] K. Gayathri, V. Thanjavur, P. Maniammai, and C. Sakar, Prime cordial label-
ing of some graphs, J. Physics: Confer. Ser., 1947 (2021) 012016, 1-7. https:
//iopscience.iop.org/article/10.1088/1742-6596/1947/1/012016/pdf
[1065] G. Ge, Y. Miao and X. Sun, Perfect difference families, perfect difference matrices
and related combinatorial structures, J. Combin. Des., 18 (2010) 415-449.

the electronic journal of combinatorics (2023), #DS6 469

[1066] T. Geetha and D. Kalamani, Square difference labeling for some graphs, J.
Computer Math. Sci., textbf10(4) 695-704. http://www.compmath-journal.org/
dnload/T-Geetha-and-D-Kalamani/CMJV10I04P0695.pdf
[1067] J. P. Georges, D. W. Mauro, and Y. Wang, On the structures of V4 -magic and
Z4 -magic graphs, J. Combin. Math. Combin. Comput., 75 (2010) 137-152.
[1068] R. Gera, V. Saenpholphat, and P. Zhang, Divisor graphs with triangles, Congr.
Numer., 165 (2003) 51-64.
[1069] K. A. Germina, More on classes of strongly indexable graphs, European J. Pure
and Applied Math., 3-2 (2010) 269-281.
[1070] K. A. Germina, A. Kumar, and K. L. Princy, Further results on set-valued graphs,
J. Discrete Math. Sci. Cryptogr., 11 (2008) 559-566.
[1071] K. A. Germina and V. Ajitha, Strongly multiplicative graphs, unpublished.
[1072] K. A. Germina and T.M.K. Anandavally, On arithmetic embeddings of graphs,
unpublished.
[1073] K. A. Germina and R. Sebastian, On square sum graphs, Proyecciones 32(2) (2013)
107-117.
[1074] K. A. Germina and R. Sebastian, Futher results on square sum graph, Inter-
nat. Math. Forum, 8(1) (2013) 47-57. http://www.m-hikari.com/imf/imf-2013/
1-4-2013/sebastianIMF1-4-2013.pdf
[1075] S. V. Gervacio, Which wheels are proper autographs?, Sea Bull. Math., 7 (1983)
41-50.
[1076] S. V. Gervacio, personal communication (2006).
[1077] H. V. Getzimah and K. Palani, Antimagic total labeling on Zp+q , J. Comp. Math.
Sci., 9(11) (2018) 1653-1660.
[1078] M. Ghebleh and R. Khoeilar, A note on: “H-cordial graphs,” Bull. Inst. Combin.
Appl., 31 (2001) 60-68.
[1079] G. V. Ghodasara and I. I. Jadav, New grid related cordial graphs, Internat. J.
Appl. Math., 28(2) (2013) 1244-1248.
[1080] G. V. Ghodasara and J. P. Jena, Prime cordial labeling of the graphs related to
cycle with one chord, twin chords and triangle, Internat. J. Pure and Appl. Math.,
89(1) (2013) 79-87.
[1081] G. V. Ghodasara and M. Patel, Some bistar related square sum graphs, Internat.
J. Math. Trend and Tech., 8(1) (2013) 47-57.
[1082] G. V. Ghodasara and M. Patel, Some new combination graphs, Internat. J. Math.
Appl., 5 (2A) (2017) 153-161.
[1083] G. V. Ghodasara and M. Patel, More on permutation labeling of graphs, Internat.
J. Appl. Graph Th., 1(2) (2017) 30-42.

the electronic journal of combinatorics (2023), #DS6 470

[1084] G. V. Ghodasara and M. Patel, Some bistar related square sum graphs, Inter-
nat. J. Math. Trends Tech., 47(3) (2017) 1-6. https://ijmttjournal.org/2017/
Volume-47/number-3/IJMTT-V47P521.pdf
[1085] G. V. Ghodasara and M. Patel, Innovative results on square sum labeling of graphs,
J. Graph Labeling, 4(1) (2018) 15-24.
[1086] G. V. Ghodasara, A. H. Rokad and I. I. Jadav, Cordial labeling of grid related
graphs, Internat. J. Comb. Graph Th. and App., 6(2)(2013) 55-62.
[1087] G. V. Ghodasara and A. H. Rokad, Cordial labeling of Kn,n related graphs, Inter-
nat. J. Sci. Res., 2(5) (2013) 74-77.
[1088] G. V. Ghodasara and A. H. Rokad, Cordial labeling in context of vertex switching
of special graphs, Internat. J. Math. Sci., 33(2) (2013) 1389-1396.
[1089] G. V. Ghodasara and A. H. Rokad, Cordial Labeling in context of barycentric
subdivision of special graphs, Internat. J. Math. Res., 5(5) (2013) 475-483.
[1090] G. V. Ghodasara and S. G. Sonchhatra, Cordial labeling of fan related graphs,
Internat. J. Sci. Eng. Res., 4(8) (2013) 470-476.
[1091] G. V. Ghodasara and S. G. Sonchhatra, Further results on 3-equitable labeling,
IAENG Internat. J. Appl. Math. IJAM, 45(1) (2015) IJAM 45 1 01. https://
www.iaeng.org/IJAM/issues_v45/issue_1/IJAM_45_1_01.pdf
[1092] G. V. Ghodasara and S. M. Vaghasiya, Product cordial labeling of graphs related
to cycle with one chord, twin chords and triangle, Internat. J. Math. Comput.
Modelling, 18(2) (2013) 1109-1113.
[1093] G. V. Ghodasara and S. M. Vaghasiya, Product cordial labeling of graphs related
to helm, closed helm and gear graph, Internat. J. Pure and Appl. Math., 91(4)
(2014) 495-504. http://dx.doi.org/10.12732/ijpam.v91i4.6
[1094] E. Ghorbani and S. Kamali, Prime labeling of ladders, arXiv:1610.08849v1
[math.CO].
[1095] P. Ghosh and A. Pal, Some new Fibonacci divisor cordial graphs, AMO - Adv.
Modeling Optim., 17(2) (2015) 221-232. https://camo.ici.ro/journal/vol17/
v17b5.pdf
[1096] S. Ghosh, On certain classes of graceful lobsters, Ars Combin., 136 (2018) 67-96.
arXiv:1306.2932 23 pages
[1097] S. Ghosh, S. Mohanty, and A. Pal, Cordial labeling of Cartesian product between
two balanced bipartite graphs, J. Informatics Math. Sci., 11(2) (2019) 179-193.
[1098] S. Ghosh and A. Pal, Signed product and total signed product cordial labeling of
Cartesian product between balanced bipartite graph and path, In: Bhattacharyya,
S., Chaki, N., Konar, D., Chakraborty, U., Singh, C. (eds) Advanced Com-
put. Commun. Paradigms. Advances Intell. Systems Comput., 706 515-522 (2018)
Springer, Singapore.
[1099] J. Ghoshal, R. Laskar, and D. Pillone, Minimal rankings, Networks, 28 (1996)
45-53.

the electronic journal of combinatorics (2023), #DS6 471

[1100] J. Ghoshal, R. Laskar, D. Pillone, and G. Fricke, Further results on mod sum
graphs, Congr. Numer., 101 (1994) 201-207.
[1101] M. Giridaran, Application of super magic labeling in cryptography, Internat. J.
Innovative Research in Sci., Engin. Tech., (IJIRSET)9(6) 2020 7 48-16-4822.
http://www.ijirset.com/upload/2020/june/134_Application_DOI.PDF
[1102] M. Giridaran, T. A. Jose, and E. A. Jeony, On the radio antipodal geometric
mean number of ladder related graphs, Malaya J. Mat., 10(01) (2022) 98-109.
http://doi.org/10.26637/mjm1001/009
[1103] L. Girija and M. Karthikeyan, Magic and antimagic labeling Of copies
of jelly fish graph, J. Huazhong U. Sci. Tech., 50(1) (2021) 1-6.
https://www.researchgate.net/publication/349126147_Magic_and_
Antimagic_Labeling_Of_Copies_Of_Jelly_Fish_Graph/references
[1104] R. B. Gnanajothi, Topics in Graph Theory, Ph. D. Thesis, Madurai Kamaraj Uni-
versity, 1991.
[1105] E. K. Gnang, On graceful labelings of trees, arXiv:1811.07614. 17 pages.
[1106] E. K. Ganag, A proof of the Kotzig-Ringel-Rosa Conjecture, arXiv:2202.03178.
17 pages
[1107] E. K. Gnang and M. P. Williams, A proof of the Graham Sloane conjecture,
arXiv:2201.02240. 10 pages.
[1108] R. Godbold and P. J. Slater, All cycles are edge-magic, Bull. Inst. Combin. Appl.,
22 (1998) 93-97.
[1109] L. Goddyn, R. B. Richter, and J. Širáň, Triangular embeddings of complete graphs
from graceful labellings of paths, J. Combin. Theory Ser. B, 97 (2007) 964-970.
[1110] A. Godinho and T. Singh, Group distance magic labeling of Cnr , Algorithms and
Discrete Applied Math., 187-192, Lecture Notes in Comput. Sci., 10156, Springer,
Cham, 2017.
[1111] A. Godinho and T. Singh, Some distance magic graphs, Elect. Notes Discr. Math.,
63 (2017) 311-315.
[1112] A. Godinho, T. Singh, and S. Arumugam, On S-magic graphs, Elect. Notes Discr.
Math., 48 (2015) 267-273. http://dx.doi.org/10.1016/j.endm.2015.05.040
[1113] A. Godinho, T. Singh, and S. Arumugam, On nearly distance magic graphs, The-
oretical Comput. Sci. Disc. Math., 76-82, Lecture Notes in Comput. Sci., 10398,
Springer, Cham, 2017.
[1114] C. G. Goh and C. K. Lim, Graceful numberings of cycles with consecutive chords,
1992, unpublished.
[1115] S. W. Golomb, How to number a graph, in Graph Theory and Computing, R. C.
Read, ed., Academic Press, New York (1972) 23-37.
[1116] S. W. Golomb, Polyominoes: Puzzles, Patterns, Problems, and Packings, second
ed. Princeton University Press, Princeton, MA, 1996.

the electronic journal of combinatorics (2023), #DS6 472

[1117] L. Golowich and C. Kim, New classes of set-sequential trees, Discrete Math., 343(3)
(2020), 111741, 13 pp. arXiv:1710.02906
[1118] N. Lakshmi, P. Sudhakar, and N. Sudhakar, An application of graph labeling
cryptographic technique with magic labeling, In: J. R. Szymanski, C. K. Chanda,
P. K. Mondal, and K. A. Khan, (eds,) Energy Systems, Drives and Automations.
ESDA 2021. Lecture Notes in Electrical Engineering,1057. Springer, Singapore,
August 2023.
[1119] V. Lakshmi (alias) Gomathi, A. Nagarajan, A. NellaiMurugan, On felicitous la-
belings of Pr,2m+1 , Pr2m+1 and Cn × Pm , Internat. J. Math. Soft Computing, 3(1)
(2012) 97-105.
[1120] V. L. A. Gomathi and A. Nagarajan, Felicitous labelings of some graphs, OUT-
REACH IX (2016) 132-139.
[1121] J. Gómez, Solution of the conjecture: If n ≡ 0 (mod 4), n > 4, then Kn has a
super vertex-magic total labeling, Discrete Math., 307 (2007) 2525-2534.
[1122] J. Gómez, Two new methods to obtain super vertex-magic total labelings of graphs,
Discrete Math., 308 (2008) 3361-3372.
[1123] J. Gómez and P. Kovář On super vertex-magic total labeling of the disjoint union
of k copies of Kn , Ars Combin., 113 (2014) 175-192.
[1124] S. Gomathi and P. Venugopal, Radio antipodal number of honeycomb derived net-
works, Scientific Reports, (2022) 12(1) 10pp. doi:10.1038/s41598-022-23618-7
[1125] V. Lakshmi (alias) Gomathi, Felicitous labelings of some graphs, Academic J.
Applied Math. Sci., 2(8) (2016) 93-97.
[1126] J. T. Gondalia, Divisor cordial labelings of Herschel graph in context of various
graph operations, Harbin Gongye Daxue Xuebao/J. Harbin Inst. Tech., 54(6) (222)
185–190.
[1127] J. T. Gondalia, On Fibonacci product cordial labeling in context of vertex swich-
ing of graphs, Adv. Appl. Disc. Math., 35 (2022) 25-35. http://www.pphmj.com/
abstract/14610.htm
[1128] J. T. Gondalia and A. H. Rokad, Integer cordial labeling of some star and bistar
related graphs, South East Asian J. Math. Math. Sci., 17)2) (2021) 277-285.
https://www.researchgate.net/publication/354126647_INTEGER_CORDIAL_
LABELING_OF_SOME_STAR_AND_BISTAR_RELATED_GRAPHS
[1129] J. Goodell, A. Beveridge, M. Gallagher, D. Goodwin, J. Gyori, and A. Joseph,
Sum graphs, (1990) unpublished.
[1130] R. Gopi, A Study on Different Kinds of Mean Graphs, Ph. D. Thesis, Bharathiasan
University, Trichy, 2013.
[1131] R. Gopi, Odd sum labeling of alternative quadrilateral snake, Internat. J. Engin.
Sci., Advan. Comput. and Bio-Tech., 7(3) (2016) 73-77.
[1132] R. Gopi, Odd sum labeling of tree related graphs, Internat. J. Math. and its Ap-
plications., 4(4) (2016) 11-16.

the electronic journal of combinatorics (2023), #DS6 473

[1133] R. Gopi, F -root square mean labeling of some graphs, Internat. J. Math. Combin.,
1 (2019) 146-149. https://www.researchgate.net/publication/332173176_
F-Root_Square_Mean_Labeling_of_Some-_Graphs
[1134] R. Gopi, k-Contra harmonic mean labeling of snake related graphs, Math. J. In-
terdiscip. Sci., 7(2) (2019) 77-80. https://mjis.chitkara.edu.in/index.php/
mjis/article/view/175/114
[1135] R. Gopi, Super root square mean labeling of some graphs, Internat. J. Engin. Sci.,
Advanced Comput. and Bio-Tech., 8(2) (2017) 75-81. DOI:10.26674/ijesacbt/
2017/49175
[1136] R. Gopi and A. Irudaya Mary, Odd sum labelings of some more graphs, Internat.
J. Engin. Sci., Adv. Comput. and Bio-Tech., 7(4) (2016) 95-103.
[1137] R. Gopi, B. Sathish Kumar, F -Centroidal mean labeling of some graphs,
AEGAEUM J., 9(1) (2021) 143-153. https://www.researchgate.net/
publication/348648621_F-Centroidal_Mean_Labeling_of_Some_Graphs
[1138] R. Gopi, B. Sathish Kumar, F -Centroidal mean labelling of trees and cy-
cle related graphs, Internat. J. Aquatic Sci., 12(2) (2021) 3623-3632.
https://www.researchgate.net/publication/354236539_F-Centroidal_
Mean_Labelling_of_Trees_and_Cycle_Related_Graphs
[1139] R. Gopi and C. Nirmala, Lehmer-3 mean labeling of cycle related graphs, Int. J.
Res. Instinct., 5 (2018) 30-35.
[1140] R. Gopi and C. Suba, Super Lehmer-3 mean labeling of tree related graphs, Inter-
nat. J. Math. Appl., 5 3-A (2017) 25-27.
[1141] R. J. Gould and V. Rödl, Bounds on the number of isolated vertices in sum graphs,
Graph Theory, Combin. and Appl., 1 (1991) 553-562.
[1142] V. Govindan, S. Pinelas, and S. Dhivya, Cube sum labeling of graphs, Annals
Commun. Math., 3(2) (2020) 171-176.
[1143] T. Grace, Graceful, Harmonious, and Sequential Graphs, Ph. D. Thesis, University
Illinois at Chicago Circle, 1982.
[1144] T. Grace, On sequential labelings of graphs, J. Graph Theory, 7 (1983) 195-201.
[1145] T. Grace, K4 snakes are sequential, Technical Report, Department of Computer
Science, Illinois Institute of Technology (1986).
[1146] A. J. Graham, D. A. Pike, and N. Shalaby, Skolem labelled trees and Ps Pt
Cartesian products, Australas. J. Combin., 38 (2007) 101-115.
[1147] R. L. Graham and N. J. A. Sloane, On additive bases and harmonious graphs,
SIAM J. Alg. Discrete Methods, 1 (1980) 382-404.
[1148] M. Grannell, T. Griggs, and F. Holroyd, Modular gracious labelings of trees, Dis-
crete Math., 231 (2001) 199-219.
[1149] I. Gray, New Construction Methods for Vertex-magic Total Labelings of Graphs,
Ph.D. thesis, University of Newcastle, 2006.

the electronic journal of combinatorics (2023), #DS6 474

[1150] I. Gray, Vertex-magic total labellings of regular graphs, SIAM J. Discrete Math.
21 (2007) 170-177.
[1151] I. Gray and J. MacDougall, Sparse semi-magic squares and vertex-magic labelings,
Ars Combin., 80 (2006) 225-242.
[1152] I. Gray and J. MacDougall, Sparse anti-magic squares and vertex-magic labelings
of bipartite graphs, Discrete Math., 306 (2006) 2878-2892.
[1153] I. Gray and J. A. MacDougall, Vertex-magic labelings of regular graphs. II, Discrete
Math., 309 (2009) 5986-5999.
[1154] I. Gray and J. MacDougall, Vertex-magic labeling of non-regular graphs, Australas.
J. Combin., 46 (2010) 173-183.
[1155] I. Gray and J. A. MacDougall, Vertex-magic labelings: Mutations, Austral. J.
Combin., 45 (2009) 189-206.
[1156] I. Gray and J. MacDougall, Vertex-magic labeling of regular graphs: disjoint unions
and assemblages. Discrete Appl. Math., 160 (2012) 1114-1125.
[1157] I. Gray, J. MacDougall, R. Simpson, and W. Wallis, Vertex-magic total labeling
of complete bipartite graphs, Ars Combin., 69 (2003) 117-127.
[1158] I. Gray, J. MacDougall, J. McSorley, and W. Wallis, Vertex-magic labeling of trees
and forests, Discrete Math., 261 (2003) 285-298.
[1159] I. Gray, J. MacDougall, and W. Wallis, On vertex-magic labeling of complete
graphs, Bull. Inst. Combin. Appl., 38 (2003) 42-44.
[1160] R. P. Grimaldi, Graphs from rings, Congr. Numer., 71 (1990) 95-104.
[1161] J. L. Gross and J, Yellen, Graph Theory and its Applications, CRC press, 2005.
[1162] J. L. G. Guirao, S. Ahmad, M. K. Siddiqui, and M. Ibrahim, Edge irregular reflex-
ive labeling for the disjoint union of generalized Petersen graph, Mathematics, 6
304. https://www.mdpi.com/2227-7390/6/12/304
[1163] J. Guo, X. Chen, Z. Wang, and B. Yao, Total vertex irregularity strength of certain
equitable complete m-partite graphs, Ars Comb., 123 (2015) 407-418.
[1164] W. F. Guo, Gracefulness of the graph B(m, n), J. Inner Mongolia Normal Univ.,
(1994) 24-29.
[1165] W. F. Guo, Gracefulness of the graph B(m, n, p), J. Math. (PRC), 15 (1995)
345-351.
[1166] S. Guruswamy and M. Varadhan, Generating graceful unicyclic graph from a given
graceful tree, Ars Combin., to appear.
[1167] A. Gutiérrez and A. Lladó, Magic coverings, J. Combin. Math. Combin. Comput.,
55 (2005) 43-56.
[1168] P. Gvozjak, On the Oberwolfach Problem for Cycles with Multiple Lengths, Ph.D.
thesis, Burnaby: Simon Fraser University, 2004.
[1169] A. Gyárfás and J. Lehel, A method to generate graceful trees, in Colloque C.N.R.S.
Problèmes Combinatories et Théorie des Graphes, Orsay, 1976 (1978) 207-209.

the electronic journal of combinatorics (2023), #DS6 475

[1170] E. Gyri, P. N. Balister, and R. H. Schelp, Coloring vertices and edges of a graph
by nonempty subsets of a set, Eur. J. Comb., 4 (2011) 533-537.
[1171] P. Hajnal and G. Nagy, Simply sequentially additive labelings of 2-regular graphs,
Discrete Math., 310 (2010) 922-928.
[1172] S. Hall, K. Hillesheim, E. Kocina, and M. Schmit, personal communication (2013).
[1173] A. C. Hamm, J. A. Hamm, and A. Way, A note on prime labeling k-partite k-
graphs, Involve 15(2) (2022) 233–239. doi:10.2140/involve.2022.15.233
[1174] N. Han and Z. Liang, On the graceful permutation graphs conjecture, J. Discrete
Math. Sci. Cryptogr., 11 (2008) 501-526.
[1175] A. K. Handa, A. Godinho, and T. Singh, Distance antimagic labeling of the ladder
graph, Elect. Notes Discr. Math., 63 (2017) 317-322.
[1176] A. K. Handa, A. Godinho, and T. Singh, Some distance antimagic labeled graphs.
In: S. Govindarajan and A. Maheshwari A. (eds), Algorithms and Discrete Applied
Mathematics. Lecture Notes in Computer Science, 9602 190-200. Springer, Cham
2016.
[1177] T. Hao, On sum graphs, J. Combin. Math. Combin. Computing, 6 (1989) 207-212.
[1178] K. M. M. Haque, X. Lin, Y. Yang, and J. Zhang, Prime cordial labeling of flower
snark and related graphs, Ars Combin., 105 (2012) 45-52.
[1179] K. M. M. Haque, X. Lin, Y. Yang, and P. Zhao, On the prime labeling of generalized
Petersen graph P (n, 1), Util. Math., 83 (2010) 95-106.
[1180] K. M. M. Haque, X. Lin, Y. Yang, and P. Zhao, On the prime cordial labeling of
generalized Petersen graph, Util. Math., 82 (2010) 71-79.
[1181] K. M. M. Haque, X. Lin, Y. Yang, and P. Zhao, On the prime labeling of generalized
Petersen graph P (n, 3), Int. J. Contemp. Math. Sci., 6 (2011) 1783-1800.
[1182] K. M. M. Haque, X. Lin, Y. Yang, and P. Zhao, Prime labeling on Knödel graphs
W3,n , Ars Combin., 109 (2013) 113-128.
[1183] F. Harary, Sum graphs and difference graphs, Congr. Numer., 72 (1990) 101-108.
[1184] F. Harary, Sum graphs over all the integers, Discrete Math., 124 (1994) 99-105.
[1185] F. Harary, I. Hentzel, and D. Jacobs, Digitizing sum graphs over the reals, Caribb.
J. Math. Comput. Sci., 1 (1991) 1-4.
[1186] F. Harary and D. Hsu, Node-graceful graphs, Comput. Math. Appl., 15 (1988)
291-298.
[1187] P. Hariprabakaran, A. Manshath, V. Maheswari, and V. Balaji, Coding strategies
through three star graphs and mean labeling, AIP Conference Proceedings 2519,
020004 (2022); https://aip.scitation.org/doi/pdf/10.1063/5.0109709
[1188] M. Harminc, On a characterization of graphs by average labelings, Discuss. Math.
Graph Theory, 17 (1997) 133-136.
[1189] M. Harminc and R. Soták, Graphs with average labellings, Graph theory (Prague,
1998) Discrete Math., 233 (2001) 127-132.

the electronic journal of combinatorics (2023), #DS6 476

[1190] D. O. Haryeni, Z. Y. Awanis, M. Bača, and A. Semaničová-Feňovčikovǎ, Mod-
ular version of edge irregularity strength for fan and wheel graphs, Symmetry,
14(12):2671 (2022) doi:10.3390/sym14122671
[1191] N. Hartsfield and G. Ringel, Pearls in Graph Theory, Academic Press, San Diego,
1990.
[1192] N. Hartsfield and W. F. Smyth, The sum number of complete bipartite graphs,
in Graphs and Matrices (ed. R. Rees), Marcel Dekker (1992) 205-211.
[1193] J. Haslegrave, Proof of a local antimagic conjecture, Discrete Math. Theor. Com-
put. Sci., 20(1) (2018), Paper No. 18, 14 pp.
[1194] R. Hashi, I. T. Tarawneh, and M. N. Husin, A remark on the edge irregularity
strength of corona proguct of two paths, J. Math. Sci. and Information, 2(1) (2022)
51-58. https://journal.umt.edu.my/index.php/jmsi/article/view/288/214
[1195] R. Hasni, I. Tarawneh, M. K. Siddiqui, A. Raheem, and M. A. Asim, Edge irregular
k-labeling for disjoint union of cycles and generalized prisms, Malaysian J. Math.
Sci., 15(1) (2021) 77-88. NO web
[1196] M. Haviar and S. Kurtulı́k, A new class of graceful graphs: k-enriched fan graphs
and their characterisations, CUBO, A Math. J., 23(02)(2021) 313-331. https:
//www.scielo.cl/pdf/cubo/v23n2/0719-0646-cubo-23-02-313.pdf
[1197] P. Haxell, O. Pikhurko, and A. Taraz, Primality of trees J. Combinatorics, 2 (2011)
481-500.
[1198] M. He, The gracefulness of the graph 2Cn , Neimenggu Daxue Xuebao Ziran Kexue,
26 (1995) 247-251.
[1199] W. He, L. Wang, H. Mi, Y. Shen, and X. Yu, Integral sum graphs from a class of
trees, Ars Combin., 70 (2004) 197-205.
[1200] W. He, X. Yu, H. Mi, Y. Sheng, and L. Wang, The (integral) sum number of the
graph Kn \E(Kr ) for Kr ⊂ Kn , Discrete Math., 243 (2002) 241-252.
[1201] Y. He, L. Shen, Y. Wang, Y. Chang, Q. Kang, and X. Yu, The integral sum number
of complete bipartite graphs Kr,s , Discrete Math., 239 (2001) 137-146.
[1202] R. Hebbar and B. Sooryanarayana, Radio multiplicative number of cer-
tain classes of transformation graphs, Int. J. Math. Appl., 7(4) (2019)
127-148. https://www.researchgate.net/publication/338477914_Radio_
Multiplicative_Number_of_Certain_Classes_of_Transformation_Graphs
[1203] S. P. Rao Hebbare, Graceful cycles, Util. Math., 10 (1976) 307-317.
[1204] F. F. Hadiputra, K. A. Sugeng, D. Silaban, T. K. Maryati, and D. Froncek, Chro-
matic number of super vertex local antimagic total labelings of graphs, Electron.
J. Graph Theory Appl., (EJGTA) 9(2) (2021) 485-498. https://www.ejgta.org/
index.php/ejgta/article/view/1236/pdf_194
[1205] D. Hefetz, Anti-magic graphs via the combinatorial nullstellensatz, J. Graph The-
ory, 50 (2005) 263-272.

the electronic journal of combinatorics (2023), #DS6 477

[1206] D. Hefetz, T. Mütze, and J. Schwartz, On antimagic directed graphs, J. Graph
Theory, 64 (2010) 219-232.
[1207] D. Hefetz, A. Saluz, and H. Tran, An application of the combinatorial nullstellen-
satz to a graph labeling problem, J. Graph Theory, 65 (2010) 70-82.
[1208] A. I. Hefnawy, E. A. Elsid, and S. Euat Tallah, Cordial labeling for the sum and
union of the second power of paths and stars, Util. Math., 108 (2018) 283-291.
[1209] S. M. Hegde, Additively graceful graphs, Nat. Acad. Sci. Lett., 12 (1989) 387-390.
[1210] S. M. Hegde, On indexable graphs, J. Combin. Inf. Sci. Sys., 17 (1992) 316-331.
[1211] S. M. Hegde, On K-sequential graphs, Nat. Acad. Sci. Lett., 16 (1993) 299-301.
[1212] S. M. Hegde, On harmonious labelings of graphs, KREC Research Bull., 5 (1996)
15-18.
[1213] S. M. Hegde, On (k, d)-graceful graphs, J. Combin., Inform. Sys. Sci., 25 (2000)
255-265.
[1214] S. M. Hegde, Geometric graphs, KREC Research Bulletin, 9 (2000) 27-34.
[1215] S. M. Hegde, Further results on set sequential and set graceful graphs, Electronic
Notes Discrete Math., 15 (2003) 100-104.
[1216] S. M. Hegde, On multiplicative labelings of graphs, in Labeling of Discrete Struc-
tures and Applications, Narosa Publishing House, New Delhi, 2008, 83-96.
[1217] S. M. Hegde, On set labelings of graphs, in Labeling of Discrete Structures and
Applications, Narosa Publishing House, New Delhi, 2008, 97-108.
[1218] S. M. Hegde, Set colorings of graphs, Europ. J. Combin., 30 (2009) 986-995.
[1219] S. M. Hegde, On sequentially additive graphs, unpublished.
[1220] S. M. Hegde and Kumudakshi, Construction of graceful digraphs using algebraic
structures, J. Discrete Math. Sci. Cryptogr. 99 (2016) 175-186.
[1221] S. M. Hegde and Kumudakshi, Graceful digraphs and complete mappings, Elect.
Notes Discr. Math., 48 (2015) 151-156. https://doi.org/10.1016/j.endm.
2015.05.021
[1222] S. M. Hegde and Kumudakshi, Further results on graceful directed graphs, Elec-
tronic Notes Discrete Math., 53 (2016) 149-154.
[1223] S. M. Hegde and M. Miller, Further results on sequentially additive graphs, Dis-
cuss. Math. Graph Theory, 27 (2007) 251-268.
[1224] S. M. Hegde and T. S. Murthy, A partial solution to cordial tree conjecture, J.
Discrete Math. Sci. Cryptogr., 17(3) (2014) 257-263.
[1225] S. M. Hegde and S. Shetty, Sequential and magic labeling of a class of trees, Nat.
Acad. Sci. Letters, 24 (2001) 137-141.
[1226] S. M. Hegde and P. Shankaran, Geometric labeled graphs, AKCE J. Graphs Com-
bin., 5 (2008) 83-97.

the electronic journal of combinatorics (2023), #DS6 478

[1227] S. M. Hegde and P. Shankaran, On triangular sum labelings of graphs, in Labeling
of Discrete Structures and Applications, Narosa Publishing House, New Delhi,
2008, 109-115.
[1228] S. M. Hegde and S. Shetty, On graceful trees, Appl. Math. E-Notes, 2 (2002)
192-197.
[1229] S. M. Hegde and S. Shetty, On arithmetic graphs, Indian J. Pure Appl. Math.,
33 (2002) 1275-1283.
[1230] S. M. Hegde and S. Shetty, On magic strengths of graphs, KREC Research Bull.,
11 (2002) 15-21.
[1231] S. M. Hegde and S. Shetty, On magic graphs, Australas. J. Combin., 27 (2003)
277-284.
[1232] S. M. Hegde and S. Shetty, Combinatorial labelings of graphs, Applied Math. E-
Notes, 6 (2006) 251-258.
[1233] S. M. Hegde and S. Shetty, Strongly indexable graphs and applications, Discrete
Math., 309 (2209) 6160-6168.
[1234] S. M. Hegde and S. Shetty, Strongly k-indexable and super edge magic labelings
are equivalent, unpublished
[1235] S. M. Hegde, S. Shetty, and P. Shankran, Further results on super edge-magic
deficiency of graphs, Ars Combin., 99 (2011) 487-502.
[1236] S. M. Hegde and Shivarajkumar, On graceful unicyclc wheels, Ars Combin., 117
(2014) 47-64.
[1237] S. M. Hegde and Shivarajkumar, On k-graceful digraphs, Util. Math. 95 (2014)
161-173.
[1238] S. M. Hegde and Vasudeva, On mod difference labelings of digraphs, AKCE J.
Graphs Combin., 6 (2009) 79-84.
[1239] S. M. Hegde and Vasudeva, An algorithm for sum labeling of graphs, unpublished.
[1240] K. Heinrich and P. Hell, On the problems of bandsize, Graphs and Combin., 3
(1987) 279-284.
[1241] V. Hemalatha and V. M. Selvi, Super geometric mean labeling of some cycle
related graphs, Internat. J. Sci. Engin. Res., 6(11) (2015) 522-529.
https://www.ijser.org/researchpaper/SUPER-GEOMETRIC-MEAN-LABELING-OF-SOME-CYCLE
pdf
[1242] V. Hemalatha and K. Amuthavalli, Radio geometric mean number of splitting of
star and bistar, Internat. J. Res. Advent Tech., 6(7) (2018) 1696-1700. https:
//ijrat.org/downloads/Vol-6/july-2018/paper%20ID-67201899.pdf
[1243] V. Hemalatha, V. Mohanaselvi, and K. Amuthavalli, Radio geometric mean la-
beling of some star like graphs, J. Informatics Math. Sci., 9(3) (2017) 969-
977. https://www.rgnpublications.com/journals/index.php/jims/article/
view/1017/761

the electronic journal of combinatorics (2023), #DS6 479

[1244] V. Hemalatha and V. Mohanaselvi, Radio geometric mean number of some sub-
division graphs, Internat. J. Pure Appl. Math., 113(6) (2017) 362-374. https:
//acadpubl.eu/jsi/2017-113-pp/articles/6/40.pdf
[1245] H. Hendy, K. A. Sugeng, A. N. M. Salman, and N. Ayunda, Another H-super magic
decompositions of the lexicographic product of graphs, Indonesian J. Combin.,
2(2) (2018) 72-81. http://dx.doi.org/10.19184/ijc.2018.2.2.2
[1246] A. Hertz and C. Picouleau, On graceful difference labelings of disjoint unions of
circuits, arXiv:1908.113100v1 [math.CO].
[1247] K. Ezhilarasi Hilda and J. Jeba Jesintha, Shell flower graphs: felicitous,Internat.
J. Pure Appl. Math., 120(8) (2018) 179-188. https://acadpubl.eu/hub/
2018-120-8/2/19.pdf
[1248] Z. R. Himami, D. R. Silaban, On local antimagic vertex coloring of corona products
related to friendship and fan graph, Indon. J. Combin., 5(2) (2021) 110-121.
[1249] Y. S. Ho and S. M. Lee, Some initial results on the supermagicness of regular
complete k-partite graphs, J. Combin. Math. Combin. Computing, 39 (2001) 3-17.
[1250] Y.S. Ho, S. M. Lee, and H. K. Ng, On friendly index sets of root-unions of stars
by cycles, J. Combin. Math. Combin. Comput., 62 (2007) 97-120.
[1251] Y. S. Ho, S. M. Lee, and H. K. Ng, On the friendly index sets of regular windmills,
unpublished.
[1252] Y. S. Ho, S. M. Lee, and E. Seah, on the edge-graceful (n, kn)-multigraphs conjec-
ture, J. Combin. Math. Combin. Computing, (1991) 141-147.
[1253] Y. S. Ho, S. M. Lee, and S. C. Shee, Cordial labellings of unicyclic graphs and
generalized Petersen graphs, Congr. Numer., 68 (1989) 109-122.
[1254] Y. S. Ho, S. M. Lee, and S. C. Shee, Cordial labellings of the cartesian product
and composition of graphs, Ars Combin., 29 (1990) 169-180.
[1255] C. Hoede and H. Kuiper, All wheels are graceful, Util. Math., 14 (1987) 311.
[1256] J. Holden, D. McQuillan, and J. M. McQuillan, A conjecture on strong magic
labelings of 2-regular graphs, Discrete Math., 309 (2009) 4130-4136.
[1257] M. Horton, Graceful Trees: Statistics and Algorithms, 2003, Univ. Tasmania, http:
//eprints.utas.edu.au/19/1/GracefulTreesStatisticsAndAlgorithms.pdf.
[1258] M. Hovey, A-cordial graphs, Discrete Math., 93 (1991) 183-194.
[1259] P. Hrnčiar and A. Haviar, All trees of diameter five are graceful, Discrete Math.,
233 (2001) 133-150.
[1260] P. Hrnčiar and G. Monoszova, A new family of graceful trees, preprint.
[1261] C-C. Hsiao, On Graph Labeling Problems of Antimagic Type, M. S. Thesis,
TungHai University, 2006.
[1262] C. H. Hsieh, K.-Y. Chen, M.-Y. Jiang, J.-J. Liaw, and J. Shin, Estimation of PM2.5
concentration based on support vector regression with improved dark channel prior

the electronic journal of combinatorics (2023), #DS6 480

 and high frequency information in images, IEEE Access, 10 (2022) 48486-48498.
https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=9767851
[1263] D. F. Hsu, Harmonious labelings of windmill graphs and related graphs, J. Graph
Theory, 6 (1982) 85-87.
[1264] D. F. Hsu and A. D. Keedwell, Generalized complete mappings, neofields, se-
quenceable groups and block designs, I, Pacific J. Math., 111 (1984) 317-332.
[1265] D. F. Hsu and A. D. Keedwell, Generalized complete mappings, neofields, se-
quenceable groups and block designs, II, Pacific J. Math., 117 (1985) 291-312.
[1266] H. L. Hu, New graceful labelings of the n-cycle Cn and its r-crowns, Pure Appl.
Math., (Xi’an) 26 (2010) 454-457.
[1267] H. Hua and C. Raridan, On the edge-balanced index sets of odd/even complete
bipartite graphs, Congr. Numer., 219 (2014) 227-232.
[1268] C. Huang, A. Kotzig, and A. Rosa, Further results on tree labellings, Util. Math.,
21c (1982) 31-48.
[1269] Q. Huang, Harmonious labeling of crowns Cn K1 , unpublished
[1270] T.-Y. Huang, Antimatic Labeling on Spiders, Master’s Thesis, Department of
Mathematics, National Taiwan University, 2015.
[1271] J. Huang and S. Skiena, Gracefully labeling prisms, Ars Combin., 38 (1994) 225-
242.
[1272] P.-Y. Huang, T.-L. Wong, and X. Zhu, Weighted-1-antimagic graphs of prime
power order, Discrete Math., 312(14) (2012) 2162-2169.
[1273] R. Huang, M. F. Hanif, M. K. Siddiqui, and M. F. Nadeem, On super
magic algorithm for union of comb and star graph, Konuralp J. Math., 11
(1) (2023) 82-89. https://dergipark.org.tr/en/pub/konuralpjournalmath/
issue/76134/929700
[1274] M. I. Huilgol and V. Sriram, Square sum labeling of disjoint union of graphs, J.
Graph Labeling, 2(2) (2016) 103-106.
[1275] M. Hussain, K. Ali, M.T. Rahim, and E. T. Baskoro, On (a, d)-vertex-antimagic
labelings of Harary graphs, Util. Math., 83 (2010) 73-80.
[1276] M. Hussain, E.T. Baskoro, and K. Ali, On super antimagic total labeling of Harary
graph, Ars Combin., 104 (2012) 225-233.
[1277] M. Hussain, E. Baskoro, and Slamin, On super edge-magic total labeling of banana
trees, Util. Math., 79 (2009) 243-251.
[1278] M. Hussainn and A. Tabraiz, Super d-anti-magic labeling of subdivided kC5 , Turk-
ish J. Math., 39(5) (2015) 773-783.
[1279] M. Ibrahim, M. Asif, A. Ahmad, and M. K. Siddiqui, Computing
the total irregularity strength of wheel related graphs, Util. Math.,
108 (2018) 321-338. https://www.researchgate.net/publication/286456461_
Total_Edge_Irregularity_Strength_of_Wheel_Related_Graphs

the electronic journal of combinatorics (2023), #DS6 481

[1280] M. Ibrahim, A. Gulzar, M. Fazil, and M. N. Azhar, On edge H-irregularity strength
of hexagonal and octagonal grid graphs, Hindawin J. Math., 2022 Article ID
6047926 (2022) 10 pages.
https://doi.org/10.1155/2022/6047926
[1281] M. Ibrahim, S. Khan, M. A. Asim, and M. Waseem, Total irregularity strength of
some cubic graphs, Proyecciones, 40(4) (2021) 905-918.
[1282] R. Ichishima, S. C. López, and F. A. Muntaner-Batle, On the beta-number of
forests with isomorphic components, Discuss. Math. Graph Theory, 38 (2018) 683-
701.
[1283] R. Ichishima, S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, The power
of digraph products applied to labelings, Discrete Math., 312 (2012) 221-228.
[1284] R. Ichishima, S. C. L/’opez, F. A. Muntaner-Batle, and Y. Takahashi, Recent
studies on the super edge-magic deficiency of graphs, arXiv:2211.04029v1, 14pp.
[1285] R. Ichishima, S. C. López, F. A. Muntaner-Batle, and Y. Takahashi, On the
strength and domination number of graphs, preprint.
[1286] R. Ichishima, A. Oshima, and Y. Takahashi, On the strength and independence
number of graphs, Contrib. Math., 6 (2022) 25-29.
[1287] R. Ichishima, A. Oshima, and Y. Takahashi, Some new results on the edge-strength
and strength of graphs, Discrete Math. Lett, 12 (2023) 22-25.
[1288] R. Ichishima, A. Oshima, and Y. Takahashi, On the beta-number of galaxies with
symmetric tructure, Southeast Asian Bull. Math., 47 (2023) 205-218.
[1289] R. Ichishima and F. A. Muntaner-Batle, On the strong sequential number of
graphs, Util. Math., 116 (202) 247-259.
[1290] R. Ichishima and F. A. Muntaner-Batle, On the strong beta-number of galaxies
with five components, preprint.
[1291] R. Ichishima and F. A. Muntaner-Batle, On the super edge-magicness of graphs
with a specific degree sequence, arXiv:2308.10661v1
[1292] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, Enlarging the classes of super
edge-magic 2-regular graphs, AKCE Int. J. Graphs Comb., 10(2) (2013) 129-146.
[1293] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, The measurements of close-
ness to graceful graphs, Australas. J. Combin., 62 (2015) 197-210.
[1294] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, The consecutively super
edge-magic deficiency of graphs and related concepts, Electron. J. Graph Theory
Appl., (EJGTA) 8(1) (2020) 71-92. https://www.ejgta.org/index.php/ejgta/
article/view/785
[1295] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, On the beta-number of joins
of graphs, Australas. J. Combin., 69 (3) (2017) 402-409.
[1296] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, The harmonious number of
graphs and related graph related parameters, Bull. Inst. Combin. Appl., 82 (2018)
80-95.

the electronic journal of combinatorics (2023), #DS6 482

[1297] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, New parameters for studying
graceful properties of graphs, Elect. Notes Discrete Math., 60 (2017) 3-10.
[1298] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, On the beta-number of the
joins of graphs, Australas. J. Combin., 69 (2017) 402-409.
[1299] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, Bounds for the strength of
graphs, Australasian J. Combin., 72(3) (2018) 492-508.
[1300] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, On the strength of some trees,
AKCE Internat. J. Graphs Combin., 17(1) 486-494. https://www.tandfonline.
com/doi/epub/10.1016/j.akcej.2019.06.002?needAccess=true
[1301] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, On the strong beta-
number of galaxies with three and four components, AKCE Internat. J. Graphs
Combin., 17(1) 314-323. https://www.tandfonline.com/doi/epub/10.1016/j.
akcej.2019.03.004?needAccess=true
[1302] R. Ichishima, F. A. Muntaner-Batle, A. Oshima, On the strength of graphs: con-
nections with factorizations, (2021) preprint.
[1303] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, A result on the strength of
graphs by factorizations of complete graphs, Discrete Math. Lett., 8 (2022) 78-82.
https://www.dmlett.com/archive/v8/DML22_v8_pp78-82.pdf
[1304] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, On the beta-number of the
coronas of graphs, Memoirs Kokushikan Univer. Inform. Sci., 43 1-7.”
[1305] R. Ichishima, F. A. Muntaner-Batle, and A. Oshima, On the beta-number and
gamma-number of galaxies, Discrete Math. Lett., 1 (2019) 49-53.
[1306] R. Ichishima, F. A. Muntaner-Batle, and O. Oshima, Minimum degree conditions
for the strength and bandwidth of graphs, Discrete Appl. Math., 320 (2022) 191-
198.
[1307] R. Ichishima, F. A. Muntaner-Batle, and M. Rius-Font, Embedding trees into super
edge-magic trees, Bull. Inst. Combin. Appl., 52 (2008) 51-60.
[1308] R. Ichishima, F. A. Muntaner-Batle, and M. Rius-Font, Bounds on the size of super
edge-magic graphs depending on the girth, Ars Combin., 119 (2016) 129-133.
[1309] R. Ichishima and A. Oshima, On the beta-number of linear forests with an even
number of components, AKCE Int. J. Graphs Comb., 15(3) (2018) 238-241.
[1310] R. Ichishima and A. Oshima, On partitional labelings of graphs, Math. Comput.
Sci., 3 (2010) 39-45.
[1311] R. Ichishima and A. Oshima, On partitional and other related graphs, Math. Com-
put. Sci., 5 (2011) 41-50.
[1312] R. Ichishima and A. Oshima, On the super edge-magic deficiency of 2-regular
graphs with two components, Ars Combin., 129 (2016) 437-447.
[1313] R. Ichishima and A. Oshima, On the super edges-magic deficiency and α-valuations
of graphs, J. Indones. Math. Soc., Special Edition (2011) 59-69.

the electronic journal of combinatorics (2023), #DS6 483

[1314] R. Ichishima and A. Oshima, Bounds for the gamma-number of graphs, Util. Math.,
109 (2018) 313-325.
[1315] R. Ichishima, A. Oshima, and Y. Takamashi, The strength sum of graphs and
related invariants, (2020), prepreint.
[1316] M. Imran, H. U. Afzal, and A. Q. Baig, On super edge-magic deficiency of volvox
and dumbbell graphs, AKCE Internat. J. Graphs Combin., 13 (2016) 112-119.
[1317] M. Imran, A. Aslam, S. Zafar, and W. Nazeer, Further results on the edge
irregularity strength of graphs, Indonesian J. Combin., 1(2) (2017) 36-45.
doi:10.19184/ijc.2017.1.2.5
[1318] M. Imran, A.Q. Baig, and A. S. Feňovčiková, Some results on super edge-magic
deficiency of graphs, Kragujevac J. Math., 44(2) (2020) 237-249. http://elib.
mi.sanu.ac.rs/files/journals/kjm/60/kjmn60p237-249.pdf
[1319] M. Imran, M. Cancan, Y. Ali, M. Nadeem, S. Mushtaq, A. Aslam, and R.
Riaz, Some comb related cordial graphs, Inter. J. Res. Publ. Reviews, 3(10)
(2022) 2334-2339. https://www.researchgate.net/publication/364958790_
Some_Comb_Related_Cordial_Graphs
[1320] M. Imran, M. K. Siddiqui, and M. Numan, Super d-antimagic labeling of uniform
subdivision of wheel, Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math.
Phys., 77 (2015)(2) 227-240.
[1321] N. Inayah, Another antimagic decomposition of generalized Petersen graph, In-
donesian J. Pure and Appl. Math., 3(2) (2021) 92-100. http://journal.uinjkt.
ac.id/index.php/inprime/article/view/19954
[1322] N. Inayah, A. Lladó, J. Moragas, Magic and antimagic H-decompositions, Discrete
Math., 312(7) (2012) 1367-1371.
[1323] N. Inayah, A. N. M. Salman, and R. Simanjuntak, On (a, d)-H-antimagic coverings
of graphs, J. Combin. Math. Combin. Comput., 71 (2009) 273-281
[1324] N. Inayah, R. Simanjuntak and A. N. M. Salman, Super (a, d) − H-antimagic total
labelings for shackles of a connected graph H, Australasian J. Combin., 57 (2013)
127-138.
[1325] N. Inayah, I. W. Sudarsana, S. Musdalifah, and N. D. Mangesa, On super mean
labeling for total graph of path and cycle, Internat. J. Math. Math. Sci., 7-8 (2018)
1-5.
[1326] N. Inayah, F. Susanto, A. Semanic̆ová-Fen̆ovc̆ı́ková On H-antimagic cover-
ings for m-shadow and closed m-shadow of connected graphs, Heliyon 7 (10)
(2021), e08203. https://www.researchgate.net/publication/355414881_
On_H-antimagic_coverings_for_m-shadow_and_closed_m-shadow_of_
connected_graphs
[1327] P. Indira, B. Selvam, and K. Thirusangu, Proper lucky labeling and lucky edge
labeling for the extended duplicate graph of quadrilateral snake, Math. Internat. J.

the electronic journal of combinatorics (2023), #DS6 484

 Math. Trends Tech., 67 (2021) 60-65. doi:10.14445/22315373/IJMTT-V67I1P50
Corpus ID: 234050223
[1328] D. Indriati, I. Widodo, I. Wijayanti, and K. A. Sugeng, Totally irregular total
labeling of some caterpillar graphs, Electron. J. Graph Theory Appl., (EJGTA)
8(2) (2020) 247-254.
[1329] D. Indriati, Widodo, I. E. Wijayanti, K. A. Sugeng, and M. Bača, On total edge
irregularity strength of generalized web graphs and related graphs, Math. Comput.
Sci., 9(2) (2015) 161-167.
[1330] D. Indriati, I. E. W. Widodo, and K. A. Sugeng, On the total edge irregularity
strength of generalized helm, AKCE Int. J. Graphs Comb., 10(2) (2013) 147-155.
[1331] D. Indriati, E. W. Widodo, I. E. Wijayanti, K. A. Sugeng, M. Bača, and A.
Semaničová-Feňovčı́ková, The total vertex irregularity strength of generalized helm
graphs and prisms with outer pendant edges, Austral. J. Combin., 65(1) (2016)
14-26.
[1332] D. Indriati, W. I. E. Widodo, and K. A. Sugeng, On the total edge irregularity
strength of generalized helm, AKCE Int. J. Graphs Comb., 10(2) (2013) 147-155.
[1333] P. Inpoonjai, Degree-magic labelings on the join and composition of complete
tripartite graphs, Comm. Math. Appl., textbf10(3) (2019) 391-402. https://www.
rgnpublications.com/journals/index.php/cma/article/view/1157/0
[1334] M. Irfan, M. Bača, P. Kovář, and A. Semaničová-Feňovčı́ková, On reflexive edge
strength of generalized prism graphs, Electronic J. Graph Theory Appl., 10(2)
415-424. doi:10.5614/ejgta.2022.10.2.6
[1335] M. Irfan and A. Semaničová-Feňovčová, On total labelings of graphs with pre-
scribed weights, AKCE Internat. J. Graphs Combin., 13 (2016) 191-199.
[1336] R. M. Irudhaya, A. Chitra, and A. N. Murugan, Lucky edge labeling of some special
graphs, Internat. J. Recent Res. Aspects, Special Issue: Conscientious Comput.
Tech., (2018) 274-277. www.ijrra.net/April2018/ConsComp2018_66.pdf
[1337] G. Isaak, R. Jamison, and D. Narayan, Greedy rankings and arank numbers, In-
form. Process. Lett., 109 (2009) 825-827.
[1338] J. Ivančo, On supermagic regular graphs, Math. Bohemica, 125 (2000) 99-114.
[1339] J. Ivančo, Magic and supermagic dense bipartite graphs, Discuss. Math. Graph
Theory, 27 (2007) 583-591.
[1340] J. Ivančo, A construction of supermagic graphs, AKCE J. Graphs Combin., 6
(2009) 91-102.
[1341] J. Ivančo, Supermagic generalized double graphs, Discuss. Math. Graph Th., 36
(2016) 211-225.
[1342] J. Ivančo, On k-total edge product cordial graphs,Australasian J. Comb., 67(3)
(2017) 476-485. https://ajc.maths.uq.edu.au/pdf/67/ajc_v67_p476.pdf
[1343] J. Ivančo, and S. Jendroľ, Total edge irregularity strenght of trees, Discuss. Math.
Graph Theory, 26 (2006) 449-456.

the electronic journal of combinatorics (2023), #DS6 485

[1344] J. Ivančo, P. Kovář, and A. Semaničová-Feňovčová, On the existence of regular
supermagic graphs, J. Combin. Math. Combin. Comput., 71 (2009) 49-64.
[1345] J. Ivančo, Z. Lastivkova, and A. Semaničova, On magic and supermagic line graphs,
Math. Bohemica, 129 (2004) 33-42.
[1346] J. Ivančo and I. Lučkaničová, On edge-magic disconnected graphs, SUT J. Math.,
38 (2002) 175-184.
[1347] Ivančo and Polláková, Supermagic graphs having a saturated vertex, Discuss.
Math. Graph Th., 34(1) (2014) 75-84.
[1348] J. Ivančo and A. Semaničova, Some constructions of supermagic non-regular
graphs, Australas. J. Combin., 38 (2007) 127-139.
[1349] J. Ivančo and A. Semaničova, Some constructions of supermagic graphs using an-
timagic graphs, SUT J. Math., 42 (2007) 177-186.
[1350] J. Jacob, D. Narayan, E. Sergel, P. Richter, and A. Tran, personal communication
(2010).
[1351] R. Jagadesh and J. Baskar Babujee, Super edge bimagic labeling, Proceed. 3rd
Inter. Conf. Math. Comp. Sci., 5-6th Jan. 2009, Loyola College, Chennai, India,
(2009) 79-82.
[1352] R. Jagadesh and J. Baskar Babujee, Edge vertex prime labeling for some class of
graphs, National Conference on Recent Trends in Mathematics and its Applica-
tions, 24-25 February 2017, SRM University, Vadapalani, Chennai, India.
[1353] P. Jampachon, K. Nakprasit, and T. Poomsa-ard, Graceful labeling of some classes
of spider graphs with three legs greater than one, Thai J. Math., 12(3) (2014) 621-
630.
[1354] M. M. Jariya, Index of labeling, Internat. J. Math. Trends Tech. 657 (2019) 87-96.
https://www.ijmttjournal.org/Volume-65/Issue-8/IJMTT-V65I8P509.pdf
[1355] I. Javaid, A. Ismail, M. Salman, A. Ahmad, and Slamin, Labeling of chordal rings,
Util. Math., 90 (2013) 61-75.
[1356] I. Javaid, F. Khalid, A. Ahmad, and M. Imran, On a weaker version of sum labeling
of graphs, Math. Rep. (Bucur.) 16(66) (2014), no. 3, 413-420.
[1357] M. Javaid, On super edge-antimagic total labeling of subdivided stars, Discuss.
Math. Graph Theory, 34(4) (2014) 691-705.
[1358] M. Javaid, Super (a, d)-EAT labeling of subdivided stars, AKCE Int. J. Graphs
Comb., 12(1) (2015) 14-18.
[1359] M. Javaid and A. A. Bhatti, On anti-magic vertex labeling of disjoint union of star
hyper-graphs, Canadian J. Sci. and Eng. Math., 3(5) (2012) 202-209.
[1360] M. Javaid, A. A. Bhatti, and M. Hussain, On (a, d)-edge-antimagic total labelings
of extended w-trees, Util. Math., 87 (2012) 293-303.
[1361] M. Javaid and A. A. Bhatti, On super (a, d)-edge-antimagic total labelings of
generalized extended w-trees, AKCE Int. J. Graphs Comb., 11 (2014) 115-126.

the electronic journal of combinatorics (2023), #DS6 486

[1362] M. Javaid, A. A. Bhatti, M. Hussain, and K. Ali, Super edge-magic total labeling
on a forest of extended w-trees, Util. Math., 91 (2013) 155-162.
[1363] M. Javaid, M. Hussain, K. Ali, and K. H. Dar, Super edge-magic total labeling on
w-trees, Util. Math., 86 (2011) 183-191.
[1364] M. Javaid, M. Hussain, K. Ali, and M. Shaker, On super edge-magic total labeling
on subdivision of trees, Util. Math. 89 (2012) 169-177.
[1365] A. Javed and M. K. Jamil, 3-total edge product cordial labeling of rhombic grid,
AKCE Int. J. Graphs Comb., 16(2) (2019) 213–221.
[1366] S. Javed, A. Riasat, and S. Kanwal, On super edge-magicness and deficiencies of
forests, Util. Math., 98 (2015) 149-169.
[1367] J. Jayapriya, 0-edge magic labeling of slitting graph, Global J. Pure and Appl.
Math., 12(1) (2016) 421-426.
[1368] J. Jayapriya, Pair sum modulo labelling of spider graph, Internat. J. Special Edu.,
37(3) (2022) 4205-4211
[1369] J. Jayapriya and K. Thirusangu, 0-edge magic labeling for some class of graphs,
Indian J. Comput. Sci. Engin.(IJCSE), 3(3) (2012) 425-427.
[1370] C. Jayasekaran and C. David Raj, Harmonic mean labeling of disconnected graphs,
J. Discrete Math. Sci. Cryptogr., 19(1) (2016) 1-12.
[1371] C. Jayasekaran and J. L. Flower, Edge trimagic total lableings of some shadow
and splitting graphs, Internat. J. Pure Appl. Math., 120(3) (2018) 303-313.
[1372] C. Jayasekaran and M. Jaslin Melbha, Some more results on one modulo three root
square mean graphs, Int. Electron. J. Pure Appl. Math., 12(1) (2018) 141-149.
[1373] K. T. JebiNivathitha, N. Srinivasan, A. Parthiban, and Sangeeta, On D3EL of
complete and star graphs, J. Xidian Univer., 14(5) 92020) 4448-4454.
[1374] K. T. JebiNivathitha, N. Srinivasan, A. Parthiban, and Sangeeta, On D3EL of
wheel graphs, J. Gujarat Res. Soc., 8(5) (2020) 5480-5483.
[1375] S. Jendroľ, J. Misšuf, and R. Soták, Total edge irregularity strength of complete
graphs and complete bipartite graphs, Elec. Notes Discrete Math., 28 (2007) 281-
285.
[1376] S. Jendroľ, J. Misšuf, and R. Soták, Total edge irregularity strength of complete
graphs and complete bipartite graphs, Discrete Math., 310 (2010) 400-407.
[1377] S. Jenifer Wency, A. Lourdusamy, and F. Patrick, Several result on group S3 cordial
remainder labeling, AIP Conference Proceed., 2261, 030035 (2020).
[1378] R. H. Jeurissen, Magic graphs, a characterization, Europ. J. Combin., 9 (1988)
363-368.
[1379] J. Jeba Jesintha, New Classes of Graceful Trees, Ph. D. Thesis, Anna University,
Chennai, India, 2005.
[1380] J. Jeba Jesintha, D. Devakirubanithi, and R. Charishma, New types of graphs on
cordial labeling, Bull. Pure Appl. Sci., Sect. E Math. Stat., 42E(1) (2023) 36-42.

the electronic journal of combinatorics (2023), #DS6 487

[1381] J. Jeba Jesintha and K. Ezhilarasi Hilda, Butterfly graphs with shell orders m and
2m + 1 are graceful, Bonfring Internat. J. Research Communication Engin., 2(2)
(2012) 1-5.
[1382] J. Jeba Jesintha and K. E. Hilda, Graceful labeling of bow graphs and shell-flower
graphs, Internat. J. Comput. Alg., 2 (2013) 214-218. DOI:10.20894/IJCOA.101.
002.001.017
[1383] J. Jeba Jesintha and K. Ezhilarasi Hilda, Shell-butterfly graphs are harmonious,
Adv. Appl. Disc. Math., 14(1) (2014) 39-51. https://www.researchgate.
net/publication/346528833_Advances_and_Applications_in_Discrete_
Mathematics_SHELL-BUTTERFLY_GRAPHS_ARE_HARMONIOUS
[1384] J. Jeba Jesintha and K. Ezhilarasi Hilda, Variation of graceful labeling on disjoint
union of two subdivided shell graphs, Annals Pure Applied Math., 8(2) (2014)
19-25.
[1385] J. Jeba Jesintha and K. Ezhilarasi Hilda, Subdivided uniform shell bow graphs are
one modulo three graceful, Math. Sci. Internat. Res. J., 3 (2) (2014) 645-646.
[1386] J. Jeba Jesintha and K. Ezhilarasi Hilda, Subdivided uniform shell bow graphs
and subdivided shell graphs are odd graceful, Eduventure Res. J. Queen Mary’s
College, 7(2) (2014) 103-105.
[1387] J. Jeba Jesintha and K. Ezhilarasi Hilda, All uniform bow graphs are graceful,
Math. Comput. Sci., 9 (2015)(2) 185-191.
[1388] J. Jaba Jesintha and K. Ezhilarasi Hilda, Double shells with two pendant edges at
the apex are k-graceful, J. Combin. Math. Combin. Comput., 92 (2015) 47-57.
[1389] J. Jeba Jesintha and K. Ezhilarasi Hilda, Shell butterfly graphs are graceful, In-
ternat. J. Pure Appl. Math., 101(6) (2015) 949-956.
[1390] J. Jeba Jesintha and K. Ezhilarasi Hilda, ρ? labeling of paths and shell butterfly
graphs, Internat. J. Pure and Appl. Math., 101(5) (2015) 645-653.
[1391] J. Jeba Jesintha and K. Ezhilarasi Hilda, Shell butterfly graphs are edge odd
graceful, Internat. J. Pure and Appl. Math., 109(7) (2016) 159-166. https://
www.inderscienceonline.com/doi/abs/10.1504/IJCAET.2021.111639
[1392] J. Jeba Jesintha and K. Ezhilarasi Hilda, The graph SSG(2) is odd graceful and
odd harmonious, Internat. J. Comp. Aided Engin. and Tech., (2016) to appear.
[1393] J. Jeba Jesintha, R. Jaya Glory, and A. Elakiya Solai, Odd graceful labeling of
path union of caterpillars, Advan. Appl. Disc. Math., 28(2) (2021) 287-294.
[1394] J. Jeba Jesintha and K. Subashini, On gracefulness of vertex switching of even
cycles, International J. Pure Appl. Math.,(IJPAM), 109(10) (2016) 11-18. http:
//acadpubl.eu/jsi/2016-109-si/10/2.pdf
[1395] J. Jeba Jesintha and K. Subashini, On cordial labeling of vertex switching of
cycles, Middle East J. Sci. Res.,(MEJSR), 25(04) (2017) 791-794. http://www.
idosi.org/mejsr/mejsr25(4)17/13.pdf

the electronic journal of combinatorics (2023), #DS6 488

[1396] J. Jeba Jesintha and K. Subashini, Gracefulness in the path union of vertex switch-
ing of odd cycle graphs, Math. Sci. Internat. Res. J (IMRFJ), 07(Special Issue 2)
(2018) 71-75.
[1397] J. Jeba Jesintha and K. Subashini, Cordial labeling for new class of graphs,
IAETSD J. for Adv. Res. in Appl. Sci.,(IAETSDJARAS), 05(04) (2018), 98-101.
https://app.box.com/s/9wi68sa59stvz7yxby77g4ywe9olbkg1
[1398] J. Jeba Jesintha and K. Subashini, Gracefulness in the path union of vertex switch-
ing of even cycles in increasing order, South East Asian J. Math. and Mathl. Sci.,
(SEAJMAMS), 14(3) (2018)15-20. http://rsmams.org/journals/articleinfo.
php?articleid=317&tag=seajmams
[1399] J. Jeba Jesintha and K. Subashini, Cordiality in the path union of vertex switch-
ing of cycles in increasing order, South East Asian J. Math.Mathl. Sci., (SEA-
JMAMS), 14(3) (2018) 111-118. http://rsmams.org/journals/articleinfo.
php?articleid=327&tag=seajmams
[1400] J. Jeba Jesintha and K. Subashini, Gracefulness of the join of cycle with different
graphs, Internat. J of Pure and Appl. Math., (IJPAM), 120 (Special Issue)(08)
(2018) 49-57. https://acadpubl.eu/hub/2018-120-8/2/6.pdf
[1401] J. Jeba Jesintha and K. Subashini, Gracefulness in the path union of vertex switch-
ing of cycles, Internat. J Res. Eng., IT Social Sci., (IJREISS), 09(Spl. issue) (2019)
06-10. http://indusedu.org/pdfs/IJREISS/IJREISS_3388_99004.pdf
[1402] J. Jeba Jesintha and K. Subashini, On gracefulness of quadrilateral snakes In-
ternat. J. Res. Eng. IT Social Sci., (IJREISS), 09(Spl. issue) (2019) 15-23.
http://indusedu.org/pdfs/IJREISS/IJREISS_3390_59454.pdf
[1403] J. Jeba Jesintha and K. Subashini, On gracefulness in the path union
and cycle of Pm θSn , Bull. Pure Appl. Sci. Sec. E. Math. Stat.,(BPAS)
38E(Special Issue)(2S) (2019) 85-91. https://www.bpasjournals.com/admin/
upload/dynamic2/85-91-bpas-e-dec.2019-special%20issue.pdf
[1404] J. Jeba Jesintha and K. Subashini, Cordiality in the path union of vertex switch-
ing of wheel graphs in increasing order,Bull. Pure Appl. Sci. Sec. E. Math. Stat.,
(BPAS) 38E(Special Issue)(2S) (2019) 79-84. https://www.bpasjournals.com/
admin/upload/dynamic2/79-84-bpas-e-dec.2019-special%20issue.pdf
[1405] J. Jeba Jesintha and K. Subashini, Cordiality in the path union and cycle of jelly
fish graphs J. Inf. Comp. Sci.,(JOICS) 10(7) (2020) 740-749. http://www.joics.
org/gallery/ics-3920.pdf
[1406] J. Jeba Jesintha, K. Subashini, and Allu Merin Sabu, Graceful labeling on
a new family of graphs, Bull. Pure Appl. Sci. Sec. E. Math. Stat.,(BPAS)
38E(Special Issue)(2S) (2019) 1-6. https://bpasjournals.com/admin/upload/
dynamic2/1-6-bpas-e-dec2019-special-issue.pdf
[1407] J. Jeba Jesintha, K. Subashini, and Allu Merin Sabu, Graceful labeling on twig dia-
mond graph with pendant edges, Bull. Pure Appl. Sci. Sec. E. Math. Stat., (BPAS)

the electronic journal of combinatorics (2023), #DS6 489

 39E(2) (2020) 188-192. https://bpasjournals.com/admin/upload/dynamic2/
188-192-bpas-e-dec.2020.pdf
[1408] J. Jeba Jesintha, K. Subashini, and H. Aysha Siddiqa, Gracefulness in the path
union of vertex switching of odd and even cycle graphs J. Maharaja Sayajirao
Univ. Baroda, 54(2)(XI) (2020) 140-144.
[1409] J. Jeba Jesintha, K. Subashini, and J. R. Rashmi Beula, Graceful labeling of
some new graphs, Bull. Pure Appl. Sci. Sec. E. Math. Stat.,(BPAS) 38E(Special
Issue)(2S) (2019) 60-64. https://bpasjournals.com/admin/upload/dynamic2/
60-64-bpas-e-dec.2019-special%20issue.pdf
[1410] J. Jeba Jesintha and G. Sethuraman, A new class of graceful rooted trees, A new
class of graceful rooted trees, J. Discrete Math. Sci. Cryptogr., 11 (2008) 421-435.
[1411] J. Jeba Jesintha and G. Sethuraman, Generation of graceful trees, Internat. J.
Algor. Comput. Math., 2 (2009) 33-38.
[1412] J. Jeba Jesintha and G. Sethuraman, All arbitrarily fixed generalized banana trees
are graceful, Math. Comput. Sci., 5(1) (2011) 51-62.
[1413] J. Jeba Jesintha and K. Subashini, Gracefulness in path union of vertex switching
of even cycles in increasing order, South East Asian J. Math. Math. Sci., 14(3)
(2018) 15-20.
[1414] J. Jeba Jesintha, N. K. Vinodhini, and S. Divya Lakshmi, Antimagic labeling of
triangular book graph and double fan graph, Bull. Pure Appl. Sci., Sect. E Math.
Stat., 42E(1) (2023) 27-30.
[1415] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, and M. Z. Youssef, k-
Product cordial behaviour of union of graphs, J. Indones. Math. Soc.,
28(1) (2022) 1-7. https://www.researchgate.net/publication/359210439_
k-Product_Cordial_Behaviour_of_Union_of_Graphs
[1416] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi and M. Z. Youssef, k-Product
cordial labeling of Napier bridge graphs, Nepal J. Math. Sci., 3(2) (2022) 59-70.
doi:10.3126/njmathsci.v3i2.49201
[1417] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, and M. Z. Youssef,m k-Product
cordial labeling of cone graphs, Internat. J. Math. Combin., 2 (2022) 72-80. http:
//fs.unm.edu/IJMC/k-Product_Cordial_Labeling_of_Cone_Graphs.pdf
[1418] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, and M. Z. Youssef, k-Product
cordial labeling of Napier bridge graphs, Proceed. Internat. Confer. Disc. Math.,
(ICDM2021-MSU), (2021) 63-70.
[1419] K. J. Daisy, R. S. Sabibha, P. Jeyanthi, and M. Z. Youssef, k-product
cordial labeling of fan graphs, TWMS J. App. Eng. Math., 13(1) (2023)
11-20. https://www.researchgate.net/publication/366822667_K-PRODUCT_
CORDIAL_LABELING_OF_FAN_GRAPHS
[1420] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, and M. Z. Youssef, k-Product
cordial labeling of cone graphs, preprint.

the electronic journal of combinatorics (2023), #DS6 490

[1421] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, and M. Z. Youssef, Further results
on k-product cordial labeling, preprint.
[1422] K. Jeya Daisy, R. Santrin Sabibha, P. Jeyanthi, and M. Z. Youssef, k-Product
cordial labeling of product of graphs, Discrete Math., Algorithms and Appl., 16(1)
(2024) 2250187 (8 pages).
[1423] P. Jeyanthi, k-equitable mean labeling, J. Algor. Computation, 44(1) (2013) 21-30.
[1424] P. Jeyanthi, Skolem difference mean labeling of union of graphs, Util. Math., 111
(2019) 139-150.
[1425] P. Jeyanthi, N. Angel Benseera and M. Immaculate Mary, On totally magic cordial
labeling, SUT J. Math., 49(1) (2013) 13-18.
[1426] P. Jeyanthi and N. Angel Benseera, Totally vertex-magic cordial labeling, SUT J.
Math., 49(1) (2013) 1-12.
[1427] P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of one-point
union of n copies of a graph, Opuscula Math., 34(1) (2014) 115-133.
[1428] P. Jeyanthi and N. Angel Benseera, Totally magic cordial labeling of some graphs,
J. Algorithms Comput., 46 (2015) 1-8.
[1429] P. Jeyanthi, N. Angel Benseera, and I. Cahit, Totally magic cordial labeling of
mPn and mKn , Proyecciones J. Math., 35(4) (2016) 371-381.
[1430] P. Jeyanthi, N. Angel Benseera and G.-C, Lau, On k-totally magic cordial labeling
of graphs, Disc. Math., Algor. Appl., 7(3)(2015) 1550024, 7 pp.
[1431] P. Jeyanthi and N. Angel Benseera, Totally magic cordial deficiency of some graphs,
Utilitas Math., 105 (2017) 87-94.
[1432] P. Jeyanthi, N. Angel Benseera, and G.-C. Lau, Hypo-k-totally magic cordial la-
beling of graphs, Proyecciones J. Math., 34(4) (2015) 347-355.
[1433] P. Jeyanthi and R. Gomathi, Odd mean labeling of chain of graphs, Electron. Notes
Disc. Math., 48 (2015) 157-160. http://dx.doi.org/10.1016/j.endm.2015.05.
022
[1434] P. Jeyanthi and R. Gomathi, Analytic odd mean labeling of super subdivision
and H-super subdivision of graphs, J. Emerging Tech. Innov. Res. (JETIR), 6(6)
(2019) 541-551. http://www.jetir.org/papers/JETIR1908A25.pdf
[1435] P. Jeyanthi and R. Gomathi, Analytic odd mean labeling of corona graphs, Malaya
J. Mat., 8(3)(2020) 898-902.
[1436] P. Jeyanthi, R. Gomathi, and G.-C. Lau, Analytic odd mean labelings of some
graphs, Palestine J. Math., 8(2) (2019) 392-399.
[1437] P. Jeyanthi, R. Gomathi, and G.-C. Lau, TWMS J. Appl. Eng. Math., (2024), to
appear.
[1438] P. Jeyanthi, R. Gomathi, and G.-C. Lau, Some results on analytic
odd mean labeling of graph, Bull. Internat. Math. Virtual Inst., 9

the electronic journal of combinatorics (2023), #DS6 491

 (2019) 487-499. http://www.imvibl.org/buletin/bulletin_imvi_9_3_2019/
bulletin_imvi_9_3_2019_493_500.pdf
[1439] P. Jeyanthi, R. Gomathi, and G.-C. Lau, Further results on analytic odd
mean labeling of graphs, Internat. J. Math. Combin., 4 (2019) 136-148.
https://www.researchgate.net/publication/338448124_Further_Results_
on_Analytic_Odd_Mean_Labeling_of_Graphs
[1440] P. Jeyanthi, R. Gomathi, G. C. Lau, and W. C. Shiu, Analytic odd mean labeling
of union andidentification of some graphs, Proyecciones J. Mathematics, 42(5)
(2023) 1141-1155.
[1441] P. Jeyanthi and K. Jeya Daisy, Zk -magic labeling of subdivision graphs, Discrete
Math., Algor. Appl., 8(3) (2016) 1650046 (19 pages).
[1442] P. Jeyanthi and K. Jeya Daisy, Certain classes of magic graphs, J. Graph Labeling,
4(1) (2018) 38-47.
[1443] P. Jeyanthi and K. Jeya Daisy, Zk -magic labeling of some families of graphs, J.
Algor. Computation, 50(2) (2018) 1-12.
[1444] P. Jeyanthi and K. Jeya Daisy, Zk -Magic labeling of star of graphs, Proyecciones
J. Math., 39(1) (2020) 31-51.
[1445] P. Jeyanthi and K. Jeya Daisy, Zk -Magic labeling of open star of graphs, Bull. Int.
Math. Virtual Inst., 7(2) (2017) 243-255.
[1446] P. Jeyanthi, K. Jeya Daisy, and A. Semaničová-Feňovčı́ková, Zk -Magic labeling of
path union of graphs, CUBO J. Math., 21(2) (2019) 15-35.
[1447] P. Jeyanthi and K. Jeya Daisy, Some results on Zk -magic labeling, Palestine J.
Math., 8(2) (2019) 400-412.
[1448] P. Jeyanthi and K. Jeya Daisy, Zk -magic labeling of cycle of graphs, Internat. J.
Math. Combin., 1 (2019) 88-102.
[1449] P. Jeyanthi, R. Gomathi and G.-C. Lau, Analytic odd mean labeling of some stan-
dard graphs, Proceed. Internat. Confer. Algebra Discrete Math., ICADM (2018)
62-68.
[1450] P. Jeyanthi, R. Gomathi, and G.-C. Lau, Analytic odd mean labeling of square
and H graphs, Internat. J. Math. Combin., Special Issue 1 (2018) 61-67.
[1451] P. Jeyanthi, R. Kalaiyarasi and D. Ramya, Centered triangular mean graphs,
Inter. J. Math. Comb., 1 (2019) 126-133. https://www.researchgate.net/
publication/332230070_Centered_Triangular_Mean_Graphs
[1452] P. Jeyanthi, R. Kalaiyarasi, D. Ramya, and T. Saratha Devi, Some results on
Skolem odd difference mean labeling, Proyecciones J. Math., 35(4) (2016) 407-
417.
[1453] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of cycle and path related
graphs, Util. Math., 98 (2015) 215-226.

the electronic journal of combinatorics (2023), #DS6 492

[1454] P. Jeyanthi and A. Maheswari, Some results on vertex equitable labeling, Open J.
Discrete Math., 2 (2012) 51-57. http://dx.doi.org/10.4236/ojdm.2012.22009
NEW Nov. 2016
[1455] P. Jeyanthi and A. Maheswari, 3-product cordial labeling, SUT J. Math., 48 (2)
(2012) 231-240.
[1456] P. Jeyanthi and A. Maheswari, 3-product cordial labeling of some graphs, Internat.
J. Math. Combin., 1 (2012) 96-105.
[1457] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of transformed trees, J.
Algor. Computation, 44 (1) (2013) 9-20. https://jac.ut.ac.ir/article_7912_
b7a385d110f5ec4c2d805c82bcf3079e.pdf
[1458] P. Jeyanthi and A. Maheswari, Some results on 3-product cordial labeling, Util.
Math., 99 (2016) 215-229.
[1459] P. Jeyanthi and A. Maheswari, One modulo three mean labeling of graphs, Amer.
J. Appl. Math. Stat., 2(5) (2014) 302-306.
[1460] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of graphs, Graph Theory
Notes New York, LXVII (2014) 34-42.
[1461] P. Jeyanthi and A. Maheswari, Further results on vertex equitable graphs, Elec-
tron. Notes Disc. Math., 48 (2015) 161-164. http://dx.doi.org/10.1016/j.
endm.2015.05.023
[1462] P. Jeyanthi and A. Maheswari, 3-product cordial labeling of star graphs, Southeast
Asian Bull. Math., 39(3) (2015) 429-437.
[1463] P. Jeyanthi and A. Maheswari, Vertex equitable labeling of cyclic snakes and bistar
graphs, J. Scientific Res., 6(1) (2014) 79-85.
[1464] P. Jeyanthi and A. Maheswari, Odd vertex equitable even labeling
of cycle related graphs, CUBO A Math. J., 20 (02) (2018) 13-21.
doi:10.4067/S0719-06462018000200013
[1465] P. Jeyanthi, A. Maheswari, and P. Pandiaraj, One modulo three mean labeling of
cycle related graphs, Internat. J. Pure and Appl. Math., 103(4)(2015) 625-633.
[1466] P. Jeyanthi, A. Maheswari, and P. Pandiaraj, On one modulo three mean labeling
of graphs, J. Discrete Math. Science & Cryptography, 19:2 (2016) 375-384.
[1467] P. Jeyanthi, A. Maheswari, and P. Pandiaraj, One modulo three geometric mean
graphs, J. Algor. Comput., 50(1) (2018) 101-108.
[1468] P. Jeyanthi, A. Maheswari, and P. Pandiaraj, One modulo three mean labeling of
transformed trees, Proyecciones J. Math., 35(3) (2016) 277-289.
[1469] P. Jeyanthi, A. Maheswari and M. VijayaLaksmi, Odd vertex equitable even la-
beling of graphs, Proyecciones J. Math., 36(1) (2017) 1-11. https://scielo.
conicyt.cl/pdf/proy/v36n1/art01.pdf
[1470] P. Jeyanthi, A. Maheswari, and M. VijayaLaksmi, New results on vertex equitable
labeling, J. Algebra Combin. Discrete Structures Appl., 3(2)(2016) 97-104. https:
//dergipark.org.tr/en/download/article-file/267792

the electronic journal of combinatorics (2023), #DS6 493

[1471] P. Jeyanthi and A. Sudha, On the total irregularity strength of some graphs,
Bull. Inter. Math. Virtual Inst., 9(2) (2019) 393-401. http://www.imvibl.org/
buletin/bulletin_imvi_9_2_2019/bulletin_imvi_9_2_2019_393_401.pdf
[1472] P. Jeyanthi, A. Maheswari and M. VijayaLaksmi, Vertex equitable labeling of union
of cyclic snake related graphs, Proyecciones J. Mathematics, 35(1) (2016) 177-186.
https://scielo.conicyt.cl/pdf/proy/v35n2/art03.pdf
[1473] P. Jeyanthi, A. Maheswari, and M. VijayaLaksmi, Vertex equitable labeling of
double alternate snake graph, J. Algor. Comput., 46 (2015) 27-34. https://jac.
ut.ac.ir/article_7923_76d1a6298f68c081c967627653edc287.pdf
[1474] P. Jeyanthi, A. Maheswari and M. VijayaLaksmi, Vertex equitable labeling of
cycle and star related graphs, J. Scientific Res., 7(3)(2015) 33-42. https://www.
banglajol.info/index.php/JSR/article/view/22810
[1475] P. Jeyanthi, A. Maheswari, and M. VijayaLaksmi, Vertex equitable label-
ings of super subdivision graphs, Scientific Internat., 27(5) (2015) 3881-
3883. https://www.researchgate.net/profile/P_Jeyanthi2/publication/
284182322_VERTEX_EQUITABLE_LABELING_OF_SUPER_SUBDIVISION_GRAPHS/
links/564ee37a08aefe619b103a26.pdf
[1476] P. Jeyanthi, A. Maheswari, and M. VijayaLakshmi, 3-Product cordial labeling of
some snake graphs, Proyecciones J. Math. 38(1) (2019) 13-30.
[1477] P. Jeyanthi, A. Maheswari, and M. VijayaLaksmi, Further results on 3-product
cordial labeling, Proyecciones J. Math., 38(2) (2019) 191-202.
[1478] P. Jeyanthi, A. Maheswari, and M. VijayaLakshmi, Vertex switching in 3-product
cordial graphs, J. Algor. Computation, 50(1) (2018) 185-193.
[1479] P. Jeyanthi, A. Maheswari, and M. VijayaLaksmi, Vertex equitable labeling
of cyclic snake related graphs, Proyecciones J. Math., 37(4) (2018) 613-
625. https://www.researchgate.net/publication/332062041_Odd_vertex_
equitable_even_labeling_of_ladder_graphs
[1480] P. Jeyanthi, A. Maheswari, and M. Vijayalaksmi, 3-product cordial labeling of
some snake graphs, Proyecciones J. Math., 38
[1481] P. Jeyanthi, A. Maheswari, and M. Vijayalakshmi, Odd vertex equi-
table even labeling of ladder graphs, Jordan J. Math. Stat., 12(1)
(2019) 75-87.@ https://www.researchgate.net/publication/332062041_Odd_
vertex_equitable_even_labeling_of_ladder_graphs
[1482] P. Jeyanthi and N. T. Muthuraja, Some cycle-super magic graphs, Internat. J.
Math. Soft Comput., 4(2) (2014) 137-144.
[1483] P. Jeyanthi, N. T. Muthuraja, A. Semaničová-Feňovčı́ková and S. J. Dharshikha,
More classes of cycle super antimagic graphs, Australasian J. Combin., 67(1)
(2017) 46-64.
[1484] P. Jeyanthi, S. Philo, and Kiki A.Sugeng, Odd harmonious labeling of some new
families of graphs, SUT J. Math., 51(2)(2015), 53-65.

the electronic journal of combinatorics (2023), #DS6 494

[1485] P. Jeyanthi and S. Philo, Odd harmonious labeling of some cycle related graphs,
Proyecciones J. Math., 35(1) 2016) 85-98. https://www.revistaproyecciones.
cl/index.php/proyecciones/article/view/1236/949
[1486] P. Jeyanthi and S. Philo, Odd harmonious labeling of plus graphs, Bull. Int. Math.
Virtual Inst., 7 (2017)(3) 515-526.
[1487] P. Jeyanthi and S. Philo, Odd harmonious labeling of some new graphs,
Southeast Asian Bull. Math., 43 (2019) 509-523. https://www.researchgate.
net/publication/329626405_Cordial_Labeling_of_Generalized_Jahangir_
Graph
[1488] P. Jeyanthi and S. Philo, Odd harmonious labeling of some super subdivision
graphs, Proyecciones J. Math., 38(1) (2019) 1-11. https://scielo.conicyt.cl/
pdf/proy/v38n1/0716-0917-proy-38-01-00001.pdf
[1489] P. Jeyanthi and S. Philo, Odd harmonious labeling of complete bipartite graphs,
Southeast Asian Bull. Math., (2022), to appear.
[1490] P. Jeyanthi and S. Philo, New results on odd harmonious labeling of graphs, TWMS
J. App. Eng. Math., 12(4) (2022) 1301-1310. https://jaem.isikun.edu.tr/web/
images/articles/vol.12.no.4/14.pdf
[1491] P. Jeyanthi and S. Philo, Odd harmonious labeling of line and disjoint union of
graphs, Chinese J. Math. Sci., (1)(1) (2021) 61-68.
[1492] P. Jeyanthi and S. Philo, Odd harmonious labeling of subdivided shell graphs,
Internat. J. Comput. Sci. Eng., 7(5) (2019) 77-80.
[1493] P. Jeyanthi and S. Philo, Odd harmonious labeling of step ladder graphs, Util.
Math., 115 (2020) 89-103.
[1494] P. Jeyanthi and S. Philo, Odd harmonious labelings of certain graphs, JASC:
J. Appl. Sci. Comput., VI(IV) (2019) 1224-1232. https://www.researchgate.
net/profile/P_Jeyanthi2/publication/332320709_ODD_HARMONIOUS_
LABELING_OF_CERTAIN_GRAPHS/links/5cadc56492851ccd4ac087b5/
ODD-HARMONIOUS-LABELING-OF-CERTAIN-GRAPHS.pdf
[1495] P. Jeyanthi and S. Philo, Some results on odd harmonious labeling of graphs, Bull.
Internat. Math. Virtual Inst., 9 (2019) 567-576.
[1496] P. Jeyanthi and S. Philo, Odd harmonious labeling of some classes of graph, CUBO,
A Math. J., 22(3) (2020) 299-314.
[1497] P. Jeyanthi, S. Philo and M. Z. Youssef, Odd harmonious labeling of grid graphs,
Proyec. J. Math., 38(3) (2019) 411-428. https://scielo.conicyt.cl/pdf/proy/
v38n3/0716-0917-proy-38-03-00411.pdf
[1498] P. Jeyanthi and D. Ramya, Some results on super mean graphs, Util. Math., 92
(2013) 149-160.
[1499] P. Jeyanthi and D. Ramya, On construction of mean graphs, J. Scientific Research
5(2) (2013) 265-273.

the electronic journal of combinatorics (2023), #DS6 495

[1500] P. Jeyanthi and D. Ramya, Super mean graphs, Util. Math., 96 (2015) 101-109.
[1501] P. Jeyanthi, D. Ramya, and A. Maheswari, On mean labeling of some trees, Util.
Math., 93 (2014) 161-191.
[1502] P. Jeyanthi and D. Ramya Super mean labeling of some classes of graphs, Inter-
national J. Math. Combin., 1 (2012) 83-91.
[1503] P. Jeyanthi, D. Ramya, and M. Selvi, Even vertex odd mean labeling of transformed
trees, TWMS J. App. Eng. Math., 10(2) 2020 338-345.
[1504] P. Jeyanthi, D. Ramya, and P. Thangavelu, On super mean graphs, AKCE J.
Graphs Combin., 6(1) (2009) 103-112.
[1505] P. Jeyanthi, D. Ramya, and P. Thangavelu, Some constructions of k-super mean
graphs, Inter. J. Pure Applied Math., 56 (2009) 77-86.
[1506] P. Jeyanthi, D. Ramya, and P. Thangavelu, On super mean labeling of some graphs,
SUT J. Math., 46 (2010) 53-66.
[1507] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling, J. Scientific Research, 5
(3) (2013) 457-467.
[1508] P. Jeyanthi and T. Sarada Devi, On edge pair sum labeling of graphs, Internat. J.
Math. Trends Tech., 7(2) (2014) 106-113.
[1509] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling of spider graph, J. Algor.
Comput., 45 (2014) 25-34.
[1510] P. Jeyanthi and T. Sarada Devi, Some edge pair sum graphs, J. Discr. Math.
Science & Crypt., 18(5) (2015) 481-493.
[1511] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling of some Cartesian product
graphs, Discrete Math., Algor. Appl., 8 (23) (2016) 16500245 (10 pages).
[1512] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling of butterfly graph with
shell order, Malaya J. Matematik, 4(2) (2016) 205-210.
[1513] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling of cycle related graphs,
J. Algor. Comput., 48 (2016) 57-68.
[1514] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling of some subdivision of
graphs, Bull. Internat. Math. Virtual Inst., 8 (2018) 67-80.
[1515] P. Jeyanthi and T. Saraha Devi, Some new families of edge pair sum graphs,
Palettine J. Math., 8(2) (2019) 61-69.
[1516] P. Jeyanthi and T. Sarada Devi, Edge pair sum labeling of some classes of graphs,
J. Discr. Math. Sci. Crypt.,24(4) (2021) 1075-1084..
[1517] P. Jeyanthi, T. Sarada Devi, and G.-C Lau, Some results on edge pair sum labeling,
Electronic Notes Disc. Math., 48 (2015) 169-173. http://dx.doi.org/10.1016/
j.endm.2015.05.025
[1518] P. Jeyanthi, T. Sarada Devi, and G.-C. Lau, New results on edge pair sum graphs,
Internat. J. Math. Appl., 4(1-B) (2016) 57-65.

the electronic journal of combinatorics (2023), #DS6 496

[1519] P. Jeyanthi, T. Saratha Devi, and G.-C. Lau, Edge pair sum labeling of W T (n : k)
tree, Global J. Pure and Appl. Math., 11(3) (2015) 1523-1539.
[1520] P. Jeyanthi and P. Selvagopal, Magic covering of chain of an arbitrary 2-connected
simple graph, SUT J. Math., 44 (2008) 23-31.
[1521] P. Jeyanthi and P. Selvagopal, More classes of H-supermagic graphs, Internat. J.
Algor., Comput. and Math., 3 (2010) 93-108.
[1522] P. Jeyanthi and P. Selvagopal, H-supermagic strength of some graphs, Tokyo J.
Math., 33 (2010) 499-507.
[1523] P. Jeyanthi and P. Selvagopal, Some C4 -supermagic graphs, Ars Combin., 111
(2013) 129-136.
[1524] P. Jeyanthi and P. Selvagopal, Supermagic coverings of some simple graphs, Inter-
nat. J. Math. Combin., 1 (2011) 33-48.
[1525] P. Jeyanthi, P. Selvagopal, and S. Soma Sundaram, Some C3 -supermagic graphs,
Util. Math., 89 (2012) 357-366.
[1526] P. Jeyanthi, M. Selvi, and D. Ramya, Skolem difference mean labeling of discon-
nected graphs, Proyecciones J. Math., 36(2) (2017) 347-361.
[1527] P. Jeyanthi, M. Selvi, and D. Ramya, Skolem difference mean labeling of union of
graphs, Util. Math., 111 (2019) 139-150.
[1528] P. Jeyanthi, M. Selvi, and D. Ramya, Restricted triangular difference mean graphs,
Proyecciones J. Math., 39(2) (2020) 275-286.
[1529] P. Jeyanthi, M. Selvi, and D. Ramya, Odd mean labeling of T ôCn and T õCn , Util.
Math., 107 (2018) 115-130.
[1530] P. Jeyanthi, M. Selvi, and D. Ramya, Centered triangular difference mean graphs,
Util. Math., 112 (2019) 125-138.
[1531] P. Jeyanthi, M. Selvi and D. Ramya, Triangular difference mean graphs, Internat.
J. Math. Combin., 2 (2020) 109-117.
[1532] P. Jeyanthi and A. Sudha, Total edge irregularity strength of disjoint union of
wheel graphs, Elect. Notes Disc. Math., 48 (2015) 175-182. http://dx.doi.org/
10.1016/j.endm.2015.05.026
[1533] P. Jeyanthi, M. Selvi and D. Ramya, One modulo N-difference mean graphs, Pales-
tine J. Math., 12(3) (2023) 163-169.
[1534] P. Jeyanthi, M. Selvi, and D. Ramya, New results on one modulo N-difference
mean graphs, Open J. Discrete Math.,13 (2023) 100-112.
[1535] P. Jeyanthi and A. Sudha, Total edge irregularity strength of wheel related graphs,
J. Graph Labeling, 2(1) (2015) 45-57.
[1536] P. Jeyanthi and A. Sudha, On the total irregularity strength of wheel related
graphs, Utilitas Math., 110 (2019) 131-134.
[1537] P. Jeyanthi and A. Sudha, Some results on edge irregular total labeling, J. Internat.
Math. Virtual Institute, 9 (2019) 73-91.

the electronic journal of combinatorics (2023), #DS6 497

[1538] P. Jeyanthi and A. Sudha, Total edge irregularity strength of disjoint union of
double wheel graphs, Proyecciones J. Math. 35(3) (2016) 251-262.
[1539] P. Jeyanthi and A. Sudha, Total vertex irregularity strength of corona product of
some graphs, J. Algorithms Comput., 48(1) (2016) 127-140.
[1540] P. Jeyanthi and A. Sudha, Total edge irregularity strength of some families of
graphs, Util. Math., 109 (2018) 139-153.
[1541] P. Jeyanthi and A. Sudha, Total vertex irregularity strength of some graphs, Pales-
tine J. Math., 7(2) (2018) 139-153.
[1542] P. Jeyanthi and A. Sudha, Total irregularity strength of disjoint union of crossed
prism and necklace graphs, Util. Math., 114 (2020 13-31.
[1543] S. Jezný and M. Trenklér, Characterization of magic graphs, Czechoslovak Math.
J., 33 (1983) 435-438.
[1544] T.-S. A. Jiang, The radio number of grid graphs, arXiv:1401.6583v1 [math.CO]
25 Jan 2014.
[1545] D. J. Jin, S. Z. Liu, S. H. Lee, H. L. Liu, X. G. Lu, and D. Zhang, The joint sum
of graceful trees, Comput. Math. Appl., 26 (1993) 83-87.
[1546] D. J. Jin, F. H. Meng, and J. G. Wang, The gracefulness of trees with diameter 4,
Acta Sci. Natur. Univ. Jilin., (1993) 17-22.
[1547] M. I. Jinnah and S. Beena, On E4 -cordial graphs, Ars Combin., 119 (2015) 413-
422.
[1548] M. I. Jinnah and A. V. Nair, On-cordial labelling of graphs, Adv. Appl. Disc.
Math., 14(2) 75-94.
[1549] M. I. Jinnah and G. Suresh Singh, A note on arthmetic numberings of graphs, Proc.
Symposium on Graphs and Combinatorics, Kochi, Kerala, India (1991) 83-87.
[1550] M. I. Jinnah and K. R. Santhosh Kumar, Irregularity strength of triangular snake
and double triangular snake, Adv. Appl. Discrete Math. 9 (2012)(2) 83-92.
[1551] Jirimutu, On k-gracefulness of r-crown Ir (K1,n ) (n > 2, r > 2) for complete bipar-
tite graph, J. Inner Mongolia Univ. Nationalities, 2 (2003) 108-110.
[1552] Jirimuta, Y-L Bao, and F-L Kong, On k-gracefulness of r-crown for complete
bipartite graphs, International J. Pure and Applied Math., 15 (2004) 81-86.
−→
[1553] Jirimuta, J. Wang, and X. Xirong, on the gracefulness of the digraphs n · Cm ,
Internat.J. Pure and Appl. Math., 23 (2005) 393-400.
[1554] Jirimuta and J. Wang, On (a, d)-antimagic labelings of generalized Petersen graphs
P (n, 2), Ars Combin., 90 (2009) 161-174.
[1555] R. P. Jones, Gracelessness, Proc. 10th S-E Conf. Combinatorics, Graph Theory,
and Computing, Congr. Numer., XXIII-XXIV, Util. Math., (1979) 547-552.
[1556] J. R. Joshi and D. Parmar, Hk – Cordial labeling of m-polygonal snake graphs,
Alochang Chakra J., IX(IV) (2020) 1924-1938.

the electronic journal of combinatorics (2023), #DS6 498

 https://www.researchgate.net/publication/340923339_HK-_Cordial_
labeling_of_m_-11990-1-12234-129054Polygonal_Snake_Graphs/
references#fullTextFileContent
[1557] J. R. Joshi and D. Parmar, Hk -cordial labeling of some snake graph, J. Xidian Uni-
versity, 14(3) (2020) 844-885. https://www.researchgate.net/publication/
340115606_HK-_Cordial_labeling_of_Some_Snake_Graphs
[1558] Jirimutu, X. Xu, W. Feng, and Y. Bao, Proof of a conjecture on the gracefulness
of a digraph, Util. Math., 81 (2010) 255-264.
[1559] G. Jothi, Highly vertex prime graphs, personal communication (2011).
[1560] J. S-T. Juan and D-F. Liu, Antipodal labelings of cycles, Ars Combin., 103 (2012)
81-96.
[1561] D. Jungreis and M. Reid, Labeling grids, Ars Combin., 34 (1992) 167-182.
[1562] S. Kalaimathy, Some results on (k, d)-even mean labeling, Inter. J. Math. Soft
Comput., 2(2) (2012) 103-112.
[1563] M. Kalaimathi and B. J. Balamurugan, Computation of even-odd harmonious
labeling of certain family of acyclic graphs, Internat. J. Engin. Adv. Tech.,
9(1S3) (2019) 414-419. https://www.ijeat.org/wp-content/uploads/papers/
v9i1s3/A10751291S319.pdf
[1564] M. Kalaimathi and B. J. Balamurugan, Biconditional cordial labeling of cycle
related graphs, AIP Confer. Proc., (2020) 2282(1):020017
[1565] M. Kalaimathi, B.J. Balamurugan, and J. V. Rao, Computation of biconditional
cordial labeling of super subdivision of graphs, In: R.R. Raje, F. Hussain, and R.J.
Kannan (eds) Artificial Intelligence and Technologies. Lecture Notes in Electrical
Engineering, 806 Springer, Singapore, (2020)
https://doi.org/10.1007/978-981-16-6448-9 60.
[1566] R. Kalaiyarasi, D. Ramya, and P. Jeyanthi, Skolem odd difference mean labeling
of tress, Global J. Pure and Appl. Math., 11(2) (2015) 887-898.
[1567] M. Kalkowski, M. Karoński, and F. Pfender, A new upper bound for the irregularity
strength of graphs, SIAM J. Discrete Math., 25 (2011) 1319-1321.
[1568] S. Kalyan and R. Kempepatil, Note on advanced labeling and Fibonacci graceful
graphs, Pramana Res. J., 9(5) (2019) 295-317. https://www.pramanaresearch.
org/gallery/prj-p810.pdf
[1569] N. Kamatchi, K. Paramasivam, A. V. Prajeesh, K. M. Sabeel, and S. Arumugam,
On group vertex magic graphs, AKCE Int. J. Graphs Comb., 17(1) (2020) 461-465.
https://www.tandfonline.com/doi/full/10.1016/j.akcej.2019.04.001
[1570] N. Kamatchi, A. Ramalakshmi, and S. Nilavarasi, A note on distance magic and
distance antimagic graphs, Elect. Notes Discr. Math., 48 (2015) 183-187. http:
//dx.doi.org/10.1016/j.endm.2015.05.027

the electronic journal of combinatorics (2023), #DS6 499

[1571] T. Kamaraj and J. Thangakani, Edge even and edge odd graceful labelings of Paley
graphs, J. Phys.: Conf. Ser., (2021 1770 012068 https://iopscience.iop.org/
article/10.1088/1742-6596/1770/1/012068/pdf
[1572] N. Kamatchi, G. R. Vijayakumar, A. Ramalakshmi, S. Nilavarasi, and S. Aru-
mugam, Distance antimagic labelings of graphs, Theoretical Comput. Sci. Discr.
Math., 113-118, Lecture Notes in Comput. Sci., 10398, Springer, Cham, 2017.
[1573] J. C. Kanani and V. J. Kaneria, Graceful labeling for some snake related
graphs, Ganita, 71 (1) (2021) 243-256. https://bharataganitaparisad.com/
wp-content/uploads/2021/10/711-ch025.pdf
[1574] K. K. Kanani and M. I. Bosmia, On cube divisor cordial graphs, Internat. J. Math.
Comput. Appl. Res. (IJMCAR), 5(4) (2015) 117-128.
[1575] K. K. Kanani and T. M. Chhaya, Strongly multiplicative labeling of some path
related graphs, Internat. J. Math. Comput. Appl. Res. (IJMCAR), 5 (5) (2015)
1-6.
[1576] K. K. Kanani and T. M. Chhaya, Some new families of strongly multiplicative
graphs, 9th National Level Science Symposium. February 14, 2016, Organized by
Christ College, Rajkot, Sponsored by GUJCOST, Gandhinagar, Mathematics &
Statistics, 3 (2016) 197-200
[1577] K. K. Kanani and M. V. Modha, 7-cordial labeling of standard graphs, Internat.
J. Appl. Math. Res., 3(4) (2014) 547-560.
[1578] K. K. Kanani and N. B. Rathod, Some new 4-cordial graphs, J. Math. Comput.
Sci., 4(5) (2014) 834-848.
[1579] K. K. Kanani and T. M. Chhaya, Strongly multiplicative labeling of some standard
graphs, Internat. J. Math. Soft Comput, 7(1) (2017) 13-21.
[1580] K. K. Kanani and T. M. Chhaya, K. K. Kanani and T. M. Chhaya, Strongly
multiplicative labeling of some snake related graphs, Internat. J. Math. Trends and
Tech. (IJMTT), 45(1) (2017) 53-56. https://www.iosrjournals.org/iosr-jm/
papers/Vol18-issue1/Ser-2/B1801022430.pdf
[1581] V. J. Kaneria and P. P. Andharia, Some results on even sum labeling of graphs,
J. Calcutta Math. Soc., 15(2) (2019) 129-138.
[1582] V. J. Kaneria and P. P. Andharia, Further results on even sum labeling of graphs,
[1583] V. J. Kaneria and H. P. Chudasama, Absolute mean graceful labeling in various
graphs, Int. J. Math. Appl., 5(4) (2017) 723-726. https://mjis.chitkara.edu.
in/index.php/mjis/article/view/15/12
[1584] V. J. Kaneria, H. P. Chudasama, and P. P. Andharia, Absolute mean graceful
labeling in path union of various graphs, Math. J. Interdiscip. Sci., 7(1) (2018),
51-56.
[1585] V. J. Kaneria, A. M. Gohil, and H. M. Makadia, Graceful related labeling and its
applications, Int. J. Math. Res., 7(1) (2015) 47-54.

the electronic journal of combinatorics (2023), #DS6 500

[1586] V. J. Kaneria, M. M. Jariya, and H. Karavadiya, Cordially of the complete graphs,
J. Graph Labeling, 2(2) (2016) 89-101.
[1587] V. J. Kaneria and M. M. Jariya, Semi smooth graceful graph and construction of
new graceful trees, Elixir Appl. Math., 76 (2014) 28,536-28,538.
[1588] V. J. Kaneria and M. M. Jariya, Smooth graceful graphs and its applications to
construct graceful graphs, Int. J. Sci. and Res., (IJSR) 3(8) (2014) 909-912.
[1589] V. J. Kaneria, M. M. Jariya, and H. M. Makadia, Graceful labeling of arrow
graphs and double arrow graphs, Malaya J. Matematik, 3(4)(2015) 382-386. https:
//www.malayajournal.org/articles/paper2_2015.pdf
[1590] V. J. Kaneria, M. M. Jariya, and M. Meghpara, Graceful labeling for some star
related graphs, Int. Math. Forum, 9(26) (2014) 1289-1293.
[1591] V. J. Kaneria, M J Khoda, and H M Karavadiya, Balanced mean cordial labeling
and graph operations, Int. J. Math. Appl., 4(3–A) (2016) 181-184.
[1592] V. J. Kaneria, M. Meghpara and M. Khoda, Semi smooth graceful labeling and its
application to produce α-labeling, J. Graph Labeling, 2(2) (2016) 153-160.
[1593] V. J. Kaneria and H. M. Makadia, Some graceful graphs, J. of Math. Res., 4(1)
(2012) 54-57.
[1594] V. J. Kaneria and H. M. Makadia, Graceful labeling for tensor product of two path
of odd lengths and some grid related graphs, Int. J. Innovation Sci. Math., 2(5)
(2014) 470-472.
[1595] V. J, Kaneria and H. M. Makadia, Graceful labeling for step grid graph, J. Ad-
vances Math., 9(5) (2014) 2647-2654.
[1596] V. J. Kaneria and H. M. Makadia, Some results on graceful labeling for step grid
related graphs, AKCE Int. J. Math. Trends Tech. (IJMTT) 65 (11) (2-19) 29-38.
http://www.ijmttjournal.org/Volume-65/Issue-11/IJMTT-V65I11P503.pdf
[1597] V. J. Kaneria and H. M. Makadia, Graceful labeling for double step grid graph,
Int. J. Math. Appl., 3(1) (2015) 33-38.
[1598] V. J. Kaneria and H. M. Makadia, Graceful labeling for plus graph, Int. J. Current
Rec. Sci. Tech., 1(3) (2015) 15-20.
[1599] V. J. Kaneria and H. M. Makadia, Some results on graceful labeling for families of
plus graph, Int. J. Current Rec. Sci. Tech., 1(4) (2015) 17-23.
[1600] V. J. Kaneria and H. M. Makadia, Graceful labeling for swastik graph, Int. J.
Math. Appl., 3(3-D) (2015) 25-29 http://ijmaa.in/v3n3-d/25-29.pdf
[1601] V. J. Kaneria and H. M. Makadia, Some results on graceful labeling for families of
swastik graphs, Advances and Appl. Discrete Math., 16(2) (2015) 161-172.
[1602] V. J. Kaneria, H. M. Makadia, and M. M. Jariya, Graceful labeling for cycle of
graphs, Int. J. Math. Res., 6 (2) (2014) 173-178.
[1603] V. J. Kaneria, H. M. Makadia, M. M. Jariya, and M. Meghpara, Graceful labeling
for complete bipartite graphs, Appl. Math. Sci., 8 (103) (2014) 5099-5104.

the electronic journal of combinatorics (2023), #DS6 501

[1604] V. J. Kaneria, H. M. Makadia, and M. Meghpara, Some graceful graphs, Int. J.
Math. Soft Comp., 4(2) (2014) 165-172.
[1605] V. J. Kaneria, H. M. Makadia, and M. Meghpara, Gracefulness of cycle of cycles
and cycle of complete bipartite graphs, Int. J. Math. Trend Tech., 12(1) (2014)
19-26.
[1606] V. J. Kaneria, H. M. Makadia, and M. Meghpara, Cordiality of a star of the
complete graph and a cycle graph C(n · Kn ), J. Math. Res., 6(4) (2014) 18-28.
[1607] V. J. Kaneria, H. M. Makadia, and M. Meghpara, Graceful labeling for grid related
graphs, Int. J. Math. Soft Comput., 5(1) (2015), 111-117.
[1608] V. J. Kaneria, H. M. Makadia and R. V. Viradia, Graceful labeling for disconnected
grid related graphs, Bull. Math. Sci. Appl., 4(1) (2015) 6-11.
[1609] V. J. Kaneria, H. M. Makadia and R. V. Viradia, Some results on graceful labeling
for double step grid related graphs, Int. J. Math. Sci. Appl., 9(1) (2015) 117-127.
[1610] V. J. Kaneria, H. M. Makadia and R. V. Viradia, Various graph operation on
semi smooth graceful graphs, Int. J. Math. and Soft Computing, 6(1) (2016 57-
79. https://www.researchgate.net/publication/321164406_Various_Graph_
Operations_on_Semi_Smooth_Graceful_Graphs
[1611] V. J. Kaneria, M. Meera, and K. Maulik, Geometric mean 3-equitable labeling of
some graphs, Internat. J. Sci. Res. Reviews, IJSRR (2018) 7(1) Suppl. 245-250.
[1612] V. J. Kaneria and M. Meghpara, Mean labeling for some cycle of graphs, Int. J.
Math. Sci. Eng. Appl., 9(2) (2015) 267-274.
[1613] V. J. Kaneria and M. Meghpara, Semi smooth graceful labeling on some graphs,
Int. J. Math. Appl., 3 (3C) (2015) 1-5.
[1614] V. J. Kaneria and M. Meghpara, Graceful labeling for one point union for path of
graphs, Int. J. Math. Appl., 3(1) (2015) 49-55.
[1615] V. J. Kaneria, M. Meghpara, and H. M. Makadia, Mean labeling
for step grid graph, Advan. Appl. Math. Sci., 14(1) (2015) 111-114.
https://www.researchgate.net/publication/318636734_MEAN_LABELING_
FOR_STEP_GRID_GRAPH
[1616] V. J. Kaneria, M. Meghpara, and H. M. Makadia, Graceful labeling for one point
union of path and barycentric subdivision of a grid graph, Int. J. Math. Comp.
Res., 2(9) (2014) 624-629.
[1617] V. J. Kaneria, M. Meghpara, and H. M. Makadia, Graceful labeling for open star
of graphs, Int. J. Math. Stat. Invention, (IJMSI), 2(9) (2014) 19-23.
[1618] V. J. Kaneria, M. Meghpara, and H. M. Makadia, Cordial labeling for cycle of
complete bipartite graphs and cycle of wheels, Int. J. Pure Appl. Math., (IJPAM),
101(1) (2015) 1-8. https://www.researchgate.net/publication/275240630_
Cordial_labeling_for_cycle_of_complete_bipartite_graphs_and_cycle_
of_wheels

the electronic journal of combinatorics (2023), #DS6 502

[1619] V. J. Kaneria, K. M. Patadiya, and J. R. Teraiya, Balanced cordial labeling and
its application to produce new cordial families, Int. J. Math. Appl., 4 (1-C) (2016)
65-68.
[1620] V. J. Kaneria, O. Teraiya and M. Meghpara, Double path union of α-graceful
graph and its α-labeling, J. of Graph Labeling, 2(2) (2016) 107-114.
[1621] V. J. Kaneria and J. R. Teraiya, Complete star of a graph and its balanced cordial
labeling, Internat. J. Math. Soft Comput., 7(1) (2017) 89-94.
[1622] V. J. Kaneria, J. R. Teraiya, and K. M. Patadiya, Some result on balanced cordial
graphs, Int. J. Math. Appl., 4 (2-A), (2016) 85-87.
[1623] V. J. Kaneria and S. K. Vaidya, Index of cordiality for complete graphs and cycle,
Inter. J. Applied Math. and Computation, 2(4) (2010) 38-46.
[1624] V. J. Kaneria, S. K. Vaidya, G. V. Ghodasara, and S. Srivastav, Some classes of
disconnected graceful graphs, Proc. First Internat. Conf. Emerging Technologies
and Appl. Engin. Tech. Sci., (2008) 1050-1056.
[1625] V. J. Kaneria, R. V. Viradia, M. M. Jariya, and H. M. Makadia, Various labeling
for the graph C(t · Pn ), Int. J. Math. Comp. Res., 2 (11) (2014) 745-751.
[1626] V. J. Kaneria, R. V. Viradia and H. M. Makadia, Mean labeling for path union
and cycle of graphs, AKCE Int. J. Graphs Comb., to appear.
[1627] A. Kanetkar, Prime labeling of grids, AKCE J. Graphs Combin., 6 (2009) 135-142.
[1628] A. Kanetkar, S. S. Sane, Graceful labeling of a family of quasistars with paths in
arithmetic progression, Ars Combin., 83 (2007) 307-320.
[1629] N. Kang, S. Chen, Z. Li, and L. Hou, D-magic labelings of the halved n-cube,
Discrete Math., 345(11) (2022) 113044. 8 pages.
[1630] S. M. Kang, S. Nazeer, W. Nazeer, and B.-Y. Lee, Radio number of caterpillar
graphs, Wulfenia, 22(5) (2015) 48-58.
[1631] Q. D. Kang, The k-gracefulness of the product graphs Pm × C4n , J. Math. Res.
Exposition, 9 (1989) 623-627.
[1632] Q. Kang, S. M. Lee, and L. Wang, On the edge-graceful spectra of the wheel
graphs, unpublished.
[1633] Q. D. Kang, Z.-H. Liang, Y.-Z. Gao, and G.-H. Yang, On the labeling of some
graphs, J. Combin. Math. Combin. Comput., 22 (1996) 193-210.
[1634] Q. D. Kang and X. Zhao, Strongly harmonious labelings of windmill graphs, J.
Hebei Normal College, 2 (1992) 1-7.
[1635] A. R. Kannan, P. Manivannan, K. Loganathan, and S. Gyeltshen, A new no-
tion of classical mean graphs based on duplicating operations, Hindawi J. Math.,
Vol. 2022, Article ID 9253512, 13 pages. https://www.hindawi.com/journals/
jmath/2022/9253512/
[1636] M. Kannan, R. Vikrama Prasad, and R. Gopi, Super root square mean
labeling of disconnected graphs, Internat. J. Math. Appl., 4(1–C) (2016)

the electronic journal of combinatorics (2023), #DS6 503

 93-98. https://www.researchgate.net/publication/303814124_Super_Root_
Square_Mean_Labeling_Of_Disconnected_Graphs
[1637] M. Kannan, R. Vikrama Prasad, and R. Gopi, Even vertex odd mean labeling of
some graphs, Global J. Pure and Applied Math., 13(3) (2017) 1019-1034.
[1638] M Kannan, R. Vikrama Prasad, and R. Gopi, Even vertex odd mean labelings of
H-graph, Internat. J. Math. Archive, 8(8) (2017) 162-167.
[1639] M. Kannan, R. Vikrama Prasad, and R. Gopi, A notion of even vertex odd mean
labeling graphs, Internat. J. Math. Trends Tech., (IJMTT) 50(3) (2017) 153.
https://ijmttjournal.org/2017/Volume-50/number-3/IJMTT-V50P524.pdf
[1640] M. Kannan, R. Vikrama Prasad, and R. Gopi, Some graph operations of even
vertex odd mean labeling graphs, Internat. J. Appl. Eng. Res., 12(18) (2017)
7749-7753.
[1641] M. Kannan, R. Vikrama Prasad, and R. Gopi, Even vertex odd mean labeling
of some graph, Global Pure Appl. Math., 13(2) (2017) 1019-1034. https://www.
ripublication.com/gjpam17/gjpamv13n3_13.pdf
[1642] M. Kannan, R. Vikrama Prasad, and R. Gopi, A notion of even vertex odd mean
labeling graphs, Internat. J. Math. Trends Tech. (IJMTT), 50(3) (2017) 153-156.
[1643] A. Rajesh Kannan, P. Manivannan and A. Durai Baskar, Exponential mean label-
ing of some graphs obtained from duplicating operations, J. Physics Confer. Ser.,
1597(1):012028 (2020) 1-10. https://iopscience.iop.org/article/10.1088/
1742-6596/1597/1/012028/pdf
[1644] A. N. Kansagara and S. K. Patel, Prime labeling in the context
of web graphs without center, AKCE Int. J. Graphs Comb., 18(3)
(2021) 132-142. https://www.tandfonline.com/doi/epub/10.1080/09728600.
2021.1974286?needAccess=true
[1645] S. Kanwal, A. Azam, and Z. Iftikhar, SEMT labelings and deficiencies of forests
with two components (II), Punjab U. of Math., 51(4)(2019) 1-12.
[1646] S. Kanwal, Z. Iftikhar, and A. Azam, SEMT labelings and deficiencies of forests
with two components, Punjab Univ. J. Math. (Lahore) 51(5) (2019) 137-149.
[1647] S. Kanwal, M. Imtiaz, Z. Iftikhar, R. Ashraf, M. Arshad, R. Irfan, and I. Sumbal,
Embedding of supplementary results in strong EMT valuations and strength, Open
Math., 17 (1) (2019) 527-543.
[1648] S. Kanwal, S. Javed, and A. Riasat, On the super edge-magicness and the deficiency
of some families of acyclic graphs, Util. Math., 100 (2016) 323-356.
[1649] S. Kanwal and I. Kanwal, SEMT valuations of disjoint union of combs, stars and
banana trees, Punjab Univ. J. Math. (Lahore), 50(3) (2018) 131-144.
[1650] S. Kanwal, A. Riasat, M. Imtiaz, Z. Iftikhar, S. Javed, and S. Ashraf, Bounds of
strong EMT strength for certain subdivision of star and bistar, Open Math., 16
(2018) 1313-1325.

the electronic journal of combinatorics (2023), #DS6 504

[1651] G. Kaplan, A. Lev, and Y. Roditty, Bertrand’s postulate, the prime number the-
orem and product anti-magic graphs, Discrete Math., 308 (2008) 787-794.
[1652] G. Kaplan, A. Lev, and Y. Roditty, On zero-sum partitions and anti-magic trees,
Discrete Math., 309 (2009) 2010-2014.
[1653] N. Karst, J. Langowitz, J. Oehrlein, and D. S. Troxell, Radio k-chromatic number
of cycles for large k, Discrete Math. Algorithms Appl., 9(3) (2017), 1750031, 20pp.
[1654] M. K. Karthik Chidambaram, S. Athisayanathan, and R. Ponraj, Group
{1, −1, i, −i} cordial labeling of some splitting graphs, Global J. Engin. Sci. Re-
searches, 4(11) (2017) 83-88. https://www.academia.edu/en/36038631/Group_
1_1_i_i_Cordial_Labeling_of_Some_Splitting-_Graphs
[1655] M. K. Karthik Chidambaram, S. Athisayanathan, and R. Ponraj, Group
{1, −1, i, −i} cordial labeling of product related graphs, Internat. J. Adv. Sci. Res.
Devel., 04 (06/I), (2017) 27-33. https://www.academia.edu/33810064/Group_1_
1_i_i_Cordial_Labeling_of_Product_Related_Graphs
[1656] S. Karthik, K. M. Sabeel, and K. Paramasivama, Group vertex magicness
of product graphs and trees, https://www.researchgate.net/publication/
368688402_Group_vertex_magicness_of_product_graphs_and_trees
[1657] C. Karthikeyan, S. Arthi, M. Abinaya, R. Swathi, A. Madhumathi, Super Fi-
bonacci graceful labelling of some cycle related graphs, JSRD -Internat. J. Sci.
Res. Develop., 5(12) (2018) 2321-0613.
[1658] S. Karthikeyan, S. Navanaeethakrishnan, and R. Sridevi, Total edge Fibonacci
irregular labeling of some star graphs, Int. J. Math. Soft Comput., 5(1) (2015)
73-78. https://oaji.net/articles/2017/296-1504962802.pdf
[1659] K. Karuppasamy and S. Kaleeswari, Total mean labeling graphs, Internat. J.
Recent Tech. Engin. (IJRTE), 8(4S4) (2019) 90-92. https://www.ijrte.org/
wp-content/uploads/papers/v8i4s4/D10361284S419.pdf
[1660] K. Kasthuri, K. Karuppasamy, and K. Nagarajan, SD-divisor labeling of path
and cycle related graphs, AIP Conference Proceed., 2463, 030001 (2022) 030001-1-
030001-10.
[1661] F. Kastrati, W. Myrvold, L. D. Panjer, and A. Williams, Cordial forests, Con-
ference: 24th International Symposium on Fundamentals of Computation Theory
(FCT 2023) At: Trier, Germany, September 2023. https://www.researchgate.
net/publication/373140098_Cordial_Forests
[1662] K. Kathiresan, Subdivisions of ladders are graceful, Indian J. Pure Appl. Math.,
23 (1992) 21-23.
[1663] K. Kathiresan, Two classes of graceful graphs, Ars Combin., 55 (2000) 129-132.
[1664] K. Kathiresan, Graceful labeling of ladders with pendant edges, unpublished.
[1665] K. Kathiresan, Odd graceful graphs, unpublished.
[1666] K. Kathiresan and S. Amutha, Arbitrary supersubdivisions of stars are graceful,
Indian J. Pure Appl. Math., 35 (2004) 81-84.

the electronic journal of combinatorics (2023), #DS6 505

[1667] K. M. Kathiresan and S. Amutha, Fibonacci Graceful Graphs, Ph. D. Thesis,
Madurai Kamaraj University, October 2006.
[1668] K. M. Kathiresan and S. Amutha, Fibonacci graceful graphs, Ars Combin., 97
(2010) 41-50.
[1669] K. Kathiresan and R. Ganesan, A labeling problem on the plane graphs Pa,b , Ars
Combin., 73 (2004) 143-151.
[1670] K. Kathiresan and R. Ganesan, d-antimagic labelings of plane graphs Pab , J.
Combin. Math. Combin. Comput., 52 (2005) 89-96.
[1671] K. Kathiresan and S. Gokulakrishnan, On magic labelings of type (1, 1, 1) for the
special classes of plane graphs, Util. Math., 63 (2003) 25-32.
[1672] K. M. Kathiresan and S. D. Laurence, On super (a, d)-H-antimagic total covering
of star related graphs, Discuss. Math. Graph Theory, 35(4) (2015) 755-764. https:
//sciendo.com/pdf/10.7151/dmgt.1832
[1673] K. M. Kathiresan, S. Muthumari, and R. Ramalakshmi, Edge odd graceful label-
ings of certain new classes of graphs, Bull. Inst. Combin. Appl., 95 (2022) 57-69.
[1674] K. Kathiresan, S. Muthuvel, and V. Nagasubbu, Consecutive labelings for two
classes of plane graphs, Util. Math., 55 (1999) 237-241.
[1675] Km. Kathiresan and S. Sabarimalai Madha, Star super edge-magic deficiency of
graphs, Contrib. Discrete Math., 12(1) (2017) 143-156.
[1676] K. Kathiresan and R. Sumathi, Solution to an open problem in gracefulness of
arbitrary supersubdivisions of graphs, Util. Math., 84 (2011) 333-338.
[1677] S. Kavitha and G. Jayalalitha, Finite and neighborhood Gaussian prime
distance graph, J. Data Acquisition Processing, 38(1) (2023) 4062-4073.
https://www.researchgate.net/publication/370717959_FINITE_AND_
NEIGHBORHOOD_GAUSSIAN_PRIME_DISTANCE_GRAPHS_1
[1678] S. Kavitha and V. L. Stella Arputha Mary, Results on hefty V4 -vertex magic graph
labeling, J. Pharmaceutical Negative Results 14 Special Issue 1 (2023) 864-871.
https://www.pnrjournal.com/index.php/home/article/view/7413/9724
[1679] K. Kayathri and R. Amutha, Edge-graceful labelings of connected graphs, Elec-
tronic Notes Discrete Math., 53 (2016) 287-296.
[1680] M. Kchikech, R. Khennoufa, and O. Togni, Linear and cyclic radio k-labelings of
trees, Discuss. Math. Graph Theory, 27 (2007) 105-123.
[1681] M. Kchikech, R. Khennoufa, and O. Togni, Radio k-labelings for cartesian products
of graphs, Discuss. Math. Graph Theory, 28 (2008) 165-178.
[1682] M. Khalid, S. T. R. Rizvi, and K. Ali, Note on cycle-(super)magic labelings of
disconnected graphs, Util. Math., 104 (2017) 315-320. arXiv:1506.06087
[1683] E. Khairunnisa and K. A. Sugeng, Graceful labelling of corona product of aster
flower graph, Adv. Intel. Systems Res., (AISR), 157 (2018) 68-71. Mathemat-
ics, Informatics, Science, and Education International Conference (MISEIC 2018).
https://download.atlantis-press.com/article/25905010.pdf

the electronic journal of combinatorics (2023), #DS6 506

[1684] N. Khan, Cordial labelling of cycles, Annals Pure Appl. Math., 1(2) (2012) 117-130.
[1685] S. Khatun and Sk. Md. Abu Nayeem, Graceful labeling of some zero divisor graphs,
Elect. Notes Discr. Math., 63 (2017) 189-196.
[1686] R. Khennoufa and O. Togni, The radio antipodal and radio number of the hyper-
cube, Ars Combin., 102 (2011) 447-461.
[1687] J. Keene and A. Simoson, Balanced strands for asymmetric, edge-graceful spiders,
Ars Combin., 42 (1996) 49-64.
[1688] P. Keevash and K. Staden, Ringel’s tree packing conjecture in quasirandom graphs,
arXiv:2004.09947 45 pages.
[1689] A. Kézdy, ρ-valuations for some stunted trees, Discrete Math., 306 (2006) 2786-
2789.
[1690] R. Khennoufa and O. Togni, A note on radio antipodal colourings of paths, Math.
Bohem., 130 (2005) 277-282.
[1691] A. Khodkar, S. Nolen, and J. Perconti, Super edge-graceful labelings of complete
bipartite graphs, Australas. J. Combin., 46 (2010) 241-261.
[1692] A. Khodkar, Super edge-graceful labelings of complete tripartite graphs, J. Com-
bin. Math. Combin. Comput., 76 (2011) 137-158.
[1693] A. Khodkar, The union of vertex disjoint 3-cycles is super edge-graceful, Bull. Inst.
Combin. Appl., 69 (2013) 43-46.
[1694] A. Khodkar, R. Rasi, and S. M. Sheikholeslami, Super edge-gracefulness of com-
plete graphs, Util. Math., 87 (2012) 207-233.
[1695] A. Khodkar and K. Vinhage, Super edge-graceful labelings of total stars and total
cycles, J. Combin. Math. Combin. Comput., 76 (2011) 233-247.
[1696] B. M. Kim, W. Hwang, and B. C. Song, Radio number for the product of a path
and a complete graph, J. Comb. Optim., 30(1) (2015) 139-149.
[1697] R. Y. Kim, S-M. Lee, and H. K. Ng, On balancedness of some graph constructions,
J. Combin. Math. Combin. Comp., 66 (2008) 3-16.
[1698] R. Y. Kim, S-M. Lee, and H. K. Ng, On balancedness of some families of graphs,
preprint.
[1699] S.-R. Kim and J. Y. Park, On super edge-magic graphs, Ars Combin., 81 (2006)
113-127.
[1700] Y.-H. Kim, On constructions of new super edge-magic graphs from some old ones
by attaching some pendants, Commun. Korean Math. Soc., 32(1) (2017 225-231.
[1701] J. S. Kimberley and J. A. MacDougall, Mutation of vertex-magic regular graphs,
24th MCCCC. J. Combin. Math. Combin. Comput., 82 (2012) 157-177.
[1702] W.W. Kirchherr, On the cordiality of some specific graphs, Ars Combin., 31 (1991)
127-138.
[1703] W.W. Kirchherr, NEPS operations on cordial graphs, Discrete Math., 115 (1993)
201-209.

the electronic journal of combinatorics (2023), #DS6 507

[1704] S. P. Kishore, Graceful Labellings of Certain Disconnected Graphs, Ph. D. Thesis,
Indian Institute of Technology, Madras, 1996.
[1705] S. Klee, H. Lehmann, and A. Park, Prime labeling of families of trees with Gaussian
integers, AKCE Internat. J. Graphs Combin., 13 (2016) 165-176.
[1706] D. Knuth, personal communication (2021).
[1707] D. E. Knuth, The Art of Computer Programming Volume, 4B 2021.
[1708] A. N. Koam and A. Ahmad, Computation of total vertex irregularity strength of
theta graphs, IEESAccess, 7 (2019) 113826-113831. https://ieeexplore.ieee.
org/stamp/stamp.jsp?arnumber=8786105
[1709] K. M. Koh, M. Miller, W. F. Smyth, and Y. Wang, On optimum summable graphs,
AKCE Int. J. Graphs Comb., 3(1) (2006) 45-57.
[1710] K. M. Koh, L. Y. Phoon, and K. W. Soh, The gracefulness of the join of graphs,
Electron. Notes Discrete Math., 48 (2015) 57-64.
[1711] K. M. Koh, L. Y. Phoon, and K. W. Soh, The gracefulness of the join of graphs
(II), AKCE Internat. J. Graphs Combin., 12 (2015) 180-185.
[1712] K. M. Koh and N. Punnim, On graceful graphs: cycles with 3-consecutive chords,
Bull. Malaysian Math. Soc., 5 (1982) 49-63.
[1713] K. M. Koh, D. G. Rogers, P. Y. Lee, and C. W. Toh, On graceful graphs V: unions
of graphs with one vertex in common, Nanta Math., 12 (1979) 133-136.
[1714] K. M. Koh, D. G. Rogers, and C. K. Lim, On graceful graphs: sum of graphs,
Research Report 78, College of Graduate Studies, Nanyang University (1979).
[1715] K. M. Koh, D. G. Rogers, and T. Tan, On graceful trees, Nanta Math., 10 (1977)
27-31.
[1716] K. M. Koh, P. Y. Lee, and T. Tan, Fibonacci trees, S outheast Asian Bull. Math.,
2(1) (1978) 45-47.
[1717] K. M. Koh, D. G. Rogers, and T. Tan, A graceful arboretum: a survey of graceful
trees, in Proceed. Franco-Southeast Asian Confer., Singapore, May 1979, 2 278-287.
[1718] K. M. Koh, D. G. Rogers, and T. Tan, Products of graceful trees, Discrete Math.,
31 (1980) 279-292.
[1719] K. M. Koh, D. G. Rogers, and T. Tan Another class of graceful trees, J. Austral.
Math. Soc. Ser. A, 31 (1981) 226-235.
[1720] K. M. Koh, D. G. Rogers, H. K. Teo, and K. Y. Yap, Graceful graphs: some further
results and problems, Congr. Numer., 29 (1980) 559-571.
[1721] K. M. Koh, T. Tan, and D. R. Rogers, Interlaced trees: a class of graceful trees,
Combinatorial Mathematics, VI (Proc. Sixth Austral. Conf., Univ. New England,
Armidale, 1978), 65-78, Lecture Notes in Math., 748 Springer, Berlin, 1979.
[1722] K. M. Koh, T. Tan, and D. G. Rogers, Two theorems on graceful trees, Discrete
Math., 25 (1979) 141-148.

the electronic journal of combinatorics (2023), #DS6 508

[1723] K. M. Koh and K. Y. Yap, Graceful numberings of cycles with a P3 -chord, Bull.
Inst. Math. Acad. Sinica, 12 (1985) 41-48.
[1724] S. R. Kola and P. Panigrahi, Radio numbers of some caterpillars, The Eighth
International Workshop on Graph Labelings (IWOGL 2014) 289-296, Electron.
Notes Discrete Math., 48, Elsevier Sci. B. V., Amsterdam, 2015. http://dx.doi.
org/10.1016/j.endm.2015.05.043
[1725] T. Kojima On C4 -supermagic labelings of the Cartesian product of paths and
graphs, Discrete Math., 313 (2013) 164-173.
[1726] S. R. Kola and P. Panigrahi, Nearly antipodal chromatic number ac0 (Pn ) of the
path Pn , Math. Bohem., 134 (2009) 77-86.
[1727] M. Konečný, S. Kučera, J. Novotná, J. Pekárek, Š. Šimsa, and M. Töpfer, Mini-
mal sum labeling of graphs, Combinatorial algorithms, 252-263, Lecture Notes in
Comput. Sci., 10765, Springer, Cham, 2018.
[1728] M. Kong, A. C. Lee, and S. M. Lee, On the balance index sets of the homeomorph
of regular graphs, Congr. Numer., 204 (2010) 193-203.
[1729] M. C. Kong, Y.-C. Wang, and S.-M. Lee. On edge-balanced index sets of some com-
plete k-partite graphs. Proceed. Fortieth Southeastern Internat. Confer. Combin.,
Graph Th. and Comput., 196 (2009) 71-94.
[1730] M. Koppendrayer, personal communication (2012).
[1731] V. Kostyuk, D. Narayan, and V. Williams, Minimal rankings and the arank number
of a path, Discrete Math., 306 (2006) 1991-1996.
[1732] W. O. Krawec, Modular multiplicative graphs, Graph Theory Notes N. Y., 64
(2013) 45-48.
[1733] W. O. Krawec, Modular multiplicative graphs, Ars Combin., 124 (2016) 33-40.
[1734] H. K. Krishnappa, K. Kopthapalli, and V. C. Venkaiah, Vertex magic total of
complete graphs, AKCE J. Graphs Combin., 6 (2009) 143-154.
[1735] M. C. Kong, S. M. Lee, E. Seah, and A. Tang, A complete characterization of
balanced graphs, J. Combin. Math. and Combin. Comput., 66 (2008) 225-236.
[1736] M. C. Kong, S. M. Lee, and H. S. H. Sun, On magic
strength of graph, Ars Combin., 45 (1997) 193-200.
https://www.sciencedirect.com/science/article/pii/S0166218X13003028
[1737] D. Korze, Z. Shao, and A. Vesel, New results on radio k-labelings of distance
graphs, Discrete Appl. Math., 319 (2022) 472-479. https://www.sciencedirect.
com/science/article/pii/S0166218X13003028
[1738] A. Kotzig, Decompositions of a complete graph into 4k-gons (in Russian), Matem-
atický Casopis, 15 (1965) 229-233.
[1739] A. Kotzig, On certain vertex valuations of finite graphs, Util. Math., 4 (1973)
67-73.

the electronic journal of combinatorics (2023), #DS6 509

[1740] A. Kotzig, β-valuations of quadratic graphs with isomorphic components, Util.
Math., 7 (1975) 263-279.
[1741] A. Kotzig, Decomposition of complete graphs into isomorphic cubes, J. Combin.
Theory, Series B, 31 (1981) 292-296.
[1742] A. Kotzig, Recent results and open problems in graceful graphs, Congr. Numer.,
44 (1984) 197-219.
[1743] A. Kotzig and A. Rosa, Magic valuations of finite graphs, Canad. Math. Bull., 13
(1970) 451-461.
[1744] A. Kotzig and A. Rosa, Magic valuations of complete graphs, Centre de Recherches
Mathematiques, Universite de Montreal, (1972) CRM-175.
[1745] A. Kotzig and J. Turgeon, β-valuations of regular graphs with complete compo-
nents, Colloq. Math. Soc. János Bolyai 18, Combinatorics, Keszthély, Hungary,
1976.
[1746] P. Kovář, Vertex magic total labeling of products of regular VMT graphs and
regular supermagic graphs, J. Combin. Math. Combin. Comput., 54 (2005) 21-31.
[1747] P. Kovář, Magic labelings of regular graphs, AKCE Inter. J. Graphs and Combin.,
4 (2007) 261-275.
[1748] P. Kovář, Unified approach to magic labeling of copies of regular graphs, Proceed.
Thirty-Fifth Southeastern International Conference on Combinatorics, Graph The-
ory and Computing. Congr. Numer., 168 (2004) 197-205.
[1749] P. Kovář, D. Fronček, and T. Kovářová, A note on 4-regular distance magic graphs,
Australas. J. Combin., 54 (2012) 127-132. https://ajc.maths.uq.edu.au/pdf/
54/ajc_v54_p127.pdf
[1750] P. Kovář, M. Kravčenko, M. Krbeček, and A. Silber, Supermagic graphs with
many different degrees, Discuss. Math. Graph Theory, 41 (2021) 1041-1050.
doi:10.7151/dmgt.2227
[1751] P. Kovár and A. Silber, Distance magic graphs of high regularity, AKCE Int. J.
Graphs Comb., 9(2) (2012) 213-219.
[1752] J. Kratochvil, M. Miller, and N. H. Minh, Sum graph labels-An upper bound and
related problems. In: Proceed. Twelfth Australasian Workshop Combin. Algor.,
Bandun, Indonesia (2001).
[1753] J. Kratochvil, M. Miller, and H. Nguyen, Sum graph labels–An upper bound and
related problems, Proc. of AWOCA 2001, Institut Teknologi Bandung, Indonesia,
(2001) 126-131.
[1754] A. K. Krishnaa, A study of the major graph labelings of trees, Informatica (Vilnius)
15 (2004) 515-524.
[1755] A. K. Krishnaa, On antimagic labelings of some cycle related graphs, J. Discrete
Math. Sci. Cryptogr., 15 (2012) (4-5) 225-235.
[1756] A. K. Krishnaa, Formulas and algorithms of antimagic labelings of some helm
related graphs, J. Discrete Math. Sci. Cryptogr., 19(2) (2016) 425-434.

the electronic journal of combinatorics (2023), #DS6 510

[1757] A. K. Krishnaa and M. S. Dulawat, Labelling paths, J. Rajasthan Acad. Phy. Sci.,
5 (2006) 99-104.
[1758] A. K. Krishnaa, M. S. Dulawat, and G. S. Rathore, Computational complexity in
decision problems, presented in Conf. of Raj. Parishad, Dec. 14-15, 2001, Udaipur,
India.
[1759] V. H. Krisnawati, A. A. G. Ngurah, N. Hidayat, and A. R. Alghofari, On the
super edge-magic deficiency of forests, December 2019AIP Conference Proceedings
2192(1):040007 https://aip.scitation.org/doi/10.1063/1.5139133
[1760] V. H. Krisnawati, A. A. G Ngurah, N. Hidayat, and A. R. Alghofari, On the
(consecutively) super edge-magic deficiency of subdivision of double stars. J. Math.,
(2020) Art. ID 4285238, 1-16.
[1761] E. Krop, Lobsters with an almost perfect matching are graceful, Bull. Inst. Combin.
Appl., 74 (2015) 21-24. arXiv:1402.3994
[1762] E. Krop, S. M. Lee, and C. Raridan, On the number of unlabeled vertices in edge-
friendly labelings of graphs, Discrete Math., 312 (2012) 574-577. arXiv:1103.5127
[1763] E. Krop, S. M. Lee, and C. Raridan, On the edge-balanced index sets of product
graphs, J. Indones. Math. Soc., (2011) Special edition, 71-78. arXiv:1103.4994
[1764] E. Krop, S. Minion, P. Patel, and C. Raridan, A solution to the edge-balanced
index set problem for complete odd bipartite graphs, Bull. Inst. Combin. Appl.,
70 (2014) 119-125. arXiv:1307.8071
[1765] E. Krop, F. Mutiso, and C. Raridan, On super edge-graceful trees of diameter four,
Congr. Numer., 210 (2011) 151-167 arXiv:1106.3063
[1766] E. Krop and K. Sikes, On the edge-balanced index sets of complete bipartite graphs,
Congr. Numer., 207 (2011) 23-32. arXiv:1106.1085
[1767] J. W. Krussel, Equitable labelling of complete bipartite graphs, Ars Combin., to
appear.
[1768] Q. Kuang, S. M. Lee, J. Mitchem, and A-G. Wang, On edge-graceful unicyclic
graphs, Congr. Numer., 61 (1988) 65-74.
[1769] C. Kujur, Lucky labeling and proper lucky labeling for bloom graph, IOSR
J. Math., 13 (2017) 52-59. https://doi.org/10.9790/5728-1302025259
https://www.academia.edu/33809434/Lucky_Labeling_and_Proper_Lucky_
Labeling_for_Bloom_Graph
[1770] C. Kujur, S. A. Xavier, and A. Raja, Proper lucky labeling of K-identified tri-
angular mesh and K-identified Sierpinski Gasket graphs, Internat. J. Sci. Engin.
Res., (IJSER), 8(4) (2017) 249-261. https://www.ijser.org/researchpaper/
Proper-Lucky-Labeling-of-k-Identified-Triangular-Mesh-and-k-Identified-Sierpins
pdf
[1771] S. Kulandhai Therese and K. Romila, Cube root cube mean labeling of graphs,
Internat. J. Math. Trends Tech., (IJMTT) 65(2) (2019) 130-135. http://
ijmttjournal.org/Volume-65/Issue-2/IJMTT-V65I2P520.pdf

the electronic journal of combinatorics (2023), #DS6 511

[1772] V. R. Kulli and M. H. Muddebihal, Lict and litact graph of graph, J. Appl. Anal.
Comput., 2(1) (2006) 33-43.
[1773] V. R. Kulli, The semitotal-block graph and the total-block graph of
a graph, Indian J. Pure Appl. Math., 7(6) (1976) 625-630. https:
//www.researchgate.net/publication/268998873_The_semitotal-block_
graph_and_the_total-block_graph_of_a_graph
[1774] A. Kumar, D. Mishra, A. Kumar, and V. Kumar, Alpha labeling of cyclic graphs,
Int. J. Appl. Comput. Math., 7(4) (2021) Paper No. 151, 7 pp. https://doi.org/
10.1007/s40819-021-01084-5
[1775] S. S. Kumar and G. Marimuthu, H-E-super magic decomposition of complete
bipartite graphs, The Eighth International Workshop on Graph Labelings (IWOGL
2014), Electron. Notes Discrete Math., 48 (2015) 297-300. http://dx.doi.org/
10.1016/j.endm.2015.05.044
[1776] R. Kuppan, L. Shobana and I. N. Cangul, Encrypting and decrypting algorithms
using strong face graph of a tree, Inter. J. Comp. Math.: Comp. Sys. Th., 5(4)
(2020) 225-233.
[1777] R. Kuppan and L. Shobana, Double duplication of special classes of cycle related
graphs, Math. Stat., 10(4)(2022) 773-781. https://www.hrpub.org/download/
20220630/MS8-13427481.pdf
[1778] T. J. Rajesh Kumar, Total neighborhood prime labeling of some trees, Proyecciones
J. Math., 41(1) (2022) 101-110.
[1779] N. Kumari and S. Mehra, On vertex product cordial labeling, Internat. J. Pure
Appl. Math.,114(3) (2017) 553-570. https://ijpam.eu/contents/2017-114-3/
11/index.html
[1780] D. Kuo, G. Chang, and Y.-H. Kwong, Cordial labeling of mKn , Discrete Math.,
169 (1997) 121-131.
[1781] S. Kuppusamy and S. Guruswamy, Graceful and cordial labeling of subdivision of
graphs, Electronic Notes Disc. Math., 53 (2016) 123-131.
[1782] H. Kwong, On balance index sets of rooted trees, Ars Combin., 91 (2009) 373-382.
[1783] H. Kwong, and S. M. Lee, On the integer-magic spectra of the corona of two graphs,
36th Southeastern International Conference on Combinatorics, Graph Theory, and
Computing, Congr. Numer. 174 (2005) 207-222.
[1784] H. Kwong, and S. M. Lee, On friendly index sets of generalized books, J. Combin.
Math. Combin. Comput., 66 (2008) 43-58.
[1785] H. Kwong, and S. M. Lee, On edge-balance index sets of generalized theta graphs,
Cong. Numer., 198 (2009) 157-168.
[1786] H. Kwong, and S. M. Lee, On edge-balance index sets of flower graphs, Bull. Instit.
Combin. Appl., 62 (2011) 107-116.
[1787] H. Kwong, and S. M. Lee, S.-P. Lo, and Y.C. Wang, On uniformly balanced graphs,
Australasian J. Combin., 53 (2012) 83-95.

the electronic journal of combinatorics (2023), #DS6 512

[1788] H. Kwong, S-M. Lee, and K. K. Ng, On friendly index set of 2-regular graphs,
Discrete Math. 308 (2008) 5522-5532.
[1789] H. Kwong, S. M. Lee, and H. K. Ng, On product-cordial index sets of cylinders,
Congr. Numer., 206 (2010) 139-150.
[1790] H. Kwong, S. M. Lee, H. K. Ng, On product-cordial index sets and friendly index
sets of 2-regular graphs and generalized wheels, Acta Math. Sinica,(Engl. Ser.) 28
(4) (2012) 661-674.
[1791] H. Kwong, S.-M. Lee, and H. K. Ng, On product-cordial index sets of Möbius
ladders and their bridge join with K4 , J. Graph Label., 2(1) (2016) 25-43.
[1792] H. Kwong, S-M. Lee, and D. G. Sarvate, On balance index sets of one-point unions
of graphs, J. Combin. Math. Combin. Comput., 66 (2008) 113-127.
[1793] Y.-L. Lai, Review of “Some results on total product cordial labeling of graphs”,
J. Indian Acad. Math., 28 (2006) 309-320 by M. Sundaram, R. Ponraj, and S.
Somasundaram, MR2313075 (2008a:05241).
[1794] K. Chitra Lakshmi and K. Nagarajan, Geometric mean cordial labeling of graphs,
Intnat. J. Math.Soft Comput,, 7(1) (2017)75-87.
[1795] D. R. Lakshmi and S. Vangipuram, A note on the graceful numbering of a class of
trees, Def. Sci. J., 35 (1985) 65-70.
[1796] P. Lalitha and L. Tamilselvi, Hexagonal snakes with alpha labeling
along a path, J. Physics Confer., Series 1504:012009 2020 https:
//www.researchgate.net/publication/341760424_Hexagonal_Snakes_With_
Alpha_Labeling_Along_A_Path
[1797] J. D. Laison, C. Starr, and A. Walker, Finite prime distance graphs
and 2-odd graphs, Disc. Math. 313(20) (2013) 2281-2291. https:
//reader.elsevier.com/reader/sd/pii/S0012365X13002665?token=
3B3684E8787CAE012B93F0D27F86B1474F6F0FBA7642A9F975200A47662F41CB576BDBC71704C71B
originRegion=us-east-1&originCreation=20220726202356
[1798] D. R. Lashmi and S. Vangipuram, An α-valuation of quadratic graph Q(4, 4k),
Proc. Nat. Acad. Sci. India Sec. A, 57 (1987) 576-580.
[1799] A. Lasim, I. Halikin and K. Wijaya, The harmonious, odd harmo-
nious, and even harmonious labeling, Math. App., 16(4) (2022) 1131-1138.
doi:10.30598/barekengvol16iss4pp1131-1138
[1800] R. Laskar and D. Pillone, Theoretical and complexity results for minimal rank-
ings, Recent advances in interdisciplinary mathematics (Portland, ME, 1997). J.
Combin. Inform. System Sci., 25 (2000) 17-33.
[1801] G.-C. Lau, Every graph is local antimagic total, arXiv:1906.10332.
[1802] G.-C .Lau, S. Alikhani, S. M. Lee, and W. Kocay, On k-edge-magic labelings of
maximal outerplanar graphs, AKCE Int. J. Graphs Comb., 12(1) (2015) 40-46.

the electronic journal of combinatorics (2023), #DS6 513

[1803] G.-C. Lau, H. H. Chu, N. Suhadak, F. Y. Foo, and H. K. Ng, On SD-prime
cordial graphs, Internat. J. Pure Appl. Math., (2016) 1017-1028. https://ijpam.
eu/contents/2016-106-4/4/4.pdf
[1804] G.-C. Lau, Z.-B. Gao, S. M. Lee, and G.-Y. Sun, On friendly index sets of the
edge-gluing of complete graph and cycles, AKCE Internat. J. Graphs Combin., 13
(2016) 107-111.
[1805] G.-C. Lau, P. Jeyanthi D. Ramya and R. Kalaiyarasi, On Skolem odd and even
difference mean graphs, J. King Saud Univer.– Science, 30 (2018) 286-291.
[1806] G.-C. Lau, S. M. Lee, and W. C. Shiu, On edge-prime cubic graphs
with small components, Open J. Discret. Appl. Math., 2(2) (2019) 48-58.
https://www.researchgate.net/publication/335502722_On_edge-prime_
cubic_graphs_with_small_components
[1807] G.-C. Lau and M. Nalliah, On local antimagic chromatic number of a corona
product graph, arXiv:2203.09906v1 8 pages.
[1808] G.-C. Lau, H.-K. Ng, and W.-C. Shiu, Affirmative solutions on local an-
timagic chromatic number, Graphs and Combin., 36(5) (2020) 1337-1354.
arXiv:1805.02886
[1809] G.-C. Lau and W.-C. Shiu, On local antimagic total labeling of amalgamation
graphs, (2022) arXiv:2203.06337, 16 pages.
[1810] G.-C. Lau, W. C. Shiu, and H.-K. Ng, Further results on cube divisor cordial
labeling, AKCE Internat. J. Graphs and Combin. 13 (2016) 200-209.
[1811] G.-C. Lau, W.-C. Shiu, and H.-K. Ng, On local antimagic chromatic num-
ber of cycle-related join graphs, Discuss. Math. Graph Th., 41 (2021) 133-152.
arXiv:1805.04888
[1812] G.-C. Lau, W. C. Shiu, H.-K. Ng, and P. Jeyanthi, Further results on SD-prime
labeling, JCMMCC 98 (2016) 151-170.
[1813] G.-C Lau, W.-C. Shiu, and H.-K. Ng, On number of pendants in local antimagic
chromatic numbers, J. Discrete Math. Sci. Cryptogr., (2021) arXiv:2001.05138.
[1814] G.-C Lau, W.-C. Shiu, and H. K. Ng, On local antimagic chromatic number
of graphs with cut-vertices, Iran. J. Maths. Sci. Inform., (2022), to appear.
arXiv:1805.04801.
[1815] G.-C. Lau, W.-C. Shiu, and H.-K. Ng, On k-super graceful labeling of graphs, Thai
J. Math., 203 (2022) 1375-1387. http://thaijmath.in.cmu.ac.th/index.php/
thaijmath/article/view/2624/354355122
[1816] G.-C Lau, W.-C. Shiu, and C. X. Soo, On local antimagic chromatic number of
spider graphs, J. Discrete Math. Sci. Cryptogr., (2022) arXiv:2008.09754.
[1817] S. D. Laurence and K. M. Kathiresan, On super (a, d)-Pn -antimagic total labeling
of stars, AKCE Int. J. Graphs Comb., 12(1) (2015) 54-58.
[1818] S. D. Laurence and K. M. Kathiresan, The total edge irregular strength of path
union of cycles, Util. Math., 105 (2017) 125-131.

the electronic journal of combinatorics (2023), #DS6 514

[1819] Q. Laurejas and A. Pedrano, On 0-edge magic labeling of some graphs, Internat.
J. Math. Appl., 5 Issue 2C (2017) 329-337.
[1820] S. Lavanya and V. Ganesa, Different operations of sunlet graph Sn , Malaya J. Mat.,
9(1) (2021) 272-282. http://malayajournal.org/articles/MJM09010046.pdf
[1821] H.-F. Law, Full friendly index sets of spiders, Ars Combin., 119 (2015) 23-31.
[1822] V. M. Lawas and Y. F. Lim, Stars are square harmonious graphs,
DLSU Research Congress 2017, De La Salle University, Manila, Philippines,
(2017) 1-6. https://www.researchgate.net/publication/359659568_Stars_
are_Square_Harmonious_Graphs
[1823] S. D. Laurence and K. M. Kathiresan, On super (a, d)−Ph -antimagic total labeling
of stars, AKCE J. Graphs Combin., 12 (2015) 54-58.
[1824] A. N-T. Lee and S. M. Lee, On (k, 1)-strongly indexable graphs associated with
sequences of positive integers, Congr. Numer., 199 (2009) 205-215.
[1825] A. N-T. Lee and S. M. Lee, On a construction of (k, d)-strongly indexable graphs,
unpublished.
[1826] A. N-T. Lee, S. M. Lee, and H. K. Ng, On balance index sets of graphs, J. Combin.
Math. Combin. Comput., 66 (2008) 135-150.
[1827] A. C. Lee, S. M. Lee, and H.-H. Su, On the balance index sets of generalized
friendship graphs, envelope graphs of cycles and cubic trees, Proceedings of the
Fortieth Southeastern International Conference on Combinatorics, Graph Theory
and Computing, Congr. Numer., 196 (2009) 3-22.
[1828] C. Lee, Minimum coprime graph labelings, arXiv:1907.12670, 17 pages
[1829] H. Y. Lee, H. M. Lee, and G. J. Chang, Cordial labelings of graphs, Chinese J.
Math., 20 (1992) 263-273.
[1830] L. M. Lee, S. M. Lee, and G. Murthy, On edge-graceful labelings of complete
graphs–solution of Lo’s conjecture, Congr. Numer., 62 (1988) 225-233.
[1831] M.-J. Lee, On super (a, 1)-edge-antimagic total labeling of grids and crowns, Ars
Combin., 104 (2012) 97-105.
[1832] M.-J. Lee, W,-H. Tsai, and C. Lin, Super (a, 1)-cyclic-antimagic labelings of the
grid, Ars Combin., 112 (2013) 3-12.
[1833] M.-J. Lee, C. Lin, and W.-H. Tsai, On antimagic labeling for power of cycles, Ars
Combin., 98 (2011) 161-165.
[1834] M.-J. Lee, W.-H. Tsai, and C. Lin, On super (a, 1)-edge-antimagic total labelings
of subdivision of stars, Util. Math., 88 (2012) 355-365.
[1835] P-S Lee, On α-labelings of prism graphs and gear graphs, unpublished.
[1836] S. M. Lee, k-graceful labelling of Mongolian tents and related graphs, Congr.
Numer., 50 (1985) 85-96.
[1837] S. M. Lee, A conjecture on edge-graceful trees, Scientia, 3 (1989) 45-47.

the electronic journal of combinatorics (2023), #DS6 515

[1838] S. M. Lee, New directions in the theory of edge-graceful graphs, Proc. 6th Caribbean
Conf. Combin. & Computing (1991) 216-231.
[1839] S. M. Lee, On constructions which yield fully magic graphs, Ars Combin. 107
(2012) 385-409.
[1840] S. M. Lee, E. Chen, E. Yera, and L. Wang, On super edge-graceful (p, p+1)-graphs,
Congr. Numer., 171 (2004) 51-65.
[1841] S. M. Lee, K-J. Chen, and Y-C. Wang, On the edge-graceful spectra of cycles with
one chord and dumbbell graphs, Congr. Numer., 170 (2004) 171-183.
[1842] S. M. Lee, K. Ho, and H.-H. Su, On balance index sets of k-level wheel graphs,
Congr. Numer., 229 (2017) 313-324.
[1843] S. M. Lee, Y. S. Ho, S. K. Tan, and H. H. Su, Edge-magic indices of stars, Proceed-
ings of the Forty-Third Southeastern International Conference on Combinatorics,
Graph Theory and Computing. Congr. Numer., 213 (2012) 15-26.
[1844] S. M. Lee, M. Kitagaki, J. Young, and W. Kocay, On edge-graceful and edge-magic
maximal outerplanar graphs, J. Combin. Math. Combin. Comput., 59 (2006) 119-
129.
[1845] S. M. Lee and M. C. Kong, On super edge-magic n-stars, J. Combin. Math. Com-
bin. Comput. 42 (2002) 87-96.
[1846] S. M. Lee, K. Y. Lai, Y. S. Wang, and M. K. Kiang, On the graceful permutation
graphs conjecture, Congr. Numer., 103 (1994) 193-201.
[1847] S. M. Lee and A. N-T Lee, On super edge-magic unicyclic graphs, unpublished.
[1848] S. M. Lee and A. N-T Lee, On super edge-magic graphs with many odd cycles,
Proceed. Thirty-Fourth Southeastern Internat. Confer. Comb., Graph Th. Com-
put. Congr. Numer., 163 (2003) 65-80.
[1849] S. M. Lee, A. Lee, H. Sun, and I. Wen, On the integer-magic spectra of graphs, J.
Combin. Math. Combin. Comput., 42 (2002) 77-86.
[1850] S. M. Lee and E. Leung, and H. K. Ng, On super vertex-graceful trees, Proceed-
ings of the Thirty-Fifth Southeastern International Conference on Combinatorics,
Graph Theory and Computing, Congr. Numer., 167 (2004) 3-26.
[1851] S. M. Lee, E. Leung, and H. K. Ng, On super vertex-graceful unicylic graphs,
Czechoslovak Math. J., 59(134) (2009) 1-22.
[1852] S. M. Lee, C. Levesque, S-P. B. Lo, and K. Schaffer, On the edge-graceful spectra
of the cylinder graphs (I), J. Combin. Math. Combin. Comput., 66 (2008) 195-214.
[1853] S. M. Lee and A. Liu, A construction of k-graceful graphs from complete bipartite
graphs, SEA Bull. Math., 12 (1988) 23-30.
[1854] S. M. Lee and A. Liu, A construction of cordial graphs from smaller cordial graphs,
Ars Combin., 32 (1991) 209-214.

the electronic journal of combinatorics (2023), #DS6 516

[1855] S. M. Lee, A. Liu, and S. K. Tan, On balanced graphs, Proceedings of the Twenty-
first Manitoba Conference on Numerical Mathematics and Computing (Winnipeg,
MB, 1991), Congr. Numer., 87 (1992) 59-64.
[1856] S. M. Lee and S-P. Lo, On (1,2)-strongly indexable spiders, J. Combin. Math.
Combin. Comput., 72 (2010) 101-113.
[1857] Sin-Min Lee, R. M. Low, H. K. Ng, and Y-C. Wang, On friendly index sets of
k-galaxies, Elect. J. Graph Theory and Appl., 7(1) (2019) 1–10. DOI:10.5614/
ejgta.2019.7.1.1
[1858] S. M. Lee, P. N. Ma, L. Valdés, and S.-M Tong, On the edge-graceful grids, Congr.
Numer., 154 (2002) 61-77.
[1859] S. M. Lee, T. Min-Fang, and S. P. B. Lo, On the edge-balance index set of some
trees, unpublished.
[1860] S. M. Lee and K. C. Ng, Every Young tableau graph is d-graceful, Combinatorial
Math. Annal., New York Acad. Sci., 555 (1989) 296-302.
[1861] S. M. Lee, M. Kong, and Y. C. Wang, On edge-balance index sets of some complete
k-partite graphs, Congr. Numer., 196 (2009) 71-94.
[1862] S. M. Lee and H. K. Ng, On friendly index sets of total graphs of trees, Util. Math.,
73 (2007) 81-95.
[1863] S. M. Lee and H. K. Ng, On friendly index sets of bipartite graphs, Ars Combin.,
86 (2008) 257-271.
[1864] S. M. Lee and H. K. Ng, A class of k-graceful bipartite planar graphs, unpublished.
[1865] S. M. Lee and H. K. Ng, On friendly index sets of cycles with parallel chords, Ars
Combin., 97A (2010) 253-267.
[1866] S. M. Lee and H. K. Ng, On friendly index sets of graphs, unpublished.
[1867] S.M. Lee and H. K. Ng, On friendly index sets of prisms and Möbius ladders, J.
Combin. Math. Combin. Comput., 90 (2014) 59-74.
[1868] S. M. Lee, H. K. Ng, Y.-S. Ho, and F. Saba, On edge-graceful edge-splitting ex-
tensions of paths and spiders, unpublished.
[1869] S. M. Lee, H. K. Ng, and G.-C. Lau, On friendly index sets of spiders, Malays. J.
Math. Sci., 8(1) (2014) 47-68.
[1870] S. M. Lee, H. K. Ng, and H. Sun, On super vertex-graceful caterpillars, Proceed.
Forty-First Southeastern Inter. Conf. Combin., Graph Th. and Compu., Congr.
Numer., 204 (2010) 33-44.
[1871] S. M. Lee, H. K. Ng, and S. M. Tong, On the balance index of the chain-sum
graphs of cycles, Util. Math., 77 (2008) 113-123.
[1872] S. M. Lee, H. K. Ng, S. M. Tong, On friendly index sets of broken wheels with
three spokes, J. Combin. Math. Combin. Comput., 74 (2010) 13-31.
[1873] S. M. Lee, H. K. Ng, and Y. Wen, On the edge-magic indices of (v, v + 1)-graphs,
Util. Math., 72 (2007) 97-110.

the electronic journal of combinatorics (2023), #DS6 517

[1874] S. M. Lee, Y. C. Pan, and M. C. Tsai, On vertex-graceful (p, p + 1)-graphs, Congr.
Numer., 172 (2005) 65-78.
[1875] S. M. Lee, W. M. Pigg, and T. J. Cox, On edge-magic cubic graphs conjecture,
Congr. Numer., 105 (1994) 214-222.
[1876] S. M. Lee, L. Quach, and S. Wang, On Skolem-gracefulness of graphs which are
disjoint union of paths and stars, Congr. Numer., 61 (1988) 59-64.
[1877] S. M. Lee, F. Saba, E. Salehi, and H. Sun, On the V4 -magic graphs, Congr. Numer.,
156 (2002) 59-67.
[1878] S. M. Lee, F. Saba, and G. C. Sun, Magic strength of the kth power of paths,
Congr. Numer., 92 (1993) 177-184.
[1879] S. M. Lee and E. Salehi, Integer-magic spectra of amalgamations of stars and
cycles, Ars Combin., 67 (2003) 199-212.
[1880] S. M. Lee, E. Salehi and H. Sun, Integer-magic spectra of trees with diameter at
most four, J. Combin. Math. Combin. Comput., 50 (2004) 3-15.
[1881] S. M. Lee, E. Schmeichel, and S.C. Shee, On felicitous graphs, Discrete Math., 93
(1991) 201-209.
[1882] S. M. Lee and E. Seah, On edge-gracefulness of kth power cycles, Congr. Numer.,
71 (1990) 237-242.
[1883] S. M. Lee and E. Seah, Edge-gracefulness labelings of regular complete K-partite
graphs, Congr. Numer., 75 (1990) 41-50.
[1884] S. M. Lee and E. Seah, On edge-gracefulness of composition of step graphs and null
graphs, Graph Theory, Combinatorics, Algorthms, and Applications (San Fran-
cisco, 1989), SIAM (1991) 325-330.
[1885] S. M. Lee and E. Seah, On edge-graceful triangular snakes and sunflower graphs,
unpublished.
[1886] S. M. Lee, E. Seah, and S.-P. Lo, On edge-graceful 2-regular graphs, J. Combin.
Math. Combin. Comput., 12 (1992) 109-117.
[1887] S. M. Lee, E. Seah, and S. K. Tan, On edge-magic graphs, Congr. Numer., 132
(1992) 179-191.
[1888] S. M. Lee, E. Seah, and P.-C. Wang, On edge-gracefulness of kth power graphs,
Bull. Inst. Math. Acad. Sinica, 18 (1990) 1-11.
[1889] S. M. Lee, and Q. X. Shan, All trees with at most 17 vertices are super edge-magic,
16th MCCCC Conference, Carbondale, University Southern Illinois, Nov. 2002.
[1890] S. M. Lee and S.C. Shee, On Skolem-graceful graphs, Discrete Math., 93 (1991)
195-200.
[1891] S. M. Lee, S. L. Song, and L. Valdeés, On Q(a)P (b)-super edge-graceful wheels,
unpublished.
[1892] S. M. Lee and H.-H. Su, On the balance index sets of permutation graphs, unpub-
lished.

the electronic journal of combinatorics (2023), #DS6 518

[1893] S. M. Lee, H.-H. Su, and H. Todt, On the edge-balance index sets of broken wheels,
Congr. Numer., 221 (2014) 31-42.
[1894] S. M. Lee, H.-H. Su, and Y.-C. Wang, On the integer-magic spectra of honeycomb
graphs, Cong. Numer., 193 (2008) 49-65.
[1895] S. M. Lee, H.-H. Su, and Y.-C. Wang, On balance index sets of disjoint graphs,
unpublished.
[1896] S. M. Lee, H.-H. Su, and Y.-C. Wang, On k-edge-magic Halin graphs, Proceed.
Forty-First Southeastern Inter. Conf. Combin., Graph Th. and Comput., Congr.
Numer., 204 (2010) 129-145.
[1897] S. M. Lee, H.-H. Su, and Y.-C. Wang, On the edge-balance index sets of (p, p + 1)-
graphs, Int. J. Contemp. Math. Sci., 7 (2012)(29-32) 1429-1447.
[1898] S. M. Lee, H.-H. Su, and Y.-C. Wang, On k-edge-magic cubic graphs, 24th MC-
CCC. J. Combin. Math. Combin. Comput., 82 (2012) 87-103.
[1899] S. M. Lee, H.-H. Su, and W. Wei, On a family of the super edge-graceful trees, J.
Combin. Math. Combin. Comput., 106 (2018) 23-36.
[1900] S. M. Lee, H. Sun, W. Wei, Y. Wen and P. Yiu, The super edge-gracefulness of
two infinite families of trees, Congr. Numer., 190 (2008) 109-128.
[1901] S. M. Lee, H. Sun, and I Wen, On group-magic graphs, J. Combin. Math. Combin.
Computing, 38 (2001) 197-207.
[1902] S. M. Lee and S. K. Tan, A class of arbitrarily graceful planar bipartite graphs, J.
Combin. Math. Combin. Comput., 9 (1991) 119-127.
[1903] S. M. Lee, M.-F. Tao, and B. Lo, On the edge-balance index sets of some trees,
unpublished.
[1904] S. M. Lee, S. M. Tong, and E. Seah, On the edge-magic and edge-graceful total
graphs conjecture, Congr. Numer., 141 (1999) 37-48.
[1905] S. M. Lee, L. Valdés, and Y. S. Ho, On group-magic trees, double trees and ab-
breviated double trees, J. Combin. Math. Combin. Computing, 46 (2003) 85-95.
[1906] S. M. Lee and G. Wang, All pyramids, lotuses and diamonds are k-graceful, Bull.
Math. Soc. Sci. Math. R. S. Roumanie (N.S.), 32 (1988) 145-150.
[1907] S. M. Lee and L. Wang, On k-edge-graceful trees, unpublished.
[1908] S. M. Lee and P. Wang, On the k-gracefulness of the sequential join of null graphs,
Congr. Numer., 71 (1990) 243-254.
[1909] S. M. Lee, J. Y-C Wang, On super edge-magicness of chain graphs whose blocks
are complete, unpublished.
[1910] S. M. Lee, L. Wang, H. Ng, Y-C Wang, On the edge-graceful spectra of the corona
of (p, p + 1)-graphs with K1 , unpublished.
[1911] S. M. Lee, L. Wang, K. Nowak, and W. Wei, On the edge-graceful trees conjecture,
J. Combin. Math. Combin. Comput., 54 (2005) 83-98.

the electronic journal of combinatorics (2023), #DS6 519

[1912] S. M. Lee, L. Wang, and Y. Wen, On the edge-magic cubic graphs and multigraphs,
Congr. Numer., 165 (2003) 145-160.
[1913] S. M. Lee, S. Wang, and I. Wui, On Skolem-gracefulness of 4-stars, Congr. Numer.,
62 (1988) 235-239.
[1914] S. M. Lee and W. Wei, On the super vertex-gracefulness of cartesian products of
graphs, Congr. Numer., 180 (2006) 175-192.
[1915] S. M. Lee, L. Wang, and E. R. Yera, On super edge-graceful Eulerian graphs,
Congr. Numer., 174 (2005) 83-96.
[1916] S. M. Lee, I. Wen, and H. Hugo, On group-magic graphs, J. Combin. Math.
Combin. Comput. 38 (2001) 197-207.
[1917] S. M. Lee and H. Wong, On the integer spectra of the power of paths, J. Combin.
Math. Combin. Comput., 42 (2002) 187-194.
[1918] S. M. Lee and R. Wong, On P (a)Q(1)-super vertex-graceful unicyclic graphs,
Congr. Numer., 173 (2005) 79-96.
[1919] S. M. Lee, Y. S. Wong, and M. K. Kiang, On graceful permutations graphs con-
jecture, Congr. Numer., 103 (1994) 193-201.
[1920] S. M. Lee and I. Wui, On Skolem-gracefulness of 2-stars and 3-stars, Bull.
Malaysian Math. Soc., 10 (1987) 15-20.
[1921] S. M. Lee, I. Wui and J. Yeh, On the amalgamation of prime graphs, Bull.
Malaysian Math. Soc. (Second Series), 11 (1988) 59-67.
[1922] C. E. Leiserson, Area efficient graph layouts for VLSI, in: Proc. 21st Ann. IEEE
Symposium, FOCS, (1980) 270-281.
[1923] C. H. Li, The Antimagic Labeling of Balanced Double Star Union cP3 , Master
Thesis, National Chung Hsing University, Taiwan, 2019.
[1924] P. C. Li, Antimagic labelings of cycle powers, Ars Combin., 124 (2016) 341-351.
[1925] R. Li, The spum and sum-diameter of graphs: labelings of sum graphs,
arXiv:2107.09025, 38 pages.
[1926] T. Li, Z-X. Song, G. Wang, D. Yang, and C-Q. Zhang, Antimagic orientations of
even regular graphs, J. Graph Theory, 90 (2019) 46-53.
[1927] W. Z. Li, G. H. Li, and Q. T. Yan, Study on some labelings on complete bipartite
graphs, Adv. Comput. Sci., Envir., Ecoinforma., and Ed., Comm. Comput. Inf.
Sci., 214 (2011) 297-301.
[1928] W.-T. Li and Y.-S. Wang, Labeling trees of small diameters with consecutive in-
tegers, Taiwanese J. Math. Adv. Pub., (2022) 1-23. https://doi.org/10.11650/
tjm/221103
[1929] X. Li, V. Mak, and S. Zhou, Optimal radio labellings of complete m-ary trees.
Discrete Appl. Math., 158(5) (2010) 507-515.
[1930] H. X. Liang, and C. F. Liu, On k-gracefulness of graphs, Dongbei Shida Xuebao,
33 (1991) 41-44.

the electronic journal of combinatorics (2023), #DS6 520

[1931] Y.-C. Liang, T.-L. Wong, and X. Zhu, Anti-magic labeling of trees, Discrete Math.,
331 (2014) 9-14.
[1932] Y.-C. Liang and X. Zhu, Anti-magic labelling of Cartesian product of graphs,
Theoret. Comput. Sci. 477 (2013) 1-5.
[1933] Y.-C. Liang and X. Zhu, Antimagic labeling of cubic graphs, J. Graph Th., 75
(2014) 31-36.
[1934] Z. Liang, The harmoniousness of book graph St(4k + 1) × P2 , Southeast Asian
Bull. Math., 21 (1997) 181-184.
[1935] Z. Liang, On the gracefulness of the graph Cm ∪ Pn , Ars Combin., 62 (2002)
273-280.
[1936] Z. Liang, On the graceful conjecture of permutation graphs of paths, Ars Combin.,
91 (2009) 65-82.
[1937] Z. Liang, Cycle-supermagic decompositions of complete multipartite graphs, Dis-
crete Math., 312(22) (2012) 3342-3348.
[1938] Z. Liang, On the strongly c-harmoniousness of cycle with some chords, Ars Com-
bin., 109 (2013) 143-160.
[1939] Z. -H. Liang, G-supermagic coverings of graphs, Acta Math. Appl. Sin., 37(5)
(2014) 857-864.
[1940] Z. Liang and Z.-L. Bai, On the odd harmonious graphs with applications, J. Appl.
Math. Comput., (2009) 29 105-116. https://link.springer.com/article/10.
1007/s12190-008-0101-0
[1941] Z. Liang and Y. Miao, On Lee’s conjecture, Util. Math., 87 (2012) 305-329.
[1942] Z. Liang, D. Q. Sun, and R. J. Xu, k-graceful labelings of the wheel graph W2k , J.
Hebei Normal College, 1 (1993) 33-44.
[1943] Z. Liang, H. Zhang, N. Xu, S. Ye, Y. Fan, and H. Ge, Gracefulness of five permu-
tation graphs of paths. Util. Math., 72 (2007) 241-249.
[1944] Z. Liang and H. Zuo, On the gracefulness of the graph P2m,2n ,Appl. Anal. Discrete
Math., 4 (2010) 175-180.
[1945] Q. Liao and and W. Liu, The group vertex magicness of unicyclic graphs and
bicyclic graphs, arXiv:2303.04588.pdf
[1946] S.-C. Liaw, D. Kuo, and G. Chang, Integral sum numbers of graphs, Ars Combin.,
54 (2000) 259-268.
[1947] K. B. Libeeshkumar and V. Anil Kumar, Induced V4 -magic labeling of cycle related
graphs, Malaya J. Mat., 8(2) (2020) 473-477. https://www.malayajournal.org/
articles/MJM08020025.pdf
[1948] K. B. Libeeshkumar and V. Anil Kumar, Induced V4 -magic labeling of some sub-
division graphs, Nonlinear Stud., 28(3) (2021) 761-768.
[1949] K.-W Lih, On magic and consecutive labelings of plane graphs, Util. Math., 24
(1983) 165-197.

the electronic journal of combinatorics (2023), #DS6 521

[1950] N. B. Limaye, k-equitable graphs, k = 2, 3, in Labeling of Discrete Structures and
Applications, Narosa Publishing House, New Delhi, 2008, 117-133.
[1951] C.-M. Lin and T-M. Wang, On zero magic sums of integer magic graphs, Ars
Combin., 118 (2015) 119-134.
[1952] Y. Lin, A. Ahmad, M. Miller, K. Sugeng, and M. Bača, Further results on d-
antimagic labelings of antiprisms, Proceed. 15-th Australasian Workshop Combin.
Alg., (2004) 103-108, Ballina, Australia.
[1953] Y. Lin and M. Miller, Vertex-magic total labelings of complete graphs, Bull. Inst.
Combin. Appl., 33 (2001) 68-76.
[1954] Y. Lin, M. Miller, R. Simanjuntak, and Slamin, Magic and antimagic labelings of
wheels, unpublished.
[1955] Y. Lin, Slamin, M. Bača, and M. Miller, On d-amtimagic labelings of prisms, Ars
Combin., 72 (2004) 65-76.
[1956] Y. Lin and K. Sugeng, Face antimagic labelings of plane graphs pba , Ars Combin.,
80 (2006) 259-273.
[1957] Z. Lingqi, Z. Linna, R. Yuan, The generalized Petersen graph P (n, 3) is (5n +
5/2, 2)-antimagic, Util. Math., 96 (2015) 17-25.
[1958] W. Lestari1, Dafik, Susanto, and A. A. Wahab, On the strong rainbow antimagic
coloring of some special graph, Proceed. 6th Internat. Conf. Comb., Graph Th.,
and Network Topology, (ICCGANT 2022) https://www.atlantis-press.com/
proceedings/iccgant-22/125986152
[1959] Y. Listiana, Darmaji, and Slamin, Vertex magic total lablings on sun di-
graphs, Proceed. Internat. Sem. Math. Edu. Graph Th., Unisma (2014) 583-589.
https://www.researchgate.net/publication/370938854_Proceedings_of_
International_Seminar_on_Mathematics_Education_and_Graph_Theory_-_
Unisma_2014
[1960] A. Litersky, Graceful kayak paddles, M.S. Thesis, University of Minnesota Duluth,
2011.
[1961] B. Liu, Some new results on graceful graphs, Math. Appl., 3 (1990) 108-110.
[1962] B. Liu, Sums of squares and labels of graphs, Math. Practice Theory, (1994) 25-29.
[1963] B. Liu and X. Zhang, On a conjecture of harmonious graphs, Systems Science and
Math. Sciences, 4 (1989) 325-328.
[1964] B. Liu and X. Zhang, On harmonious labelings of graphs, Ars Combin., 36 (1993)
315-326.
[1965] D. Liu, Radio number for trees, Discrete Math., 308 (2008) 1153-1164.
[1966] D. Liu, Multi-level distance labelings for trees, unpublished.
[1967] D. Liu and M. Xie, Radio number for square of cycles, Congr. Numer., 169 (2004)
105-125.

the electronic journal of combinatorics (2023), #DS6 522

[1968] D. Liu and M. Xie, Radio number for square of paths, Ars Combin., 90 (2009)
307-319.
[1969] D. Liu and X. Zhu, Multi-level distance labelings for paths and cycles, SIAM J.
Discrete Math., 19 (2005) 610-621.
[1970] J.-B. Liu, M. K. Aslam, M. Javaid, and A. Raheen, Computing edge-weight bounds
of antimagic labeling on a class of trees, IEEE Access, 4 (2016) 1-11.
[1971] J. B. Liu, T. Zou, Y. Lu, Gracefulness of Cartesian product graphs, Pure Appl.
Math. (Xi’an), 28 (2012)(3) 329-332, 362.
[1972] J. B. Liu, L. Wang, and Y. Lu, Odd graceful labeling and algorithm of bicyclic
graphs with a common edge, J. Hefei Univ. Technol. Nat. Sci., 35(6) (2012) 857-
859.
[1973] R. Y. Liu, On Bodendiek’s conjecture for graceful graphs, Chinese Quart. J. Math.,
4 (1989) 67-73.
[1974] Y. Liu, The gracefulness of the star graph with top sides, J. Sichuan Normal Univ.,
18 (1995) 52-60.
[1975] Y. Liu, Proof of a conjecture concerning gracefulness of graphs, Huaihua Shizhuan
Xuebao, 15 (1996) 13-25.
[1976] Y. Liu, Crowns graphs Q2n are harmonious graphs, Hunan Annals Math., 16 (1996)
125-128.
[1977] Y. Liu, All crowns and helms are harmonious, unpublished.
[1978] Z. S. Liu, A class of graceful graphs and two classes of graceful graphs derived from
it, Neimenggu Daxue Xuebao, 16 (1985) 183-186.
[1979] Q. Liu and Z. Liu, A necessary and sufficient condition for a graph to be E2 -cordial,
Ars Combin., 123 (2015) 159-167.
[1980] Q. Liu, Z. Liu, and H. Wu, On the Ek -cordiality of some graphs, Ars Combin.,
120 (2015) 193-198.
[1981] Z. Liu and B. Zhu, A necessary and sufficient condition for a 3-regular graph to
be cordial, Ars Combin., 84 (2007) 225-230.
[1982] A. Lladó and J. Moragas, Cycle-magic graphs, Discrete Math., 307 (2007) 2925-
2933.
[1983] M.-L. Lo and L. V. Alegria, Radio number for fourth power paths, Involve 9(2)
(2016) 317-332.
[1984] S. Lo, On edge-graceful labelings of graphs, Congr. Numer., 50 (1985) 231-241.
[1985] S. Locke and A. Niedzialomski, Kn P is radio graceful, Matematiche (Catania)
73 (2018) (1) 127-137.
[1986] S. C. López and F. A. Muntaner-Batle, A new application of the ⊗h -product to
α-labelings, Discrete Math., 338 (2015) 839-843.
[1987] S. C. López and F. A. Muntaner-Batle, Langford sequences and a product of
digraphs, European J. Combin., 53 (2016) 86-95.

the electronic journal of combinatorics (2023), #DS6 523

[1988] S. C. López, F. A. Muntaner-Batle, and M. Prabu, A new labeling construction
from the ⊗h -product. Discrete Math., 340(8) (2017) 1903-1909.
[1989] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, Super edge-magic models,
Math. in Comput. Sci., 5 (2011) 63-68.
[1990] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, Enumerating super edge-
magic labelings for some types of pathlike trees, Utilitas Math. to appear. https:
//core.ac.uk/download/pdf/41759896.pdf
[1991] S. C. López, F. A. Muntaner-Batle, M. Rius-Font, Perfect super edge-magic graphs,
Bull. Math. Soc. Sci. Math. Roumanie, 55 (103)(2) (2012) 199-208.
[1992] S. C. López, F. A. Muntaner-Batle, M. Rius-Font, Perfect edge-magic labelings,
Bull. Math. Soc. Sci. Math. Roumanie, 57 (105)(1) (2014) 81-91.
[1993] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, Bi-magic and other gener-
alizations of super edge-magic labeling, Bull. Aust. Math. Soc., 84 (2011) 137-152.
[1994] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font Bi-magic and other gen-
eralizations of super edge-magic labelings, [corrigendum to S. C. López, F. A.
Muntaner-Batle, and M. Rius-Font, Bi-magic and other generalizations of super
edge-magic labeling, Bull. Aust. Math. Soc., 84 (2011) 137-152.]
[1995] S. C. López, F. A. Muntaner-Batle and M. Rius-Font, New problems related to
the valences of (super) edge-magic labelings, AKCE Int. J. Graphs Combin., 10(2)
(2013) 169-181.
[1996] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, On super edge-magic de-
composable graphs, Indian J. Pure Appl. Math. 43(5) (2012) 455-473.
[1997] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, Open problems involving
super edge-magic labelings and related topics, Bull. Inst. Combin. Appl., 65 (2012)
43-56.
[1998] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, A problem on
edge-magic labelings of cycles, Canadian Math. Bull., 57 (2014) 375-380.
doi:10.4153/CMB-2013-036-1
[1999] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, Labeling constructions
using digraph products, Discrete Appl. Math., 161 (2013) 3005-3016.
[2000] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, The jumping knight and
other (super) edge-magic constructions, Mediterr. J. Math., 11(2) (2014) 217-235.
[2001] S. C. López, F. A. Muntaner-Batle, and M. Rius-Font, Magic coverings and the
Kronecker product, Util. Math., 95 (2014) 73-84.
[2002] A. Lourdusamy and F. J. Beaula, Further results on group S3 mean cordial labeling,
Sciencia Acta Xaveriana, 13(1) (2022) 83-94 https://www.researchgate.net/
publication/362325517_Further_results_onGroup_S3_Mean_Cordial
[2003] A. Lourdusamy and S. George, Super vertex mean labeling of cycles through dif-
ferent ways, Proyecciones, 37(2) (2018) 181-198.

the electronic journal of combinatorics (2023), #DS6 524

[2004] A. Lourdusamy and S. George, Super vertex mean graphs of order 6 7, J. Appl.
Math. Inform., 35(5-6) (2017) 565-586.
[2005] A. Lourdusamy and S. George, Linear cyclic snakes as super vertex mean graphs,
Internat. J. Math. Sci. Comput., 1 (2018) 109-126.
[2006] A. Lourdusamy, S. George and M. Seenivasan, An extension of mean labeling,
preprint.
[2007] A. Lourdusamy, J. S. Mary and F. Patrick, Even vertex equitable even label-
ing, Sciencia Acta Xaveriana, 7 (2016) 37-46. https://www.researchgate.
net/profile/Lourdusamy_Arockiam2/publication/303564979_Even_
Vertex_Equitable_Even_Labeling/links/574876d908ae2e0dd30162ed/
Even-Vertex-Equitable-Even-Labeling.pdf
[2008] A. Lourdusamy and F. Patrick, Sum divisor cordial graphs, Proyecciones, 35(1)
(2016) 119-136.
[2009] A. Lourdusamy and F. Patrick, Even vertex equitable even labeling of
path and bistar related graphs, Informa. Sci. Comput., 2016 (2016)
1-9. https://www.researchgate.net/publication/313160627_Even_Vertex_
Equitable_Even_Labeling_of_Path_and_Bistar_Related_Graphs
[2010] A. Lourdusamy and F. Patrick, Vertex equitable labeling for ladder and snake
related graphs, J. Prime Research Math., 13 (2017) 1-7.
[2011] A. Lourdusamy and F. Patrick, New construction on SD-prime cordial labeling,
Theoretical Computer Science and Discrete Mathematics, 134-143, Lecture Notes
in Comput. Sci., 10398, Springer, Cham, 2017.
[2012] A. Lourdusamy and F. Patrick, Some results on SD-prime cordial labeling, Proyec-
ciones, 36(4) (2017) 601-614.
[2013] A. Lourdusamy and F. Patrick, Even vertex equitable even labeling for cycle
related graphs, Kragujevac J. Math. 43(3) (2019) 427-441. https://imi.pmf.kg.
ac.rs/kjm/pdf/accepted-finished/db52db9c7ff1618dd35125495d743075_
2536_07152018_043122/kjm_43_3-7.pdf
[2014] A. Lourdusamy and F. Patrick, Several results on sum divisor cordial graph, Jor-
dan J. Math. Stat., 15(3b) (2022) 643-660. https://journals.yu.edu.jo/jjms/
issues/vol15no32022pdf/16.PDF
[2015] A. Lourdusamy, J. Shobana Mary, and F. Patrick, Even vertex equitable even
labeling for path related graphs, Sciencia Acta Xaveriana, 7(1) (2018) 47-56.
[2016] A. Lourdusamy and M. Seenivasan, Vertex equitable labeling of graphs, J. Discrete
Math. Sci, Crypt., 11 (2008) 727-735.
[2017] A. Lourdusamy and M. Seenivasan, Mean labeling of cyclic snakes, AKCE Int. J.
Graphs Combin., 8 (2011) 105-113.
[2018] A. Lourdusamy and M. Seenivasan, Mean labeling of edge linked cyclic snakes,
AKCE Int. J. Graphs Combin., 10(4) (2013) 391-403.

the electronic journal of combinatorics (2023), #DS6 525

[2019] A. Lourdusamy and M. Seenivasan, Vertex-mean graphs, Internat. J. Math. Com-
bin., 3 (2011) 114-120.
[2020] A. Lourdusamy, M. Seenivasan, S. George and R. Revathy, Super vertex-mean
graphs, Sciencia Acta Xaver., 5(2) (2014) 39-46.
[2021] A. Lourdusamy, S. J. Wency, and F. J. Beaula, SDC labeling on zero divisor graphs,
Sciencia Acta Xaveriana, 12(2) (2021) 11-19. https://www.researchgate.net/
publication/362325187_SDC_Labeling_on_Zero_Divisor_Graphs
[2022] A. Lourdusamy, S. J. Wency, and F. Patrick, On SD-prime cordial labeling, Inter-
nat. J. Pure Appl. Math., (2017) 221-228.
[2023] A. Lourdusamy, S. J. Wency, and F. Patrick, On SD-harmonious labeling, Mapana
J. Sci., 17(3) (2018) 1–15 https://doi.org/10.12723/mjs.46.1
[2024] S. J. Lourdusamy, S. J. Wency, and F. Patrick, Even vertex equi-
table even labeling for snake related graphs, Proyecciones, 38(1) (2019)
177-189. https://scielo.conicyt.cl/scielo.php?script=sci_arttext&pid=
S0716-09172019000100177
[2025] A. Lourdusamy, S. J. Wency, and F. Patrick, Group S3 cordial remainder labeling,
Internat. J. Recent Tech. Engin., 8(4) (2019) 8276–8281.
[2026] A. Lourdusamy, S. J. Wency, and F. Patrick, Group S3 cordial remainder labeling
for subdivision of graphs, J. Appl. Math. Informatics, 38(3-4) (2020) 221–238.
https://koreascience.kr/article/JAKO202016151586225.pdf
[2027] A. Lourdusamy, S. J. Wency, and F. Patrick, Group S3 cordial remainder labeling
for wheel and snake related graphs, Jordan J. Math. Stat., 14(2) (2021) 267–286.
https://journals.yu.edu.jo/jjms/Issues/Vol14No22021PDF/6.pdf
[2028] A. Lourdusamy, S. J. Wency, and F. Patrick, Group S3 cordial remainder labeling
for path and cycle related graphs, J. Appl. Math. Informatics, 39(1-2) (2021)
223–237. https://koreascience.kr/article/JAKO202109950461292.pdf
[2029] A. Lourdusamy, S. J. Wency, and F. Patrick, Some results on group S3 cordial
remainder labeling, Palest. J. Math. 11(2) (2022) 511–520. https://pjm.ppu.
edu/sites/default/files/papers/PJM_May_2022_511_to_520.pdf
[2030] R. M. Low and S. M. Lee, On group-magic Eulerian graphs, J. Combin. Math.
Compin. Comput., 50 (2004) 141-148.
[2031] R. M. Low and S. M. Lee, On integer-magic Eulerian graphs, personal communi-
cation (2006).
[2032] R. M. Low and D. Roberts, Application of the combinatorial nullstellensatz
to integer magic graph labelings, Theory Appl. Graphs, 9(1) (2022) Arti-
cle 3, 14 pages. digitalcommons.georgiasouthern.edu/cgi/viewcontent.cgi?
article=1211&context=tag
[2033] R. M. Low and W. C. Shiu, On the integer-magic spectra of graphs, Congr. Numer.,
191 (2008) 193-203.

the electronic journal of combinatorics (2023), #DS6 526

[2034] R. M. Low and L. Sue, Some new results on the integer-magic spectra of tessellation
graphs, Australas. J. Combin., 38 (2007) 255-266.
[2035] A. Lozano, M. Mora, C. Seara, and J. Tey, Caterpillars are antimagic, Mediterr.
J. Math., 18(39) (2021). doi:10.1007/s00009-020-01688-z
[2036] A. Lozano, M. Mora, and C. Seara, Antimagic labeling of caterpillas,
Appl. Math. Comput., 347 (2017) 734-740. https://upcommons.upc.edu/
bitstream/handle/2117/125781/AMC-D-18-01012R1-Antimagic+Labelings+
of+Caterpillars-Nov-2018.pdf
[2037] A. Lozano, M. Mora, C. Seara, and J. Tey, Trees whose even-degree vertices induce
a path are antimagic, arXiv:1905.06595 [math.CO] 7pp.
[2038] H.-C. Lu, On the constructions of sequential graphs, Taiwanese J. Math., 10 (2006)
1095-1107.
[2039] H.-C. Lu, On large harmonious graph, Ars Combin., 91 (2009) 447-458.
W
[2040] X. Lu and X. F. Li, P1 Tm graphs and a certification of its gracefulness,
Gongcheng Shuxue Xuebao, 13 (1996) 109-113.
[2041] X. Lu, W. Pan, and X. Li, k-gracefulness and arithmetic of graph St(m) ∪ Kp,q , J.
Jilin Univ., 42 (2004) 333-336.
[2042] K. J. Ma and C. J. Feng, About the Bodendiek’s conjecture of graceful graph, J.
Math. Research and Exposition, 4 (1984) 15-18.
[2043] K. J. Ma and C. J. Feng, On the gracefulness of gear graphs, Math. Practice
Theory, (1984) 72-73.
[2044] X. D. Ma, Some classes of graceful graphs, J. Xinjiang Univ. Nat. Sci., 3 (1986)
106-107.
[2045] X. Ma, A graceful numbering of a class of graphs, J. Math. Res. and Exposition,
(1988) 215-216.
[2046] X. Ma, Y. Liu, and W. Liu, Graceful graphs: cycles with (t − 1) chords, Math.
Appl., 9 (1990), suppl., 6-8.
[2047] J. A. MacDougall, M. Miller, Slamin, and W. D. Wallis, Vertex-magic total label-
ings of graphs, Util. Math., 61 (2002) 3-21.
[2048] J. A. MacDougall, M. Miller, and K. Sugeng, Super vertex-magic total labelings
of graphs, Proceedings Australasian Workshop Combin. Algorithm 2004, Balina,
NSW (2004) 222-229.
[2049] J. A. MacDougall, M. Miller, and W. D. Wallis, Vertex-magic total labelings of
wheels and related graphs, Util. Math., 62 (2002) 175-183.
[2050] J. A. MacDougall and W. D. Wallis, Strong edge-magic labeling of a cycle with a
chord, Australas. J. Combin., 28 (2003) 245-255.
[2051] J. A. MacDougall and W. D. Wallis, Strong edge-magic graphs of maximum size,
Discrete Math., 308 (2008) 2756-2763.

the electronic journal of combinatorics (2023), #DS6 527

[2052] K. Mahalingam and H. P. Rajendran, m-Bonacci graceful labeling, AKCE Int. J.
Graphs Comb, 18(1) (2021) 7-15. https://www.tandfonline.com/doi/epub/10.
1080/09728600.2021.1876505?needAccess=true
[2053] M. Maheo, Strongly graceful graphs, Discrete Math.,29 (1980) 39-46. https://
core.ac.uk/download/pdf/82643761.pdf
[2054] M. Maheo and H. Thuillier, On d-graceful graphs, Ars Combin., 13 (1982) 181-192.
[2055] A. U. Maheswari, S. Azhagarasi, and B. Samuvel, Some labelings on cycle with
parallel P4 chord, Turkish J. Comput. Math. Edu., 12(10) (2021) 5500-5508.
https://turcomat.org/index.php/turkbilmat/article/view/5355
[2056] A. U. Maheswari, S. Azhagarasi, and J. B. Samuvel, Square sum label-
ings on new families of cycle (Cn ) with parallel P3 chords, Stochastic
Modeling Appl., 26(3) Special Issue 2022 Part - 4) 432-440, Special Is-
sue on Recent Research on Management, Applied Sciences and Technol-
ogy. https://www.researchgate.net/publication/361101964_SQUARE_SUM_
LABELING_ON_NEW_FAMILIES_OF_CYCLE_Cn_WITH_PARALLEL_CHORDS
[2057] G. U. Maheswari, M. J. Jebarani and V. Balaji, Coding techniques through
Fibonacci webs, difference cordial labeling and GMJ code method, J. Physics,
Conf Series 1139 (2018) 012077 https://iopscience.iop.org/article/10.
1088/1742-6596/1139/1/012077/pdf
[2058] A. U. Maheswari and P. Jeyanthi, Odd vertex equitable even labeling
of duplication and product graphs, Internat. J. Math. Combin., 1 (2022)
56-64. https://www.researchgate.net/publication/315703517_Odd_vertex_
equitable_even_labeling_of_graphs
[2059] A. U. Maheswari and V. Srividya, New families of square sum graphs, J. Comput.
Math. Sci., 10(4) (2019) 907-914.
[2060] A. U. Maheswari and V. Srividya, Some labelings on cycles with parallel P3
chords, JASC: J. Appl. Sci. Comput., VI (I) (2019) 469-475. https://pdfs.
semanticscholar.org/f1f2/bc5bc33c50a47e0c3bea04d6957c6536cf96.pdf?
_ga=2.208011094.537058225.1571009368-2077171013.1571009368
[2061] G. Uma Maheswari, G. M. J. Jebarani and V. Balaji, On coding through
a two star and super mean labeling, Springer - Applied Mathemat-
ics and Scientific Computing, 2 2017). Trends in Mathematics, 469-478.
doi:10.1007/978-3-030-01123-9 46
[2062] V. Maheswari, D. S. T. Ramesh, and V. Balaji, Relaxed mean labeling, Internat.
J. of Math. Res., 4(3) (2012) 217-224.
[2063] V. Maheshwari, L. Vinothkumar and V. Balaji, Further results on mean cordial la-
beling for three star graph, Proc. Jangjeon Math. Soc., 23 2 (2020) 241-251. https:
//jangjeonopen.or.kr/public/upload/1589423526-pjms23-2-11-fin.pdf

the electronic journal of combinatorics (2023), #DS6 528

[2064] G. U. Maheswari, P. Hariprabakaran, and V. Balaji, Coding techique with two
and three stars, SSM L(V4 , S2 ) and GMJ code, J. Xi’an Shiyou Univee., Natural
Science Ed., 16(11) 31-37. https://www.xisdxjxsu.asia/V16I11-8.pdf
[2065] A. Mahmoody, A note on graceful graphs with large chromatic numbers, Ars Com-
bin., 90 (2009) 423-424.
[2066] H. Mahmoudzadeh and K. Eshghi, Metaheuristic approach to the graceful labeling
problem, Int. J. Appl. Metaheuristic Comput., IJAMC 1 (2010) 42-57.
[2067] H. Mahmoudzadeh and K. Eshghi, A metaheuristic approach to the grace-
ful labeling problem, Modeling, Analysis, and Applications in Metaheuristic
Computing: Advancements and Trends. IGI Global, 2012, (2014) 217-232.
doi:10.4018/978-1-4666-0270-0.ch013
[2068] P. Majerski and J. Przybylo, Total vertex irregularity strength of dense graphs, J.
Graph Th., 76(1) (2014) 34-41.
[2069] P. Majerski and J. Przybyo, On the irregularity strength of dense graphs, SIAM
J. Discrete Math., 28(1) (2014) 1, 197-205.
[2070] H. M. Makadia, H. M. Karavadiya, and V. J. Kaneria, Some results on α-graceful
graphs, Internat. J. of Math. Combin., to appear.
[2071] H. M. Makadia, H. M. Karavadiya, and V. J. Kaneria, Graceful centers of graceful
graphs and universal graceful graphs, Proyecciones J. Math., 38 (2019)(2) 305-314.
[2072] K. Manickam and M. Marudai, Odd mean labelings of graphs, Bull. Pure Appl.
Sci., 25E 1 (2006) 149-153.
[2073] K. Manickam and M. Marudai, Edge magic labeling of graphs Util. Math., 79
(2009) 181-187.
[2074] K. Manickam, M. Marudai, and R. Kala, Some results on felicitous labeling of
graphs, J. Combin. Math. Combin. Comput., 81 (2012) 273-279.
[2075] F. A. Manico and A. C. Pedrano, On vertex balance index set of some snake
graphs, Adv. Appl. Discrete Math., 28(2) ( 2021) 253-265. http://dx.doi.org/
10.17654/DM028020253
[2076] A. Manshath, P. Hariprabakaran, M. Veerasamy, and V. Balaji, GMJ coding using
even felicitous labeling and bistar graphs, July 2021 Journal of Physics Conference
Series 1964(2):022004. doi:10.1088/1742-6596/1964/2/022004
[2077] J. M. Manulang and K. A. Sugeng, Graceful labeling on torch graph, Indon. J.
Combin., 2(1) (2018) 14-19.
[2078] H. T. Marbun and A. N. M. Salman, Wheel-supermagic labelings for a wheel k-
multilevel corona with a cycle, AKCE Int. J. Graphs Comb., 10(2 )(2013) 183-191.
[2079] G. T. Marimuthu and M. Balakrishnan, E-super vertex magic labelings of graphs,
Discrete Appl. Math., 160(12) (2012) 1766-1774.
[2080] G. Marimuthu and M. Balakrishnan, Super edge magic graceful graphs, Informa-
tion Sciences, 287(10) (2014) 140-151.

the electronic journal of combinatorics (2023), #DS6 529

[2081] G. Marimuthu, S. Kavitha, and M. Balakrishnan, Super edge magic graceful label-
ing of generalized Petersen graphs, The Eighth International Workshop on Graph
Labelings (IWOGL 2014), Electron. Notes Discrete Math., 48 (2015) 235-241.
http://dx.doi.org/10.1016/j.endm.2015.05.035
[2082] G. Marimuthu and P. Krishnaveni, Super edge-antimagic gracefulness of discon-
nected graphs, Theoretical Comput. Sci. Disc. Math., 152-155, Lecture Notes in
Comput. Sci., 10398, Springer, Cham, 2017.
[2083] G. Marimuthu and G. Kumar, On consecutive magic graphs, Elect. Notes Discr.
Math., 48 (2015) 213-215. http://dx.doi.org/10.1016/j.endm.2015.05.031
[2084] G. T. Marimuthu and G. Kumar, Solution to some open problems on E-super
vertex magic labeling of disconnected graphs, Appl. Math. Comput., 268 (2015)
657-663.
[2085] G. Marimuthu, B. Suganya, S. Kalaivani, and M. Balakrishnan, E-super vertex
magic labelling of graphs and some open problems, Appl. Appl. Math.,10(1) (2015)
536-543. https://www.pvamu.edu/sites/mathematics/journal/aam/2015/
vol-10-issue-1/31_r722-marimuthu-vol.-10-issue-1-posted-06-20-15.
pdf
[2086] G. Marimuthu and G. Kumar, V -super and E-super vertex-magic total labelings of
graphs, The Eighth International Workshop on Graph Labelings (IWOGL 2014),
Electron. Notes Discrete Math., 48 (2015) 223-230. http://dx.doi.org/10.1016/
j.endm.2015.05.033
[2087] G. Marimuthu and G. Kumar, On consecutive magic graphs, Elect. Notes Discr.
Math., 48 (2015) 213-215. http://dx.doi.org/10.1016/j.endm.2015.05.031
[2088] G. Marimuthu and S. S. Kumar, H-V -super magic decomposition of complete
bipartite graphs, The Eighth International Workshop on Graph Labelings (IWOGL
2014), Electron. Notes Discrete Math., 48 (2015) 231-233. http://dx.doi.org/
10.1016/j.endm.2015.05.034
[2089] G. T. Marimuthu, M. S. Raja Durga, and G. Durga Devi, Solution to some open
problems on E-super vertex magic total labeling of graphs, Appl. Appl. Math.,
10(2) (2015) 1104-1112.
[2090] G. T. Marimuthu, M. S. Raja Durga, and G. Durga Devi, V -Super vertex in-
antimagic total labelings of digraphs, J. Graph Labeling, 1(1) (2015) 21-30.
[2091] R. Marinescu-Ghemeci, Radio number for some thron graphs, Discuss. Math.
Graph Theory, 30 (2010) 210-222.
[2092] T. S. Martini, M. Roswitha, and D. A. Lestari, Cycle-supermagic covering on grid
graph and K1 + K2 . Proceed. 3rd Internat. Sympos. Current Prog. Math. Sci. 2017
(ISCPMS2017) AIP Conf. Proc., (2023) 020197-1–020197-4; https://doi.org/
10.1063/1.5064194
[2093] A. M. Marr, Labelings of Directed Graphs, Ph.D. thesis, Southern Illinois Univer-
sity at Carbondale, 2007, 63 pages.

the electronic journal of combinatorics (2023), #DS6 530

[2094] A. M. Marr, Graceful labelings of directed graphs, J. Combin. Math. Combin.
Comput., 66 (2008) 97-103.
[2095] A. M. Marr, N. C. K. Phillips, and W. D. Wallis, Bimagic labelings, AKCE J.
Graphs Combin., 6 (2009) 155-160.
[2096] A. M. Marr, S. Ochel, and B. Perez, In-magic total labelings of digraphs, J. Graph
Labeling, 1(2) (2015) 81-93.
[2097] P. Martinez, J. Ortiz, M. Tomova, and C. Wyels, Radio numbers for generalized
prism graphs, Discuss. Math. Graph Theory 31 (2011) 45-62. arXiv:1007.5346v1
[math.CO].
[2098] A. Marr and R. Simanjuntak, D-Magic oriented graphs, Symmetry 13 (2021) 2261
1-9. www.mdpi.com/2073-8994/13/12/2261
[2099] V. L. Stella Arputha Mary, S. Navaneetha Krishnan, and A. Nagarajan, Z4p -magic
labeling for some special graphs, Internat. Math. Soft Comput., 3(3)(2013) 61-70.
https://oaji.net/articles/2017/296-1504259768.pdf
[2100] T. K. Maryati, E. T. Baskoro, and A. N. M. Salman, Ph -(super) magic labelings
of some trees, J. Combin. Math. Combin. Comput., 65 (2008) 197-204.
[2101] T. K. Maryati, E. T. Baskoro, A. N. M. Salman, and Irawati, On the path-
(super)magicness of a cycle with some pendants, Util. Math., 96 (2015) 319-330.
[2102] T. K. Maryati, A. N. M. Salman, and E. T. Baskoro, Supermagic coverings of
the disjoint union of graphs and amalgamations, Discrete Math., 313(4) (2013)
397-405.
[2103] T. K. Maryati, A. N. M. Salman, and E. T. Baskoro, and Irawati, The supermag-
icness of a disjoint union of isomorphic connected graphs, Proceed. 4th IMT-GT
Internat. Conf. Math. Stat. Appl., 3 (2008) 1-5.
[2104] T. Maryati, A. N. M. Salman, E. T. Baskoro, J. Ryan, M. Miller, On H-supermagic
labelings for certain shackles and amalgamations of a connected graph, Util. Math.,
83 (2010) 333-342.
[2105] M. Matamala and J. Zamora, Graphs admitting antimagic labeling for arbitrary
sets of positive integers, LAGOS’17—IX Latin and American Algorithms, Graphs
and Optimization, Electron. Notes Discrete Math., 62 (2017) 159-164.
[2106] M. Matamala and J. Zamora, Weighted antimagic labeling, Discrete Appl. Math.,
245 (2018) 194-201.
[2107] M. Matamala and J. Zamora, Graphs admitting antimagic labeling for arbitrary
sets of positive numbers, Discrete Appl. Math., 281 (2020) 246-251.
[2108] V. L. Stella Arputha Mary, S. Navaneetha Krishnan, and A. Nagarajan, Z4p -magic
labeling for some special graphs, Internat. Math. Soft Comput., 3(3) (2013) 61-70.
https://oaji.net/articles/2017/296-1504259768.pdf
[2109] C. C. Marzuki, A. N. M. Salman, and M. Miller, On the total irregularity strength
of cycles and paths, Far East J. Math. Sci., (to appear).

the electronic journal of combinatorics (2023), #DS6 531

[2110] M. Mavronicolas and L. Michael, A substitution theorem for graceful trees and its
applications Discrete Math., 309 (2009) 3757-3766.
[2111] O. Mbianda, Properly Even Harmonious Graphs, M. S. Thesis, University of Min-
nesota Duluth, 2016.
[2112] D. McQuillan, A technique for constructing magic labelings of 2-regular graphs, J.
Combin. Math. Combin. Comput., 75 (2010) 129-135.
[2113] D. McQuillan, Edge-magic and vertex-magic total labelings of certain cycles, Ars
Combin., 90 (2009) 257-266.
[2114] D. McQuillan and J. McQuillan, Magic labelings of triangles, Discrete Math., 309
(2009) 2755-2762.
[2115] D. McQuillan and J. McQuillan, Strong vertex-magic and edge-magic labelings of
2-regular graphs of odd order using Kotzig completion, Discrete Math., 341(1)
(2018) 194-202.
[2116] D. McQuillan and K. Smith, Vertex-magic total labeling of odd complete graphs,
Discrete Math., 305 (2005) 240-249.
[2117] D. McQuillan and K. Smith, Vertex-magic total labeling of multiple complete
graphs, Congr. Numer., 180 (2006) 201-205.
[2118] J. McSorley and W. Wallis, On the spectra of totally magic labelings, Bull. Inst.
Combin. Appl., 37 (2003) 58-62.
[2119] J. McSorley and J. Trono, On k-minimum and m-minimum edge-magic injections
of graphs, Discrete Math., 310 (2010) 56-69.
[2120] K. McTavish, personal communication (circa 1990).
[2121] A. Meena Kumari and S. Arockiaraj, On (1,1,0)-F-face magic mean labeling of
some graphs, Utilitas Math., 103 (2017) 139-159.
[2122] A. Meena Kumari and S. Arockiaraj, On (1,0,0)-F-face magic mean labeling
of some graphs, J. Physics: Conference Series, 1139 (2018) 7 pp. https:
//iopscience.iop.org/article/10.1088/1742-6596/1139/1/012049/pdf
[2123] A. Meena Kumari and S. Arockiaraj, Further results on F-face magic mean graphs,
Songklanakarin J. Sci. Tech., 42(6) (2020) 1397-1406. https://sjst.psu.ac.th/
article.php?art=2293
[2124] S. Meena and J. Naveen, Some results on prime labeling of graphs, Internat. J.
Math. Comput. Res., 2(9) (2014) 606-618.
[2125] S. Meena and G. Gajalakshmi, Odd prime labeling of graphs related to cir-
cular ladder, Comm. Math. Appl., 13(4) (2022) 1307-1315. https://www.
rgnpublications.com/journals/index.php/cma/article/view/2173/1484
[2126] S. Meena and M. Sivasakthi, Harmonic mean labeling Of subdivision graphs,
IJRAR- Internat. J. Res. Analytical Reviews, 6(1) (2019) 196-204. http://ijrar.
com/upload_issue/ijrar_issue_20542941.pdf

the electronic journal of combinatorics (2023), #DS6 532

[2127] S. Meena and S. Usharani, Product cordial labelling for some bicyclic graphs,
Commun. Math. Appl., 13(4) (2022) 1329-1336. doi:10.26713/cma.v13i4.2171
[2128] S. Meena and K. Vaithilingam, Prime labeling of friendship graphs, Internat. J.
Engin. Res. Tech., (IJERT) 1(10) (2012).
[2129] D. E. W. Meganingtyas, Dafik, and Slamin, Super (a, d)-vertex antimagic total la-
belings on directed cycles, Proceed. Internat. Sem. Math. Edu. Graph Th., Unisma
(2014) 509-515. https://www.researchgate.net/publication/370938854_
Proceedings_of_International_Seminar_on_Mathematics_Education_and_
Graph_Theory_-_Unisma_2014
[2130] S. Mehra and Puneet, 2017, Topological integer additive set-labeling of signed
graphs, Int. J. Recent Sci. Res. 8(12) (2017) 22423-22427.
[2131] A. Meissner and K. Zwierzyński, Vertex-magic total labeling of a graph by
distributed constraint solving in the Mozart System, in Parallel Processing
and Applied Mathematics, Lecture Notes in Computer Science, 3911 Springer
Berlin/Heidelberg, 2006.
[2132] L. S. Melnikov and A. V. Pyatkin, Regular integral sum graphs, Discrete Math.,
252 (2002) 237-245.
[2133] E. Mendelsohn and N. Shalaby, Skolem labelled graphs, Discrete Math., 97 (1991)
301-317.
[2134] E. Mendelsohn and N. Shalaby, On Skolem labelling of windmills, Ars Combin.,
53 (1999) 161-172.
[2135] Y. Miao and Z. Liang, On the strongly c-harmoniousness cycle with P2 or P3 chord,
Ars Combin., 102 (2011) 101-128.
[2136] G. Michael and M. Z. Youssef, On prime self-complementary graphs, J. Disc. Math.
Sci. and Cryptography, 17(3) (2014) 239-256.
[2137] S. Miklavic and P. Sparl, On distance magic labelings of Hamming graphs and
folded hypercubes, Discuss. Math. Graph Th., (2021) 1-17, to appear. https:
//sciendo.com/de/article/10.7151/dmgt.2430
[2138] M. Miller, Open problems in graph theory: labelings and extremal graphs, personal
communication (2008).
[2139] M. Miller and M. Bača: Antimagic valuations of generalized Petersen graphs,
Australas. J. Combin., 22 (2000) 135-139.
[2140] M. Miller, M. Bača, and Y. Lin: On two conjectures concerning (a, d)-antimagic
labelings of antiprisms, J. Combin. Math. Combin. Comput., 37 (2001) 251-254.
[2141] M. Miller, M. Bača, and J. A. MacDougall: Vertex-magic total labeling of general-
ized Petersen graphs and convex polytopes, J. Combin. Math. Combin. Comput.,
59 (2006) 89-99.
[2142] M. Miller, D. Patel, J. Ryan, K. Sugeng, Slamin, and M. Tuga, Exclusive sum
labeling of graphs, J. Combin. Math. Combin. Comput., 55 (2005) 149-158.

the electronic journal of combinatorics (2023), #DS6 533

[2143] M. Miller, O. Phanalasy, J. Ryan, All graphs have antimagic total labelings, Elec-
tronic Notes Disc. Math., 38(1) (2011) 645-650.
[2144] M. Miller, O. Phanalasy, J. Ryan, and L. Rylands, Antimagicness of some families
of generalized graphs, Australas. J. Combin., 53 (2012) 179-190.
[2145] M. Miller, O Phanalasy, J. Ryan, and L. Rylands, A note on antimagic labelings
of trees, Bull. Inst. Combin. Appl., 72 (2014) 94-100.
[2146] M. Miller, O. Phanalasy, J. Ryan, and L. Rylands, Sparse graphs with vertex
antimagic edge labelings, AKCE Int. J. Graphs Comb., 10(2 (2013) 193-198.
[2147] M. Miller, J. Ryan, K. Sugeng, Slamin, and M. Tuga, Exclusive sum labeling of
graphs, J. Combin. Math. Combin. Comput., 55 (2005) 137-148.
[2148] M. Miller, C. Rodger, and R. Simanjuntak, Distance magic labelings of graphs,
Australas. J. Combin., 28 (2003) 305-315.
[2149] M. Miller, J. Ryan, and Slamin, Integral sum numbers of cocktail party graphs and
symmetric complete bipartite graphs, Bull. Inst. Combin. Appl., 25 (1999) 23-28.
[2150] M. Miller, J. Ryan, Slamin, and W. Smyth, Labelling wheels for the minimum sum
number, J. Combin. Math. Combin. Comput., 28 (1998) 289-297.
[2151] M. Miller, J. Ryan, Slamin, K. Sugeug, and M. Tuga, Open problems in exclusive
sum graph labeling, preprint.
[2152] M. Miller, J. Ryan, and W. Smyth, The sum number of the cocktail party graph,
Bull. Inst. Combin. Appl., 22 (1998) 79-90.
[2153] K. G. Mirajkar and P. G. Sthavarmath, Edge-odd gracefulness of lict and litact
graphs for few types of graphs, AIP Confer. Proceed., 2385, 130039 (2022) https:
//www.researchgate.net/publication/357648727_Edge-odd_gracefulness_
of_lict_and_litact_graphs_for_few_types_of_graphs_Edge-Odd_
Gracefulness_of_Lict_and_Litact_Graphs_for_Few_Types_of_graphs
[2154] K. G. Mirajkar and P. G. Sthavarmath, Square sum and square difference
labelings of semitotal-block graph for some class of graphs, Ratio Mathematica,
to appear. https://www.researchgate.net/publication/367016888_Square_
sum_and_square_difference_labelings_of_semitotal-block_graph_for_
some_class_of_graphs
[2155] K. G. Mirajkar and P. G. Sthavarmath, Square product labeling for few
types of cactus graphs, J. Pharmaceutical Negative Results, 13(10) Spe-
cial Issue (2022) 2735-2743. https://www.pnrjournal.com/index.php/home/
article/view/9193/12812
[2156] K. G. Mirajkar and P. G. Sthavarmath, On square product labeling, South East
Asian J. Math. Math. Sci., to appear.
[2157] D. Mishra and S. Bhattacharjee, Some new classes of lobsters exhibiting graceful
labeling, Global J. Pure Appl. Math., 11(2) (2015) 909-930.
[2158] D. Mishra and A. C. Panda, Some new graceful generalized classes of lobsters,
Internat. J. Pure Appl. Math., (IJPAM, 91(1) (2014) 57-76.

the electronic journal of combinatorics (2023), #DS6 534

[2159] D. Mishra, A. C. Panda, and S. Bhattacharjee, Some new classes of grace-
ful lobsters, Internat. J. Scientific Res. Math. Stat. Sci., textbf8(6) (2021)
30-39. https://www.isroset.org/pdf_paper_view.php?paper_id=2649&
5-ISROSET-IJSRMSS-07036.pdf
[2160] D. Mishra, A. C. Panda, and R. B. Dash, A class of graceful lobsters with even
number of branches incident on the central path, Internat. J. Math. Sci. Appl.,
1(2) (2011) 463-472. http://ijmsa.yolasite.com/resources/5-may.pdf
[2161] D. Mishra, S. K. Rout, and P. C. Nayak, Some new graceful lobsters with
pendant vertices with central paths, Indian J. Sci. Tech., 10(6) (2017) 1-9..
doi:10.17485/ijst/2017/v10i6/86164
[2162] D. Mishra and A. C. Panda, Some new family of graceful lobsters, Adv. Appl.
Discrete Math., 14 (2014)(1) 1-24.
[2163] D. Mishra and A. C. Panda, A Class of diameter six graceful trees, J. Advances
Math., 9(5) (2014) 2677- 2686.
[2164] D. Mishra and A. C. Panda, A class of diameter six trees with
graceful labelings, Inter. J. Math. Trends Tech., 9(1) (2014) 1-11.
doi:10.14445/22315373/IJMTT-V9P508
[2165] D. Mishra and A. C. Panda, A family of graceful diameter six trees generated
by component moving techniques, British J. Math. Comput. Sci., 21(1) Article
no.BJMCS.3107, (2017) 1-15.
[2166] D. Mishra and P. Panigrahi, Graceful lobsters obtained by component moving of
diameter four trees, Comput. Math. Appl., 50 (2005) 367-380.
[2167] D. Mishra and P. Panigrahi, Some graceful lobsters with all three types of branches
incident on the vertices of the central path, Comput. Math. Appl. 56 (2008) 1382-
1394.
[2168] D. Mishra and P. Panigrahi, Some new classes of graceful lobsters obtained from
diameter four trees, Math. Bohem., 135 (2010) 257-278.
[2169] J. Mitchem and A. Simoson, On edge-graceful and super-edge-graceful graphs, Ars
Combin., 37 (1994) 97-111.
[2170] S. Mitra and S. Bhoumik, Graceful labeling of triangular extension of complete
bipartite graph, Electron. J. Graph Theory Appl. (EJGTA), 7(1) (2019) 11-30.
[2171] M. V. Modha and K. K. Kanani, Some new families of 5-cordial graphs, Internat.
J. Math. and Soft Computing, 5(1) (2015) 129-141.
[2172] M. V. Modha and K. K. Kanani, k-cordial labeling of fan and double fan, Internat.
J. Applied Math. Res., 4(2) (2015) 362-369.
[2173] M. V. Modha and K. K. Kanani, Some wheel related 7-cordial graphs, Internat.
J. Emerging Tech. Appl. Eng., Tech., Sci., 9 (2016) 71-78.
[2174] M. V. Modha and K. K. Kanani, k-cordiality of wheel, path related and cycle
related graphs, Internat. J. Math. Sci. Comput., 5(2) (2015) 79-82.

the electronic journal of combinatorics (2023), #DS6 535

[2175] M. V. Modha and K. K. Kanani, k-cordiality wheel, path related and cycle related
graphs, Internat. J. Math. Sci. Comput., 5(2) (2015) 70-82.
[2176] M. V. Modha and K. K. Kanani, On k-cordial labeling of some graphs, British J.
Math. Comput Sci., 13(3) (2016) 1-7.
[2177] M. V. Modha and K. K. Kanani, k-cordial labeling of some prisms, Internat. J.
Math. Trends and Tech. (IJMTT), 35(3) (2016) 174-176.
[2178] M. V. Modha and K. K. Kanani, 5-cordiality of some path, cycle and wheel related
graphs, 9th National Level Science Symposium. February 14, 2016, Organized by
Christ College, Rajkot, Sponsored by GUJCOST, Gandhinagar, Mathematics &
Statistics, 3 (2016) 183-187.
[2179] V. Mohan and A. Sugumaran, Some new divisor cordial graphs, J. Emerg-
ing Tech. and Innovative Res., 5(8)(2018) 229-238. https://ijmttjournal.org/
Volume-12/number-2/IJMTT-V12P513.pdf
[2180] V. Mohan and A. Sugumaran, Difference cordial labeling of some graphs related
to square graph, J. Emerging Tech. and Innovative Res., 5(11)(2018) 589-594.
[2181] V. Mohan and A. Sugumaran, Difference cordial labeling for plus and hanging
pyramid graphs, Internat. J. Res. Analytical Reviews, 6(1)(2019) 1106-1114.
[2182] M. Mohana priya and S. M. Santhiya, Lucky edge labeling for some graphs, The
Internat. J Analytical Experimental Modal Analysis, XII(IX) (2020) 1224-1231.
http://www.ijaema.com/gallery/146-ijaema-september-4595.pdf
[2183] M. Mollard and C. Payan, Elegant labelings and edge-colorings: A proof of two
conjectures of Hartman, and Chang, Hsu, Rogers, Ars Combin., 36 (1993) 97-106.
[2184] M. Mollard, C. Payan, and S. Shixin, Graceful problems, Seventh Hungarian Col-
loquium on Finite and Infinite Combinatorics, Budapest July 1987.
[2185] K. M. Mominul Haque, X. Lin, Y. Yang, and J. Zhang, Prime cordial labeling of
flower snark and related graphs, Ars Combin., 105 (2012) 45-52.
[2186] K. Monika and K. Murugan, Odd-even sum labeling in the context of duplication
of graph elements, Mapana J. of Sci., 17(3) (2018) 17-28. https://doi.org/10.
12723/mjs.46.2
[2187] R. Montgomery, A. Pokrovskiy, and B. Sudakov, Embedding rainbow trees with
applications to graph labelling and decomposition, arXiv:1803.03316. 22 pages
[2188] R. Montgomery, A. Pokrovskiy and B. Sudakov, A proof of Ringel’s conjecture,
Geom. Funct. Anal., 31 (2021) 663-720. arXiv:2001.02665 37 pages. https://
doi.org/10.1007/s00039-021-00576-2
[2189] D. Morgan, All lobsters with perfect matchings are graceful, Electron. Notes Dis-
crete Math., 11 (2002) 6 pp.
[2190] D. Morgan, Gracefully labeled trees from Skolem sequences, Congr. Numer., 142
(2000) 41-48.
[2191] D. Morgan and R. Rees, Using Skolem and Hooked-Skolem sequences to generate
graceful trees, J. Combin. Math. Combin. Comput., 44 (2003) 47-63.

the electronic journal of combinatorics (2023), #DS6 536

[2192] M. Morris-Rivera, M. Tomova, C. Wyels, A. Yeager, The radio number of Cn Cn ,
Ars Combin., 120 (2015) 7-21.
[2193] M. O. Bani Mostafa A. and E. Ghorbani, Hamiltonicity of a coprime graph, Graphs
Combin., 37 (2021) 2387-2395. arXiv:2005.06308.pdf
[2194] H. Mukherjee and R. Pawar, Congruence distance magic graphs, https://arxiv.
org/pdf/2302.05652.pdf
[2195] M. I. Moussa and E. M. Badr, Odd graceful labelings of crown graphs, 1st Internat.
Conf. Comp. Sci. Algor. Appl., 2009 1-5 Cairo, Egypt.
[2196] M. I. Moussa, Some simple algorithms for some odd graceful labeling graphs, Pro-
ceed. 9th WSEAS Internat. Conf. Applied Informatics and Communications (AIC
’09) August, 2009, Moscow, Russia.
[2197] M. I. Moussa, An algorithm for odd graceful labeling of the union of paths and
cycles, Internat. J. Appl. Graph Theory in Wireless ad hoc Networks (Graph Hoc),
2(1) (2010) 112-119.
[2198] M. I. Moussa, An algorithm for odd gracefulness of the tensor product of two line
graphs, Inter. J. Applications of Graph Theory in Wireless ad hoc Networks and
Sensor Networks (GRAPH-HOC), 3 (2011).
[2199] M. I. Moussa and E. M. Badr, Ladder and subdivision of ladder graphs with
pendant edges are odd graceful, Internat. J. Appl. Graph Theory Wireless
Ad hoc Networks and Sensor Networks, (GRAPH-HOC) textbf8(1) (2016) 1-8.
arXiv:1604.02347.pdf
[2200] D. Moulton, Graceful labelings of triangular snakes, Ars Combin., 28 (1989) 3-13.
[2201] A. Mughal and N. Jamil, Total face irregularity strength of grid and
wheel graph under k-labeling of type (1, 1, 0), J. Math., (2021) Art. ID
1311269, 16 pp. https://www.hindawi.com/journals/jmath/2021/1311269/
#conflicts-of-interest
[2202] J. Mülbacher, Magische Quadrate und ihre Verallgemeinerung: ein graphen-
theoretisches Problem in: Graphs, Data Structures, Algorithms, Hensen Verlag,
München, 1979.
[2203] K. Mumtaz, P. John, and D. R. Silaban, The odd harmonious labeling of matting
graph, J. Phys.: Conf. Ser., 1722 012050 (2021) 1-5. https://iopscience.iop.
org/article/10.1088/1742-6596/1722/1/012050/pdf
[2204] K. Mumtaz and D. R. Silaban, The odd harmonious labelling of n hair-kC4 -snake
graph, 2021 J. Phys.: Conf. Ser., 1725 012089. https://ojs3.unpatti.ac.id/
index.php/barekeng/article/view/5091/5129
[2205] A. Munia, J. Maowa, S. Tania, M. Kaykobad, A new class of graceful tree, Internat.
J. Eng. Sci. and Res., 5 (2014) 1112-1115.
[2206] F. A. Muntaner-Batle, Special super edge-magic labelings of bipartite graphs, J.
Combin. Math. Combin. Comput., 39 (2001) 107-120.

the electronic journal of combinatorics (2023), #DS6 537

[2207] B. J. Murali, K. Thirusangu, and B. J. Balamurugan, Zumkeller cordial labeling
of cyclie related graphs, Internat. J. Pure Appl. Math., 116(3) (2017) 617-627.
https://www.ijpam.eu/contents/2017-116-3/7/7.pdf
[2208] B. J. Murali, K. Thirusangu, R. Madura Meenakshi, Biconditional cordial labeling
of cycles, Internat. J. Appl. Eng. Res. (IJAER), 10(80) (2015) 188-191.
[2209] B. J. Murali, K. Thirusangu, R. M. Meenakshi, Zumkeller cordial labeling of
graphs, Adv. Intelligent Systems Comput., Springer 412 (2015) 533-541.
[2210] K. Murhu Guru Packiam, T. Manimaran, and A. Thuraiswamy, On total edge
irregularity strength of graph, Ars Combin., 129 (2016) 173-183.
[2211] K. Muthugurupackiam and S. Ramya, Modular irregularity strength of two
classes of graphs, J. Comp. Math. Sci. 9(9) (2018) 1132-1141. http://www.
allsubjectjournal.com/archives/2015/vol2/issue10/2-8-145
[2212] A. N. Murugan and R. M. I. A. Chitra, Lucky edge labeling of Pn , Cn and corona
of Pn , Cn , IJSIMR, 2(8) (2014) 710-718.
[2213] A. N. Murugan and R. M. I. A. Chitra, Lucky edge labeling of fans, spider, and
twig graphs, Proceed. UGC Sponsored 2 day Nat. Seminar Recent Devel. Functional
Analysis, Topology and Graph Theory (2015) 243-250.
[2214] A. N, Murugan and R. M. I. A. Chitra, Lucky edge labeling of triangular graphs,
Internat. J. Math. Trends Tech., (IJMTT) 36 (2016) 116-118. https://doi.org/
10.14445/22315373/IJMTT-V36P516
[2215] A. N. Murugan and A. Mathubala, Cycle-related homo-cordial graphs, Inter-
nat. J. Multidisciplinary Res. Develop., 2(10) (2015) 9201, 84-88. http://www.
allsubjectjournal.com/archives/2015/vol2/issue10/2-8-145
[2216] A. N. Murugan and P. I. Selvaraj, Path related cup cordial graphs, Indian J. Ap-
plied Res., 4(8) (2011) 433-436. https://www.researchgate.net/publication/
276195461_Path_Related_Cup_Cordial_Graphs
[2217] A. N. Murugan and V. Selva Vidhya, Path related hetro-cordial graphs, Internat. J.
Emerging Tech. Engineering Res., (2015) 2(3) (2015) 9-14. https://www.ijeter.
everscience.org/Manuscripts/Volume-2/Issue-3/Vol-2-issue-3-M-03.pdf
[2218] K. Murugan and A. Subramanian, Skolem difference mean labeling of H-
graphs, Internat. J. Math. Soft Comput., 1(1) (2011) 115-129. http://oaji.net/
articles/2015/296-1433770540.pdf
[2219] M. Murugan, Almost-magic, relaxed-magic and magic strength of a graph, Util.
Math., 65 (2004) 53-64.
[2220] M. Murugan and G. Arumugan, Bi-graceful graphs, Number theory and discrete
mathematics (Chandigarh, 2000) Trends Math., Birkhäuser 243-249.
[2221] M. Murugan and G. Arumugan, Are banana trees graceful?, Math. Ed. (Siwan),
35 (2001) 18-20.
[2222] M. Murugan and G. Arumugan, On graceful numberings of nC5 with a common
edge, unpublished.

the electronic journal of combinatorics (2023), #DS6 538

[2223] M. Murugan and G. Arumugan, An algorithm to find graceful numberings of a
Spl. class of banana trees, unpublished.
[2224] S. Murugan and S. Chandra Kumar, H − V -super magic labeling of H-factorable
graphs, Malaya J. Mat., 7(2) (2019) 138—141.
[2225] N. Murugesan and R. Senthil Amutha, Bimagic total labeling for bistar Bn,n ,
Internat. J. Sci. Innov. Math. Res. (IJSIMR), 2(9) (2014) 764-769.
[2226] S. Murugesan, D. Jayaraman, and J. Shiama 3-Equitable prime cordial labeling
of graphs, Internat. J. Appl. Inform. Systems (IJAIS), 5(9) (2013) 1-4. https:
//research.ijais.org/volume5/number9/ijais13-450974.pdf
[2227] S. Murugesan, D. Jayaraman, and J. Shiama, Square divisor cordial graphs, Inter-
nat. J. Comput. Appl., 64 (22) (2013) 1-4.
[2228] A. Muthaiyan and P. Pugalenthi, Vertex odd divisor cordial labeling of graphs,
IJISET - Internat. J. Innovative Sci., Engin. Tech., 2(10) (2015) 395-400. http:
//ijiset.com/vol2/v2s10/IJISET_V2_I10_53.pdf
[2229] S. Mutharasu and D. Kumar, Vk -Super vertex magic labeling of graphs, Malaya
J. Mat., 6(4) (2018) 795-799. https://www.malayajournal.org/articles/
MJM06040014.pdf
[2230] S. Mutharasu, N. Mary Bernard, Duraisamy kumar, Vk - Super vertex in-magic
labelings of directed graphs, J. Physics: Confer. Ser., 1850 (2021) 012067
pages 1-7. https://iopscience.iop.org/article/10.1088/1742-6596/1850/
1/012067/pdf
[2231] K. Muthgu Guru Packiam, Total face irregularity strength of plane graphs, J.
Graph Label., 2(1) (2016) 69-77.
[2232] K. Muthu Guru Packiam, T. Manimaran, and A. Thuraiswamy, Irregularity
strength of corona of two graphs, Theoretial Comput. Sci. Disc. Math., 175-181,
Lecture Notes in Comput. Sci., 10398, Springer, Cham, 2017.
[2233] K. Muthu Guru Packiam, T. Manimaran, and A. Thuraiswamy, 1-distant irregu-
larity strength of graphs, Theoretical Comput. Sci. Disc. Math., 182-190, Lecture
Notes in Comput. Sci., 10398, Springer, Cham, 2017.
[2234] G. Muthumanickavel and K. Murugan, Oblong sum labeling of
union of some graphs, World Scientific News, 145 (2020) 85-94.
http://www.worldscientificnews.com/wp-content/uploads/2020/04/
WSN-145-2020-85-94.pdf
[2235] D. Muthuramakrishnan, k-even Sequential Harmonious Labeling of Graphs, PhD
thesis, Bharathidasan University, 2013.
[2236] D. Muthuramakrishnan and S. Sutha, Pell graceful labeling of graphs, Malaya
J. Matematik, 7(3) (2019) 508-512. http://www.malayajournal.org/articles/
MJM07030023.pdf
[2237] H. Nagamochi, M. Miller, and Slamin, Bounds on the number of isolates in sum
graph labeling, Discrete Math., 240 (2001) 175-185.

the electronic journal of combinatorics (2023), #DS6 539

[2238] S. Nada, A. T. Diab, A. Elrokh, and D. E. Sabra, The corona between cycles and
paths, J. Egyptian Math. Soc., 25(2) (2017) 111-118.
[2239] S. Nada, A. T. Diab, A. Elrokh, and D. E. Sabra, The corona between paths and
cycles, Ars Combin., 139 (2018) 269-281.
[2240] S. Nada, A. I. Elrokh, Y. Elmshtaye, and Abd El-hay, On singed product cor-
dial of cone graph and its second power, Turkish J. Computer Math. Edu.,
(TURCOMAT) 13(03) (2022) 597-606. https://www.turcomat.org/index.php/
turkbilmat/article/view/13070/9364
[2241] S. Nada, A. I. Elrokh, and E. Elshafey, The cordiality of the join and union of the
second power of fans, Appl. Comput. Math., 7(6) (2018) 219-224. doi:10.11648/
j.acm.20180706.11
[2242] S. Naduvtath, A study on set-cordial graphs, Commun. Fac. Sci. Univ. Ank.
Ser. A1 Math. Stat., 71(2) (2022) 339-348. https://dergipark.org.tr/en/
download/article-file/684619
[2243] U. Nadzima and T. S. Martini, Super (a, d) − H-antimagic total labeling on wheel
edge corona product with a path and a cycle, ICMETA 2018 IOP Conf. Series: J.
Physics: Conf. Series 1306 (2019) 012007 2414-2423. doi:10.1088/1742-6596/
1306/1/012007
[2244] M. Naeem and M. K. Siddiqui, Total irregularity strength of disjoint union of
isomorphic copies of generalized Petersen graph, Discrete Math. Algor. Appl., 9(6)
(2017) 1750071, 9 pp.
[2245] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakaran, Even vertex magic total
labeling, Internat. J. Pure Appl. Math., 115 (9)(2017) 363-375.
[2246] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakaran, Internat. J. Math Trends
Tech., Odd vertex magic total labeling of trees, 52(6) (2017) 374-379.
[2247] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakan, Even vertex magic total labeling
of isomorphic and non isomorphic suns, Internat. J. Math Trends Tech., 52 (7)
(2017) 458-467.
[2248] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakaan, Even vertex magic total la-
beling of some 2-regular graphs, Internat. J. Math Trends Tech., 54(1) (2018)
52-59.
[2249] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakaan, Odd vertex magic total labeling
of some graphs, Internat. J. Pure Appl. Math., 115 (10)(2018) 97-109.
[2250] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakan, Odd vertex magic total labeling
of isomorphic and non isomorphic suns, Internat. J. Math Trends Tech., 52(1)
(2018) 34-41.
[2251] CT. Nagaraj, C. Y. Ponnappan, and G. Prabakaran, Multiple magic graphs, Int.
J. Math. Appl., 6(1) (2018) 109-115. (Special Issue)
[2252] A. Nagarajan, R. Vasuki, and S. Arockiaraj, Super mean number of a graph,
Kragujevac J. Math. 36(1) (2012) 93-107.

the electronic journal of combinatorics (2023), #DS6 540

[2253] S. Nagarajan and G. Priyadharsini, Lucky edge labeling of new graphs, Internat.
J. Math. Trends Tech., (IJMTT) 65(8) (2019) 26-30. http://www.ijmttjournal.
org/Volume-65/Issue-8/IJMTT-V65I8P505.pdf ?
[2254] M. Nalliah, Antimagic labeling of digraphs, J. Indones. Math. Soc., 22(1) (2016)
61-69.
[2255] M. Nalliah, A survey on recent open problems on super (a, d)-edge antimagic total
labelings J. Graph Labeling, 1(2) (2015) 129-136.
[2256] M. Nalliah and S. Arumugam, Super (a, 3)-edge antimagic total labeling for union
of two stars, Theoretical Computer Science and Discrete Mathematics, 203-211,
Lecture Notes in Comput. Sci., 10398, Springer, Cham, 2017.
[2257] D. Narayan, Problem 380. Representations of graphs modulo n, Discrete Math.,
257 (2002) 614.
[2258] D. Narayan, An upper bound for the representaion number of graphs of fixed order,
Integers, 3 (2003) A12 4 pages.
[2259] G. Narasimhan and R. Sampathkumar, (2013). Contra harmonic mean labeling of
graphs, Mapana-J. Sciences,12(8) 23–29. https://doi.org/10.12723/mjs.26.7
[2260] A. Naseem, K. Shabbir, and H. Shaker, The radio number of edge-joint graphs,
Ars Combin., 139 (2018) 337-315.
[2261] S. Nasir, N. Idrees, A. Sadiq, F. B. Farooq, S. Kanwal, and M. Imran, Strongly
multiplicative labeling of diamond graph, generalized Petersen graph, and some
other graphs, Hindawi J. Math., 2022, Article ID 3203108, 5 pages. https://
www.hindawi.com/journals/jmath/2022/3203108/
[2262] S. Nazeer, M. S. Khan, I. Kousar, and W. Nazeer, Radio labeling and radio number
for generalized caterpillar graphs, J. Appl. Math. Informatics, 34 (5-6) (2016) 451-
465.
[2263] S. Nazeer, I. Kousar, and W. Nazeer, Radio and radio antipodal labelings for
circulant graphs G(4k + 2; {1, 2}), J. Appl. Math. Inform., 33(1-2) (2015) 173-183.
[2264] W. Nazeer, S. Nazeer, I. Kousar, and M. Munir, The radio and radio antipodal
numbers of non-bipartite cubic graphs of order 2k , Ars Combin., 145 (2019) 301-
312.
[2265] P. Nedumaran and K. Thirusangu, On 0-edge magic labeling in certain graphs,
Internat. J. Appl. Research, 1(12) (2015) 874-877.
[2266] P. Nedumaran, K. Thirusangu, and V. Celin Mary, 1-Near nean cordial and bicon-
ditional cordial labeling of certain classes of graphs, Internat. J, Pure and Appl.
Math., 117(12) (2017), 297-307. https://www.researchgate.net/publication/
350063970_-Near_Mean_Cordial_and_Biconditional_Cordial_Labeling_of_
Certain_Classes_of_Graphs/references#fullTextFileContent
[2267] N. Neela and C. Selvaraj, Total magic cordial labeling of complete multipartite
graphs, The Eighth International Workshop on Graph Labelings (IWOGL 2014),
251–254, Electron. Notes Discrete Math., 48, Elsevier Sci. B. V., Amsterdam, 2015.

the electronic journal of combinatorics (2023), #DS6 541

[2268] N. Neela and C. Selvaraj, Conjecture on odd graceful graphs, J. Combin. Math.
Combin. Comput., 97 (2016) 65-82.
[2269] J. Nešetřil and A. Pultr, A Dushnik-Miller type dimension of graphs and its com-
plexity, in: M. Karpinski, Ed., Fundamentals of Computation Theory, Lecture
Notes in Computer Science, 56, Springer, Berlin, 1977, 482-493.
[2270] S. Nemani and G. Joshi, E-super vertex magic labeling of cartoon flowers and
wounded flowers, AKCE Int. J. Graphs Comb., 17(3) (2020) 1039-1044. https:
//www.tandfonline.com/doi/full/10.1016/j.akcej.2019.09.001
[2271] C.-m Ni Z.-s Liu, and F.-l Lu, On the E3 -cordiality of some graphs, J. Combin.
Math. Combin. Comput., 97 (2016) 3-10.
[2272] T. Nicholas and K. J. Bosco, Radio mean D-distance labeling of cycle-relted graphs,
Internat. J. Math. Trends Tech., (IJMTT) 40(3) (2016) 247-251.
[2273] T. Nicholas and P. and Maya, Some results on integer edge cordial graph, J. Eng.
Appl. Math., 3(1) 2017) 1-12. doi:10.18831/djmaths.org/2017011001
[2274] A. J. Niedzialomski, Consecutive radio labelings and the Cartesian product of
graphs, Ph. D. Thesis, University of Iowa, August 2013.
[2275] A. J. Niedzialomski, Radio graceful Hamming graphs, Discuss. Math. Graph The-
ory, 36(4) (2016) 1007-1020.
[2276] T. Nierhoff, A tight bound on the irregularity strength of graphs, SIAM J. Discrete
Math., 13 (2000) 313-323.
[2277] S. A. N. Ni’mah and D. Indriati, On vertex irregular total k-labeling and total ver-
tex irregularity strength of lollipop graphs, J. Physics Confer. Series 1306:012025
July 2019
[2278] P. K. Niranjan and S. Rao Kola, On the radio number for corona of paths and
cycles, AKCE Internat. J. Graphs Combin., 17(1) 2020) 269-275. https://www.
sciencedirect.com/science/article/pii/S0972860019300684
[2279] R. Nirmalasari Wijaya, J. Ryan, and T. Kalinowski, Cube-magic labelings of grids,
arXiv:1702.02639.
[2280] R. Nisviasari, Dafik, and I. H. Agustin, The total H-irregularity strength of
triangular ladder graphs, J. Phys.: Conf. Ser., 1465 012026 (2020) https:
//iopscience.iop.org/article/10.1088/1742-6596/1465/1/012026
[2281] R. Nithya and K. Anitha, Even vertex ζ-graceful labeling on rough graph,
arXiv:2208.12047
[2282] H. K. Ng, α-valuations and k-gracefulness, Notices AMS, 7 (1986) 247.
[2283] H. K. Ng, Gracefulness of a class of lobsters, Notices AMS, 7 (1986) 825-05-294.
[2284] S. Ng, F. Alwie, T. P. Marjadi, and K. A. Sugeng, Harmonious labeling of the
union of m-cycle and n-path graph, J. Phys.: Conf. Ser., 1725 (2021) 012088 1-8.
https://iopscience.iop.org/article/10.1088/1742-6596/1725/1/012088

the electronic journal of combinatorics (2023), #DS6 542

[2285] A. A. G. Ngurah, On (a, b)-edge-antimagic total labeling of odd cycle. J. Indones.
Math. Soc., 9 (2003) 9-12.
[2286] A. A. G. Ngurah and Adiwijaya, New results on the (super) edge-magic deficiency
of chain graphs, Int. J. Math. Math. Sci., (2017), Art. ID 5156974, 6 pp.
[2287] A. A. G. Ngurah, On the (super) edge-magic deficiency of chain graphs, J. Combin.
Math. Combin. Comput., 103 (2017) 225-236.
[2288] A. A. G. Ngurah and E. Baskoro, On magic and antimagic total labelings of gen-
eralized Petersen graph, Util. Math., 63 (2003) 97-107.
[2289] A. A. G. Ngurah, E. Baskoro, and R. Simamjuntak, On antimagic total labelings of
generalized Petersen graph, J. Combin. Math. Combin. Comput., 55 (2005) 57-70.
[2290] A. A. G. Ngurah, E. Baskoro, and R. Simamjuntak, On (a, d)-edge-antimagic total
labelings of mCn , Bull. Inst. Combin. Appl., 48 (2006) 35-44.
[2291] A. A. G. Ngurah, E. Baskoro, and R. Simamjuntak, On the super edge-magic
deficiencies of graphs, Australas. J. Combin., 40 (2008) 3-14. http://ajc.maths.
uq.edu.au/pdf/40/ajc_v40_p003.pdf
[2292] A. A. G. Ngurah, E. Baskoro, and R. Simamjuntak, On new families of (super)
edge-magic graphs, Util. Math., 74 (2007) 111-120.
[2293] A. A. G. Ngurah, E. T. Baskoro, and I. Tomescu, Magic graphs with pendant eges,
Ars Combin., 99 (2011) 149-160.
[2294] A. A. G. Ngurah, A. N. M. Salman, and I. W. Sudarsana, On supermagic coverings
of fans and ladders, SUT J. Math., 46 (2010) 67-78.
[2295] A. A. G. Ngurah, A. N. M. Salman, and L. Susilowati, H-supermagic labelings of
graphs, Discrete Math., 310 (2010) 1293-1300.
[2296] A. A. G. Ngurah and R. Simanjuntak, Super edge-magic deficiency of join-product
graphs, Util. Math., 105 (2017) 279-289.
[2297] A. A. G. Ngurah and R. Simanjuntak, On the super edge-magic deficiency of join
product and chain graphs, Electron. J. Graph Theory Appl. (EJGTA), 7(1) (2019)
157-167.
[2298] A. A. G. Ngurah, R. Simamjuntak, and E. Baskoro, On (super) edge-magic total
labeling of subdivision of K1,3 , SUT J. Math., 43 (2007) 127-136.
[2299] T. Nicholas and S. Somasundaram, More results on integral sum graphs, Graph
Theory and its Applications, Editors: R. Balakrishnan et al., Narosa Publishing
House, New Delhi, India (2004) 75-83.
[2300] T. Nicholas and S. Somasundaram, More results on sum graphs, Proceedings of
the Conference on Graph Theory and its Applications held at Anna University,
Chennai, (2001) 73-83.
[2301] T. Nicholas, S. Somasundaram, and V. Vilfred, On (a, d)-antimagic special trees,
unicyclic graphs and complete bipartite graphs, Ars Combin., 70 (2004) 207-220.
[2302] T. Nicholas and V. Vilfred, Sum graph and edge reduced sum number, unpublished.

the electronic journal of combinatorics (2023), #DS6 543

[2303] R. W. Nirmalasari Wijaya, J. Ryan, and T. Kalinowski, H-supermagic labelings
for firecrackers, banana trees and flowers, Australasian J. Combin., 69(3) (2017)
442-451. arXiv:1607.07911
[2304] R. Nistyawati and T. S. Martini, On super (a, d) − H-antimagic total labeling
of edge corona product and corona product of gear graph with path and cycle,
IOP Conf. Series: J. Physics: Conf., Series 1306 (2019) 012010 1-7. https://
iopscience.iop.org/article/10.1088/1742-6596/1306/1/012010/pdf
[2305] S. Novotny, J. Ortiz, and D. Narayan, Minimal k-rankings and the rank number
of Pn2 , Inform. Process. Lett., 109 (2009) 193-198.
[2306] T. Noviati, T. S. Martini, and D. Indriati, On H-supermagic labeling of friendship
edge corona product with path and sun edge corona product with path, J. Physics
Conference Series, 1306:012008 (2019) 1-6.
[2307] R. Nowakowski and C. Whitehead, Ordered graceful labellings of the 2-star, Graph
theory (Prague, 1998), Discrete Math., 233 (2001) 183-191.
[2308] K. Nurdin and K. Hye, Irregular labeling on transportation network of split-
ting graphs of stars, Proc. Jangjeon Math. Soc., 22(1) (2019) 103-108. http:
//jangjeonopen.or.kr/public/upload/1549515921-pjms22-1-11.pdf
[2309] N. Nurdin, On the total edge irregularity strength of quad trees and all banana
trees, J. Indones. Math. Soc., 18(1) (2012) 26-31.
[2310] S. Nurdin, A. N. M. Salman, and E. T. Baskoro, The total edge-irregular strengths
of the corona product of paths with some graphs, J. Combin. Math. Combin.
Comput., 65 (2008) 163-175.
[2311] S. Nurdin, E. T. Baskoro, A. N. M. Salman,and N. N. Gaos, On the total vertex
irregularity strength of trees. Discrete Math., 310 (2010) 3043-3048.
[2312] S. Nurdin, E. T. Baskoro, A. N. M. Salman, and N. N. Gaos, On the to-
tal vertex irregular labelings for several types of trees, Util. Math., 83 (2010)
277-290. https://www.researchgate.net/publication/264943737_On_total_
vertex-irregular_labellings_for_several_types_of_trees
[2313] E. Nurdini, I. Rosyida, and Mulyono, On total edge irregularity strength of tadpole
chain graph T r(6, n), J. Phys.: Conf., Ser. 1538 (2020) 012001 1-9. https://
iopscience.iop.org/article/10.1088/1742-6596/1538/1/012001
[2314] S. Nurdin, A. N. M. Salman, N. N. Gaos, and E. T. Baskoro, On the total vertex-
irregular strength of a disjoint union of t copies of a path, J. Combin. Math.
Combin. Comput., 71 (2009) 227-233.
[2315] D. E. Nurvazly and K. A. Sugeng, Graceful labelling of edge amalgamation of
cycle graph, J. Physics Confer. Ser., 1108 012047 (2018) http://iopscience.
iop.org/article/10.1088/1742-6596/1108/1/012047/pdf
[2316] D. Nurvazly, S. L. Chasanah, and A. R. Wiranto, Variations of graceful labelling
of subgraph of millipede graph, AIP Conference Proceedings 2563, 050018 (2022);
https://doi.org/10.1063/5.0105447

the electronic journal of combinatorics (2023), #DS6 544

[2317] U. Odabasi, · D. Roberts, and · R. M. Low, The integer-antimagic spectra of
Hamiltonian graphs, Elect. J. Graph Th. and Appl., 9(2) (2021) 301-308. https:
//www.ejgta.org/index.php/ejgta/article/view/1097/pdf_180
[2318] A. S. Odyuo and P. Mercy, On Fibonacci range labeling for stan-
dard shell graphs, J. Adv. Math. Comput. Sci, 38(7) (2023) 67-75.
https://www.researchgate.net/publication/370248581_On_Fibonacci_
Range_Labeling_for_Standard_Shell_Graphs
[2319] D. L. Oliveira, S. Dantas, and A. G. Luiz, Results on the graceful game and range-
relaxed graceful game, In: J. Nešetřil, G. Perarnau, J. Rue, and O. Serra, O.
Extended Abstracts EuroComb 2021. Trends Math., (2021) 14 Birkhauser, Cham.
https://link.springer.com/chapter/10.1007/978-3-030-83823-2_34
[2320] M. A. Ollis, New complete Latin squares of odd order, European J. Combin., 41
(2014) 35-46.
[2321] T. Öner and E. Erol, On Cm -supermagicness of book-snake graphs, Punjab
Univ. J. Math., (Lahore) 53(4) (2021) 221-230. http://acikerisim.mu.edu.tr:
8080/xmlui/bitstream/handle/20.500.12809/9305/oner.pdf?sequence=1&
isAllowed=y
[2322] M. J. M. Orias and A. C. Pedrano, On super root square mean labeling of some
cycle related graphs, Acta Sci. Comput. Sci., 5(1) (2023) 40-48. https://www.
gjesr.com/Issues%20PDF/Archive-2018/November-2018/23.pdf
[2323] A. Ovais, M. Umar, M. Bača, and A. Semaničová-Feňovčı́ková, Fans are cycle-
antimagic, Australas. J. Combin., 68 (2017) 94-105.
[2324] L. Packiam and K. Kathiresan, On total vertex irregularity strength of graphs,
Discuss. Math. Graph Theory, 32(1) (2012) 39-45.
[2325] K. Palani and A. Shunmugapriya, Near mean labeling in dragon digraphs,
J. Xidian Univer., 14(3) (2020) 1298-1307. https://www.researchgate.net/
publication/340979735_NEAR_MEAN_LABELING_IN_DRAGON_DIGRAPHS
[2326] K. Palani and A. Shunmugapriya, Near mean labeling in dicyclic snakes,
Ratio Math., 45 (2023) 238-247. http://eiris.it/ojs/index.php/
ratiomathematica/article/view/238-247/0
[2327] W. Pan and X. Lu, The gracefulness of two kinds of unconnected graphs (P2 ∨
Kn ) ∪ St(m) and (P2 ∨ Kn ) ∪ Tn , J. Jilin Univ., 41 (2003) 152-154.
[2328] A. C. Panda and D. Mishra, Some new classes of graceful diameter six trees,Turkic
World Math. Soc. J. Appl. Engin. Math., 5(2) (2015) 269-275.
[2329] A. C. Panda, D. Mishra, R. B. Dash, A class of diameter six trees exhibiting
graceful labeling. J. Discrete Math. Sci. Cryptogr., 19(5-6) (2016) 947-963.
[2330] J. Pandimadevi and S. P. Subbiah, Vertex antimagic total labeling of digraphs,
Kyungpook Math. J., 55(2) (2015) 267-277.

the electronic journal of combinatorics (2023), #DS6 545

[2331] P. Pandya and N. P. Shrimali, Vertex-edge neighborhood prime labeling of
some graphs, Internat. J. Scien. Res. Review, 7(10) 2018 735-743. http://www.
dynamicpublisher.org/gallery/82-ijsrr-d1002.pdf
[2332] P. Panigrahi, A survey on radio k-colorings of graphs, AKCE J. Graphs Combin.,
6 (2009) 161-169.
[2333] P. Panigrahi and D. Mishra, Graceful lobsters obtained from diameter four trees
using partitioning technique, Ars Combin., 87 (2008) 291-320.
[2334] P. Panigrahi and J. Saha, On harmoniousness of hypercubes, AKCE J. Graphs
Combin., 5 (2008) 189-198.
[2335] A. Panpa and T. Poomsa-ard, On graceful spider graphs with at most four legs of
lengths greater than one, J. Appl. Math., 3 (2016) 1-5.
[2336] R. Parameswari, Total magic cordial labeling of square and shadow graphs, Appl.
Math. Sci., 9(25) (2015 1229-1234. http://dx.doi.org/10.12988/ams.2015.
4121058
[2337] R. Parameswari and C. Jayalakshmi, On cordial totally magic labeling
of flower graphs, AIP Confer. Proceed., 2639, 040002 (2022) 151-160.
doi:10.1007/978-981-19-5224-1 17
[2338] R. Parameswari and R. A. Margret, Square sum labeling of Octopus graph
and Vanessa graph, November 2022AIP Conference Proceed., 2516(1):210042
doi:10.1063/5.0119754
[2339] R. Parameswari and R. Rajeswari, Total bimagic labeling and total
magic cordial labeling of Paley digraphs, 2013 International Conference on
Pattern Recognition, Informatics and Mobile Engineering, 2013, 506-509,
doi:10.1109/ICPRIME.2013.6496723
[2340] R. Parameswari and R. Rajeswari, Total magic cordial labeling of (Pn , K1 ), gear
and shadow graphs, Int. J. Pure Appl. Math., 101(6) (2015) 993-1001. https:
//acadpubl.eu/jsi/2015-101-5-6-7-8/2015-101-6/17/17.pdf
[2341] R. Parameswari, K. Saradha Pritha, and R. Rajeswari, Integer cordial and face
integer cordial labeling of some flower graphs, Internat. Conf. Math. Sci., (ICMS
2020), J. Physics: Confer. Ser., 1770 (2021) 012079. https://iopscience.iop.
org/article/10.1088/1742-6596/1770/1/012079
[2342] A. Parestu, D. R. Silaban, and K. A. Sugeng, Pelabelan simpul-ajaib total dari
gabungan graf matahari, prosising Seminar Nasional Matematika, Universitas
Parahyangan, Bandung, 3 (2008) 407-414.
[2343] A. Parestu, D. R. Silaban, and K. A. Sugeng, Vertex antimagic total labelings of
the union of suns, J. Combin. Math. Combin. Comput., 71 (2009) 179-188.
[2344] J. Y. Park, J. H. Choi, and J. H. Bae, On super edge-magic labeling of some
graphs, Bull. Korean Math. Soc., 45 (2008) 11-21.
[2345] D. Parmar and J. Joshi, Hk -Cordial labeling of triangular snake graph, J. Appl.
Sci. Computat., 6(3) (2019) 2118-2123.

the electronic journal of combinatorics (2023), #DS6 546

[2346] Y. Parmar, Edge vertex prime labeling for wheel, fan and friendship graph, Inter-
nat. J. Math. Stat. Invention (IJMSI), 5(8) (2017) 23-29.
[2347] Y. Parmar, Edge vertex prime labeling for K2,n and K3,n graphs, Math. J. Inter-
disciplinary Sci., 6(2) (2018) 167-180.
[2348] D. Parmar and U. Vaghela, Skolem difference mean labeling of some path related
graphs, Pramana Res. J., 9(5) (2019) 651-657.
[2349] A. Parthiban and N. G. David, On prime distance labeling of graphs, in: S. Aru-
mugam, J. Bagga, L. Beineke, B. Panda, (eds.), Th. Comput. Sci. Discr. Math.,
ICTCSDM 2016 Lecture Notes in Computer Science 10398 31 (2017) 238-241.
[2350] A. Parthiban and V. Sharma, A comprehensive survey on prime cordial and
divisor cordial labeling of graphs, April 2020 J. Physics Conf., Series 1531:012074
https://www.researchgate.net/publication/341874840_A_comprehensive_
survey_on_prime_cordial_and_divisor_cordial_labeling_of_graphs
[2351] A. Parthiban and Vishally Sharma, Double divisor cordial labeling of graphs, Jour-
nal of Physics: Conference Series 2267 (2022) 012026 1-12. https://iopscience.
iop.org/article/10.1088/1742-6596/2267/1/012026/pdf
[2352] A. Pasotti, Constructions for cyclic Moebius ladder systems, Discrete Math., 310
(2010) 3080-3087.
[2353] A. Pasotti, On d-divisible α-labelings of C4k × Pm , Util. Math., 90 (2013) 135-148.
[2354] A. Pasotti, On d-graceful labelings, Ars Combin., 111 (2013) 207-223.
[2355] A. M. Pastel, and H. Raynaud, Numerotation gracieuse des oliviers, in Colloq.
Grenoble, Publications Université de Grenoble, (1978) 218-223.
[2356] M. Pate and V. Ghodasara, Cube sum labeling (taxi-cab labeling) of graphs,
Internat. J. Math. Combin., 2 (2023) 78-86. https://www.researchgate.net/
publication/372344264_Cube_Sum_Labeling_Taxi-Cab_Labeling_of_Graphs
[2357] S. K. Patel, Neighborhood-prime labeling of some generalized Petersen graphs,
Internat. J. Math. Soft Comput., 7(2) (2017) 111-118.
[2358] M. Patel and G. V. Ghodasara, Neighborhood-prime labeling of some cycle related
graphs, Math. Today, 34 (2018) 159-173.
[2359] M. J. Patel and G. V. Ghodasara, Square sum labeling in context of some graph
operations, Internat. J. Math. Trends and Tech. 66(12) (2020), 134-147. http:
//ijmttjournal.org/archive/ijmtt-v66i12p519
[2360] S. K. Patel and A. N. Kansagara, Prime labeling of union graphs, Internat. J. Sci.
Research Math. Stat. Sci., 6(1) (2019) 86-93.
[2361] S. K. Patel and A. N. Kansagara, Neighborhood-prime labeling of snake graphs,
Acta Math. Universitatis Comenianae, 90(4) (2021) 353-376. http://www.iam.
fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1509/904
[2362] S. K. Patel, A. N. Kansagara and J. B. Vasava, Prime labeling in the con-
text of subdivision of some cycle related graphs, TWMS J. App. Eng. Math.,

the electronic journal of combinatorics (2023), #DS6 547

 11(2) (202) pp. 524-540. http://jaem.isikun.edu.tr/web/images/articles/
vol.11.no.2/21.pdf
[2363] S. K. Patel, U. M. Prajapati, and A. N. Kansagara, Product cordial labeling of
extensions of barbell graph, Math. Combin. Book Ser., 4 (2018) 146-159.
[2364] S. K. Patel and N. P. Shrimali, Neighborhood-prime labeling, Internat. J. Math.
and Soft Comput., 5(2) (2015) 135-143.
[2365] S. K. Patel and N. P. Shrimali, Neighborhood-prime labeling of some union graphs,
Internat. J. Math. Soft Comput., 6(1) (2016) 39-47.
[2366] S. K. Patel and N. P. Shrimali, Neighborhood-prime labeling of some product
graphs, Algebra Discrete Math., 25(1) (2018) 118-129.
[2367] S. K. Patel and J. B. Vasava, On prime labeling of some union graphs, Kragujevac
J. Math., 42(3) (2018) 441-452.
[2368] S. K. Patel and J. B. Vasava, Some results on (a, d)-distance antimagic labeling,
Proy. J. Math., 39(2) (2020) 361-381. https://www.revistaproyecciones.cl/
index.php/proyecciones/article/view/3475/3366
[2369] S. K. Patel and J. B. Vasava, On prime labeling of some union graphs and circulant
graphs, Inter. J. Sci. Res. Math. Stat. Sci., 5(6) (2018) 248-254. https://www.
isroset.org/pdf_paper_view.php?paper_id=1000&34-IJSRMSS-01559.pdf
[2370] H. Patodia and H. K. Saikia, m-Zumkeller graphs, Adv. Math. Sci. J. 9(7)
(2020) 4687-4694. https://www.research-publication.com/amsj/uploads/
papers/vol-09/iss-07/AMSJ-2020-N7-35.pdf
[2371] H. Patodia and H. K. Saikia, t-m-Zumkeller labeling of graphs, Adv. Appl. Disc.
Math., 27(1) (2021) 1-14. doi:10.17654/DM027010001
[2372] R. Patrias and O. Pechenik, Path-cordial abelian groups, Australas. J. Combin.,
80 (2021) 157-166. https://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p157.pdf
[2373] L. Pattabiraman, T. Loganathan, and C. V. Rao, Graceful labeling of hexagonal
snakes, Graceful Labeling of Hexagonal Snakes AIP Confer. Proceed. 2112, 020056
(2019) 1-3. https://doi.org/10.1063/1.5112241
[2374] R. Pawar and T. Singh, Distance magic labeling of generalised Mycielskian graphs,
arXiv:2306.07578v1. 9pp.
[2375] O. Pechenik and J. Wise, Generalized graph cordialty, Discuss. Math. Graph Th.,
32(3) (2012) 557-567.
[2376] A. C. Pedrano and R. Rulete, On the total product cordial labeling on the cartesian
product of Pm ×Cn , Cm ×Cn and the generalized Petersen graph P (m, n), Malaya J.
Mat., 5(2) (2017) 194-201. https://www.malayajournal.org/articles/Paper_
7_2017.pdf
[2377] A. Pedrano and R. Rulete, On total product cordial labeling of some crown graphs,
Internat. J. Math. Appl., 5(2B) (2017) 273-284.
[2378] E. Pegg Jr., personnal communication, 2021

the electronic journal of combinatorics (2023), #DS6 548

[2379] S. G. Penrice, Some new graph labeling problems: a preliminary report, DIMACS
Tech. Rep. 95-29 (1995).
[2380] J. Pereira, T. Singh, and S. Arumugam, m-gracefulness of graphs, Algor. Discrete
Appl. Math., Lecture Notes in Comput. Sci., 9602, Springer, [Cham], (2016) 289-
298.
[2381] J. Pereira, T. Singh, and S. Arumugam, On (k, d)-Skolem graceful graphs, The
Eighth International Workshop on Graph Labelings (IWOGL 2014), 81-88, Elec-
tron. Notes Discrete Math., 48, Elsevier Sci. B. V., Amsterdam, 2015.
[2382] J. Pereira, T. Singh, and S. Arumugam, A new measure for gracefulness of graphs,
Elect. Notes Discr. Math., 48 (2015) 275-280.
[2383] J. Pereira, T. Singh, and S. Arumugam, On (k, d)-hooked Skolem graceful graphs,
Elect. Notes Discr. Math., 48 (2015) 81-88. https://doi.org/10.1016/j.endm.
2015.05.012 arXiv:1705.06736v1
[2384] K. Periasamy, K. Venugopal, and P. L. Rozario Raj, kth Fibonacci prime
labeling of graphs Internat. J. Math. Trends Tech., 68(5) (2022) 61-67.
https://www.researchgate.net/publication/361207921_K_th_Fibonacci_
Prime_Labeling_of_Graphs/references#fullTextFileContent
[2385] M. A. Perumal, S. Navaneethakrishnan, A. Nagarajan, S. Arockiaraj, Super grace-
ful labeling for some simple graphs, Internat. J. Math. Soft Computing, 2 (2012)
35-49.
[2386] M. A. Perumal, S. Navaneethakrishnan, S. Arockiaraj, A. Nagarajan, Super grace-
ful labeling for some special graphs, Int. J. Res. Rev. Appl. Sci. 9(3) (2011) 382-404.
[2387] K. Petrie and B. Smith, Symmetry breaking in graceful graphs, in Proc.CP’03,
LNCS, 930-934 Springer (2003)
[2388] F. Pfender, Total edge irregularity strength of large graphs, Discrete Math., 312(2)
229-237. arXiv:1006.4501
[2389] O. Phanalasy, Antimagic labeling of generalized sausage graphs, J. Indones. Math.
Soc., 20(2) (2014) 95-110.
[2390] O. Phanalasy, M. Miller, C. S. Iliopoulos, S. P. Pissis, and E. Vaezpour, Construc-
tion of antimagic labeling for the Cartesian product of regular graphs, Math. in
Comput. Sci., 5(1) (2011) 81-87.
[2391] O. Phanalasy, M. Miller, J. Ryan and S. Arumugam, Antimagic labeling of gener-
alized pyramid graphs, Acta. Math. Sin.-English Ser., 30 (2014) 283.
[2392] O. Phanalasy, M. Miller, L. J. Rylands, and P. Lieby, On a relationship between
completely separating systems and antimagic labeling of regular graphs, In C. S. Il-
iopoulos and W. F. Smyth, editors, Proceedings of IWOCA10, Lecture Notes in
Computer Science, 6460 (2011) 238-241.
[2393] N. C. K. Phillips, R. S. Rees, and W. D. Wallis, Edge-magic total labelings of
wheels, Bull. Inst. Combin. Appl., 31 (2001) 21-30.

the electronic journal of combinatorics (2023), #DS6 549

[2394] N. C. K. Phillips, R. S. Rees, and W. D. Wallis, personal communication (circa
2002).
[2395] D. A. Pike, A. Sanaei and N. Shalaby, Pseudo-Skolem sequences and Graph Skolem
Labelling, Math. Scandinavica, 120 (2017) 17-38.
[2396] O. Pikhurko, Every tree with at most 34 vertices is prime, Util. Math., 62 (2002)
185-190.
[2397] O. Pikhurko, Dense edge-magic graphs and thin additive bases, Discrete Math.,
306 (2006) 2097-2107.
[2398] O. Pikhurko, Trees are almost prime, Discrete Math., 307 (2007) 1455-1462.
[2399] O. Pikhurko, Characterization of product anti-magic graphs of large order, Graphs
and Combin., 23 (2007) 681-689.
[2400] A. A. Pir and A. Parathiban, Further results on 2-odd labelings of graphs, Adv.
Appl. Math. Sci., 21(8) (2022).
[2401] S. Poljak and M. Sûra, An algorithm for graceful labeling of a class of symmetrical
trees, Ars Combin., 14 (1982) 57-66.
[2402] A. Ponmoni, S. Navaneetha Krishnan and A. Nagarajan, Skolem difference Lucas
mean labeling for star related graphs, Internat. J. Math. Trends Tech., 62(2) (2018)
104-109. http://www.ijmttjournal.org/archive/ijmtt-v62p515
[2403] C. Y. Ponnappan, CT. Nagaraj, and G. Prabakaran, Odd vertex magic label-
ing, Internat. J. Comput. Organization Trends, 9(1) (2014) 86-89. https://pdfs.
semanticscholar.org/88c4/f87f384255dddab2fca95e4fc0644424f8cc.pdf
[2404] R. Ponraj, (α1 , α2 , . . . , αk )-cordial labeling of graphs, Varahmihir J. Math. Sci., 8
(2008) 137-145.
[2405] R. Ponraj, Further results on (α1 , α2 , . . . , αk )-cordial labeling of graphs, J. Indian
Acad. Math., 31 (2009) 157-163.
[2406] R. Ponraj and M. Maria Adaickalam, Quotient cordial labeling of star related
graphs, J. Indian Acad. Math. , 37(2)(2015) 313-324.
[2407] R. Ponraj and M. Maria Adaickalam, 3-difference cordiality of some graphs, Pales-
tine. J. Mathematics, 6 (2017) 202-210.
[2408] R. Ponraj and M. Maria Adaickalam, 3-difference cordiality of some union of
graphs, Palestine J. Math., 2 (2017) 141-148.
[2409] R. Ponraj and M. Maria Adaickalam, 3-difference cordial labeling of some cycle
related graphs, J. Algor. Comput., 47 (2016) 1-10.
[2410] R. Ponraj, M. Maria Adaickalam, and R. Kala, 3-difference cordiality of some
special graphs, Jordan J. Math. Stat., 11(2) (2018) 145-167.
[2411] R. Ponraj, M. Maria Adaickalam and R. Kala, Quotient cordial labeling of graphs,
Inter. J. Math. Combin., 1 (2016) 101-108.
[2412] R. Ponraj, M. Maria Adaickalam and R. Kala, k-difference cordial labeling of
graphs, Internat. J. Math. Comb., 2 (2016) 121-131.

the electronic journal of combinatorics (2023), #DS6 550

[2413] R. Ponraj, M. Adaickalam, and R. Kala, 3-difference cordiality of corona of double
alternate snake graph, Bull. Int. Math. Virtual Inst., 8(2) (2018) 245-258.
[2414] R. Ponraj, K. Annathurai, and R. Kala, Remainder cordial labeling of graphs, J.
Algor. Comput., 49 (2017) 17-30.
[2415] R. Ponraj, K. Annathurai, and R. Kala, k-remainder cordial graphs, J. Algor.
Comput., 49(2) (2017) 41-52.
[2416] R. Ponraj, K. Annathurai, and R. Kala, 4-remainder cordial labeling of some
special graphs, Internat. J. Pure Appl. Math., 118(6) (2018) 399- 405.
[2417] R. Ponraj, K. Annathurai, and R. Kala, 4-remainder cordial labeling of some
graphs, Internat. J. Math. Combin., 1 (2018) 138-145.
[2418] R. Ponraj, K. Annathurai, and R. Kala, 4-reminder cordial labeling graphs ob-
tained from ladder, Internat.l J. Mathematical Combin., to appear.
[2419] R. Ponraj, K. Annathurai, and R. Kala, Remainder cordiality of some graphs,
Palestine J. Math., 8(1) (2019) 367-372.
[2420] R. Ponraj, K. Annathurai, and R. Kala, 4-remainder cordial labeling of some new
families graphs, Palestine J. Math., 8(2) (2019) 78-86.
[2421] R. Ponraj, A. Gayathri, and S. Somasundaram, 4-remainder cordial labeling of
parachute, twig, kayak paddle graph, Palest. J. Math. 11(2) (2022) 26-37. https:
//pjm.ppu.edu/sites/default/files/papers/PJM_May_2022_26_to_37.pdf
[2422] R. Ponraj and J. V. X. Parthipan, Pair sum labeling of graphs, J. Indian Acad.
Math., 32(2) (2010) 587-595.
[2423] R. Ponraj, J. V. X. Parthipan, and R. Kala, Some results on pair
sum labeling of graphs, Internat. J. Math. Combin.. 4 (2010) 55-
61. https://www.researchgate.net/publication/267129811_Some_results_
on_pair_sum_labeling_of_graphs
[2424] R. Ponraj and J. V. X. Parthipan, Further results on pair sum labeling of trees,
Appl. Math., 2(10) (2011) 1270-1278.
[2425] R. Ponraj and J. V. X. Parthipan, Pair mean labeling of graphs, J. Indian Acad.
Math., 33(2) (2011) 375-383.
[2426] R. Ponraj, J. V. X. Parthipan, and R. Kala, Some results on pair sum labeling of
graphs, Inter. J. Mathematical Combin., 4 (2010) 53-61.
[2427] R. Ponraj, J. V. X. Parthipan, and R. Kala, A note on pair sum graphs, J. Scientific
Research, 3(2) (2011) 321-329.
[2428] R. Ponraj, J. V. X. Parthipan and R. Kala, Further results on pair sum graphs,
Appl. Math., 3(3) (2012) 267-275.
[2429] R. Ponraj, J. V. X. Parthipan and R. Kala, Some new families of pair sum graphs,
J. Math. Comput. Sci., 2(3) (2012) 747-758.
[2430] R. Ponraj and S. Sathish Narayanan, Further results on difference cordial labeling
of corona graphs, J. Indian Academy Math., 35 (2013) 217-235.

the electronic journal of combinatorics (2023), #DS6 551

[2431] R. Ponraj and S. Sathish Narayanan, Difference cordiality of some graphs obtained
from double alternate snake graphs, Global J. Math. Sciences: Theory and Prac-
tical, 5 (2013) 167-175.
[2432] R. Ponraj and S. Sathish Narayanan, Difference cordiality of some snake graphs,
J. Appl. Math. and Informatics, 32 (2014) 377-387.
[2433] R. Ponraj and S. Sathish Narayanan, Difference cordiality of some derived graphs,
Internat. J. Math. Combin., 4 (2013) 37-48.
[2434] R. Ponraj and S. Sathish Narayanan, Difference cordial labeling of graphs obtained
from triangular snakes, Applications Applied Math., 9(2) (2014) 811-825.
[2435] R. Ponraj and S. Sathish Narayanan, Total mean cordiality of Knc + 2K2 , Palestine
J. Math., 4(2) (2015) 431-438.
[2436] R. Ponraj and S. Sathish Narayanan, Mean cordiality of some snake graphs, Pales-
tine J. Math., 4(2) (2015) 439-445.
[2437] R. Ponraj and S. Sathish Narayanan, Total mean cordial labeling of some cycle
related graphs, J. Appl. Math. & Informatics, 33 (1-2) (2015) 101-110.
[2438] R. Ponraj and S. Sathish Narayanan, Some results on total mean cordial labeling
of graphs, International J. Math. Combin., 2 (2015) 122-132.
[2439] R. Ponraj and S. Sathish Narayanan, Existence and non existence of mean cordial
labeling of certain graphs, J. Prime Research Math., 11 (2015) 123-136.
[2440] R. Ponraj and S. Sathish Narayanan, Total mean cordiality of some derived graphs,
Bull. inter. Math. Virtual Institute, 5 (2015) 181-190.
[2441] R. Ponraj and S. Sathish Narayanan, Further results on total mean cordial labeling
of graphs, J. Algor. Comput., 46 (2015) 73-83.
[2442] R. Ponraj and S. Sathish Narayanan, Radio mean number of certain graphs, Inter.
J. Math. Combin., 2 (2016) 51-64.
[2443] R. Ponraj, S. Sathish Narayanan, and R. Kala, Difference cordial labeling of graphs,
Global J. Math. Sciences: Theory and Practical, 3 (2013) 192-201.
[2444] R. Ponraj, S. Sathish Narayanan, and R. Kala, Difference cordial labeling of graphs
obtained from double snakes, Internat. J. of Math. Research, 5 (2013) 317-322.
[2445] R. Ponraj, S. Sathish Narayanan, and R. Kala, Difference cordial labeling of corona
graphs, J. Math. Comput. Sci., 3 (2013) 1237-1251.
[2446] R. Ponraj, S. Sathish Narayanan, and R. Kala, Difference cordial labeling of sub-
divided graphs, Scientia Magna, 9(3) (2013) 57-66.
[2447] R. Ponraj, S. Sathish Narayanan, and R. Kala, Difference cordial labeling of sub-
division of snake graphs, Universal J. Appl. Math., 2(1) (2014) 40-45.
[2448] R. Ponraj, S. Sathish Narayanan, and R. Kala, Difference cordiality of product
related graphs, Tbilisi Math. J., 8(2) (2015) 41-47.
[2449] R. Ponraj, S. Sathish Narayanan, and R. Kala, A note on difference cordial graphs,
Palestine J. Math., 4(1) (2015) 189-197.

the electronic journal of combinatorics (2023), #DS6 552

[2450] R. Ponraj, S. Sathish Narayanan, and R. Kala, Radio mean labeling of a graph,
AKCE Internat. J. Graphs Combin., 12 (2015) 224-228.
[2451] R. Ponraj, S. Sathish Narayanan, and R. Kala, On radio mean number of some
graphs, Internat. J.Math. Combin., 3 (2014) 41-48.
[2452] R. Ponraj, S. Sathish Narayanan, and R. Kala, Radio mean number of some wheel
related graphs, Jordan J. Math. and Stat. (JJMS), 7(4) (2014) 273-286.
[2453] R. Ponraj, S. Sathish Narayanan and A. M. S. Ramasamy, Total mean cordial
labeling of graphs, International J.Math. Combin., 4 (2014) 56-68.
[2454] R. Ponraj, S. Sathish Narayanan and A. M. S. Ramasamy, Total mean cordial
labeling of some graphs, Util. Math., to appear.
[2455] R. Ponraj, S. Sathish Narayanan and A. M. S. Ramasamy, Total mean cordiality
of umbrella, butterfly and dumbbell graphs, Jordan J. Math. and Stat. (JJMS),
8(1)(2015) 59-77.
[2456] R. Ponraj, S. Sathish Narayanan, and R. Kala, Radio mean labeling of a graph
AKCE Internat. J. Graphs Combin., 12 (2015) 224-228.
[2457] R. Ponraj, S. Sathish Narayanan and R. Kala, Radio mean number of some sub-
division graphs, Jordan J. Math. and Stat. (JJMS), 9(1) (2016) 45-64.
[2458] R. Ponraj, S. Sathish Narayanan and A. M. S. Ramasamy, Parity combination
cordial labeling of graphs, Jordan J. Math. and Stat. (JJMS), 8(4)(2015) 293-308.
[2459] R. Ponraj and R. Singh, 4-Prime cordial graphs obtained from 4-prime cordial
graphs, Bull. Int. Math. Virtual Inst. 8(1) (2018) 1-9.
[2460] R. Ponraj, R. Singh, R. Kala and S. Sathish Narayanan, k-Prime cordial graphs,
J. Appl. Math. & Informatics, 34(3-4) (2016) 227-237.
[2461] R. Ponraj, R. Singh, and S. Sathish Narayanan, A note on 3-prime cordial graphs,
J. Algor. Comput., 48 (2016) 45-55.
[2462] R. Ponraj, R. Singh, and R. Kala, 4-Prime cordial labeling of some special graphs,
Bull. Int. Math. Virtual Inst. 8(1) (2018) 89-97.
[2463] R. Ponraj, R. Singh,and R. Kala, 4-Prime cordiality of m copies of some graphs,
Palestine J. Math., 8(1) (2018) 307-311.
[2464] R. Ponraj, R. Singh, and S. Sathish Narayanan, On parity combination cordial
graphs, Palestine J. Math., 6 (1) (2017) 211-218. https://pjm.ppu.edu/sites/
default/files/papers/PJM_MAR_2017_25.pdf
[2465] R. Ponraj and M. Sivakumar, On mean cordial graphs, Internat. J. Math. Combin.,
3 (2013) 78-84.
[2466] R. Ponraj, M. Sivakumar, and M. Sundaram, k-Product cordial labeling of graphs,
Int. J. Contemp. Math. Sci., 7 (2012) 733-742.
[2467] R. Ponraj, M. Sivakumar, and M. Sundaram, On 4-product cordial graphs, Inter.
J. Math. Archive, 7 (2012) 2809-2814.

the electronic journal of combinatorics (2023), #DS6 553

[2468] R. Ponraj, M. Sivakumar, and M. Sundaram, k-Total product cordial labeling of
graphs, Appl. Appl. Math.: An Inter. J., 7 (2012) 708-716.
[2469] R. Ponraj, M. Sivakumar, and M. Sundaram, On 3-total product cordial graphs,
Int. Math. Forum, 7(29-32) (2012) 1537-1546.
[2470] R. Ponraj, M. Sivakumar, and M. Sundaram, New families of 3-product cordial
graphs, Inter. J. Math. Archive, 5 (2012) 1985-1990.
[2471] R. Ponraj, M. Sivakumar, and M. Sundaram, 3-Total product cordial labeling of
some sub divided graphs, Inter. J. Math. Research, 5 (2012) 517-526.
[2472] R. Ponraj and M. Sivakumar, A note on k-Total product cordial graphs, Global J.
Math. and Math. Sciences, 1 (2012) 37-44.
[2473] R. Ponraj, M. Sivakumar, and M. Sundaram, Mean cordial labeling of graphs,
Open J. Discrete Math., 2 (2012) 145-148. doi:10.4236/ojdm.2012.24029
[2474] R. Ponraj and S. Somasundaram, Further results on mean graphs, Proc. SACOEF-
ERENCE, National Level Conference, Dr. Sivanthi Aditanar College of Engineer-
ing, (2005) 443-448.
[2475] R. Ponraj and S. Somasundaram, Mean labeling of graphs obtained by identifying
two graphs, J. Discrete Math. Sci. Cryptogr., 11(2) (2008) 239-252.
[2476] R. Ponraj, S. Subbulakshmi, and S. Somasundaram, On 4-total mean cor-
dial graphs, J. Appl. Math. Inform., 39(3-4) (2021) 497-506. https://www.
koreascience.or.kr/article/JAKO202116954748838.pdf
[2477] R. Ponraj, S. Subbulakshmi, and S. Somasundaram, Further results on 4-difference
cordial graphs, Palest. J. Math., 11(1) (2022) 142-148. https://pjm.ppu.edu/
sites/default/files/papers/PJM_November_2021_142_to_148.pdf
[2478] G. Pooranam, R. Vasuki, and S. Suganthi, New families of odd mean graphs,
Internat. J. Math. Combin., 1 (2019) 134-145. https://www.researchgate.
net/publication/338178781_International_Journal_of_Mathematical_
Combinatorics_vol_12019
[2479] R. S. Porchelvi and S. A. Devi, Pronic graceful graphs, J. Xidian University, 14(3)
(2020) 895-898.
[2480] R. S. Porchelvi and S. A. Devi, Pronic Heron mean graphs, The Internat. J. Ana-
lytical and Experimental Modal Analysis, XII(III) (2020) 2207-2212.
[2481] P. Pradhan and K. Kamesh, On k-graceful labeling of some graphs, Math. Inform.,
34(1-2) (2016) 9-17.
[2482] P. Pradhan and A. Kumar, Graceful hairy cycles with pendent edges and some
properties of cycles and cycle related graphs, Bull. Calcutta Math. Soc., 103(3)
(2011) 233-246.
[2483] T. R. Pradipta and A. N. M. Salman, Some cycle-supermagic labelings of
the calendula graphs, J. Physics Conference Series, 948(1):012071 (2018)
doi:10.1088/1742-6596/948/1/012071

the electronic journal of combinatorics (2023), #DS6 554

[2484] U. M. Prajapati and S. J. Gajjar, Some results on prime labeling Open J. Discrete
Math., 4 (2014) 60-66. http://dx.doi.org/10.4236/ojdm.2014.43009
[2485] U. M. Prajapati and R. M. Gajjar, personal commuication (2011).
[2486] U. M. Prajapati and R. M. Gajjar, Cordial labeling for complement of some graphs,
Math. Today, 30 (2015) 99-118.
[2487] U. M. Prajapati and R. M. Gajjar, Cordial labeling in the context of duplication
of some graph elements, Internat. J. Math. Soft Comput., 6(2) (2016) 65-73.
[2488] U. M. Prajapati and R. M. Gajjar, Cordiality in the context of duplication in crown
related graphs, J. Math. Comput. Sci., 6(6) (2016) 1058-1073. http://scik.org/
index.php/jmcs/article/view/2896
[2489] U. M. Prajapati and R. M. Gajjar, Cordiality in the context of duplication in
flower related graphs, Internat. J. Math. Soft Comput., 7(2) (2017) 9-101. www.
ijmsc.com/index.php/ijmsc/article/view/ijmsc-7-2-8/pdf
[2490] U. M. Prajapati and R. M. Gajjar, Cordiality in the context of duplication in web
and armed helm, Internat. J. Math. Combin., 3 (2017) 90-105.
[2491] U. M. Prajapati and R. M. Gajjar, Some labeling techniques of holiday star graph,
Internat. J. Math. Trends Tech., 49(6) (2017) 339-344. www.ijmttjournal.org/
2017/Volume-49/number-6/IJMTT-V49P554.pdf
[2492] U. M. Prajapati and R. M. Gajjar, Some labeling techniques of Kusudama flower
graph, Math. Today, 34(A) (2017) 211-217.
[2493] . U. M. Prajapati and S. J. Gaijjar, Some labeling techniques of braided star graph,
Internat. J. Math. Appl., 5(4-C) (2017) 361-369.
[2494] U. M. Prajapati and R. M. Gajjar, Cordiality in the context of duplication in helm
and closed helm, Internat. J. Math. Appl., 6(1-A) (2018) 139-145.
[2495] U. M. Prajapati and R. M. Gajjar, Some labeling techniques of boreale star graph,
Internat. J. Res. Analytical Reviews, 6(1) (2019) 668-671. https://ijrar.org/
papers/IJRAR19J2514.pdf
[2496] U. M. Prajapati and S. J. Gajjar, Prime labeling of generalized Petersen graph,
Internat. J. Math. Soft Comput., 5(1) (2015) 65-71.
[2497] U. M. Prajapati and S. J. Gajjar, Prime cordial labeling of generalized prism graph
Ym,n , Ultra Scientist, 27(3)A (2015) 189-204.
[2498] U. M. Prajapati and N. B. Patel, Edge product cordial labeling of some cycle
related graphs, Open J. Discrete Math., 6(6) (2016) 268-278. http://dx.doi.
org/10.4236/ojdm.2016.64023
[2499] U. M. Prajapati and N. B. Patel, Edge product cordial labeling of some graphs,
J. Appl. Math. Comput. Mech., 18(1) (2019) 69-76. http://amcm.pcz.pl/?id=
view&volume=18&issue=1&article=6
[2500] U. M. Prajapati and K. K. Raval, Product cordial labeling in context of some
one point union graphs, IJRAR- Internat. Res. Analytical Reviews, 5I(4) (2018)
490-495.

the electronic journal of combinatorics (2023), #DS6 555

[2501] U. M. Prajapati and K. K. Raval, Product cordial graph in the context of some
graph operations on gear graph, Open J. Discrete Math., 6 (2016) 259-267.
[2502] U. M. Prajapati and K. K. Raval, Some graphs in the context of product cor-
dial labeling, Math. Today, 33 (2017) 58-66. http://mathematicstoday.org/
archives/V33_2017_9.pdf
[2503] U. M. Prajapati and K. K. Raval, Vertex even and odd mean labeling in the
context of some cyclic snake graphs, Internat. J. Emerging Tech. Innovat, Res.,
5(7) (2018) 319-324. http://www.jetir.org/papers/JETIRC006365.pdf
[2504] U. Prajapati and K. Raval, Vertex odd and even mean labeling of triangular
snake, J. Appl. Sci. Computations, 5(12) (2018) 1273-1280. http://j-asc.com/
gallery/182-december-1554.pd
[2505] U. Prajapati and K. Raval, Several results of vertex even mean and ver-
tex odd mean graphs, Adv. Appl. Math. Sci., 19(4) (2020) 259-272.
https://www.researchgate.net/publication/357867081_Several_Results_
of_Vertex_Even_Mean_and_Vertex_Odd_Mean_Graphs
[2506] U. M. Prajapati and P. D. Shah, Some edge product cordial graphs in the context
of duplication of some graph elements, Open J. Discrete Math., 6 (2016) 248-258.
http://dx.doi.org/10.4236/ojdm.2016.64021
[2507] U. M. Prajapati and K. P. Shah, On odd prime labeling, IJRAR- Internat. J. Res.
Analy. Rev., 5(4) (2018) 2348-1269.
[2508] U. M. Prajapati and K. P. Shah, Odd prime labeling of graphs with duplication
of graph elements, JASC: J. Appl. Sci.Comp., V(XII) (2018) 1281-1288 http:
//j-asc.com/gallery/183-december-1553.pdf.
[2509] U. M. Prajapati and K. P. Shah, Prime labeling of graphs with duplication of
graph elements, JASC: J. Appl. Sci. Comput., V(XII) (2018) 1281-1288.
[2510] U. M. Prajapati and B. M. Suthar, Prime labeling in the context of duplication of
graph elements in K2,n , Internat. J. Math. Soft Comput., 7(1) (2017) 117-125.
[2511] U. M. Prajapati and A. V. Vantiya, SD-prime cordial labeling of some snake graphs,
JASC: J. Appl. Sci. Comput., VI(IV) (2019) 1857-1868.
[2512] U. M. Prajapati and A. V. Vantiya, SD-prime cordial labeling of K4 -
snake and related graphs, J. Xidian U., 14(4) (2020) 543-551. https:
//www.researchgate.net/publication/340600650_SD-Prime_Cordial_
Labeling_of_K4-Snake_and_Related_Graphs
[2513] U. Prajapati and A. V. Vantiya, SD-Prime cordial labeling of alternate k-polygonal
snake of various types, Proyecciones, 40(3) (2021) 619-634.
[2514] G. Prasad and G. U. Maheswari, Matrix coding technique on sunflower graphs
with edge product cordial labeling, IOP Conf. Series: Materials Sci. En-
gin., 872 (2020) 012004 1-11. https://www.researchgate.net/publication/
342502155_Matrix_Coding_Technique_on_Sunflower_Graphs_with_Edge_
Product_Cordial_Labeling

the electronic journal of combinatorics (2023), #DS6 556

[2515] R. V. Prasad, M. Kannan, and R. Gopi, Some results on even vertex odd mean
labeling graphs, Internat. J. Mechanical Enginer. Tech., (IJMET), 9(2) (2018)
615-621.
[2516] D. A. B. Prasetyo, Strong edge antimagic total labeling on multistar, J. Phys.:
Conf. Ser., (2021) 1778 012009 1-7. https://iopscience.iop.org/article/10.
1088/1742-6596/1778/1/012009/meta
[2517] D. Prathap and J. Baskar Babujee, Magic and bimagic labeling for star graphs,
Internat. Review Pure Appl. Math., 5 (2009) 67-76.
[2518] M. Prema and K. Murugan, Oblong sum labeling of some special graphs.
World Scientific News, 98 (2018) 12-22. http://www.worldscientificnews.com/
wp-content/uploads/2018/02/WSN-98-2018-12-22-1.pdf
[2519] B. N. G. Pricilla, A Study On New Classes Of Graphs In Variations Of Graceful
Graph, Ph.D. Thesis, Bharath University, Chennai, 2008. http://shodhganga.
inflibnet.ac.in/handle/1w0603/33
[2520] R. M. Prihandini and R. Adawiyah1, On super 3(n + 5, 2)-edge antimagic total
labeling and its application to construct Hill cipher algorithm, BAREKENG: J.
Math. Its Applications,17(1) (2023) 0029–0036. https://ojs3.unpatti.ac.id/
index.php/barekeng/article/view/6427/5506
[2521] R. M. Prihandini, Dafik, I. H. Agustin, R. Alfarisi, R. Adawiyah, and K.
A. Santoso, On super (a, d) − P2 . H antimagic total labeling of disjoint
union of comb product graphs, J. Physics Conf. Ser. 1211:012012 (2019)
https://www.researchgate.net/publication/332916076_On_super_ad-P_
2unicodex22B3H_antimagic_total_labeling_of_disjoint_union_of_comb_
product_graphs
[2522] V. Princy Kala, k-super cube root cube mean labeling of graphs, Proyecciones, (on
line), 40(5) (2021) 1097-1116.
[2523] V. Princy Kala, k-super cube root cube mean labeling of some corona graphs,
Proyecciones 41(4) (2022) 903-921. https://www.revistaproyecciones.cl/
index.php/proyecciones/article/view/5200/4093
[2524] J. Przybylo, Irregularity strength of regular graphs, Electron. J. Combin., 15(1)
(2008), P82, 10 pp.
[2525] J. Przybylo, Linear bound on the irregularity strength and the total vertex irreg-
ularity strength of graphs, SIAM J. Discrete Math., 23 (2009) 511-516.
[2526] J. Przybylo, Linear bound on the irregularity strength and the total vertex irreg-
ularity strength of graphs, SIAM J. Discrete Math., 23(1) (2008/09) 511-516.
[2527] J. Przybylo, Distant irregularity strength of graphs, Discrete Math., 313(24) (2013)
2875-2880.
[2528] Q. Pu, M. Numan, S. I. Butt, M. Asif, F. Rafique, and Z. Shao, Cyclic super
magic labelings for toroidal and Klein-bottle fullerene, IEEE Access, 7 (2019)
145928-145933,

the electronic journal of combinatorics (2023), #DS6 557

[2529] J.-F. Puget, Breaking symmetries in all different problems, in Proceedings of Sym-
Con04, the 4th International Workshop on Symmetry in Constraints, 2004, 6 pp.
[2530] D. A. Pujiwati, I. Halikin, and K. Wijaya, Odd harmonious labeling of two graphs
containing star, AIP Conference Proceedings 2326, 020019 (2021) 1-5. https:
//aip.scitation.org/doi/pdf/10.1063/5.0039644
[2531] N. Punnim and N. Pabhapote, On graceful graphs: cycles with a Pk -chord, k > 4,
Ars Combin., 23A (1987) 225-228.
[2532] C. Purcell, J. Ryan, Z. Ryjááček, and M. Skyvová, On exclusive sum la-
bellings of hypergraphs, Graphs and Combin., 38(2) (2022) DOI:10.1007/
s00373-021-02432-4
[2533] P. R. L. Pushpam and A. Saibulla, On super (a, d)-edge antimagic total labeling
of certain families of graphs, Discuss. Math. Graph Theory 32(3) (2012) 535-543.
[2534] A. Puthussery and G. Muneeswari (2021) Faulty node detection using vertex magic
total labelling, in distributed system. In: P. Karuppusamy, I. Perikos, F. Shi,
and T. N. Nguyen (eds) Sustainable Communication Networks and Application.
Lecture Notes on Data Engineering and Communications Technologies, Springer,
Singapore. 55 (23021 619-630.
https://doi.org/10.1007/978-981-15-8677-4_50
[2535] A. Pyatkin, New formula for the sum number for the complete bipartite graphs,
Discrete Math., 239 (2001) 155-160.
[2536] J. Quadras and S. Teresa Arockiamary, Total edge irregularity strength of hexag-
onal networks, J. Combin. Math. Combin. Comput., 92 (2015) 131-138.
[2537] J. Qian, On some conjectures and problems in graceful labelings graphs, unpub-
lished.
[2538] J. Radha, Y. Venkatesan, K. Vitaldas, and V. Perumal, Group {1, −1, i, −1}
cordial labeling in some classes of graphs, 5th International Conference on In-
telligent Computing: IConIC 2K22 25–26 March 2022, 2790(1) (2023) https:
//doi.org/10.1063/5.0152417
[2539] P. Ragukumara and G. Sethuraman, Binomial trees are graceful, AKCE Internat.
J. Graphs Combin., 1711 632-636.
[2540] A. Raheem, On super (a, d)-edge-antimagic total labeling of a subdivided stars,
Ars Combin., 136 (2018) 169-179.
[2541] A. Raheem and A. Q. Baig, Super edge-antimagicness of subdivided star trees,
Discuss. Math. Graph Th., 1 (2016) 27-33.
[2542] A. Raheem, M. Javaid, and A. Q. Baig, On super edge-antimagicness of subdivided
stars, Discuss. Math. Graph Th., 4 (2015) 663-673.
[2543] A. Raheem, M. Javaid, M. Numan, and R. Hasni, Sum divisor cordial labeling of
disjoint union of paths and subdivided star, J. Disc. Math. Sci. Crypt., (2021)
[2544] M. T. Rahim, K. Ali, Kashif and I. Javaid, On antimagic total labeling of some
families of graphs, Ars Combin., 95 (2010) 225-234.

the electronic journal of combinatorics (2023), #DS6 558

[2545] M. T. Rahim, M. Farooq, M. Ali, and S. Jan, Multi-level distance labelings for
generalized gear graphs Internat. J. Math. and Soft Comput., 2(1) (2012) 57-63.
[2546] M. T. Rahim and Slamin, Vertex-magic total labelings of the union of suns, Ars
Combin., 103 (2012) 305-310.
[2547] M. T. Rahim and Slamin, Most wheel related graphs are not vertex magic, Util.
Math., 77 (2008) 193-199.
[2548] M. T. Rahim and Slamin, Vertex-magic total labeling of the union of suns, Ars
Combin., 103 (2012) 305-310.
[2549] M. T. Rahim, I. Tomescu, and Slamin, On vertex-magic total labeling of some
wheel related graphs, Util. Math., 73 (2007) 97-104.
[2550] S. Rahmawati, K. A. Sugeng, D. R. Silaban, M. Miller, and M. Bača, Construction
of new larger (a, d)-edge antimagic vertex graphs by using adjacency matrices,
Austral. J. Combin., 56, (2013) 257-272.
[2551] C. D. Raj, C. Jayasekaran, and S. S. Sandhya, Few families of harmonic mean
graphs, J. Combin. Math. Combin. Comput., 96 (2016) 235-243.
[2552] P. L. R. Raj and S. Koilraj, Cordial labeling for the splitting graph of some
standard graphs, Internat. J. Math. Soft Comput., 1(1)(2011) 105-114. http:
//oaji.net/articles/2015/296-1433770428.pdf
[2553] P. L. R. Raj and R. Valli, Some new families of divisor cordial graphs, Internat. J.
Math. Trends Tech., 7 (2) (2014) 94-102. http://ijmttjournal.org/Volume-7/
number-2/IJMTT-V7P512.pdf
[2554] P. L. R. Raj and K. Vivek, Some new families of analytic mean graphs, Internat. J.
Anal. Exper. Modal Anal., VI(X) (2019) 358-361. https://www.researchgate.
net/publication/336847676_Some_New_Families_of_Analytic_Mean_Graphs
[2555] I. Rajasingh and P. R. L. Pushpam, Strongly harmonious labeling of helms, per-
sonal communication (circa 1996).
[2556] I. Rajasingh and P. R. L. Pushpam, On graceful and harmonious labelings of t
copies of Km,n and other special graphs, (circa 1996).
[2557] I. Rajasingh, B. Rajan, and V. Annamma, On total vertex irregularity strength of
triangle related graphs, Annals Pure Appl. Math., 1(2) (2012) 108-116.
[2558] I. Rajasingh and V. Annamma, Total vertex irregularity strength of 1-fault tolerant
hamiltonian graphs, Math. Comput. Sci., 9(2) (2015) 151-160.
[2559] I. Rajasingh, B. Rajan, and S. Teresa Arockiamary, Irregular total labeling of
butterfly and benes networks, In: Abd Manaf A., Sahibuddin S., Ahmad R., Mohd
Daud S., El-Qawasmeh E. (eds), Informatics Eng. Infor. Sci., ICIEIS 2011, Comm.
Comput. Information Sci., 253 (2011) Springer, Berlin, Heidelberg. https://doi.
org/10.1007/978-3-642-25462-8_25
[2560] I. Rajasingh and S. Teresa Arockiamary, Total edge irregularity strength of hon-
eycomb networks, Internat. J. Comput. and Applied Math., 8(3) (2013) 213-220.

the electronic journal of combinatorics (2023), #DS6 559

[2561] I. Rajasingh and S. Teresa Arockiamary, Total edge irregularity strength of series
parallel graphs, Internat. J. Pure Appl. Math., 99(1) (2015) 11-21.
[2562] T. J. Rajesh Kumar, A. S. Jerome,, and K. R. Santhosh Kumar, A note on Gaus-
sian total neighborhood prime labeling, Adv. Math.: Sci. J., 10(3) (2021) 1821-
1832.
[2563] T. J. Rajesh Kumar T.J. and T. K. Mathew Varkey, A note on total neighborhood
labelings, Internat. J. Pure and Appl. Math., 118(4) (2018) 1007-1013.
[2564] T. J. Rajesh Kumar and T. K. Mathew Varkey, Gaussian neighborhood-prime
labeling of some trees and other graphs, Annals Pure and Appl. Math., 16(1) (2018)
133-140. http://www.researchmathsci.org/APAMart/apam-v16n1-15.pdf
[2565] T. J. Rajesh Kumar and T. K. Mathew Varkey, A note on total neighborhood
labelings, Internat. J. Pure and Appl. Math., 118(4) (2018) 1007-1013. https:
//ijpam.eu/contents/2018-118-4/14/14.pdf
[2566] S. Rajkumar and M. Nalliah, On local edge antimagic chromatic number of graphs,
Proyecciones (Antofagasta) 41(6) (2022) 1397-1412.
doi:10.22199/issn.0717-6279-5339
[2567] S. Rajkumar, M. Nalliah, G. Uma Maheswari, Super (a, d) − G + e-antimagic
total labeling of Gu [Sn ], Proyecc. J. Math., 41(1) (2022) 249-262. https://www.
revistaproyecciones.cl/article/view/5014
[2568] S. Rajkumar, M. Nalliah, and M. Venkataraman, Note on super (a, 1)-P3 -antimagic
total labeling of star Sn , Ural Math. J. 7(2) (2022) 86-93. https://umj.uran.ru/
index.php/umj/article/view/357/pdf
[2569] V. Ramachandran and C. Sekar, One modulo N gracefulness of acyclic graphs,Ultra
Scientist, 25(3)A (2013) 417-424.
[2570] V. Ramachandran and C. Sekar, One modulo N gracefulness of splitting graphs
and subdivision of double triangle graphs, Scientia 125 (2014) 1-9.
[2571] V. Ramachandran and C. Sekar, One modulo N gracefulness of arbitrary super-
subdivisions of graphs, Internat. J. Math. Combin., 2 (2014) 36-46.
[2572] V. Ramachandran and C. Sekar, Gracefulness and one modulo N gracefulness of
Ln ⊗ Sm , Scientia Magna, 10(3) (2014) 66-76.
[2573] V. Ramachandran and C. Sekar, One modulo N gracefulness of regu-
lar bamboo tree and coconut tree, Internat. J. Appl. Graph Theory Wire-
less ad hoc Networks Sensor Networks, (GRAPH-HOC) 6(2) (2014) 1-10.
doi:10.5121/jgraphoc.2014.6201
[2574] V. Ramachandran and C. Sekar, Graceful labelling of supersubdivision of ladder,
Internat. J. Math. Appl., 2(2) (2014) 29-36.
[2575] V. Ramachandran and C. Sekar, One modulo N gracefulness of crowns, armed
crowns and chain of even cycles, Ars Combin., 138 (2018) 143-159.
[2576] K. Ramanjaneyulu, V. C. Venkaiah, and K. Kothapalli, Cordial labelings of a class
of planar graphs AKCE J. Graphs Combin., 6 (2009) 171-181.

the electronic journal of combinatorics (2023), #DS6 560

[2577] J. L. Ramı́rez-Alfonsı́n, Gracefulness of replicated paths and cycles, Ars Combin.,
53 (1999) 257-269.
[2578] R. Ramdani and A. N. M. Salman, On the total irregularity strength of some
Cartesian product graphs, AKCE Int. J. Graphs Comb., 10(2) (2013) 199-209.
[2579] R. Ramdani, A. N. M. Salman, and H. Assiyatun, On the total irregularity strength
of regular graphs, J. Math. Fundam. Sci., 47(3) (2015) 281-295.
[2580] R. Ramdani, A. N. M. Salman, H. Assiyatun, A. Semaničová-Feňovčı́ková, and
Bača, Total irregularity strength of three families of graphs, Math. Comput. Sci.,
9(2) (2015) 229-237.
[2581] D. Indriati, Widodo, I. E. Wijayanti, and K. A. Sugeng, On total irregular-
ity strength of star graphs, double-stars, and caterpillar, AIP Confer. Proceed.,
1707(1) (2016) 020008(1)-020008(6).
[2582] R. Ramdani, A, N. M. Salman, A. Assiyatum, and A. Semaničová-Feňovčı́ková, On
the total irrgularity strenght of disjoint union of graphs, Math. Reports, 18(68)(4)
(2016) 469-482.
[2583] V. Ramachandran and C. Sekar, One modulo N gracefulness of n-polygonal snakes,
(t)
Cn and Pa,b , Internat. J. Engineering Res. & Tech., (IJERT) 2(10) (2013) 3514-
3529.
[2584] D. Ramya and P. Jeyanthi, Mean labeling of some graphs, SUT J. Math., 47(2)
(2011) 129-141.
[2585] D. Ramya and P. Jeyanthi, New super mean graphs, J. Disc. Math. Sci. Cryptogr.,
17(5-6) (2014) 395-418.
[2586] D. Ramya, R. Kalaiyarasi and P. Jeyanthi, Skolem odd difference mean graphs, J.
Algor. and Comput., 45 (2014) 1-20.
[2587] D. Ramya, R. Ponraj, and P. Jeyanthi, Super mean labeling of graphs, Ars Com-
bin., 112 (2013) 65-72.
[2588] D. Ramya, M. Selvi, and P. Jeyanthi, Odd mean labeling of some trees, Util. Math.,
106 (2018) 65-78.
[2589] D. Ramya, M. Selvi and P. Jeyanthi, Odd mean labeling of some graphs, preprint.
[2590] M. Ramya and S. Meenakshi, Labeling techniques of some special graphs, Inter-
nat. J. Pure Appl. Math., 116(24) (2017) 93 –102. https://acadpubl.eu/jsi/
2017-116-23-24/articles/24/10.pdf
[2591] V. Jeba Rani, S. Sunder Raj, and T. Shyla Isaac Mary, Vertex polynomial of ladder
graphs, Infokara Research, 8(11) 2019) 169-176.
[2592] S. B. Rao, Sigma graphs: A survey, in Labeling of Discrete Structures and Appli-
cations, Narosa Publishing House, New Delhi, 2008, 135-140.
[2593] S. B. Rao and U. K. Sahoo, Embeddings in Eulerian graceful graphs, Australasian
J. Comb., 62(1) (2015) 128-139.

the electronic journal of combinatorics (2023), #DS6 561

[2594] S. B. Rao, T. Singh, and V. Parameswaran, Some sigma labelled graphs:I, Graphs,
Combinatorics, Algorithms and Applications, S. Armugam, B. D. Acharya and S.
B. Rao, eds., (2004), 125-133, Narosa Publishing House, New Delhi.
[2595] S. N. Rao, Prime labelling, In: R. C. Bose Centenary Symposium on Discrete
Math. and Applications, Kolkata (2002).
[2596] L. Ratnasari and Y. Susanti, Total edge irregularity strength of ladder-related
graphs, Asian-Eur. J. Math., 13(4) (2020), no. 2050072, 16 pp.
[2597] K. K. Raval and U. M. Prajapati, Vertex even and odd mean labeling in the
context of some cyclic snake graphs, J. Emerging Tech. Innovative Res. (JETIR),
4(6) (2017) 319-324. https://www.jetir.org/papers/JETIRC006365.pdf
[2598] K. K. Raval and M. Prajapati, Signed product cordial labelings of some fractal
graphs, Gradiva Review J. 8(11) 2022 537-546. https://www.researchgate.
net/publication/368273533_SIGNED_PRODUCT_CORDIAL_LABELING_OF_SOME_
FRACTAL_GRAPHS
[2599] N. B. Rathod and K. K. Kanani, Some path related 4-cordial graphs, Internat. J.
Math. and Soft Computing, 5(2) (2015) 21-27.
[2600] N. B. Rathod and K. K. Kanani, V4 -cordial labeling of quadrilateral
snakes,Internat. J. Emerging Tech. Appl. Eng., Tech., Sci.,9 (2016) 45-51.
[2601] N. B. Rathod and K. K. Kanani, On V4 -cordial labeling of graphs, British J. Math.
Comput Sci., 13(4) (2016) 1-15.
[2602] N. B. Rathod and K. K. Kanani, 4-cordial labeling of star, book and fan related
graphs, Proceedings of 8th National Level Science Symposium, Rajkot, India, 2
(2015) 38-42.
[2603] N. B. Rathod and K. K. Kanani, 5-cordial labeling of some standard graphs, Pro-
ceedings of 8th National Level Science Symposium, Rajkot, India, 2 (2015) 43-48.
[2604] N. B. Rathod and K. K. Kanani, 4-cordiality of some new path related graphs,
Internat. J. Math. Trends Techno. (IJMTT) 34(1) (2016) 5-8.
[2605] N. B. Rathod and K. K. Kanani, V4 -cordial labeling of some alternate triangu-
lar snake related graphs, 9th National Level Science Symposium. February 14,
2016, Organized by Christ College, Rajkot, Sponsored by GUJCOST, Gandhina-
gar, Mathematics & Statistics, 3 (2016) 188-196.
[2606] J. Ratilal and P. Parmar, Hk -Cordial labeling of some snake graphs, J. Xid-
ian Univ., 14(3) (2020) 844-858. https://www.researchgate.net/publication/
340115606_HK_Cordial_labeling_of_Some_Snake_Graphs/references
[2607] L. Ratnasari1, S. Wahyuni1, Y. Susanti1, and D. J. E. Palupi1, Total edge irregu-
larity strength of quadruplet and quintuplet book graphs, ITM Web of Conferences
36, 03004 ICMSA 2020 (2021) 1-10.
[2608] M. A. Razzaq, S. T. Rizvi, and K. Ali, H-group magic total labelings of families
of fan graphs, Util. Math., 108 (2018) 213-219.

the electronic journal of combinatorics (2023), #DS6 562

[2609] K. A. Reddy and S. Sharief Basha, New classes of reverse super edge magic graphs,
AIMS Math., 7(3) (2022) 3590-3602. http://www.aimspress.com/article/doi/
10.3934/math.2022198
[2610] T. A. Redl, Graceful graphs and graceful labelings: two mathematical program-
ming formulations and some other new results, Congressus Numer., 164 (2003)
17-32.
[2611] M. Reid, personal communication (1992).
[2612] M. Regees, Super edge trimagic total labeling of some star type graphs, J. Discrete
Math. Sci. Cryptogr., 20(3) (2017) 747-754.
[2613] M. Regees and C. Jayasekaran, Super edge trimagic total labeling of generalized
prism and web graphs, J. Discrete Math. Sci. Cryptogr., 19(1) (2016) 81-92.
[2614] J. Renuka, P. Balaganesan, P. Selvaraju, On harmonious labeling, Internat. J.
Advance in Math. Math. Sci., 1(2) (2012) 65-70.
[2615] J. Renuka and B. Palanivelu, Odd harmonious and strongly odd harmonious la-
beling of some classes of graphs, Indian J. Public Health Res. Devel., 9(9) (2018)
399.
[2616] N. Revathi, Mean labeling of some graphs, Internat. J. Sci. Res. (IJSR), 4(10)
(2015) 1921-1923. https://www.ijsr.net/archive/v4i10/23101501.pdf
[2617] N. Revathi, Vertex odd mean and even mean labeling of some graphs, IOSR J.
Math., 11(2) (2015) 70-74. https://www.iosrjournals.org/iosr-jm/papers/
Vol11-issue2/Version-4/J011247074.pdf
[2618] R. Revathi, A. Dharmakkan, and R. M. Jeya Jothi, MMD labeling of com-
plete tripartite graphs, J. Physics Confer. Ser., (2010) 1770(1):012083. https:
//iopscience.iop.org/article/10.1088/1742-6596/1770/1/012083/pdf
[2619] R. Revathi and R. Rajeswari, On modular multiplicative divisor graphs, in
IEEE Proceed. Internat. Conf. Pattern Recognition, Informatics Mobile Engin.,
(PRIME), 2013.
[2620] R. Revathi and R. Mary Jeya Jothi, MMD labeling of butterfly networks, Proceed.
2018 IEEE Internat. Conf. Current Trends toward Converging Tech., Coimbatore,
India
[2621] R. Revathi and R. Rajeswari, Modular multiplicative divisor labeling of some
path related graphs, Indian J. Sci. Technol., 7(12) (2014) 1967-1972. https:
//i-scholar.in/index.php/indjst/article/view/59430/50407
[2622] A. Riasat, S. Kanwal, and S. Javed, On odd-graceful labeling of disjoint union of
graphs, Util. Math., 101 (2016) 189-214.
[2623] P. Richter, E. Leven, A. Tran, B. Ek, J. Jacob, and D. A. Narayan, Rank numbers
for bent ladders, Discuss. Math. Graph Th. 34(2) (2014) 309-329.
[2624] N. M. Rilwan and R. Radha, Edge vertex prime labeling of Cayley (di)graphs,
Malaya J. Mat., 8(2) (2020) 531-535. https://www.researchgate.net/
publication/341936051_Edge_vertex_prime_labeling_of_Cayley_digraphs

the electronic journal of combinatorics (2023), #DS6 563

[2625] G. Ringel, Problem 25, in Theory of Graphs and its Applications, Proc. Symposium
Smolenice 1963, Prague (1964) 162.
[2626] G. Ringel and A. Llado, Another tree conjecture, Bull. Inst. Combin. Appl., 18
(1996) 83-85.
[2627] G. Ringel, A. Llado, and O. Serra, Decomposition of complete bipartite graphs
into trees, DMAT Research Report 11/96, Univ. Politecnica de Catalunya.
[2628] A. Riskin, Cordial deficiency, Bull. Malays. Math. Sci. Soc., 30 (2007) 201-204.
arXiv:math/0610760v1 [math.CO] 25 Oct 2006.
[2629] A. Riskin, On the cordial deficiency of complete multipartite graphs,
arXiv:0706.2431v1 [math. CO] 16 June 2007.
[2630] A. Riskin, Z22 -cordiality of Kn and Km,n , arXiv:0709.0290v1 [math.CO] 3 Sep.
2007.
[2631] A. Riskin and G. Weidman, On edge graceful labelings of disjoint unions of
2r-regular edge graceful graphs, Bull. Inst. Combin. Appl., 52 (2008) 45-50.
arXiv:math/0605234v1.
[2632] R. Ristiawan, Graf pendulum dengan pelabelan graceful super Fibonacci, Faktor
Exacta, 12(1) (2019) 51-57. https://journal.lppmunindra.ac.id/index.php/
Faktor_Exacta/article/view/3365/2492
[2633] S. T. R. Rizvi, K. Ali, and M. Hussain, Cycle-supermagic labelings of the disjoint
union of graphs, Util. Math., 104 (2017) 215-226. arXiv:1506.06087.
[2634] S. T. R. Rizvi, K. Ali, N. Iqbal, and A. Gulraze, Super edge-magicness of stars like
graphs, Ars Combin., 136 (2018) 405-417.
[2635] S. T. R. Rizvi, M. Khalid, K. Ali, M. Miller, and J. Ryan, On cycle-supermagicness
of subdivided graphs, Bull. Aust. Math. Soc., 92(1) (2015)11-18.
[2636] L. Robertson and B. Small, On Newman’s conjecture and prime trees, Integers:
The Elect. J. Combin. Number Theory, 9 (2009) A10 112-128.
[2637] E. Robeva, An Extensive Survey of Graceful Trees, Undergraduate Honors Thesis,
Stanford University, 2011.
[2638] Y. Roditty and T. Bachar, A note on edge-magic cycles, Bull. Inst. Combin. Appl.,
29 (2000) 94-96.
[2639] R. I. Rofa, A functional definition of graceful labelling of rooted symmetric trees,
arXiv:2109.09511.
[2640] R. Rofa, Graceful and strongly graceful permutations. arXiv:2107.14007.
[2641] R. I. Rofa, On number representation, arXiv:1310.8277.
[2642] D. G. Rogers, A graceful algorithm, Southeast Asian Bull. Math., 2 (1978) 42-44.
[2643] A. H. Rokad, 3-Equitable labeling in context of ring sum of graphs Research &
Reviews: Discrete Math. Structures: Open Journal Systems, 2(3) (2015) 6272-
6275.

the electronic journal of combinatorics (2023), #DS6 564

[2644] A. H. Rokad, Product cordial labeling of double wheel and double fan related
graphs, Kragujevac J. Math., 43(1) (2019) 7-13. http://elib.mi.sanu.ac.rs/
files/journals/kjm/55/kjmn55p7-13.pdf
[2645] A. H. Rokad and K. M. Patadiya, Cordial labeing of some graphs, Aryabhatta J.
Math. Informatics, 09 (01) (2017) 589-597.
[2646] Q. Rong and D. Xiong, The gracefulness of graph P2r,b , J. Systems Sci. Math. Sci.,
30(5) (2010) 703-709.
[2647] D. Ropp, Graceful labelings of cycles and prisms with pendant points, Congress.
Numer., 75 (1990) 218-234.
[2648] A. Rosa, On certain valuations of the vertices of a graph, Theory of Graphs (Inter-
nat. Symposium, Rome, July 1966), Gordon and Breach, N. Y. and Dunod Paris
(1967) 349-355. https://www.researchgate.net/publication/244474213_On_
certain_valuations_of_the_vertices_of_a_graph
[2649] A. Rosa, Labelling snakes, Ars Combin., 3 (1977) 67-74.
[2650] A. Rosa, Cyclic Steiner triple systems and labelings of triangular cacti, Scientia,
1 (1988) 87-95.
[2651] A. Rosa and J. Širáň, Bipartite labelings of trees and the gracesize, J. Graph
Theory, 19 (1995) 201-215.
[2652] T. Rose and H.-H. Su, An algorithm to calculate the balance index set of a graph,
Proceedings of the Forty-Third Southeastern International Conference on Combi-
natorics, Graph Theory and Computing. Congr. Numer., 213 (2012) 107-121.
[2653] M. Roswitha, E.T. Baskoro, T. K. Maryati, N. A. Kurdhi, and I. Susanti, Further
results on cycle-supermagic labeling, AKCE Int. J. Graphs Comb., 10(2) (2013)
211-220.
[2654] M. Roswitha and E.T. Baskoro, H-magic covering of some classes of graphs, AIP
Conf. Proc. on ICREM5, ITB Bandung, 1450 (2012) 135-138.
[2655] M. Roswitha, T. S. Martini, and S. A. Nugroho, (a, d)−H-Anti magic total labeling
on double cones graph, ICMETA 2018 IOP Conf. Series: J. Physics: Conf. Series
1306 (2019) 012012 1-5.
[2656] I. Rosyida and D. Indriati, On total edge irregularity strength of some cactus
chain graphs with pendant vertices, IOP Conf. Series: J. Physics: Conf. Series
1211 (2019) 012016. doi:10.1088/1742-6596/1211/1/012016
[2657] I. Rosyida and D. Indriati, Computing total edge irregularity strength of
some n-uniform cactus chain graphs and related chain graphs, Indon. J. Com-
bin., 4(1) (2020) 53-75. https://www.researchgate.net/publication/
342523731_Computing_total_edge_irregularity_strength_of_some_
n-uniform_cactus_chain_graphs_and_related_chain_graphs/comments#
fullTextFileContent
[2658] I. Rosyida, E. Ningrum, Mulyono, and D. Indriati, On the total edge irregularity
strength of general uniform cactus chain graphs with pendant vertices, J. Dis-

the electronic journal of combinatorics (2023), #DS6 565

 crete Math. Sci. Crypt., (2020) 23(6) 1335-1358. DOI:10.1080/09720529.2020.
1820704
[2659] P. L. Rozario Raj and M. M. Sheriff, Some more results on neighbourhood-
prime labeling of graphs, Internat. J. Anal. Exper. Modal Anal., XI(X) Iss
(2019) 38-43. https://www.researchgate.net/publication/336847767_Some_
More_Results_on_Neighbourhood-Prime_Labeling_of_Graphs
[2660] J. Ryan, Exclusive sum labelings of graphs: A survey, AKCE J. Graphs Combin.,
6 (2009) 113-126.
[2661] J. Ryan, O. Phanalasy, M. Miller and L. Rylands, On antimagic labeling for gen-
eralized web and flower graphs, In C. S. Iliopoulos and W. F. Smyth, editors,
Proceed. IWOCA10, Lecture Notes in Computer Science, 6460 (2011) 303-313.
[2662] J. Ryan, O. Phanalasy, L. Rylands and M. Miller, On antimagic labeling for gen-
eralized web and flower graphs, Combinatorial algorithms, 303-313, Lecture Notes
in Comput. Sci., 6460, Springer, Heidelberg, 2011.
[2663] L. Rylands, O. Phanalasy, J. Ryan and M. Miller, Construction for antimagic
generalized web graphs, Int. J. Graphs and Combinatorics, 8 (2011) 141-149.
[2664] K. M. Sabeel, A. V. Prajeesh, and K. Paramasivam, A characterization for V4 -
vertex magicness of trees with diameter 5, In Computat. Sci. - Modelling, Comput.
Soft Comput., Springer, (2021) 243-249.
[2665] K. M. Sabeel, K. Paramasivam, A. V. Prajeesh, N. Kamatchi, and S. Arumugam,
A characterization of group vertex magic trees of diameter up to 5, Australas. J.
Combin., 85 (2023) 49-60.
[2666] L. Saha and A. R. Basunia, Radio graceful labelling of graphs, Theory Appl.
Graphs, 7(1) (2020), Art. 7, 8 pp.
https://digitalcommons.georgiasouthern.edu/cgi/viewcontent.cgi?
article=1106&context=tag
[2667] L. Saha and P. Panigrahi, Antipodal number of some powers of cycles, Discrete
Math., 312(9) (2012) 1550-1557.
[2668] L. Saha and P. Panigrahi, A graph radio k-coloring algorithm, Combin. Al-
gorithms, (IWOCA 2012): Lecture Notes in Comput. Sci., Springer, Berlin,
Germany, 7643, 2012. https://link.springer.com/content/pdf/10.1007/
978-3-642-35926-2_15.pdf
[2669] L. Saha and P. Panigrahi, On the radio number of toroidal grids, Australasian J.
Combin., 55 (2013) 273-288. https://ajc.maths.uq.edu.au/pdf/55/ajc_v55_
p273.pdf
[2670] L. Saha and P. Panigrahi, On the radio number of square of graphs, The Eighth
International Workshop on Graph Labelings (IWOGL 2014), 205-212, Electron.
Notes Discrete Math., 48, Elsevier Sci. B. V., Amsterdam, 2015. http://dx.doi.
org/10.1016/j.endm.2015.05.030

the electronic journal of combinatorics (2023), #DS6 566

[2671] L. Saha and P. Panigrahi, A new graph radio k-coloring algorithm,
Disc. Math., Algor. and Appl., 11(1) Article ID 1950005, p. 10, 2019.
https://www.researchgate.net/publication/328807166_A_New_Graph_
Radio_k_-coloring_Algorithm
[2672] A. R. Sahaya, P. Maya, and T. Nicholas, Product integer cordial labeling of some
well known graphs, J. Emerging Tech. Innovative Res., 05(11) (2018) 132-138.
https://www.jetir.org/papers/JETIR1811022.pdf
[2673] F. Salama, Computing the total edge irregularity strength for quintet snake graph
and related graphs, J. Discrete Math. Sci. Crypt., (2021)
[2674] M. Salarrezaei, Mathematical programming models for graceful labeling problem of
2-regular graphs. Master of Science thesis, Sharif University of Technology (2012).
[2675] E. Salehi, Zero-sum magic graphs and their null sets, Ars Combin., 82 (2007)
41-53.
[2676] E. Salehi, PC-labelings of a graphs and its PC-sets, Bull. Inst. Combin. Appl., 58
(2010) 112-121.
[2677] E. Salehi and D. Bayot, The friendly index set of Pm × Pn , Util. Math., 81 (2010)
121-130.
[2678] E. Salehi and P. Bennett, On integer-magic spectra of caterpillars, J. Combin.
Math. Combin. Comput., 61 (2007) 65-71.
[2679] E. Salehi, S. Churchman, T. Hill, and J. Jordan, Product cordial sets of trees,
Congr. Numer., 220 (2014) 183-193.
[2680] E. Salehi and S. De, On a conjecture concerning the friendly index sets of trees,
Ars Combin., 90 (2009) 371-381.
[2681] E. Salehi and S.-M. Lee, On friendly index sets of trees, Cong. Numer., 178 (2006)
173-183.
[2682] E. Salehi and S. M. Lee, Integer-magic spectra of functional extensions of graphs,
J. Combin. Math. Combin. Comput., 64 (2008) 127-139.
[2683] E. Salehi, S. M. Lee, and M. Khatirinejad, IC-colorings and IC-indices of graphs,
Discrete Math., 299 (2005) 297-310.
[2684] E. Salehi and D. McGinn, On friendly index set of hypercube Qn , J. Combin.
Math. Combin. Comput., 106 (2018) 109-124.
[2685] E. Salehi and Y. Mukhin, Product cordial sets of long grids, Ars Combin., 107
(2012) 339-351.
[2686] E. Salehi, Y. Mukhin, and S. W. Saputro, Cordial sets of hypercubes, Bull. Instit.
Combin. Appl., 75 (2015) 95-106.
[2687] A. N. M. Salman and T. K. Maryati, On graph-(super)magic labeling of a path-
amalgamation of isomorphic graphs, in: The Proceedings of the 6th IMT-GT
International Conference on Mathematics, Statistics and its Applications, 2010,
228-233.

the electronic journal of combinatorics (2023), #DS6 567

[2688] A. N. M. Salman, A. A. G. Ngurah, and N. Izzati, On (super) edge-magic total
labelings of a subdivision of a star Sn , Util. Math., 81 (2010) 275-284.
[2689] H. Salmasian, A result on prime labelings of trees, Bull. Inst. Combin. Appl., 28
(2000) 36-38.
[2690] S. K. O. D. Samarathunge, A. M. U. M. Athapattu, and A. A. I. Perera, Charac-
terization of E-super vertex magic labelling of odd order binary trees, Ceylon J.
Sci., 51(4) (2022) 389-393. http://doi.org/10.4038/cjs.v51i4.8056
[2691] R. K. Sampath, G. Narasimhan, and K. M. Nagaraja, Heron mean labelling of
graphs, Internat. J. Recent Sci. Res., 8(9) (2017) 19808-19811.
[2692] E. Samuvel and S. Kalaivani, Square sum labeling for some lilly related graph,
Internat. J. Adv. Tech. Exploration, 4(29) online, (2017) 68-72. https://www.
accentsjournals.org/PaperDirectory/Journal/IJATEE/2017/4/3.pdf
[2693] Ľ. Šándorová and M.Trenklér, On a generalization of magic graphs, Colloquia
Math. Societatis J.Bolyai, 52 Combinatorics, North-Holland, Amsterdam 1988,
447-452.
[2694] Y. Sanaka, On γ- labelings of complete bipartite graphs, Ars Combin., 111 (2013)
251-256.
[2695] S. Saduakdee and K. Khemmani, The unique γ-min labelings of graphs, Thai J.
Math., 2018, Special issue, 187-203.
[2696] M. Santhi and J. Albert, Signed product cordial labeling and signed total product
cordial labeling for some new graphs, IMPACT: International J. Res. Appl., Nat.
Social Sci., 3(1) (2015) 133-138.
[2697] S. S. Sandhya, E. R. Merly, and B. Shiny, Subdivision of super geometric mean
labeling for quadrilateral snake graphs, Internat. J. Math. Trends Tech., 24(1)
(2015) 1-16.
[2698] S. S. Sandhya, E. R. Merly, and B. Shiny, Super geometric mean labeling on double
quadrilateral snake graphs, Asian Pacific J. Res., 1 (XXI) (2015) 128-135.
[2699] S. S. Sandhya, E. R. Merly, and B. Shiny, New classes of super geometric mean
graphs, J. Discrete Math. Sci. Cryptogr., 19(1) (2016) 117-140.
[2700] S. S. Sandhya, S. Somasundaram, and S. Anusa, Root square mean labeling of
graphs, Internat. J. Contemp. Math. Sci., 914 (2014) 667-676.
[2701] S. S. Sandhya, S. Somasundaram, and S. Anusa, Some more results on root square
mean graphs, J. Math. Res., 7(1) (2015) 72-81, 2015. https://www.ccsenet.org/
journal/index.php/jmr/article/view/41459
[2702] S. S. Sandhya, S. Somasundaram, and R. Ponraj, Some more results on harmonic
mean graphs, J. Math. Res., 4(1) (2012) 21-29.
[2703] S. S. Sandhya, S. Somasundaram, and R. Ponraj, Harmonic mean labeling
of some cycle related graphs. Int. J. Math. Anal., (Ruse) 6(37-40) (2012)
1997-2005. http://www.m-hikari.com/ijma/ijma-2012/ijma-37-40-2012/
sandhyaIJMA37-40-2012.pdf

the electronic journal of combinatorics (2023), #DS6 568

[2704] S. S. Sandhya, S. Somasundaram, R. Ponraj, Some results on harmonic mean
graphs, Int. J. Contemp. Math. Sci., 7 (2012) 197-208.
[2705] I. P. Sandy, A. Rizal, E. N. Manurung, and K. A. Sugeng, Alternative construction
of graceful symmetric trees, J. Phys.: Conf. Ser., 1008 (2018) 012031
[2706] A. P. Sangeeta, Analyzing the applications of graph theory in communica-
tion networks through the divisor 3-equitable labeling of graphs. In: D. Singh,
R. K. Chaudhary, and K. Dev Kumar,(eds) Computer Aided Constellation
Management and Communication Satellites. Lecture Notes in Electrical Engi-
neering, Springer, Singapore, 987, (2023) 105-112. https://doi.org/10.1007/
978-981-19-8555-3_12
[2707] A. Sangeeta, R. Parthiban, and P. Selvaraju, 3-equitable and prime
labeling of some classes of graphs, Math. Stat., 11(3) (2023) 534-
540. https://www.researchgate.net/publication/370598062_3-Equitable_
and_Prime_Labeling_of_Some_Classes_of_Graphs
[2708] S. Sangeetha and U. Usharani, Relaxed mean labeling of some corona graphs, AIP
Confer. Proceed., (2019) 2112, 020067 (2019) https://aip.scitation.org/doi/
pdf/10.1063/1.5112252
[2709] K. Sankar and G. Sethuramam, Graceful and cordial labeling of subdivision of
graphs, Electronic Notes Discrete Math., 53 (2016) 123-131.
[2710] G. Santhosh, Sequential coronations of graphs, Natl. Acad. Sci. Lett., 28 (2005)
269-270.
[2711] G. Santhosh and G. Suresh Singh, A note on the super edge-magic deficiency of
graphs, Far East J. Appl. Math. 24 (2006) 233-242.
[2712] G. Santhosh and G. Suresh Singh, On super magic strength of graphs, Far East J.
Appl. Math., 18 (2005) 199-207.
[2713] G. Santhosh, On weak magic graphs, Ars Combin., 92 (2009) 245-254.
[2714] G. Santhosh and G. Suresh Singh, A note on subdivision of integral sum graphs,
unpublished.
[2715] G. Santhosh and G. Suresh Singh, On divisor graphs, unpublished.
[2716] G. A. Saputri, K. A. Sugeng, and D. Fronček, The odd harmonious labeling
of dumbbell and generalized prism graphs, AKCE Int. J. Graphs Comb., 10(2)
(2013) 221-228. https://www.tandfonline.com/doi/pdf/10.1080/09728600.
2013.12088738?needAccess=true
[2717] P. B. Sarasija and R. Binthiya, Even harmonious graphs with applications, Inter-
nat. J. Comput. Sci. Infor. Security, 9 (2011) 161-163.
[2718] T. V. Sateesh Kumar and S. Meenakshi, Lucky and proper lucky labeling of quadri-
lateral snake graphs, IOP Conf. Ser.: Material Sci. Engin., 1085 (2021) 012039
doi:10.1088/1757-899X/1085/1/012039
[2719] T. V. Sateesh Kumar and S. Meenakshi, Proper lucky labeling of graph, S.-L.
Peng et al. (eds.), Proceed. First Internat. Conf. Math. Modeling Comput. Sci.,

the electronic journal of combinatorics (2023), #DS6 569

 Adv. Intell. Sys. Comput., 1292 (2021) 341-351. https://doi.org/10.1007/
978-981-33-4389-4_31
[2720] A. A. Sathakathullaa, M. Akrama, M. and P. G. Rajeswari, Cordial, total
cordial, edge cordial, total edge cordial labeling of some box type fractal graphs,
Internat. J. Algebra Stat., 1(2) (2012) 99-106. https://www.researchgate.net/
publication/258257334_On_cordial_Total_cordial_Edge_cordial_Total_
Edge_cordial_labeling_of_some_box_type_fractal_graphs
[2721] A. A. Sathakathulla, A. A. and P. G. Rajeswari, Edge cordial, total edge
cordial labeling of some ladder type fractal graphs, Internat. J. Applied Sci.
Eng. Res., 1 (6) (2012) 793-801. https://www.researchgate.net/publication/
272796839_Edge_Cordial_Total_Edge_Cordial_Labeling_Of_Some_Ladder_
Type_Fractal_Graphs
[2722] G. Sathiamoorthy, C. Natarajan, S. K. Ayyaswamy, and T. N.
Janakiraman, Graceful labeling of splitting graph of a caterpillar,
Internat. J. Mech. Engin. Tech., (IJMET) 8(11) (2017) 663-667.
[2723] G. Sathiamoorthy, Graceful labeling of nova cloud, Internat. J. Mech. Engin. Tech.,
(IJMET) 8(11) (2017) 1-9.
[2724] S. Sathish Narayanan and M. Vijayaragavan, Some 3-divisor cordial graphs derived
from path, Jordan J. Math. and Stat., (JJMS) 14(2) (2021) 335-350. https://
journals.yu.edu.jo/jjms/Issues/Vol14No22021PDF/9.pdf
[2725] K. Schaffer and S. M. Lee, Edge-graceful and edge-magic labelings of Cartesian
products of graphs, Congr. Numer., 141 (1999) 119-134.
[2726] S. A. Schluchter, J. Z. Schroeder, K. Cokus, R. Ellingson, H. Harris, E. Rarity, and
T. Wilson, Prime labelings of generalized Petersen graphs, Involve, 10(1) (2017)
109-124.
[2727] S.A. Schluchter, and T. Wilson, Prime labelings of bipartite generalized Pe-
tersen graphs and other prime cubic bipartite graphs, Congr. Numer., 226 (2016)
227–241.
[2728] J. Z. Schroeder, Every cubic bipartite graph has a prime labeling except K3,3 ,
Graphs Combin., 35(1) (2019) 119-140.
[2729] J. Z. Schroeder, J. Combin., A 2-regular graph has a prime labeling if and only if
it has at most one odd component. 12(3) (2021) 379-388.
[2730] J. Z. Schroeder, J. Combin., A 2-regular graph has a prime labeling if and only if
it has at most one odd component, erratum, to appear.
[2731] R. Sebastian and K. A. Germina, Square sum labeling of class of planar graphs,
Proyecciones, 34(1) (2015) 55-68.
[2732] J. Sedláček, Problem 27, in Theory of Graphs and its Applications, Proc. Sympo-
sium Smolenice, June, (1963) 163-167.
[2733] J. Sedláček, On magic graphs, Math. Slov., 26 (1976) 329-335.

the electronic journal of combinatorics (2023), #DS6 570

[2734] M. Seenivasan and A. Lourdusamy, Absolutely harmonious labeling of graphs,
Internat. J. Math. Combin., 2 (2011) 40-51.
[2735] A. Sehgal, N. Takshak, P. Maan, and A. Malik, Graceful labeling of power graph
of group Z2k−1 × Z4 , Asian-European J. Math. (2021)
[2736] C. Sekar, Studies in Graph Theory, Ph. D. Thesis, Madurai Kamaraj University,
2002.
[2737] C. Sekar and V. Ramachandren, Graceful labelling of arbitrary supersubdivision
of disconnected graph, Ultra Scientist, 25(2)A (2013) 315-318.
[2738] A. Sekar and R. Varatharajaperumal, E-super arithmetic graceful labelling of some
standard classes of cubic graphs related to cycles, Bull. Int. Math. Virtual Inst.,
12(2) (2022) 353-367. http://fs.unm.edu/IJMC/ESuperArithmeticGraceful.
pdf
[2739] P. Selvaraju, New classes of graphs with α-valuation, harmonious and cordial la-
belings, Ph. D. Thesis, Anna University, 2001. Madurai Kamaraj University, 2002.
[2740] P. Selvaraju, P. Balaganesan, and J. Renuka, Odd harmonious labeling of some
path related graphs, Internat. J. Math. Sci. Engg. Appls., 7(3) (2013) 163-170.
doi:org/10.4067/S0716-09172016000100006
[2741] P. Selvagopal and P. Jeyanthi, On Ck -supermagic graphs, Inter. J. Math. Comput.
Sci., 3 (2008) 25-30.
[2742] P. Selvagopal, P. Jeyanthi, N. P. T. Muthuraja, and A. Semaničová-Feňovčiková
Super (a, d)-star-antimagic graphs, Hacet. J. Math. Stat., 48 (2019)(3) 700-710.
[2743] P. Selvaraju and C. Moha, Prime valuation of union of cycles and cycle related
graphs, Internat. J. Advan. Res. Comput. Sci. Software Engin., 7(6) (2017) 839-
842.
[2744] P. Selvaraju and G. Sethurman, Decomposition of complete graphs and complete
bipartitie graphs into copies of Pn3 or S2 (Pn3 ) and harmonious labeling of K2 + Pn ,
J. Indones. Math. Soc., Special Edition (2011) 109-122.
[2745] T. M. Selvarajan and R. Subramoniam, Prime graceful labeling, Internat. J. Engin.
Tech., 7(4.36) (2018) 750-752.
[2746] M. Selvi, D. Ramya and P. Jeyanthi, Triangular difference mean graphs, Internat.
J. Math. Combin., 2 (202)) 109-117.
[2747] M. Selvi, D. Ramya and P. Jeyanthi, Skolem difference mean graphs, Proyecciones
J. Math., 34(3) (2015) 243-254.
[2748] A. Semaničová, On magic and supermagic circulant graphs, Discrete Math., 306
(2006) 2263-2269.
[2749] A. Semaničová-Feňovčı́ková, M. Bača, and M. Lascsáková, Two constructions of
H-antimagic graphs AKCE Internat. J. Graphs Combin., 14(1) (2017) 42-47.
[2750] A. Semaničová-Feňovčı́ková, M. Bača, M. Lascsáková, M. Miller, and J. Ryan,
Wheels are cycle-antimagic, Electronic Notes Disc. Math., 48 (2015) 11-18. The
Eighth International Workshop on Graph Labelings (IWOGL 2014)

the electronic journal of combinatorics (2023), #DS6 571

[2751] M. F. Semenyuta, (a, d)-Distance antimagic labeling of some types of graphs, Cy-
bernetics Systems Anal., 52(6) (2016) 950-955.
[2752] M. F. Semenyuta, On the (a, d)-distance antimagic and 1-vertex bimagic vertex
labelling of some types of graphs, Kibernet. Sistem. Anal., 54 (2018)(2) 134-141;
translation in Cybernet. Systems Anal., 54 (2018) (2) 295-301.
[2753] M. F. Semenyuta, S. M. Nedilko, and V. M. Nedilko, Bimagic vertex labelings,
Cybernet. Systems Anal., 54(5) (2018) 771-778.
[2754] A. Sen, H. Deng, and S. Guha, On a graph partition problem with application to
VLSI Layout, Inform. Process. Lett., 43 (1992) 87-94.
[2755] R. Senthil Amutha and N. Murugesan, Characterization of connected vertex magic
total labeling graphs in topological ideals, J. Inform. Eng. Appl., 1 (1) (2011) 22-25.
[2756] M. Seoud and M. Aboshady, Further results on parity combination cordial la-
beling, J. Egyptian Math. Soc., 28(1) (2020) Paper No. 25, 10 pp. https:
//joems.springeropen.com/articles/10.1186/s42787-020-00082-8
[2757] A. Seoud, G. M. Abd El Hamid, and M. S. Abo Shady, Indexable and strongly
indexable graphs, Proceed. Pakistan Acad. Sci., 49(2) (2012) 139-144.
[2758] M. A. Seoud and M. E. Abdel-Aal, On odd graceful graphs, Ars Comb., 108 (2013)
161-185.
[2759] M. A. Seoud and A. E. I. Abdel Maqsoud, On 3-equitable and magic labelings,
Proc. Math. Phys. Soc. Egypt, 7 (2000) 67-76.
[2760] M. A. Seoud and A. E. I. Abdel Maqsoud, On cordial and balanced labelings of
graphs, J. Egyptian Math. Soc., 7 (1999) 127-135.
[2761] M. A. Seoud, A. E. I. Abdel Maqsoud and Y. I. Aldiban, New classes of graphs
with and without 1-vertex magic vertex labeling, Proc. Pakistan Acad. Sci., 46
(2009) 159-174.
[2762] M. A.Seoud, A. E. I. Abdel Maqsoud and J. Sheehan, Harmonious graphs, Util.
Math., 47 (1995) 225-233.
[2763] M. A. Seoud, A. E. I. Abdel Maqsoud, and J. Sheehan, Gracefulness of the union
of cycles and paths, Ars Combin., 54 (2000) 283-292.
[2764] M. A. Seoud and M. N. Al-Harere, Some notes on non combination graphs, Applied
Math. Sciences, 6(131) (2012) 6515-6520.
[2765] M. A. Seoud and M. N. Al-Harere, Some notes on combination graphs, Ars Com-
bin., to appear
[2766] M. A. Seoud and M. N. Al-Harere, Further results on square sum graphs, Nat.
Acad. Sci. Lett., 37(5) (2014) 473-475.
[2767] M. A. Seoud and M. A. Anwar, On combination and permutation graphs, Util.
Math., 98 243-255. https://www.researchgate.net/publication/295579013_
On_Combination_and_Permutation_Graphs

the electronic journal of combinatorics (2023), #DS6 572

[2768] M. A. Seoud and M. A. Anwar, Some families of combination and permutation
graphs, Ars Combin., 127 (2016) 435-443. https://www.researchgate.net/
publication/307928064_Some_Families_of_Combination_and_Permutation_
Graphs
[2769] M. A. Seoud, A. T. Diab, and E. A. Elsahawi, On strongly-C harmonious, relatively
prime, odd graceful and cordial graphs, Proc. Math. Phys. Soc. Egypt, no. 73,
(1998) 33-55.
[2770] A. Seoud, A. El Sonbaty, and S. S. Abd El Rehim, Some methods of labeling
graphs, J. Egyptian Math. Soc., 18(2) (2010) 199-221.
[2771] M. A. Seoud and E. A. Elsahawi, On almost graceful, felicitous and elegant graphs,
J. Egyptian Math. Soc., 7 (1999) 137-149.
[2772] M. A. Seoud and E. A. El Sahawi, On variations of graceful labelings, Ars Combin.,
87 (2008) 127-138.
[2773] M. A. Seoud and E. A. El Sahawi, On strongly c-elegant graphs, preprint.
[2774] M. A. Seoud, A. El Sonbaty, and A. E. A. Mahran, On divisor graphs, J. Egyptian
Math. Soc., 18(2) (2010) 187-198.
[2775] M. A. Seoud A. El Sonbaty, and A. E. A. Mahran, Primality of some graphs, Ars
Combin., 112 (2013) 459-469.
[2776] M. A. Seoud and E. F. Helmi, On product cordial graphs, Ars Combin., 101 (2011)
519-529.
[2777] M. A. Seoud and E. F. Helmi, Some α-graphs and odd graceful graphs, Ars Comb.,
101 (2011) 385-404.
[2778] M. A. Seoud and E. F. Helmi, On difference graphs, J. Combin. Math. and Combin.
Comput. 76 (2011) 189-199.
[2779] M. A. Seoud and H. Jaber, On 1-sequentially additive graphs, Ars Combin., to
appear.
[2780] M. A. Seoud and H. Jaber, Prime cordial and 3-equitable prime cordial graphs,
Util. Math., 111 (2019) 95–125.
[2781] M. A. Seoud and A. E. A. Mahran, On permutation graphs, J. Egyptian Math.
Soc. 20 (2012) 57-63.
[2782] M. A. Seoud and A. E. A. Mahran, On strongly multiplicative graphs, Ars Com-
bin.,, 118 (2015) 155-165.
[2783] M. A. Seoud and A. E. A. Mahran, Necessary conditions for strongly *-graphs,
AKCE Internal. J. Graphs Comb., 9(2) (2012) 115-122.
[2784] M. A. Seoud and A. E. A. Mahran, Some notes on strongly *-graphs, Pro-
ceed. Pakistan Acad. Sci.,: Pakistan Acad. Sci.,A. Physical Comput. Sci.,
54(2) (2017) 179-195. https://www.paspk.org/wp-content/uploads/2017/07/
A-06-PS-410-On-Strongly-Graphs.pdf

the electronic journal of combinatorics (2023), #DS6 573

[2785] M. A. Seoud, E. M. Roshdy, and M. S. AboShady, On strongly ∗ -graphs, Proc.
Pak. Acad. Sci., A 54(2) (2017) 179-195.
[2786] M. A. Seoud and M. A. Salim, Two upper bounds of prime cordial graphs, JCMCC,
75 (2010) 95-103.
[2787] M. A. Seoud and M. A. Salim, Further results on triangular sum graphs, In-
ternat. Math. Forum, 7(48) (2012) 2393-2405. http://www.m-hikari.com/imf/
imf-2012/45-48-2012/seoudIMF45-48-2012.pdf
[2788] M. A. Seoud and M. A. Salim, Upper bounds of four types of graph labelings, 127
(2016) 271-278.
[2789] M. A. Seoud and M. A. Salim, On odd mean graphs, Util. Math.,, 84 (2011)
119-130.
[2790] M. A. Seoud and M. A. Salim, On permutation labeling, J. Egyptian Math. Soc.,
19(3) (2011) 134-136.
[2791] M. A. Seoud and M. A Salim, On mean graphs, Ars Combin., 115 (2014) 13-34.
[2792] M. A. Seoud and M. A. Salim, Further results on edge-odd graceful graphs, Turkish
J. Math., 40(3) (2016) 647-656.
[2793] M. A. Seoud and M. A. Salim, Some results and remarks on harmonic mean and
mean cordial labelings, Ars Combin., 133 (2017) 329-340.
[2794] M. A. Seoud, A. El Sonbaty, and A. E. A. Mahran, On prime graphs, Ars Combin.,
104 (2012) 241-260.
[2795] M. A. Seoud and R. J. Wilson, Some disgraceful graphs, Int. J. Math. Ed. Sci.
Tech., 24 (1993) 435-441.
[2796] M. A. Seoud and M. Z. Youssef, On labelling complete tripartite graphs, Int. J.
Math. Ed. Sci. Tech., 28 (1997) 367-371.
[2797] M. A. Seoud and M. Z. Youssef, On prime labelings of graphs, Congr. Numer.,
141 (1999) 203-215.
[2798] M. A. Seoud and M. Z. Youssef, Families of harmonious and non-harmonious
graphs, J. Egyptian Math. Soc., 7 (1999) 117-125.
[2799] M. A. Seoud and M. Youssef, New families of graceful disconnected graphs, Ars
Combin., 57 (2000) 233-245.
[2800] M. A. Seoud and M. Z. Youssef, On harmonious graphs of order 6, Ars Combin.,
65 (2002) 155-176.
[2801] M. A. Seoud and M. Z. Youssef, The effect of some operations on labelling of
graphs, Proc. Math. Phys. Soc. Egypt, 73 (2000) 35-49.
[2802] M. A. Seoud and M. Z. Youssef, Harmonious labellings of helms and re-
lated graphs, https://www.researchgate.net/publication/312218305_
Harmonious_labelling_of_helms_and_related_graphs.

the electronic journal of combinatorics (2023), #DS6 574

[2803] M. A. Seoud and M. Z. Youssef, On gracefulness of disconnected graphs,
https://www.researchgate.net/publication/312218547_On_gracefulness_
of_disconnected_graphs.
[2804] M. A. Seoud and A. Zid, Strong multiplicativity of unions and corona of paths and
complete graphs, Proc. Math. Phys. Soc. Egypt, 74 (1999) 59-71.
[2805] B. J. Septory, M. I. Utoyo, Dafik, B. Sulistiyono, and I. H. Agustin, On
rainbow antimagic coloring of special graphs, J. Phys.: Conf. Ser., 1836
012016 (2021). https://iopscience.iop.org/article/10.1088/1742-6596/
1836/1/012016/pdf
[2806] E. Sergel, P. Richter, A. Tran, P. Curran, J. Jacob, and D. A. Narayan, Rank
numbers for some trees and unicycle graphs, Aequat. Math., 82(1-2) (2011) 65-79.
[2807] E. Setiawan, K. A. Sugeng, Silaban, and D. Riama, On b-edge consecu-
tive edge magic total labeling on trees, Electron. J. Graph Theory Appl.,
(EJGTA) 10(2) (2022) 553-563. https://www.ejgta.org/index.php/ejgta/
article/view/1585/pdf_248
[2808] G. Sethuraman and R. Dhavamani, Graceful numbering of an edge-gluing of shell
graphs, Discrete Math., 218 (2000) 283-287.
[2809] G. Sethuraman and R. Dhavamani, Graceful numbering of union of shell graphs,
unpublished.
[2810] G. Sethuraman and A. Elumalai, On graceful graphs: Pendant edge extensions of
a family of complete bipartite and complete tripartite graphs, Indian J. Pure Appl.
Math., 32 (2001) 1283-1296.
[2811] G. Sethuraman and A. Elumalai, Gracefulness of a cycle with parallel Pk -chords,
Australas. J. Combin., (2005) 32) 205-211.
[2812] G. Sethuraman and A. Elumalai, Packing of any set of graphs into a grace-
ful/harmonious/elegant graph, Ars Combin., 76 (2005) 297-301.
[2813] G. Sethuraman and A. Elumalai, Graceful, harmonious and elegant labellings on
star extension graphs, unpublished.
[2814] G. Sethuraman and A. Elumalai, Every graph is a vertex induced subgraph of a
graceful graph and elegant graph, unpublished.
[2815] G. Sethuraman and J. Jesintha, A new class of graceful lobsters, J. Combin. Math.
Combin. Computing, 67 (2008) 99-109.
[2816] G. Sethuraman and J. Jesintha, Gracefulness of a family of rooted trees, Far East
J. Appl. Math., 30 (2008) 143-159.
[2817] G. Sethuraman and J. Jesintha, A new family of graceful rooted trees, Proc. Na-
tional Conf. Appl. Math., (2008) 74-80.
[2818] G. Sethuraman and J. Jesintha, A new class of graceful rooted trees, J. Disc. Math.
Sci. Crypt., 11 (2008) 421-435.
[2819] G. Sethuraman and J. Jesintha, Generating new graceful trees, Proc. Inter. Conf.
Math. Comput. Sci., July (2008) 67-73.

the electronic journal of combinatorics (2023), #DS6 575

[2820] G. Sethuraman and J. Jesintha, Generation of graceful trees, Proc. Inter. Conf.
Math. Comput Sci., 1 (2009) 1-3.
[2821] G. Sethuraman and J. Jesintha, All extended banana trees are graceful, Proc.
Internat. Conf. Math. Comput. Sci., 1 (2009) 4-8.
[2822] G. Sethuraman and J. Jesintha, All banana trees are graceful, Advances Appl.
Disc. Math., 4 (2009) 53-64.
[2823] G. Sethuraman and S. P. M. Kishore, On graceful graphs: Union of n copies of
edge deleted subgraphs of K4 , Indian J. Pure Appl. Math., 30 (1999) 801-808.
[2824] G. Sethuraman and V. Murugan, Generating graceful trees from caterpillars by
recursive attachment, Electronic Notes Discrete Math., 53 (2016) 133-147.
[2825] G. Sethuraman and V. Murugan, Generating graceful unicyclic graph from a given
graceful tree, Ars. Combin., (2019), to appear.
[2826] G. Sethuraman and V. Murugan, Generating graceful unicyclic graphs from a
given forest, AKCE Internat. J. Graphs Combin., to appear. https://doi.org/
10.1016/j.akcej.2019.02.007
[2827] G. Sethuraman and P. Ragukumar, Every tree is a subtree of graceful tree, graceful
graph and alpha-labeled graph, Ars Combin., 132 (2017) 105-109.
[2828] G. Sethuraman and P. Ragukumar, Towards optimal embedding of an arbitrary
tree in a graceful tree, The Eighth International Workshop on Graph Labelings
(IWOGL 2014), 73-80, Electron. Notes Discrete Math., 48, Elsevier Sci. B. V.,
Amsterdam, 2015.
[2829] G. Sethuraman, P. Ragukumar, and P. J. Slater, Embedding an arbitrary tree in
a graceful tree, Bull. Malays. Math. Sci. Soc., 39(1) (2016) suppl., S341-S360.
[2830] G. Sethuraman, P. Ragukumar, and P. J. Slater, Any tree with m edges can be
embedded in a graceful tree with less than 4m edges and in a graceful planar graph,
Discrete Math., 340(2) (2017) 96-106.
[2831] G. Sethuraman and K. Sankar, On graceful and cordial labeling of shell graphs,
Ars Combin., 108 (2013) 515-532.
[2832] G. Sethuraman and K. Sankar, Subdivision of wheel is graceful and cordial, In-
ternat. J. Math. Anal., textbf9(17) (2015) 817-822. http://www.m-hikari.com/
ijma/ijma-2015/ijma-17-20-2015/01IsankarIJMA17-20-2015-08.pdf
[2833] G. Sethuraman and P. Selvaraju, Gracefulness of arbitrary supersubdivisions of
graphs, Indian J. Pure Appl. Math., 32 (2001) 1059-1064.
[2834] G. Sethuraman and P. Selvaraju, On graceful graphs: one vertex unions of non-
isomorphic complete bipartite graphs, Indian J. Pure Appl. Math., 32 (2001) 975-
980.
[2835] G. Sethuraman and P. Selvaraju, One edge union of shell graphs and one vertex
union of complete bipartite graphs are cordial, Discrete Math., 259 (2002) 343-350.

the electronic journal of combinatorics (2023), #DS6 576

[2836] G. Sethuraman and P. Selvaraju, Decompositions of complete graphs and complete
bipartite graphs into isomorphic supersubdivision graphs, Discrete Math., 260
(2003) 137-149.
[2837] G. Sethuraman and P. Selvaraju, Super-subdivisions of connected graphs are grace-
ful, unpublished.
[2838] G. Sethuraman and P. Selvaraju, On graceful graphs I: Union of non-isomorphic
complete bipartite graphs with one vertex in common, J. Combin. Inform. System
Sci., 26 (2001) 23-32.
[2839] G. Sethuraman and P. Selvaraju, New classes of graphs on graph labeling, preprint.
[2840] G. Sethuraman and P. Selvaraju, On harmonious and felicitous graphs: Union of
n-copies of edge deleted subgraphs of K4 , unpublished.
[2841] G. Sethuraman, P. Selvaraju, and A. Elumalai, On harmonious, felicitous, elegant
and cordial graphs: Union of n copies of edge deleted subgraphs of K4 , preprint.
[2842] G. Sethuraman and K. M. Shermily, Antimagic labeling of new classes of trees,
AKCE Int. J. Graphs Comb., 18(2) (2021) 110-116. https://www.tandfonline.
com/doi/full/10.1080/09728600.2021.1964334
[2843] G. Sethuraman and S. Venkatesh, Decomposition of complete graphs and complete
bipartite graphs into α-labelled trees, Ars Combin., 93 (2009) 371-385.
[2844] H. Shaabani and I. N. Kamalabadi, An efficient population-based simulated an-
nealing algorithm for the multi-product multi-retailer perishable inventory routing
problem, Comput. Ind. Eng., 99 (2016)
[2845] M. K. Shafiq, G. Ali, and R. Simanjuntak, Distance magic labeling of a union of
graphs, AKCE J. Graph Combin., 6 (2009) 191-200.
[2846] P. V. Shah, D. B. Parmar, Integer cordial labeling of triangular snake graph,
Inter. J. Sci. Res. Reviews, 08(1) (2019) 3118-3126.
https://www.researchgate.net/publication/332319553_Integer_Cordial_
Labeling_of_Triangular_Snake_Graph
[2847] P. V. Shah, and D. B. Parmar, Integer cordial labeling of some different snake
graph, J. Xidian Univer., 14(4) (2020) 1361-1375. doi:10.37896/jxu14.4/159
[2848] D. Shah and D. Parmar, Integer cordial labeling of alternate snake graph
and irregular snake graph, Applications Appl. Math. (AAM), 17 (3) Art.
5 (2022) 59-71. https://digitalcommons.pvamu.edu/cgi/viewcontent.cgi?
article=2038&context=aam
[2849] A. T. Shahida and M. S. Sunitha, Characterization for topologically set-graceful
stars and paths, Adv. Appl. Discrete Math., 15(1) (2015) 1–8.
[2850] V. S. Shainy and V. Balaji, On limits of Skolem mean labeling for star graphs
K1,a1 ∪ K1,b1 ∪ K1,c,1 . JASC: J. Appl. Sci. Comput., V(XII) (2018) 1-6.
[2851] A. R. Shahul Hameed, M. Palanivelrajan, K. Gunasekaran, and R. Raziya Begam,
On graceful labeling of some bicyclic graphs, Internat. J. Fuzzy Mathematical
Archives, 3 (2013) 1-8.

the electronic journal of combinatorics (2023), #DS6 577

[2852] A. R. Shahul Hameed, M. Palanivelrajan, K. Gunasekaran and R. Raziya Begam,
Graceful labeling of extended komodo dragon graphs, Bull. Math. Stat. Res., 2(4)
(2014) 454-459.
[2853] A. R. Shahul Hameed, M. Palanivelrajan, K. Gunasekaran and R. Raziya Begam,
Graceful labeling of extended squid graphs, Bull. Math. Stat. Res., 2(4) (2014)
465-473.
[2854] A. R. Shahul Hameed, M. Palanivelrajan, K. Gunasekaran and R. Raziya Begam,
Graceful labeling of komodo dragon graphs, J. Sci. Res. Physical & Math. Sci.,
2(2) (2015) 17-27.
[2855] A. R. Shahul Hameed, M. Palanivelrajan, K. Gunasekaran and R. Raziya Begam,
Graceful labeling of squid graphs, J. Sci. Res. Physical & Math. Sci., 2(2) (2015)
28-38.
[2856] H. Shaker, A. Rana, M. H. Zobair, and M. Hussain, Super edge-magic total labeling
of subdivision of stars, Ars Combin., 116 (2014) 177-183.
[2857] P. Shalini and D. P. Dhayabaran, An absolute differences of cubic and
square difference labelings, Internat. J. Adv. Sci. Tech. Res., 3(5) (2015)
1-8. https://www.researchgate.net/publication/362174849_An_Absolute_
Differences_of_Cubic_and_Square_Difference_Labelings
[2858] P. Shalini, R. Gowri, and D. P. Dhayabaran, An absolute differences of cubic
and square difference labeling for some families of graphs, Internat. J. Analytical
Experimental Modal Analysis, XI(X) (2019) 538-544. http://www.ijaema.com/
gallery/59-october-2570.pdf
[2859] P. Shalini and S. A. Meena, Lehmer-4 mean labeling of graphs, In-
ternat. J. Res. Appl. Sci. Engin. Tech., (IJRASET) 10(XII) (2022)
doi:10.22214/ijraset.2022.48176
[2860] S. Shan and X. Yu, Antimagic orientation of biregular bipartite graphs, Electron.
J. Combin., 24 (2017) Paper 4.31.
[2861] S. Shan, Antimagic orientation of graphs with minimum degree at least 33, J.
Graph Th., 98(4) (2021) 676-690. arXiv:2005.01829
[2862] J.-L. Shang, Spiders are antimagic, Ars Combin., 118 (2015) 367-372.
[2863] J.-L. Shang, P2 , P3 , P4 -free linear forests are antimagic, Util. Math., 101 (2016)
13-22.
[2864] J.-L. Shang, Antimagic labeling of linear forests, Util. Math., 106 (2018) 23-37.
[2865] J.-L Shang, C. Lin, and S-C Liaw, On the antimagic labeling of star forests, Util.
Math., 97 (2015) 373-385.
[2866] Z. Shao, F. Deng, Z. Li, and A. Vese, Graceful labelings of the generalized Petersen
graphs, Commun. Combin. Opt., 2(2) (2017) 149-159.
[2867] A. Sharary, Integal sum graphs from complete graphs, cycles and wheels, Arab
Gulf Sci. Res., 14-1 (1996) 1-14.

the electronic journal of combinatorics (2023), #DS6 578

[2868] V. Sharma and A. Parthiban, On double divisor cordial labeling of star related
graphs, Adv. Appl. Math. Sci., 21(8) (2022) 4389-4398. https://iopscience.
iop.org/article/10.1088/1742-6596/2267/1/012026/pdf
[2869] S. Philo, P. Jeyanthi, and B. Davazz, Odd harmonious labeling of complete
bipartite graphs, Southeast Asian Bull. Math., 46(1) (2022) 23-34. https://www.
researchgate.net/publication/359462364_Southeast_Asian_Bulletin_of_
Mathematics_Odd_Harmonious_Labeling_of_Complete_Bipartite_Graphs
[2870] V. Sharon Philomena and K. Thirusangu, Some new classes of 3-total product
cordial graphs, Internat. J. Comput. Algor., 3 (2014) 647-650.
[2871] V. Sharon Philomena and K. Thirusangu, Square and cube difference labeling of cy-
cle cactus, special tree and a new key graph, Annals Pure Appl. Math., 8(2) (2014)
115-122. http://www.researchmathsci.org/apamart/apam-v8n2-14.pdf
[2872] N. K. Shawkat and M. A. Ahmed, On antimagic labeling for some fami-
lies of graphs, Ibn AL-Haitham J. Pure Appl. Sci., 36(1) (2023) 284-291.
doi:10.30526/36.1.3014
[2873] S. C. Shee, On harmonious and related graphs, Ars Combin., 23 (1987) A, 237-247.
[2874] S. C. Shee, Some results on λ-valuation of graphs involving complete bipartite
graphs, Discrete Math., 28 (1991) 73-80.
[2875] S. C. Shee and Y. S. Ho, The cordiality of one-point union of n-copies of a graph,
Discrete Math., 117 (1993) 225-243.
[2876] S. C. Shee and Y. S. Ho, The cordiality of the path-union of n copies of a graph,
Discrete Math., 151 (1996) 221-229.
[2877] S. Shee and S. Lee, On harmonious and felicitious labeling of graphs, Congr. Nu-
mer., 68 (1989) 155-170.
[2878] Y. Shen, J. Dong, G. Zheng, and L. Guo, The radio number of standard caterpillars,
Ars Combin., 125 (2016) 257-269.
[2879] V. Shendra Shainy and V. Balaji, Even felicitous labeling, Malaya J. Mat., S(1)
(2020) 45-47. https://doi.org/10.26637/MJM0S20/0009
[2880] V. Shendra shainy, P. Hariprabakaran, V. Swathy, and V. Balaji, MGL coding tech-
niques with Skolem mean like labeling and two star graphs, J. Physics Conference
Series, 1964(2):022009 (2021) 1-6. https://iopscience.iop.org/article/10.
1088/1742-6596/1964/2/022009/pdf
[2881] V. Shendra shainy, L. Vinothkumar and V. Balaji, Mean cordial labeling for three
star graph, J. Phys.: Conf. Ser., 1362 (2019) 012036. https://iopscience.iop.
org/article/10.1088/1742-6596/1362/1/012036
[2882] D. A. Sheppard, The factorial representation of major balanced labelled graphs,
Discrete Math., 15 (1976) 379-388.
[2883] M. M. Sheriff, A. F. Abbas and P. L. R. Raj, Face integer cordial label-
ing of graphs, Internat. J. Math. Trends Tech., (IJMTT) 41(2) (2017) 177-

the electronic journal of combinatorics (2023), #DS6 579

 185. https://www.researchgate.net/publication/315917668_Face_Integer_
Cordial_Labeling_of_Graphs
[2884] M. M. Sheriff and A. F. Abbas, A study on face integer edge cordial
graphs, Internat. J. Fuzzy Math. Archive 15(2) (2018) 209-216. http://www.
researchmathsci.org/IJFMAart/IJFMA-v15n2-12.pdf
[2885] Z. Sherman, Square difference labeling of some union and disjoint union graphs,
Algebra Discrete Math., 25(2) (2018) 294-302.
[2886] J. Shiama, Square sum labeling for middle and total graphs, Internat. J. Comp.
Appl., 37(4) (2005) 205-211.
[2887] J. Shiama, Square sum labeling for some middle and total graphs, Internat. J.
Comput. Appl., 37(4) (2012) 6-8. https://citeseerx.ist.psu.edu/viewdoc/
download?doi=10.1.1.736.5400&rep=rep1&type=pdf
[2888] J. Shiama, Cube difference labeling of some graphs, Internat. J. Engin. Sci. In-
novative Tech. (IJESIT), 2(6) (2013) 200-205. http://www.ijesit.com/Volume%
202/Issue%206/IJESIT201306_25.pdf
[2889] J. Shiama, Square difference labeling for some graphs, Internat. J. Com-
put. Appl., 44(4) (2012) 30-33. https://research.ijcaonline.org/volume44/
number4/pxc3878399.pdf
[2890] H. Shimazu, Graceful labelling of the union of cycles and paths, Internat. J. Physics
Appl., 3(2) (2011) 205-208.
[2891] W. C. Shiu, Super-edge-graceful labelings of some cubic graphs, Acta Math. Sin.,
22 (2006) 1621-1628.
[2892] W. C. Shiu, Edge-magic labeling matrices of the composition of paths and null
graphs, Congr. Numer., 187 (2007) 55-68.
[2893] W. C. Shiu, The non-edge-magic simple connected cubic graph of order 10, JCMCC
83 (2012) 225-241.
[2894] W. C. Shiu, Product-cordial index set for Cartesian product of a graph with a
path, J. Combin. Number Th., 4(3) (2013) 177-194.
[2895] W. C. Shiu, Extreme edge-friendly indices of complete bipartite graphs, Trans.
Combin., 5(3) (2016) 11-21.
[2896] W. C. Shiu, Full edge-friendly index sets of complete bipartite graphs, Trans.
Combin., 6(2) (2017) 7-17.
[2897] W. C. Shiu, Integer-antimagic spectra of disjoint unions of cycles, Theory Appl.
Graphs, 5(2) (2018) Art. 3, 12 pp.
[2898] W. C. Shiu and M.-H. Ho, Full friendly index sets of slender and flat cylinder
graphs, Transactions Combin., 2 (4) (2013) 63-80.
[2899] W. C. Shiu and M.-H. Ho, Full Friendly index sets and full product-cordial index
sets of some permutation Petersen graphs, J. Combin. and Number Theory, 5(3)
227-244.

the electronic journal of combinatorics (2023), #DS6 580

[2900] W.-C. Shiu, G.-C. Laub, H.-K. Ng, Edge-coloring vertex-weighting of graphs,
Iranian J. Math. Sci. Informatics, 16(1) (2021) 1-13.

https://www.researchgate.net/publication/226610853_On_
vertex-coloring_edge-weighting_of_graphs
[2901] W. C. Shiu and H. Kwong, Full friendly index sets of P2 × Pn , Discrete Math.,
308 (2008) 3688-3693.
[2902] W. C. Shiu and H. Kwong, An algebraic approach for finding balance index sets,
Australasian J. Combin., 45 (2009) 139-155.
[2903] W. C. Shiu and H. Kwong, Product-cordial index and friendly index of regular
graphs, Transactions Combin., 1 (2012) 15-20.
[2904] W. C. Shiu, P. C. B. Lam, Super-edge-graceful labelings of multi-level wheel
graphs, fan graphs and actinia graphs, Congr. Numer., 174 (2005) 49-63.
[2905] W. C. Shiu, P. C. B. Lam, and H. L. Cheng, Supermagic labeling of an s-duplicate
of Kn,n , Congr. Numer., 146 (2000) 119-124.
[2906] W. C. Shiu, P. C. B. Lam, and H. L. Cheng, Edge-gracefulness of the composition
of paths with the null graphs, Discrete Math., 253 (2002) 63-76.
[2907] W. C. Shiu, P. C. B. Lam, and S. M. Lee, Edge-magic index sets of (p, p)-graphs,
Congr. Numer., 137 (1999) 97-107.
[2908] W. C. Shiu, P. C. B. Lam, and S. M. Lee, On a construction of supermagic graphs,
J. Combin. Math. Combin. Comput., 42 (2002) 147-160.
[2909] W. C. Shiu, P. C. B. Lam, and S. M. Lee, Edge-magic indices of (n, n − 1)-graphs,
Electron. Notes Discrete Math., 11 (2002) 443-458.
[2910] W. C. Shiu, P. C. B. Lam, and S. M. Lee, Edge-magic index sets of square of paths,
Util. Math., 97 (2015) 271-286.
[2911] W. C. Shiu, P. C. B. Lam, and P. K. Sun, Construction of group-magic graphs and
some A-magic graphs with A of even order, Congr. Numer., 167 (2004) 97-107.
[2912] W. C. Shiu and G.-C. Lau, Some results on k-edge-magic broken wheel graphs, J.
Graph Labeling, 1(2) (2015) 65-79.
[2913] W.-C. Shiu, G.-C. Lau, and S.-M. Lee, On (semi-)edge-primality of graphs, Iranian
J. Math. Sci. and Informatics, 12(2) (2017) 1-14.
[2914] W.C. Shiu and G-C. Lau, On SD-prime labelings of some one point unions of gears,
Symmetry 13(849) (2021) 18 pp. https://doi.org/10.3390/sym13050849
[2915] W. C. Shiu and S. M. Lee, Some edge-magic cubic graphs, J. Combin. Math.
Combin. Comput., 40 (2002) 115-127.
[2916] W. C. Shiu and S. M. Lee, Full friendly index sets and full product-cordial index
sets of twisted cylinders, J. Combin. Number Thoery, 3 (3) (2012) 209-216.
[2917] W. C. Shiu, S. M. Lee, and K. Schaffer, Some k-fold edge-graceful labelings of
(p, p − 1)-graphs, J. Combin. Math. Combin. Comput., 38 (2001) 81-95.

the electronic journal of combinatorics (2023), #DS6 581

[2918] W. C. Shiu and M. H. Ling, Full friendly index sets of Cartesian products of two
cycles, Acta Mathematica Sinica, English Series, 26 (2010) 1233-1244.
[2919] W. C. Shiu, M. H. Ling, and R. M. Low, The entire edge-graceful spectra of
cycles with one chord, Proc. Thirty-Seventh Southeastern International Conf. on
Combin., Graph Theory and Comput., Congr. Numer., 183 (2006) 213-219.
[2920] W. C. Shiu, M. H. Ling, and R. M. Low, The edge-graceful spectra of connected
bicyclic graphs without pendant, JCMCC, 66 (2008) 171-185.
[2921] W. C. Shiu and R. M. Low, Group magicness of complete N -partite graphs, J.
Combin. Math. Combin. Comput., 58 (2006) 129-134.
[2922] W. C. Shiu and R. M. Low, Integer-magic spectra of sun graphs, J. Comb. Optim.,
14 (2007) 309-321.
[2923] W. C. Shiu and R. M. Low, Ring-magic labelings of graphs, Australasian J.
Combin., 41 (2008) 147-158.
[2924] W. C. Shiu and R. M. Low, Zk -magic labeling of fans and wheels with magic-value
zero, Australasian J. Combin., 45 (2009) 309-316.
[2925] W. C. Shiu and R. Low, The integer-magic spectra of bicyclic graphs without
pendant, Proceedings of the Forty-Third Southeastern International Conference
on Combinatorics, Graph Theory and Computing. Congr. Numer., 214 (2012)
65-73.
[2926] W. C. Shiu and R. M. Low, Group-magic labelings of graphs with deleted edges,
Australasian J. Combin., 57 (2013) 3-19.
[2927] W. C. Shiu and R. M. Low, Integer-antimagic spectra of complete bipartite graphs
and complete bipartite graphs with a deleted edge, Bull. Inst. Combin. Appl., 76
(2016) 54-68.
[2928] W. C. Shiu and R. M. Low, The integer-antimagic spectra of dumbbell graphs,
Bull. ICA, 77 (2016) 89-110.
[2929] W. C. Shiu and R. M. Low, The integer-magic spectra and null sets of the Cartesian
product of trees, Austral. J. Combin., 70(1) (2018) 157-167.
[2930] W. C. Shiu and R. M. Low, On the integer-antimagic spectra of non-
Hamiltonian graphs, Theory Appl. Graphs, 9(2) (2022) Article 8 1-19. https:
//digitalcommons.georgiasouthern.edu/tag/vol9/iss2/8
[2931] W. C. Shiu, P. K. Sun, and R. M. Low, Integer-antimagic spectra of tad-
pole and lollipop graphs, Congr. Numer., (2015) 225 (2015) 5-22. https:
//www.researchgate.net/publication/283085888_Integer-antimagic_
spectra_of_tadpole_and_lollipop_graphs
[2932] W. C. Shiu and F. S. Wong, Extreme friendly indices of Cm × Pn , Cong. Numer.,
197 (2009) 65-75.
[2933] W. C. Shiu and F. S. Wong, Strong vertex-graceful labeling for some double cycles,
Congr. Numer., 20 (2010) 17-24.

the electronic journal of combinatorics (2023), #DS6 582

[2934] W. C. Shiu and F. S. Wong, Full friendly index sets of cylinder graphs, Australasian
J. Combin., 52 (2012) 141-162.
[2935] C.-L. Shiue and H.-L. Fu, α-labeling number of trees, Discrete Math., 306 (2006)
3290-3296.
[2936] C.-L. Shiue and H.-L. Fu, The IC-indices of complete bipartite graphs, Electron.
J. Combin., 15(1) (2008) Research paper 43, 13 pages.
[2937] C.-L. Shiue and H.-C. Lu, Trees which admit no α-labelings, Ars Combin., 103
(2012) 453-463.
[2938] M. A. Shivarajkumar, Sriraj, and S. M. Hegde, Graceful labeling of digraphs—a
survey, AKCE Internat. J. Graphs Combin., (2021) 1-5. https://doi.org/10.
1080/09728600.2021.1978014
[2939] S. Shixin and S. Yu, On Hamming-graceful graphs, unpublished.
[2940] N. P. Shrimali and P. B. Pandya, Total neighborhood prime labeling of some
graphs, Internat. J. Sci. Res. Math. Stat. Sci., 5(6) (2018) 157-163.
[2941] N. P. Shrimali and Y. M. Parmar, Edge vertex prime labeling for some trees, J ASC:
J. Appl. Sci. Comput., VI(I) (2019) 2136-1249. https://www.researchgate.net/
publication/330959323_Edge_vertex_prime_labeling_for_some_trees
[2942] N. P. Shrimali and Y. M. Parmar, Edge vertex prime labeling for some graphs,
South East Asian J. Math. Math. Sci., 16(1) (2020), 149-156.
[2943] N. P. Shrimali and Y. M. Parmar, Distance magic and distance antimagic labeling
of some product graphs, Recent Advancements in Graph Theory, CRC Press, (2020)
181-191. https://www.researchgate.net/publication/346580733_Distance_
Magic_and_Distance_Antimagic_Labeling_of_Some_Product_Graphs
[2944] N. P. Shrimali and A. K. Rathod, Vertex-edge neighborhood prime labeling
of some trees, South East Asian J. Math. Math. Sci., 16(3) (2020) 207-218.
http://rsmams.org/download/articles/2_16_3_838091879_Paper%2017%
20%20VERTEX-EDGE%20NEIGHBORHOOD%20PRIME%20LABELING%20OF%20SOME%
20TREES.pdf
[2945] N. P. Shrimali, A. K. Rathod, and P. L. Vihol, Neighborhood-prime labeling for
some graphs, Malaya J. Mat.,7(1) (2019) 108-112. http://www.malayajournal.
org/selected_article.php?id=538
[2946] N. P. Shrimali and S. K. Singh, Gaussian vertex prime labeling of some graphs,
J. Chungcheong Math. Soc.. 34(3) (2021) 285–294. https://www.koreascience.
or.kr/article/JAKO202123758839918.pdf
[2947] N. P. Shrimali and S. T. Trivedi, Gaussian neighborhood-prime labeling of graphs
containing Hamiltonian cycle, Math. J. Interdiscip. Sci., 7(2) (2019) 161-165.
https://mjis.chitkara.edu.in/index.php/mjis/article/view/190/125
[2948] M. K. Siddiqui, On the total edge irregularity strength of a categorical product of
a cycle and a path, AKCE J. Graphs, Combin., 9(1) (2012) 43-52.

the electronic journal of combinatorics (2023), #DS6 583

[2949] M. K. Siddiqui, On edge irregularity strength of subdivision of star Sn , Internat.
J. Math. Soft Comput., 2(1) (2012) 75-82.
[2950] M. K. Siddiqui, On irregularity strength of convex polytope graphs with certain
pendent edges added, Ars Combin., 129 (2016) 199-210.
[2951] M. K. Siddiqui, On Z3k -magic labeling of certain families of graphs, unpublished.
[2952] M. K. Siddiqui, A. Ahmad, M. F. Nadeem, and Y. Bashir, Total edge irregularity
strength of the disjoint union of sun graphs, Internat. J. Math. Soft Comput., 3(1)
(2013) 21-27.
[2953] M. K. Siddiqui, M. Miller, and J. Ryan, Total edge irregularity strength of octag-
onal grid graph, Util. Math., 103 (2017) 277-287.
[2954] M. K. Siddiqui, M. Numan, and M. A. Umar, Face antimagic labeling of Jahangir
graph, Math. Comput. Sci., 7(2) (2013) 237-243.
[2955] D. R. Silaban, A. Parestu, B. N. Herawati, K. A. Sugeng, and Slamin, Vertex-
magic total labelings of unions of generalized Petersen graphs and union of special
circulant graphs, J. Combin. Math. Combin. Comput., 71 (2009) 201-207.
[2956] D. R. Silaban and K. A. Sugeng, Edge antimagic total labelings on
paths and uncycles, J. Combin. Math. Combin. Comput., 65 (2007) 1-
8. https://www.researchgate.net/publication/265587900_Edge_antimagic_
total_labeling_on_paths_and_unicycles#fullTextFileContent
[2957] M. Simanihuruk, T. A. Kusmayadi, B. Swita, M. Romala, and F. Damanik, A
conjecture on super edge-magic total labeling of 4-cycle books, Int. J. Math. Math.
Sci., (2021) Art. ID 8483926, 8 pp. https://www.hindawi.com/journals/ijmms/
2021/8483926/
[2958] R. Simanjuntak, F. Bertault, and M. Miller, Two new (a, d)-antimagic graph label-
ings, Proc. Eleventh Australia Workshop Combin. Algor., Hunrer Valley, Australia
(2000) 179-189.
[2959] R. Simanjuntak and K. Wijaya, On distance antimagic graphs, arXiv:1312.7405.
[2960] M. Simaringa and S. Muthukumaran, Edge vertex prime labeling of some graphs,
Malaya J. Matematik, 7(2) (2019) 264-268 http://www.malayajournal.org/
articles/MJM07020018.pdf
[2961] M. Simaringa and S. Muthukumaran, Edge vertex prime labeling of graphs, Malaya
J. Mat., 7(3) (2019) 572-578. https://www.malayajournal.org/articles/
MJM07030034.pdf
[2962] M. Simaringa and S. Muthukumaran, Edge vertex prime labeling of union of
graphs, Internat. J. Engin. Adv. Tech,,̇ 9(1s6) (2019) 89-97. DOI:10.35940/ijeat.
A1017.1291S619
[2963] M. Simaringa and S. Thirunavukkarasu, An analytic odd mean labeling of some
new results of graphs, Nonlinear Stud., 28(3) (2021) 795-799.

the electronic journal of combinatorics (2023), #DS6 584

[2964] G. J. Simmons, Synch-sets: a variant of difference sets, Proc. 5th Southeastern
Conference on Combinatorics, Graph Theory and Computing, Util. Math. Pub.
Co., Winnipeg (1974) 625-645.
[2965] S. Singla, A. Tiwari, and A. Tripathi, Some results on the spum and the integral
spum of graphs, Discrete Math., 344(5) (2021) 112311. https://doi.org/10.
1016/j.disc.2021.112311
[2966] D. Sinha and J. Kaur, Edge-friendly labelings of graph–II, Util. Math., 99 (2016)
251-271.
[2967] D. Sinha and J. Kaur, Region indices of friendly labeling of a planar graph, Util.
Math., 101 (2016) 149-178.
[2968] I. Singgih, New Methods for Magic Total Labelings of Graphs, Masters Thesis,
Department of Mathematics and Statistics, U. Minnesota Duluth, 2015.
[2969] S. Singla, A. Tiwari, and A. Tripathi, Some results on the spum and the integral
spum of graphs, Discrete Mathematics 344 (2021) 11231 https://iopscience.
iop.org/article/10.1088/1742-6596/1778/1/012009/pdf
[2970] G. Suresh Singh, A note on graceful prisms, Nat. Acad. Sci. Lett., 15 (1992) 193-
194.
[2971] G. Suresh Singh, Subdivisions of ladders are arithmetic, Multidiscplinary Research
Review, 2 (1992) 23-25.
[2972] G. Suresh Singh, A note on sequential crowns, Nat. Acad. Sci. Lett., 16 (1993)
243-245.
[2973] G. Suresh Singh, A note on labeling of graphs, Graphs and Combin., 14 (1998)
201-207.
[2974] G. Suresh Singh, Some generalities on arithmetic graphs, Graph Theory Notes of
New York, XXXVIII (2000) 12-16.
[2975] G. Suresh Singh, personal communication (2015)
[2976] G. Suresh Singh, Divisor graphs-I, unpublished.
[2977] G. Suresh Singh, and J. Devaraj, On triangular graceful graphs, unpublished.
[2978] G. Suresh Singh, and G. Santhosh, A note on integral sum crowns, Ars Combin.,
66 (2003) 65-77.
[2979] G. Suresh Singh, and V. Vilfred, Some results on arithmetic trees, unpublished.
[2980] N. M. Singhi, G. R. Vijayakumar and N. Usha Devi, Set-magic labelings of infinite
graphs. Ars Combin., 63 (2002) 305-310.
[2981] S. Singhun, Graphs with edge-odd graceful labelings, Int. Math. Forum,
8(9-12) (2013) 577-582. http://www.m-hikari.com/imf/imf-2013/9-12-2013/
singhunIMF9-12-2013.pdf
[2982] S. Singhun, R. Boonklurb, and C. Charnsamorn, A supermagic labeling of finite
copies of Cartesian product of cycles, East-West J. Math., 17(1) (2015) 61-69.

the electronic journal of combinatorics (2023), #DS6 585

[2983] D. Sinha and J. Kaur, Full friendly index set-I, Discrete Appl. Math., 161(9) (2013)
1262-1274.
[2984] D. Sinha and J. Kaur, Full friendly index set-II, J. Combin. Math. Combin. Com-
put., 79 (2011) 65-75.
[2985] D. Sinha and J. Kaur, Edge friendly labelings of graph-I, Ars Combin., 129 (2016)
139-156..
[2986] D. Sinha and J. Kaur, Region indices of friendly labeling of a planar graph, Util.
Math., 101 (2016) 149-178.
[2987] D. Sinha and J. Kaur, Region indices of edge-friendly labeling of a plane graph,
Util. Math., 99 (2016) 187-213.
[2988] Siqinbate and W. Feng, Wei, Gracefulness of the digraph 3C ~ 2p , Pure Appl. Math.
(Xi’an) 29(2) (2013) 111-117.
[2989] Siqinqimuge, Jirimutu, and L. Zhao, On the gracefulness of the digraphs n-C ~ 19 for
even n, Util. Math., 85 (2011) 193-199.
[2990] M. Sivakumar, On 4-total product cordiality of some corona graphs, Internat. J.
Math. Combin., 3 (2016) 99-106.
[2991] S. Sivakumar, S. Vidyanandini, E. Sreedevi, S. R. Nayak, and A. K. Bhoi, Edge
irregularity strength exists in the anti-theft network, In: P. K. Mallick, A. K.
Bhoi, P. Barsocchi, and V. H. C. de Albuquerque, (eds), Cognitive Informatics Soft
Comput., Lecture Notes in Networks and Systems, 375 (2022) Springer, Singapore.
[2992] R. Sivaraman, Graceful graphs and its applications, Internat. J. Current Research,
8(11) (2016) 41062-41067.
[2993] T. Skolem, On certain distribution of integers into pairs with given differences,
Math. Scand., 5 (1957) 57-68.
[2994] J. Skowronek-Kaziów, Multiplicative vertex-colouring weightings of graphs, In-
form. Process. Lett., 112(5) (2012) 191-194.
[2995] S. Slamet, K. Sugeng, and M. Miller, Sum graph based access structure in a secret
sharing scheme, J. Prime Research Math., 2 (2006) 113-119.
[2996] Slamin, M. Bača, Y. Lin, M. Miller, and R. Simanjuntak, Edge-magic total label-
ings of wheels, fans and friendship graphs, Bull. ICA, 35 (2002) 89-98.
[2997] Slamin, Dafik, and W. Winnona, Total vertex irregularity strength of the disjoint
union of sun graphs, Int. J. Comb., 2012 Art. ID 284383, 9 pp.
[2998] Slamin and M. Miller, On two conjectures concerning vertex-magic total labelings
of generalized Petersen graphs, Bull. Inst. Combin. Appl., 32 (2001) 9-16.
[2999] Slamin, A. C. Prihandoko, T. B.Setiawan, V. Rosita, and B. Shaleh, Vertex-magic
total labelings of disconnected graphs, J. Prime Research in Math., 2 (2006) 147-
156.
[3000] P. J. Slater, On k-sequential and other numbered graphs, Discrete Math., 34 (1981)
185-193.

the electronic journal of combinatorics (2023), #DS6 586

[3001] P. J. Slater, On k-graceful graphs, Proc. of the 13th S.E. Conf. on Combinatorics,
Graph Theory and Computing, (1982) 53-57.
[3002] P. J. Slater, On k-graceful, locally finite graphs, J. Combin. Theory, Series B, 35
(1983) 319-322.
[3003] P. J. Slater, Problems in graph theory: graceful and sequential numbering of infi-
nite graphs, Southeast Asian Bull. Math., 9 (1985) 15-22.
[3004] P. J. Slater, On k-graceful, countably infinite graphs, Discrete Math., 61 (1986)
293-303.
[3005] R. Slı́va, Antimagic labeling graphs with a regular dominating subgraph, Inform.
Process. Lett., 112(21) (2012) 844-847.
[3006] D. Small, Regular (even) spider graphs are edge-graceful, Congr. Numer., 74
(1990) 247-254.
[3007] B. M. Smith, Set of symmetry breaking constraints, (2005) https://pdfs.
semanticscholar.org/c2cf/ccdb6f07044b87bb4e5a1a152d24939c7540.pdf
[3008] B. M. Smith and J.-F Puget, Constraint models for graceful graphs, Constraints,
15 (1) (2010) 64-92.
[3009] W. Smyth, Sum graphs of small sum number, Colloquia Mathematica Societatis
János Bolyai, 60 (1991) 669-678.
[3010] W. Smyth, Sum graphs: New results, new problems, Bull. Inst. Combin. Appl., 2
(1991) 79-81.
[3011] H. Snevily, Combinatorics of Finite Sets, Ph. D. Thesis, U. Illinois, 1991.
[3012] H. Snevily, New families of graphs that have α-labelings, Discrete Math., 170
(1997) 185-194.
[3013] B. Sokolowsky, Achieving all radio numbers, AKCE Int. J. Graphs Comb., 10(1)
(2013) 77-95.
[3014] A. Solairaju and M. A. Arockiasamy, Gracefulness of k-step staircase graphs, J.
Analysis Computation, 6 (2010) 109-114.
[3015] A. Solairaju and M. A. Arockiasamy, Graceful mirror-staircase graphs, Inter. J.
Contemporary Math. Sci., 5 (2010) 2433-2441.
[3016] A. Solairaju and M. A. Arockiasamy, A study of labeling techiques in relations to
a new family of staircase graphs, unpublished.
[3017] A. Solairaju and K. Chithra, New classes of graceful graphs by merging a finite
number of C4 , Acta Cienc. Indica Math., 34 (2008) 959-965.
[3018] A. Solairaju and K. Chithra, Edge-odd graceful labeling of some graphs, Proceed-
ings of the ICMCS, 1 (2008) 101-107.
[3019] A. Solairaju and K. Chithra, Edge odd graceful graphs, Electronic Notes in Dis-
crete Math., 33 (2009) 15-20.
[3020] D. D. Somashekara and C. R. Veena, On strong vertex graceful graphs, Internat.
Math. Forum, 5(56) (2010) 2751-2757.

the electronic journal of combinatorics (2023), #DS6 587

[3021] D. D. Somashekara and C. R. Veena, On square sum labelings of graphs, Proc.
Jangjeon Math. Soc, 15(1) (2012) 69-78.
[3022] D. D. Somashekara and C. R. Veena, On pentagonal sum labelings of graphs, Adv.
Studies Contemp. Math., 22(3) (2012) 421-432.
[3023] S. Somasundaram and R. Ponraj, Mean labelings of graphs, Natl. Acad, Sci. Let.,
26 (2003) 210-213.
[3024] S. Somasundaram and R. Ponraj, Non-existence of mean labeling for a wheel, Bull.
Pure and Appl. Sciences (Mathematics & Statistics), 22E (2003) 103-111.
[3025] S. Somasundaram and R. Ponraj, Some results on mean graphs, Pure and Applied
Math. Sci., 58 (2003) 29-35.
[3026] S. Somasundaram and R. Ponraj, On mean graphs of order < 5, J. Decision
Math. Sci., 9 (2004) 47-58.
[3027] S. Somasundaram, P. Vidhyarani and R. Ponraj, Geometric mean labelings of
graphs, Bull. Pure Appl. Sci,, 30E(2) (2011) 153-160.
[3028] S. Somasundaram, P. Vidhyarani and S. S. Sandhya, Some results on geometric
mean graphs, Internat. Math. Forum, 7(28) (2012) (28) 1381-1391.
[3029] S. Sonchhatra and G. V. Ghodasara, Sum perfect square graphs in context of some
graph operations, Internat. J. Math. Trends Tech. (IJMTT), 46(2) (2017) 62-65.
[3030] S. G. Sonchhatra and G. V. Ghodasara, Sum perfect square labeling of graphs,
Internat. J. Scient. Innovative Math. Res., 4 (2016) 64-70.
[3031] S. G. Sonchhatra and G. V. Ghodasara, Snakes related sum perfect square graphs,
Internat. J. Mathematics Appl., 4 (2016) 157-168.
[3032] S. G. Sonchhatra and G. V. Ghodasara, Some new sum perfect square graphs,
Internat. J. Pure Appl. Math., textbf113(3) (2017) 489-499.
[3033] M. Sonntag, Antimagic vertex-labelling of hypergraphs, Discrete Math., 247 (2002)
187-199.
[3034] M. Sonntag, Difference labelling of cacti, Discuss. Math. Graph Theory, 23 (2003)
55-65.
[3035] M. Sonntag and H.-M. Teichert, Sum numbers of hypertrees, Discrete Math., 214
(2000) 285-290.
[3036] M. Sonntag and H.-M. Teichert, On the sum number and integral sum number of
hypertrees and complete hypergraphs, Discrete Math., 236 (2001) 339-349.
[3037] B. Sooryanarayana and P. Raghunath, Radio labeling of cube of a cycle, Far East
J. Appl. Math., 29 (2007) 113-147.
[3038] B. Sooryanarayana, M. Vishu Kumar, K. Manjula, Radio number of cube of a
path, Int. J. Math. Comb., 1 (2010) 5-29.
[3039] D. Speyer and Z. Szaniszló, Every tree is 3-equitable, Discrete Math., 220 (2000)
283-289.

the electronic journal of combinatorics (2023), #DS6 588

[3040] R. Sridevi, S. Navaneethakrishnan, and K. Nagarajan, Almost super Fibonacci
graceful labeling, Scientia Magna, 6(3) (2010) 99-125. Not on web
[3041] R. Sridevi, S. Navaneethakrishnan, and K. Nagarajan, Super Fibonacci graceful
labeling, Internat. J. Math. Combin., 3 (2010) 22-40. https://vixra.org/pdf/
1403.0419v1.pdf
[3042] R. Sridevi, S. Navaeethakrishnan, A. Nagarajan, and K. Nagarajan, Odd-even
graceful graphs, J. Appl. Math. Inform., 30(5-6) (2012) 913-923.
[3043] R. Sridevi, K. Nagarajan, A. Nellaimurugan, and S. Navaneethakrishnan, Fi-
bonacci divisor cordial graphs, Interat. J. Math. Soft Comput., 3(3) (2013) 33-39.
no web
[3044] R. Sridevi, K. Palani, S. Navanaeethakrishnan, and K. Nagarajan, Some re-
sults on Fibonacci divisor cordial graphs, https://www.researchgate.net/
publication/334654897_Some_Results_on_Fibonacci_Divisor_Cordial_
Graphs
[3045] N. Sridharan and R. Umarani, Ek -cordial labellings of graphs, Elixir Appl. Math.,
38 (2011) 4564-4567.
[3046] V. Srinivasan, N. Chidambaram, N. Devadoss, R. Pakkirisamy, and P. Krish-
namoorthi, On the gracefulness of m-Super subdivision of graphs, J. Discrete Math.
Sci. Crypt., 23(6) (2020) 1359-1368.
[3047] S. Sriramr and R. Govindarajan, Permutation labeling of joins of kite graph,
Internat. J. Comput. Engin. Tech., (IJCET) 10(3) (2019) 1–8, Article ID:
IJCET 10 03 001.
[3048] S. Stalin Kumar and G. T. Marimuthu, H − V -super magic decomposition of
complete bipartite graphs, Commun. Korean Math. Soc., 30(3) (2015) 313-325.
[3049] R. P. Stanley, Linear homogeneous Diophantine equations and magic labelings of
graphs, Duke Math. J., 40 (1973) 607-632.
[3050] R. P. Stanley, Magic labelings of graphs, symmetric magic squares, systems of
parameters and Cohen-Macaulay rings, Duke Math. J., 43 (1976) 611-531.
[3051] R. Stanton and C. Zarnke, Labeling of balanced trees, Proc. 4th Southeast Conf.
Combin., Graph Theory, Comput., (1973) 479-495.
[3052] V. L. Stella Arputha Mary, S. Navaneethakrishnan, and A. Nagarajan, Strong
Z4p -magic labeling, Ars Combin., 135 (2017) 197-211.
[3053] B. M. Stewart, Magic graphs, Canadian J. Math., 18 (1966) 1031-1059.
[3054] B. M. Stewart, Supermagic complete graphs, Canadian J. Math., 19 (1967) 427-
438.
(3) (4)
[3055] R. J. Stones, Do the windmills K5 and K5 admit graceful labellings?, https:
//mathoverflow.net/q/424682
[3056] A. Su, J. Buchanan, R. C. Bunge, E. Pelttari, G. Rasmuson, E. Sparks, and S.
Tagaris, On decompositions of complete multipartite graphs into the union of two
even cycles, J. Combin. Math. Combin. Comput., 96 (2016) 129-157.

the electronic journal of combinatorics (2023), #DS6 589

[3057] H.-H. Su, and H. Todt, On the edge-balance index sets of broken wheels, Congr.
Numer., 223 (2015) 205-218.
[3058] J. Su, H. Wang, and B. Yao, On elegant labelling and magic labelling of large-scale
graphs, Discrete Dynamics in Nature and Society, 2022 (2022) Article ID 6301674,
10 pages https://www.hindawi.com/journals/ddns/2022/6301674/
[3059] G. Subashini, K. Bhuvaneswari, and K. Manimekalai, Square dif-
ference labeling of theta graphs, Internat. J. Engin. Res. Tech.,
(IJERT), 8(9) (2019) 343-345. https://www.ijert.org/research/
square-difference-labeling-of-theta-graphs-IJERTV8IS090122.pdf
[3060] M. Subbiah, A Study on Some Variations of Graph Labeling and its Applications
in Various Fields, Ph. D. Thesis, Depart. Math., (2011), Bharathidasan University.
[3061] S. P. Subbiah and J. Pandimadevi, H − E-super magic decomposition of graphs,
Electron. J. Graph Theory Appl. (EJGTA), 2(2) (2014) 115-128.
[3062] G. Subhashini, K. Ramanathan and K. Manimekalai, Square sum labeling for
pyramid graph and hanging pyramid graph, Internat. Math. Appl., 6(1) (2019)
97-102.
[3063] I. W. Sudarsana, E. T. Baskova, D. Ismaimuza, and H. Assiyatun, Creating new
super edge-magic total labelings from old ones, J. Combin. Math. Combin. Com-
put., 55 (2005) 83-90.
[3064] I. W. Sudarsana, E. T. Baskoro, S. Uttunggadewa, and D. Ismaimuza, Expansion
techniques on the super edge anti magictotal graphs, J. Combin. Math. Combin.
Comput., 71 (2009) 189-199.
[3065] I. W. Sudarsana, A. Hendra, Adiwijaya, D. Y. Setyawan, On super edge anti
magic total labeling for t-joint copies of wheel, Far East J. Math. Sci., (FJMS)
69(2) (2012) 275-283.
[3066] I. W. Sudarsana, D. Ismaimuza, E. Baskova, and H. Assiyatun, On super (a, d)-
antimagic total labeling of disconnected graphs, J. Combin. Math. Combin. Com-
put., 55 (2005) 149-158.
[3067] I. W. Sudarsana, S. A. Suryanto, D. Lusianti, and N. Putri, An application of
super mean and magic graphs labeling on cryptography system, J. Physics Con-
fer. Ser. 1763(1):012052 (2020) https://www.researchgate.net/publication/
348996477_An_application_of_super_mean_and_magic_graphs_labeling_
on_cryptography_system/references#fullTextFileContent
[3068] G. Sudarvizhi and K. Balasangu, One modulo three mean labeling of graphs,
J. Phys.: Conf. Ser., (2021) 1770 012077, 1-12. https://iopscience.iop.org/
article/10.1088/1742-6596/1770/1/012077
[3069] S. Sudha, Some chain graphs are graceful, Math. Sci. Internat. Research J., 1(3)
(2012) 855-859.
[3070] S. Sudha, Gracefulness of joining complete bipartite graphs having a common
vertex set, Engin. Sci. Internat. Research J., 1(1) (2013) 84-85.

the electronic journal of combinatorics (2023), #DS6 590

[3071] M. Sudha and A. C. Babu, Even-even gracefulness of some families of graphs,
IOSR J. Math., (IOSR-JM), 8 (6) (2013) 7-11.
[3072] S. Sudha and V. Kanniga, Arbitrary supersubdivision of helms, centipedes and
ladder graphs are graceful, Math, Sci. Internat. Research J., 1(3)(2012) 860-863.
[3073] S. Sudha and V. Kanniga, Gracefulness of joining isolated vertices to a path, Global
J. Math. Math. Sciences, 2(1) (2012) 91-94.
[3074] S. Sudha and V. Kanniga, Gracefulness of some new class of graphs, Engin. Sci.
Internat. Reser. J., 1(1) (2013) 81-83.
[3075] S. Sudha and V. Kanniga, Graceful labeling on the combination of some graphs,
Math. Sci. Internat. Research J., 2(2) (2013) 630-633.
[3076] S. Sudha and V. Kanniga, Superposition of stars on cycles and n-centipedes are
graceful, Math. Sci. Internat. Research J., 2(2) (2013) 634-636. https://www.
xisdxjxsu.asia/V16I11-8.pdf
[3077] A. Manshath, P. Hariprabakaran, M. Veerasamy, and V. Balaji, GMJ coding using
even felicitous labeling and bistar graphs, July 2021 Journal of Physics Conference
Series 1964(2):022004. doi:10.1088/1742-6596/1964/2/022004
[3078] S. Sudhakar, T. Ranjani, V. Swathy, and V. Balaji, GMJ coding using even felicic-
itous labeling and two star graphs, July 2021 Journal of Physics Conference Series
1964(2):022025 8 pages. doi:10.1088/1742-6596/1964/2/022025
[3079] K. A. Sugeng, Z. Z. Barack, N. Hinding, and R. Simanjuntak, Modular irregular
labeling on double-star and friendship graphs, J. Math., (2021) Article ID 4746609,
6 pages. https://www.hindawi.com/journals/jmath/2021/4746609/
[3080] K. A. Sugeng and N. H. Bong, Vertex (a, d)-antimagic total labeling on circulant
graph Cn (1, 2, 3), J. Indones. Math. Soc., Special Edition (2011) 79-89.
[3081] K. A. Sugeng, D. Frončcek, M. Miller, J. Ryan, and J. Walker, On distance magic
labelings of graphs, J. Combin. Math. Combin. Comput., 71 (2009) 39-48.
[3082] K. A. Sugeng, B. N. Herawati, M. Miller, and M. Bača, On magicness and an-
timagicness of the union of 4-regular circulant graphs, Austral. J. Combin., 50,
(2011) 141-153.
[3083] K. A. Sugeng and M. Miller, Relationship between adjacency matrices and super
(a, d)-edge-antimagic-total labelings of graphs, J. Combin. Math. Combin. Com-
put., 55 (2005) 71-82.
[3084] K. A. Sugeng and M. Miller, On consecutive edge magic total labelings of graphs,
J. Discrete Algorithms, 6 (2008) 59-65.
[3085] K. A. Sugeng, M. Miller, M. Bača, Super edge-antimagic total labelings,
Util. Math., 71 (2006) 131-141. https://www.researchgate.net/publication/
262723143_Super_edge-antimagic_total_labelings
[3086] K. A. Sugeng, M. Miller, Y. Lin, and M. Bača, Super (a, d)-vertex-
antimagic total labelings, J. Combin. Math. Combin. Comput., 55 (2005)

the electronic journal of combinatorics (2023), #DS6 591

 91-102. https://www.researchgate.net/publication/262722984_Super_
ad-vertex-_antimagic_total_labelings
[3087] K. A. Sugeng, M. Miller, Y. Lin, and M. Bača, Face antimagic labelings of prisms,
Util. Math., 71 (2006) 269-286. https://www.researchgate.net/publication/
262722998_Face_antimagic_labelings_of_prisms
[3088] K. A. Sugeng, M. Miller, Slamin, and M. Bača, (a, d)-edge-antimagic total labelings
of caterpillars, Lecture Notes Comput. Sci., 3330 (2005) 169-180. https://link.
springer.com/content/pdf/10.1007/978-3-540-30540-8_19.pdf
[3089] K. A. Sugeng and J. Ryan, On several classes of monographs, Australas. J.
Combin., 37 (2007) 277-284. https://www.researchgate.net/publication/
266961369_On_several_classes_of_monographs
[3090] K. A. Sugeng, J. Ryan, and H. Fernau, A sum labelling for the flower fp,q , un-
published. https://www.academia.edu/18724308/A_Sum_Labelling_for_the_
Flower_fq_p
[3091] K. A. Sugeng and D. R. Silaban, Super (a, d)-vertex antimagic total labeling on
disjoint union of regular graphs, J. Combin. Math. Combin. Comput., 71 (2009)
217-225. https://www.researchgate.net/publication/266037854_Super_
ad-vertex_antimagic_total_labeling__on_a_disjoint_union_of_regular_
graphs
[3092] K. A. Sugeng, Surip, and Rismayati, On odd harmonious labeling of m-shadow
of cycle, gear with pendant, and Shuriken graphs, https://aip.scitation.org/
doi/pdf/10.1063/1.5139141
[3093] K. A. Sugeng and W. Xie, Construction of super edge magic total graphs, in: Pro-
ceed. Sixteenth Australasian Workshop oCombin. Algor. 2005, Ballarat, Australia,
(2005) 303-310/ https://core.ac.uk/download/pdf/213011717.pdf
[3094] M. Sugiyama, Generalization of magic graphs and their properties, Inform. Pro-
cess. Soc. Japan (IPSJ), 59(6) (2017) 1394-1404.
[3095] A. Sugumaran and V. Mohan, Prime cordial labeling of some graphs related to
H−graph, Annals Pure and Appl. Math., 16(1) (2018) 171-176.
[3096] A. Sugumaran and V. Mohan, Further results on prime cordial labeling, Annals
Pure and Appl. Math.,, 14(3) (2017) 489-496. http://www.researchmathsci.
org/APAMart/apam-v14n3-16.pdf
[3097] A. Sugumaran and V. Mohan, Difference cordial labeling of some special graphs
and related to fan graphs, Internat. J. Res. Engin. Appl. Management, 4(12) (2019)
57-60. http://ijream.org/papers/IJREAMV04I1248014.pdf
[3098] A. Sugumaran and K. Rajesh, Extended results on sum divisor cordial labeling,
Proyecc. J. Math., 38(4) (2019) 653-663. https://www.revistaproyecciones.
cl/index.php/proyecciones/article/view/3779/3239
[3099] A. Sugumaran and K. Suresh, Some results on divisor cordial labeling, Internat.
J. Applied Engin. Res, 10(72) (2015) 68-71.

the electronic journal of combinatorics (2023), #DS6 592

[3100] A. Sugumaran and K. Suresh, Some results on vertex odd divisor cordial label-
ing of graphs, Internat. J. Pure Appl. Math., 113(11) (2017) 199-207. https:
//acadpubl.eu/jsi/2017-113-pp/articles/11/22.pdf
[3101] A. Sugumaran and K. Suresh, A special class of prime cordial graphs, Inter-
nat. J. Pure Appl. Math.,, 114(6) (2017) 41-48. https://acadpubl.eu/jsi/
2017-114-5/articles/2/5.pdf
[3102] A. Sugumaran and K. Suresh, Further results on vertex odd divisor cordial labeling
of some graphs, Annals Pure Appl. Math., 16(2) (2018) 365-372. http://www.
researchmathsci.org/APAMart/apam-v16n2-13.pdf
[3103] A. Sugumaran and K. Suresh, Some star related vertex odd divisor cordial la-
beling of graphs, Annals Pure Appl. Math., 16(2) (2018) 385-391. http://www.
researchmathsci.org/APAMart/apam-v16n2-15.pdf
[3104] A. Sugumaran and K. Suresh, Cycle related vertex odd divisor cor-
dial labeling of graphs, J. Comput. Math. Sci., 9(3) (2018) 204-211.
http://www.compmath-journal.org/dnload/A-Sugumaran-and-K-Suresh-/
CMJV09I03P0204.pdf
[3105] A. Sugumaran and P. Vishnu Prakash, Some new results of prime cordial label-
ing, Internat. J. Pure Engin. Math., (IJPEM), 5(1) (2017) 9-14. http://www.
ascent-journals.com/IJPEM/Vol5No1/2-vishnuprakash.pdf
[3106] A. Sugumaran and P. Vishnu Prakash, Prime cordial labeling for theta graph, An-
nals Pure Appl. Math., 14(3) (2017) 379-386. https://pdfs.semanticscholar.
org/38c3/54cd5af11aead326d7c7de6193719995481b.pdf
[3107] A. Sugumaran and P. Vishnu Prakash, Some new results on prime cordial labeling
for theta graph, J. Comput. Math. Sci., 8(11) (2017) 630-634.
[3108] A. Sugumaran and P. Vishnu Prakash, Some new families of 3-equitable prime
cordial graphs, Internat. J. Stat. Appl. Math., 3(1) (2018) 45-49. http://www.
mathsjournal.com/pdf/2018/vol3issue1/PartA/2-6-12-620.pdf
[3109] A. Sugumaran and P. Vishnu Prakash, E-cordial labeling for theta graph, Research
Reviews: Discrete Math. Structures, 5(1)(2018) 26-32.
[3110] A. Sugumaran and P. Vishnu Prakash, 3-equitable prime cordial labeling in theta
graph, J. Emerging Tech. Innovative Res., 5(7) (2018) 332-338. https://www.
jetir.org/papers/JETIR1807205.pdf
[3111] A. Sugumaran and K. Rajesh, Some new results on sum divisor cordial graphs,
Annals Pure Appl. Math., 14(1) (2017) 45-52. https://pdfs.semanticscholar.
org/eee0/93c3f3bb98122a7551b08f1e1a26db538370.pdf
[3112] A. Sugumaran and K. Rajesh, Sum divisor cordial labeling of theta graph, Annals
Pure Appl. Math., 14(2) (2017) 313-320. https://pdfs.semanticscholar.org/
a540/180f1aeaf801a1e9ba53e817dfade5afcfc1.pdf

the electronic journal of combinatorics (2023), #DS6 593

[3113] A. Sugumaran and K. Rajesh, Sum divisor cordial labeling of Herschel graph, An-
nals Pure Appl. Math., 14(3) (2017) 465-472. https://pdfs.semanticscholar.
org/6327/4d4d2ff4c6239308ac67cba007846e1688be.pdf
[3114] A. Sugumaran and K. Rajesh, Further results on sum divisor cordial labeling, J.
Comput. Math. Sci., 8(12) (2017) 802-807. http://www.compmath-journal.org/
dnload/A-Sugumaran-and-K-Rajesh/CMJV08I12P0802.pdf
[3115] A. Sugumaran and K. Rajesh, Some graph operations on sum divisor cordial la-
beling related to H-graph, Internat. J. Stat. Appl. Math., 3(1) (2018) 389-395.
http://www.mathsjournal.com/archives/2018/vol3/issue1/PartE/3-1-15
[3116] A. Sugumaran, K. Rajesh, Sum divisor cordial labeling on some special graphs, In-
ternat. J. Math. Appl., 6(2-B) (2018) 347-353. https://pdfs.semanticscholar.
org/2105/7352842a3fb5d129c4e140c93775c65734a7.pdf
[3117] A. Sugumaran and K. Rajesh, Sum divisor cordial labeling on some
classes of graphs, J. Comput. Math. Sci., 10(2) (2019) 316-325.
http://www.compmath-journal.org/dnload/A-Sugumaran-and-K-Rajesh/
CMJV10I02P0316.pdf
[3118] A. Sugumaran and K. Rajesh, Perrin graceful graphs, Internat. J. Pure Appl.
Math., 114(6) (2017) 131-137.
[3119] A. Sugumaran and K. Rajesh, Lucas divisor cordial labeling, Internat. J. Pure
Appl. Math., 113(6) (2017) 233-241. https://acadpubl.eu/jsi/2017-114-5/
articles/2/14.pdf
[3120] J. E. Sulayman and A. C. Pedrano, On Fibonacci cordial labeling of some snake
graphs, April, 2023, preprint. https://www.researchgate.net/publication/
369712614_On_Fibonacci_Cordial_Labeling_of_Some_Snake_Graphs
[3121] P. Sumathi and G. G. Raman, Arithmetic sequential graceful labeling on star
related graphs, Indian J. Sci. Tech., 15(44) (2022) 2356-2362.
https://indjst.org/articles/arithmetic-sequential-graceful-labeling-on-star-rel
[3122] P. Sumathi and A. Rathi Some more results on quotient labeling of special graphs,
Internat. J. Pure Appl. Math., 115(9) (2017) 259-268. https://acadpubl.eu/
jsi/2017-115-9/articles/9/22.pdf
[3123] P. Sumathi and A. Rathi, Quotient labeling of some ladder graphs, American
Engin. Res., (AJER), 7 (12) 38-42. https://ajer.org/papers/Vol-7-issue-12/
E07123842.pdf
[3124] P. Sumathi and A. Rathi, Quotient labeling of snake related graphs, IOSR J.
Math., 14(6) Ver. II (2018) 26-33.
[3125] P. Sumathi and J. Suresh Kumar, Fuzzy quotient-3 cordial labeling of star related
graphs- Paper I, Malaya J. Matematik, S(1) (2019) 79-82. https://doi.org/10.
26637/MJM0S01/0020
[3126] L. Sun, Radio number for middle graph of dandelion, J. Discrete Math. Sci. Cryp-
togr, 24(4) (2021) 865-877.

the electronic journal of combinatorics (2023), #DS6 594

[3127] R. G. Sun, Harmonious and sequential labelings of the book graphs Bm , Gaoxiao
Yingyong Shuxue Xuebao Ser. A, 9 (1994) 335-337.
[3128] D. Q. Sun and D.Y. Wang, Even sequential harmonious graphs, personal commu-
nication (2015).
[3129] G. C. Sun, J. Guan, and S.-M. Lee, A labeling algorithm for magic graph, Proceed-
ings of the Twenty-fifth Southeastern International Conference on Combinatorics,
Graph Theory and Computing (Boca Raton, FL, 1994). Congr. Numer. 102 (1994)
129-137.
[3130] G. C. Sun and S. M. Lee, Construction of magic graphs, Congr. Numer., 103
(1994) 243-251.
[3131] G-Y. Sun, Z-B. Gao, and S-M. Lee, On full friendly index sets of twisted product
of Mőbius ladders, Ars Combin., 128 (2016) 225-239.
[3132] H. Sun, X. Zhang, and B. Yao, Construction of new graphical passwords
with graceful-type labellings on trees, Conference: 2018 2nd IEEE Adv. In-
for. Management, Communicates, Elect. Automation Control Conf. (IMCEC)
https://www.researchgate.net/publication/328166886_Construction_of_
New_Graphical_Passwords_with_Graceful-Type_Labellings_on_Trees
[3133] M. Sundaram, R. Ponraj and S. Somasundaram, Product cordial labeling
of graphs, Bull. Pure and Appl. Sci. (Math. & Stat.), 23E (2004) 155-163.
https://www.researchgate.net/publication/303486909_Product_cordial_
labeling_of_graphs
[3134] M. Sundaram, R. Ponraj, and S. Somasundram, Prime cordial labeling of graphs,
J. Indian Acad. Math., 27 (2005) 373-390.
[3135] M. Sundaram, R. Ponraj, and S. Somasundram, Some results on total product
cordial labeling of graphs, J. Indian Acad. Math., 28 (2006) 309-320.
[3136] M. Sundaram, R. Ponraj, and S. Somasundaram, On a prime labeling conjecture,
Ars Combin., 80 (2006) 205-209.
[3137] M. Sundaram, R. Ponraj, and S. Somasundram, Total product cordial labeling of
graphs, Bull. Pure Appl. Sci. Sect. E Math. Stat., 25 (2006) 199-203.
[3138] M. Sundaram, R. Ponraj and S. Somasundaram, On prime graphs of order 6 6,
Acta Ciencia Indica, 32 (2006) 859-871.
[3139] M. Sundaram, R. Ponraj and S. Somasundaram, Mean number of a graph, Pure
Appl. Math. Sci., 57 (2007) 93-101.
[3140] M. Sundaram, R. Ponraj and S. Somasundaram, EP-cordial labeling of graphs,
Varahmihir J. Math. Sci., 7 (2007) 183-194.
[3141] M. Sundaram, R. Ponraj and S. Somasundaram, On graph labeling parameter, J.
Discrete Math. Sci. Cryp., 11 (2008) 219-229.
[3142] M. Sundaram, R. Ponraj, and S. Somasundaram, Some results on product cordial
labeling, Pure and Applied Math. Sciences, to appear.

the electronic journal of combinatorics (2023), #DS6 595

[3143] B. S. Sunoj and T. K. Mathew Varkey, ADCSS-Labeling for some mid-
dle graphs, Annals Pure Applied Math., 12(2) (2016) 161-167. http://www.
researchmathsci.org/apamart/apam-v12n2-7.pdf
[3144] I. N. Suparta and I Dewa M. Agus Ariawan, Expanding graceful trees, Electron.
J. Graph Theory Appl, (EJGTA) 8(2) (2020) 217-232. https://www.ejgta.org/
index.php/ejgta/article/view/936/pdf_137
[3145] N. Suparta and D. M. A. Ariawan, Some methods for constructing some classes of
graceful uniform trees, Indonesian J. Combin., 2(2) (2018) 123-135. http://dx.
doi.org/10.19184/ijc.2018.2.2.7
[3146] I. N. Suparta and I. P. Suharta, A note on edge irregularity strength of some graphs,
Indonesian J. Combin., 4(1) (2020) 10-20. http://dx.doi.org/10.19184/ijc.
2020.4.1.2
[3147] M. C. Superdock, The Graceful Tree Conjecture: A Class of Graceful Diameter-6
Trees, Senior Thesis, Department of Mathematics of Princeton University, 2013
[3148] Y. Susanti and M. A. Haq, On the total edge irregularity strength
of odd and even staircase graphs, Preprints 2022, 2022080259 (doi:
10.20944/preprints202208.0259.v1).
[3149] Y. Susanti, H. Khotimah, M. Hidayati, and M. F. Wahyujati, On total edge irreg-
ularity strength of some graphs and the construction of some labeling, Far East J.
Math. Sci. (FJMS), 104(1) (2018) 49-64.
[3150] Y. Susanti, I. Ernanto1, and B. Surodjo, On some new edge odd graceful graphs,
Proceed. 8th SEAMS-UGM Internat. Conf. Math. Appl. 2019 AIP Conf. Proc.
2192, 040016-1–040016-12. https://aip.scitation.org/doi/pdf/10.1063/1.
5139142?class=pdf
[3151] Y. Susanti, Y. I. Puspitasari and H. Khotimah, On total edge irregularity strength
of staircase graphs and related graphs, Iran. J. Math. Sci. Inform., 15(1) (2020)
1-13. http://ijmsi.ir/article-1-1121-en.html
[3152] Y. Susanti, S. Wahyuni, A. Sutjijana, S. Sutopo, and I. Ernanto, Generalized
arithmetic staircase graphs and their total edge irregularity strengths, Sym-
metry 14(9) (2022) :1853. https://www.researchgate.net/publication/
363400767_Generalized_Arithmetic_Staircase_Graphs_and_Their_Total_
Edge_Irregularity_Strengths
[3153] F. Susanto, On super (a, d)-Cn -antimagic total labeling of disjoint union of cycles,
AKCE Int. J. Graphs Comb., 15(1) (2018) 22-26. https://www.tandfonline.
com/doi/full/10.1016/j.akcej.2018.01.017?scroll=top&needAccess=true
[3154] F. Susanto, C. N. Betistiyan, I. Halikin, and K. Wijaya, On inclusive distance
vertex irregularity strength of small identical copies of star graphs, Journal of
Physics: Conference Series 1872 (1) (2021), 012005.
[3155] F. Susanto, K. Wijaya, P. M. Purnama, and Slamin, On distance irregular
labelings of disconnected graphs, Kragujevac J. Math., 46(4) (2020) 507-

the electronic journal of combinatorics (2023), #DS6 596

 523. researchgate.net/publication/340593151_ON_DISTANCE_IRREGULAR_
LABELING_OF_DISCONNECTED_GRAPHS
[3156] F. Susanto, K. Wijaya, and Slamin, A. Semanic̆ová-Fen̆ovc̆ı́ková, Distance irregu-
larity strength of graphs with pendant vertices, Opuscula Math. 42 (3) (2022),
439-458. https://www.researchgate.net/publication/360259244_Distance_
irregularity_strength_of_graphs_with_pendant_vertices
[3157] F. Susanto, K. Wijaya, I. W. Sudarsana, and Slamin, Non-inclusive and inclusive
distance irregularity strength for the join product of graphs, Electron. J. Graph
Theory Appl. (EJGTA) 10 (1) (2022), 1-13. https://www.researchgate.
net/publication/360299847_Non-inclusive_and_inclusive_distance_
irregularity_strength_for_the_join_product_of_graphs
[3158] S. Susilawati, E. T. Baskoro, and R. Simanjuntak, Total vertex irregularity strength
of trees with maximum degree five, Elect. J. Graph Th. Appl. 6 (2) (2018) 250-257.
[3159] Susilawati, E. T. Baskaro, and R. Simanjuntak, On the vertex irregular clabeling
for subdivision for trees, Australas J. Comb., 71(2) (2018) 293-302. https://ajc.
maths.uq.edu.au/pdf/71/ajc_v71_p293.pdf
[3160] Susilawati, E. T. Baskoro and R. Simanjuntak, Total vertex irregularity labelings
for subdivision of several classes of trees, Procedia Comput. Sci., 74 (2015)
112-117. https://www.researchgate.net/publication/290021906_Total_
Vertex-Irregularity_Labelings_for_Subdivision_of_Several_Classes_
of_Trees
[3161] Susilawati, E. T. Baskoro and R. Simanjuntak, Total vertex irregularity strength
of trees with maximum degree four, AIP Conf. Proc., 1707 (2016) 1-7.
[3162] Susilawati, E. T. Baskoro and R. Simanjuntak, Total vertex irregularity strength
of trees with maximum degree five, (submitted). z
[3163] Susilawati, E. T. Baskoro and R. Simanjuntak, On the total vertex irregularity
strength for trees with many vertices of degree 2, (submitted).
[3164] L. Susilowati, T. Sania, and N. Estuningsih, Super (a, d)-Cn -antimagic total label-
ing of ladder graph, Adv. Appl. Discrete Math., 10(2) (2012) 77-93.
[3165] M. Sutton, Sumable Graphs Labellings and Their Applications, Ph. D. Thesis,
Dept. Computer Science, The University of Newcastle, 2001.
[3166] M. Sutton, A. Draganova, and M. Miller, Mod sum numbers of wheels, Ars Com-
bin., 63 (2002) 273-287.
[3167] M. Sutton and M. Miller, Mod sum graph labelling of Hn,n and Kn , Australas. J.
Combin., 20 (1999) 233-240.
[3168] M. Sutton and M. Miller, On the sum number of wheels, Discrete Math., 232
(2001) 185-188.
[3169] M. Sutton, M. Miller, J. Ryan, and Slamin, Connected graphs which are not mod
sum graphs, Discrete Math., 195 (1999) 287-293.

the electronic journal of combinatorics (2023), #DS6 597

[3170] V. Swaminathan and P. Jeyanthi, Super vertex-magic labeling, Indian J. Pure
Appl. Math., 34(6) (2003) 935-939.
[3171] V. Swaminathan and P. Jeyanthi, On super vertex-magic labeling, J. Discrete
Math. Sci. & Cryptography, 8 (2005) 217-224.
[3172] V. Swaminathan and P. Jeyanthi, Super edge-magic strength of fire crackers,
banana trees and unicyclic graphs, Discrete Math., 306 (2006) 1624-1636.
https://reader.elsevier.com/reader/sd/pii/S0012365X06002172?token=
A64AFC9690FA9E459EEA4506C7FD4BC3D30B4D2FEF4FA06418CB9802AEE5C6BB3AD0A20D863D0012
originRegion=us-east-1&originCreation=20230311182022
[3173] V. Swaminathan and P. Jeyanthi, Super edge-magic strength of generalized theta
graph, Inter. J. Management and Systems, 22 (2006) 203-220.
[3174] V. Swaminathan and P. Jeyanthi, Super edge-magic strength of some trees, Util.
Math., 72 (2007) 199-210.
[3175] V. Swaminathan and P. Jeyanthi, (a, d)-1-vertex-antimagic vertex labeling, Util.
Math., 74 (2007) 179-186.
[3176] V. Swaminathan and P. Jeyanthi, Super edge-magic labeling of some
new classes of graphs, Math. Education, XLII(2) (2008) 91-94. https:
//www.researchgate.net/publication/267677152_Super_edge-magic_
labeling_of_some_new_classes_of_graphs
[3177] V. Swaminathan and P. Jeyanthi, Strong super edge-magic graphs, Math. Educa-
tion, XLII(3) (2008) 156-160.
[3178] B. Swita, U. Rafflesia, N. Henni Ms, D. S. Adji, and M. Simanihuruk, On edge
magic total labeling of (7, 3)-cycle books, Int. J. Math. Math. Sci., (2019) Art. ID
1801925, 8 pp. https://doi.org/10.1155/2019/1801925
[3179] R. Sweetly and J. P. Joseph, The radio number of (Wn : 2) graphs, J. Discrete
Math. Sci. Cryptogr., 12 (2009) 729-736.
[3180] Z. Szaniszló, k-equitable labellings of cycles and some other graphs, Ars Combin.,
37 (1994) 49-63.
[3181] A. Tabraiz and M. Hussain, Magic and anti-magic total labeling on subdivision of
grid graphs, J. Graph Labeling, 2(1) (2016) 9-24.
[3182] Y. B. Tai, G. L. Chia, and P.-H. Ong, Multi-bridge graphs are anti-magic, Electron.
J. Graph Theory Appl., (EJGTA) 10(1) (2022) 311-318. https://www.ejgta.org/
index.php/ejgta/article/view/1369/pdf_222
[3183] A. Taimur, G. Ali, M. Numan, A. Aslam, and K. Anoh Yannick, Super H-
antimagic total covering for generalized antiprism and toroidal octagonal map,
J. Math., (2021) Art. ID 9680137, 8 pp. https://www.hindawi.com/journals/
jmath/2021/9680137
[3184] A. Taimur, M. Numan, A. Mumtaz, and A. Semanic̆ová-Fen̆ovc̆ı́ková, Super (a, d)−
H-antimagic labeling of subdivided graphs, Open Math., 16 (2018) 688-697.

the electronic journal of combinatorics (2023), #DS6 598

[3185] Y. Takahasi, F. A. Muntaner-Batle, and R. Ichishima, Some new results concerning
the valences of (super) edge-magic graphs, arXiv:2306.15986.pdf
[3186] M. Tamilselvi, K. Akilandeswari, and V. Suguna, k-super mean labeling of some
graphs, Internat. J. Sci. and Res., (IJSR), 5(6) 2016. https://bit.ly/2UEeMzu
[3187] M. Tamilselvi and N. Revathi, k–super harmonic mean labeling of some graphs,
Aryabhatta J. Math. Informatics, 9(1) (2017) 779-787.
[3188] D. Tanna, J. Ryan, and Semaničová-Feňovčı́ková, Edge irregular reflexive labeling
of prisms and wheels, Australasain J. Combin., 69(3) (2017) 394-401. https://
ajc.maths.uq.edu.au/pdf/69/ajc_v69_p394.pdf
[3189] R. Tao, On k-cordiality of cycles, crowns and wheels, Systems Sci. Math. Sci., 11
(1998) 227-229.
[3190] I. Tarawneh, R. Hasni, and A. Ahmad, On the edge irregularity strength of corona
product of graphs with paths, Appl. Math. E-Notes, 16 (2016) 80-87.
[3191] I. Tarawneh, R. Hasni, and A. Ahmad, On the edge irregularity strength of corona
product of cycle with isolated vertices, AKCE Internat. J. Graphs Combin., 13
(2016) 213-217.
[3192] I. Tarawneh, R. Hasni, A. Ahmad, and M. A. Asim, On the edge irregularity
strength for some classes of plane graphs, 6(3) (2021) 2724-2731. http://www.
aimspress.com/article/doi/10.3934/math.2021166
[3193] I. Tarawneh, R. Hasni, and M. A. Asim, On the edge irregularity strength of
disjoint union of star graph and subdivison of star graph, Ars Combin., 141 (2018)
93-100.
[3194] I. Tarawneh, R. Hasni, M. K. Siddiqui, and M. A. Asim, On the edge irregularity
strength of disjoint union of certain graphs, Ars Combin., 142 (2019) 239-249.
[3195] M. Teffilia1 and J. Devaraj, On friendly index set of graphs, Internat. J. Sci. Res.
Math. Stat. Sci., 5(4) (2018) 258-263.
[3196] H.-M. Teichert, The sum number of d-partite complete hypergraphs, Discuss.
Math. Graph Theory, 19 (1999) 79-91.
[3197] H.-M. Teichert, Classes of hypergraphs with sum number one, Discuss. Math.
Graph Theory, 20 (2000) 93-103.
[3198] H.-M. Teichert, Sum labellings of cycle hypergraphs, Discuss. Math. Graph The-
ory, 20 (2000) 255-265.
[3199] S. Telang, private communication.
[3200] A. Tenguria and R. Verma, 3-Total super sum cordial labeling for union of some
graphs, IJAIS, Foundation of Computer Science, New York, USA, 8(4) (2015)
25-30.
[3201] A. Tenguria and R. Verma. 3-Total super product cordial labeling for some graphs,
Internat. J. Science Res., 4(2) (2015) 557-559.

the electronic journal of combinatorics (2023), #DS6 599

[3202] A. Tenguria and R. Verma, 3-total super sum cordial labeling by applying opera-
tions on some graphs, Appl. Appl. Math., 11 (2016)(1) 444-446.
[3203] M. Tezer and I. Cahit, A note on (a, d)-vertex antimagic total labeling of paths
and cycles, Util. Math., 68 (2005) 217-221.
[3204] T. Tharmaraj and P. B. Sarasija, Square difference labeling for certain graphs,
Internat. J. Math. Archive, 4(8) (2013) 183-186.
[3205] T. Tharmaraj and P. B. Sarasija, On beta combination labeling graphs, Internat.
J. Computer Applications, 79(13) (2013) 26-29.
[3206] T. Tharmaraj and P. B. Sarasija, Beta combination graphs, Internat. J. Computer
Applications, 76(14) (2013) 1-5.
[3207] K. Thejeshwi and S. Kirupa, Application of graceful graph in MPLS, IJSRD -
Internat. J. Sci. Res. Development, 6(06) (2018) 2321-0613.
[3208] K. Thirugnanasambandam and G. Chitra, Fibonacci mean anti-magic labeling of
graphs, Inter. J. Res. Advent. Tech., 7(4S) (2019) 7-10. http://www.ijrat.org/
downloads/Vol-7/aprils-2019/PaperID-74S201905.pdf
[3209] K. Thirugnanasambandam, G. Chitra, and Y. Vishnupriya, Prime odd mean la-
beling of some special graphs, J. Emerging Tech. Innov. Res. (JETIR), 5(6) (2018)
115-126. https://www.jetir.org/papers/JETIR1806795.pdf
[3210] K. Thirusangu and R. Bhrathiraja, Magic and antimagic labelings of Cayley di-
graphs over the groups Zpn ⊕Zpn and Zm ⊕Zn , Adv. Appl. Math. Sci., 20(9) (2021)
1851-1864. https://www.mililink.com/upload/article/717844157aams_vol_
209_july_2021_a19_p1851-1864_k._thirusangu_and_r._bharathiraja.pdf
[3211] K. Thirusangu and M. Madhu, Divisor cordial labeling in extended duplicate graph
of star, bistar and double star, JASC: J. Appl. Sci. Comput., VI(I) (2019) 19-24.
[3212] K. Thirusangu, A. K. Nagar, and R. Rajeswari, Labelings in Cayley digraphs,
European J. Combin., 32 (2011) 133-139.
[3213] M. I. Tilukay, A. N. M. Salman, and E. R. Persulessy, On the to-
tal irregularity strength of fan, wheel, triangular book, and friend-
ship graphs, Procedia Compu. Sci,, 74 (2015) 124-131. https:
//reader.elsevier.com/reader/sd/pii/S1877050915035486?token=
945B03DAA7D05314791234C784DCBD7D736CD6C46FF4684B0D2E0069DDBA68787C7D3B572E05A1EF
originRegion=us-east-1&originCreation=20220104130600
[3214] M. I. Tilukay, P. D. M. Taihuttu, A. N. M. Salman, F. Y. Rumlawang, and Z.
A. Leleury, Complete bipartite graph is a totally irregular total graph, Electron.
J. Graph Theory Appl., (EJGTA) 9(2) (2021) 387-395. https://www.ejgta.org/
index.php/ejgta/article/view/453/pdf_186
[3215] M. I. Tilukay, B. P. Tomasouw, F. Y. Rumlawang, and Z. A. Leleury, The total
irregularity strength of complete graphs and complete bipartite graphs, Far East
J. Math. Sci., 102(2) (2017) 317-327.

the electronic journal of combinatorics (2023), #DS6 600

[3216] M. I. Tilukay, B. P. Tomasouw, F. Y. Rumlawang, and A. N. M. Salman, The total
irregularity strength of complete graphs and complete bipartite graphs, Far East
J. Math Sci., (FJMS), 102(2) (2017) 317-327.
[3217] M. I. Tilukay, A. Salman, V. Y. Ilwaru, and F. Y. Rumlawang, The total
face irregularity strength of some plane graphs,AKCE Int. J. Graphs Comb.,
17(1) (2020) 495-502. https://www.sciencedirect.com/science/article/
pii/S0972860017302463
[3218] A. Tiwari and A. Tripathi, On the range of size of sum graphs & integral sum
graphs of a given order, Discrete Appl. Math., 161 (16-17) (2013) 2653-2661.
[3219] H. Todt, On edge-balance index sets of distance two, Congr. Numer., 223 (2015)
105-117.
[3220] C. Tong, X. Lin, Y. Yang, and L. Wang, Irregular total labellings of Cm Cn , Util.
Math., 81 (2010) 3-13.
[3221] A. Tout, A. N. Dabboucy, and K. Howalla, Prime labeling of graphs, Nat. Acad.
Sci. Letters, 11 (1982) 365-368.
[3222] T. Traetta, A complete solution to the two-table Oberwolfach problems, J. Combin.
Theory, Series A, 120(5) (2013) 984-997.
[3223] M. Trenklér, Some results of magic graphs, graphs and other combinatorics topics,
Teubner-Texte zur Mathematik - Band 59, Leipzig (1983) 328-332.
[3224] M. Trenklér, Numbers of vertices and edges of magic graphs, Ars Combin., 55
(2000) 93-96.
[3225] M. Trenklér, Super-magic complete n-partite hypergraphs, Graphs and Combin.,
17 (2001) 171-175.
[3226] M. Trenklér, Magic p-dimensional cubes, Acta Arithmetica, 96 (2001) 361-364.
[3227] M. Trenklér and V. Vetchý, Magic powers of graphs, Math. Bohemica, 122 (1997)
121-124.
[3228] E. F. Elizeche and A. Tripathi, A characterization of the sum and integral sum
labellings of some classes of graphs, Integers 20 (2020) Paper No. A33, 24 pp.
http://math.colgate.edu/~integers/u33/u33.pdf
[3229] M. Truszczyński, Graceful unicyclic graphs, Demonstatio Mathematica, 17 (1984)
377-387.
[3230] Y. Tsao, A simple research of divisor graphs, The 29th Workshop Combin. Math.
Computation Th., National Taipei College of Business, Institute of Information
and Decision Sciences, Taipei, Taiwan, April 27-28, 2012, 186-190.
[3231] M. Tuczyński, P. Wenus, and K. Wȩsek, On cordial labeling of hypertrees, Discrete
Math. Theor. Comput. Sci., 21(4) (2019) Paper No. 1, 14 pp.
[3232] M. Tuga, M. Miller, J. Ryan, and Z. Ryjáčk, Exclusive sum labelings of trees, J.
Combin. Math. Combin. Comput., 55 (2005) 109-121.
[3233] Z. Tuza, Graph labeling games, Electronic Notes Disc. Math., 60 (2017) 61-68.

the electronic journal of combinatorics (2023), #DS6 601

[3234] J. Uma and A. Mazudha Shanofer, A note on edge–graceful labeling for corona
and flower graph, AIP Conf. Proceed. 2112, 020095, (2019) 1-5. https://aip.
scitation.org/doi/pdf/10.1063/1.5112280
[3235] R.Ullah, G. Rahmat, M. Numan, K. Anoh Yannick, and A. Aslam, 3-total edge
product cordial labeling for stellation of square grid graph, J. Math., (2021) Art.
ID 1724687, 6 pp. https://downloads.hindawi.com/journals/jmath/2021/
1724687.pdf
[3236] N. Ujwala, Applications of graceful graph, Internat. J. Eng. Sci. Res. Tech., 4
(2015) 129-131.
[3237] R. Ulfatimah, M. Roswitha, and T. A. Kusmayadi, H-supermagic labeling on
shrubs graph and Lm · Pn , Internat. Confer. Math.: Edu., Th. Appl., IOP Conf.
Series: Journal of Physics: Conf. Series 855 (2017) 012055 1-8.
[3238] S. K. Vaidya and C. M. Barasara, Product cordial labeling for some new graphs, J.
Math. Research, 3(2) (2011) 206-211. http://www.ccsenet.org/journal/index.
php/jmr/article/view/8703
[3239] U. Vaghela and D. Parmar, Difference perfect square cordial labeling, J.
Gujarat Res. Soc., 21(15) (2019) 758-770. https://www.researchgate.net/
publication/338503111_Difference_Perfect_Square_Cordial_Labeling
[3240] U. Vaghela and D. Parmar, Difference perfect square cordial labeling of some
graphs, J. Xidian Univer., 14(2) (2020) 87-98.
[3241] U. Vaghela and D. Parmar, Difference perfect square cordial labeling of
snake graphs, Zeichen J., 6(3) 2020 54-73. https://www.researchgate.net/
publication/340309173_Difference_Perfect_Square_Cordial_Labeling_
of_Snake_Graphs/references#fullTextFileContent
[3242] U. Vaghela and D. Parmar, Extra Skolem difference mean labeling of var-
ious graphs, J. Math. Stat. Studies, JMSS 2(1) (2021) 26-39 https://
al-kindipublisher.com/index.php/jmss/article/view/1465/1274
[3243] U. Vaghela and D. Parmar, Edge magic total labeling & edge trimagic total
labeling of some graphs, Annals of R.S.C.B., 25(4) (2021) 5784-5809. https:
//www.annalsofrscb.ro/index.php/journal/article/view/3145/2616
[3244] S. K. Vaidya and C. M. Barasara, Further results on product cordial labeling,
International J. Math. Combin., 3 (2012) 64-71.
[3245] S. K. Vaidya and C. M. Barasara, Some product cordial graphs, Elixir Discrete
Math., 41 (2011) 5948-5952.
[3246] S. K. Vaidya and C. M. Barasara, Product cordial graphs in the
context of some graph operations, Internat. J. Math. Sci. Comput.,
1(2) (2011) 1-6. https://www.researchgate.net/publication/265662133_
Product_Cordial_Graphs_in_the_Context_of_Some_Graph_Operations
[3247] S. K. Vaidya and C. M. Barasara, Harmonic mean labeling in the context of du-
plication of graph elements, Elixir Discrete Math., 48 (2012) 9482-9485.

the electronic journal of combinatorics (2023), #DS6 602

[3248] S. K. Vaidya and C. M. Barasara, Further results on product cordial graphs, In-
ternat. J. Math. Soft Comput., 2(2) (2012) 67-74. https://www.researchgate.
net/publication/277765650_Further_Results_on_Product_Cordial_Graphs
[3249] S. K. Vaidya and C. M. Barasara, Edge product cordial labeling of graphs,
J. Math.Comput. Science, 2(5) (2012) 1436-1450. http://scik.org/index.php/
jmcs/article/view/420/189
[3250] S. K. Vaidya and C. M. Barasara, Geometric mean labeling in the context of
duplication of graph elements, Internat. J. Math. Sci. Engin. Appl., 6(6) (2012)
311-319. http://www.ascent-journals.com/IJMSEA/Vol6No6/29-S.K.Vaidya.
pdf
[3251] S. K. Vaidya and C. M. Barasara, Some new families of edge product cordial
graphs, Advanced Modeling Optimization, 15(1) (2013) 103-111. http://camo.
ici.ro/journal/vol15/v15a9.pdf
[3252] S. K. Vaidya and C. M. Barasara, Some edge product cordial graphs, Internat. J.
Math. Soft Comput., 3(3) (2013) 49-53.
[3253] S. K. Vaidya and C. M. Barasara, Edge product cordial labeling in the context
of some graph operations, Internat. J. Math. Scientific Comput., 3(1) (2013) 4-7.
https://veltech.edu.in/wp-content/uploads/2016/04/Paper-02-13.pdf
[3254] S. K. Vaidya and C. M. Barasara, Total edge product cordial labeling of
graphs, Malaya J. Matematik, 3(1) (2013) 55-63. http://www.malayajournal.
org/articles/MJM039.pdf
[3255] S. K. Vaidya and C. M. Barasara, On total edge product cordial labeling, Internat.
J. Math. Scientific Comput., 3(2) (2013) 12-16.
[3256] S. K. Vaidya and C. M. Barasara, On edge product cordial labeling of some product
related graphs, Internat. J. Math. Appl., 2(2) (2014) 15-22.
[3257] S. K. Vaidya and C. M. Barasara, Product and edge product cordial labeling of
degree splitting graph of some graphs, Adv. Appl. Discrete Math., 15(1) (2015)
61-74.
[3258] S. K. Vaidya and C. M. Barasara, Product cordial labeling of line graph of some
graphs, Kragujevac J. Math., 40(2) (2016) 290-297.
[3259] S. K. Vaidya and C. M. Barasara, Embedding and NP-complete problems for some
equitable labelings, J. Appl. Comp. Sci. Math., 18(8) (2014) 38-42.
[3260] S. K. Vaidya and C. M. Barasara, On embedding and NP-complete problems of eq-
uitable labelings, IOSR J. Math., 11(1)(III) (2015) 80-85. http://iosrjournals.
org/iosr-jm/papers/Vol11-issue1/Version-3/N011138085.pdf
[3261] S. K. Vaidya and L. Bijukumar, Odd graceful labeling of some new graphs, Modern
Appl. Sci., 4 (2010) 65-69.
[3262] S. K. Vaidya and L. Bijukumar, New mean graphs, International J. Math. Combin.,
3 (2011) 107-113.

the electronic journal of combinatorics (2023), #DS6 603

[3263] S. K. Vaidya and N. A. Dani, Some new star related graphs and their cordial as
well as 3-equitable labeling, J. Science 1(1) (2010) 111-114.
[3264] S. K. Vaidya and N. A. Dani, Cordial labeling and arbitrary super subdivision of
some graphs, Inter. J. Information Sci. Comput. Math., 2(1) (2010) 51-60.
[3265] S. K. Vaidya and N. A. Dani, Some new product cordial graphs, J. Applied Com-
puter Science & Math., 8(4) (2010) 62-65. http://jacs.usv.ro/index.php
[3266] S. K. Vaidya and N. A. Dani, Cordial and 3-equitable graphs induced by duplica-
tion of edge, Math. Today, 27 (2011) 71-82.
[3267] S. K. Vaidya, N. Dani, K. Kanani, and P. Vihol, Cordial and 3-equitable labeling
for some star related graphs, Internat. Mathematical Forum, 4 (2009) 1543-1553.
[3268] S. K. Vaidya, N. Dani, K. Kanani, and P. Vihol, Cordial and 3-equitable labeling
for some shell related graphs, J. Sci. Res., 1 (2009) 438-449.
[3269] S. K. Vaidya, N. Dani, K. Kanani, and P. Vihol, Some wheel related 3-equitable
graphs in the context of vertex duplication, Adv. and Appl. Disc. Math., 4 (2009)
71-85.
[3270] S. K. Vaidya, N. A. Dani, K. K. Kanani, and P. L. Vihol, Cordial and 3-equitable
labeling for some wheel related graphs, IAENG International J. Applied Math.
41(2) (2011) 99-105.
[3271] S. K. Vaidya, N. A. Dani, P. L. Vihol, and K. K. Kanni, Strongly multiplicative la-
beling in the context of arbitrary supersubdivision, J. Math. Research, 2(2) (2010)
28-33.
[3272] S. K. Vaidya, G. Ghodasara, S. Srivastav, and V. Kaneria, Cordial labeling for two
cycle related graphs, Math. Student, 76 (2007) 237-246.
[3273] S. K. Vaidya, G. V. Ghodasara, S. Srivastav, and V. J. Kaneria, Cordial and
3-equitable labeling of star of a cycle, Math. Today, 24 (2008) 54-64.
[3274] S. K. Vaidya, G. Ghodasara, S. Srivastav, and V. Kaneria, Some new cordial
graphs, Internat. J. Scientific Computing, 2 (2008) 81-92.
[3275] S. K. Vaidya and K. Kanani, Some new results on cordial labeling in the context of
arbitrary supersubdivision of graph, Applied Math. Sci., 4(47) (2010) 2323-2329.
[3276] S. K. Vaidya and K. K. Kanani, Some cycle related product cordial graphs, Inter-
nat. J. Algor., Comput. and Math., 3(1) (2010) 109-116.
[3277] S. K. Vaidya and K. K. Kanani, Strongly multiplicative labeling for some cycle
related graphs, Modern Applied Science, 4(7) (2010) 82-88.
[3278] S. K. Vaidya and K. K. Kanani, Prime labeling for some cycle related graphs, J.
Math. Research, 2(2) (2010) 98-103.
[3279] S. K. Vaidya and K. K. Kanani, Some new product cordial graphs, Math. Today,
27 (2011) 64-70.

the electronic journal of combinatorics (2023), #DS6 604

[3280] S. K. Vaidya and K. K. Kanani, Some strongly multiplicative graphs in the context
of arbitrary supersubdivision, Internat. J. Applied Math. and Comput., 3(1) (2011)
60-64.
[3281] S. K. Vaidya, V. J. Kaneria, S. Srivastav, and N. A. Dani, Gracefulness of union
of two path graphs with grid graph and complete bipartite graph, Proceedings of
the First International Conference on Emerging Technologies and Applications in
Engineering Technology and Sciences (2008) 616-619.
[3282] S. K. Vaidya, K. Kanani, S. Srivastav, and G. Ghodasara, Baracentric subdivision
and cordial labeling of some cycle related graphs, Proceedings of the First Inter-
national Conference on Emerging Technologies and Applications in Engineering,
Technology and Sciences, (2008) 1081-1083.
[3283] S. K. Vaidya, K. Kanani, P. Vihol, and N. Dani, Some cordial graphs in the context
of barycentric subdivision, Int. J. Comtemp. Math. Sciences, 4 (2009) 1479-1492.
[3284] S. K. Vaidya and N. J. Kothari, Some new families of line graceful graphs, Internat.
J. Mathematics Sci. Comput., 1(2) (2011) 26-28.
[3285] S. K. Vaidya and N. J. Kothari, Line gracefulness of some path related graphs,
Internat. J. Math. Sci. Comput., 4(1) (2014) 15-18.
[3286] S. K. Vaidya and B. Lekha, Odd graceful labeling of some new graphs, Modern
Appl. Sci., 4 (10) (2010) 65-70.
[3287] S. K. Vaidya and B. Lekha, Some new odd graceful graphs, Advances Appl. Disc.
Math., 6(2). (2010) 101-108.
[3288] S. K. Vaidya and B. Lekha, New families of odd graceful graphs, Internat. J.
Open Problems Comp. Sci. Math., 3(5) (2010) 166-171. www.ijopcm.org/Vol/
10/IJOPCM(vol.3.5.18.D.10).pdf
[3289] S. K. Vaidya and B. Lekha, Some new graceful graphs, Internat. J. Math. Soft
Comp., 1(1) (2011) 37-45. http://oaji.net/articles/2015/296-1433770065.
pdf
[3290] S. K. Vaidya and B. Lekha, Some new results on E-cordial labeling, Internat. J.
Information Sci. Comput. Math., 3(1) (2011) 21-29.
[3291] S. K. Vaidya and B. Lekha, Some new families of E-cordial graphs, J. Math. Res.,
3(4) (2011) 105-111.
[3292] S. K. Vaidya and B. Lekha, Some new perspectives on odd sequential graphs,
Internat. J. Math. Soft Comput., 4(1) (2014) 93-101.
[3293] S. K. Vaidya and U. M. Prajapati, Some results on prime and k-prime labeling, J.
Math. Research, 3(1) (2011) 66-75. http://www.ccsenet.org/journal/index.
php/jmr/
[3294] S. K. Vaidya and U. M. Prajapati, Some switching invariant prime graphs,
Open J. Discrete Math., 2 (2012) 17-20. http://www.scirp.org/journal/
PaperInformation.aspx?paperID=17155

the electronic journal of combinatorics (2023), #DS6 605

[3295] S. K. Vaidya and U. M. Prajapati, Some new results on prime graphs, Open J. Dis-
crete Math., 2 (2012) 99-104. doi:10.4236/ojdm.2012.23019
[3296] S. K. Vaidya and U. M. Prajapati, Fibonacci and super Fibonacci graceful labelings
of some cycle related graphs, Inter. J. Math. Combin., 4 (2011) 59-69.
[3297] S. K. Vaidya and U. M. Prajapati, Prime labeling in the context of duplication of
graph elements, Internat. J. Math. Soft Comput., 3(1) (2013) 13-20.
[3298] S. K. Vaidya, U. M. Prajapati, and P. Vihol, Some important results on triangular
sum graphs, Appl. Math. Sciences, 3 (2009) 1763-1772.
[3299] S. K. Vaidya and N. H. Shah, Some new families of prime cordial graphs, J. Math.
Research 3(4) (2011) 21-30.
[3300] S. K. Vaidya and N. H. Shah, Some new odd harmonious graphs, Internat. J.
Math. and Soft Comput., 1(1) (2011) 9-16.
[3301] S. K. Vaidya and N. H. Shah, Odd harmonious labeling of some graphs, Interna-
tional J. Math. Combin., (3) (2012) 105-112.
[3302] S. K. Vaidya and N. H. Shah, Prime cordial labeling of some graphs,
Open J. Discrete Math., 2 (2012) 11-16. http://www.scirp.org/journal/
PaperInformation.aspx?paperID=17154
[3303] S. K. Vaidya and N. H. Shah, 3-Equitable labeling for some tar and bistar related
graphs, Internat. J. Math. and Sci. Comput., 2(1) (2012) 3-8.
[3304] S. K. Vaidya and N. H. Shah, Graceful and odd graceful labeling of some graphs,
Internat. J. of Math. Soft Computing, 3(1) (2013) 61-68.
[3305] S. K. Vaidya and N. H. Shah, Some star and bistar related divisor cordial graphs,
Annals Pure Appl. Math., 3(1) (2013) 67-77.
[3306] S. K. Vaidya and N. H. Shah, Prime cordial labeling of some wheel related graphs,
Malaya J. Mate., 4(1) (2013) 148-156.
[3307] S. K. Vaidya and N. H. Shah, Further results on divisor cordial labeling, Annals
Pure Appl. Math., 4(2) (2013) 150-159.
[3308] S. K. Vaidya and N. H. Shah, Some new results on prime cordial labeling, ISRN
Combin., 2014 Article ID 607018, 9 pages, 2014. http://www.hindawi.com/
journals/isrn.combinatorics/2014/607018/
[3309] S. K. Vaidya and N. H. Shah, Cordial labeling for some bistar related graphs,
Internat. J. Mathematics Soft Comput., 4(2) (2014) 33-39.
[3310] S. K. Vaidya and N. H. Shah, Cordial labeling of snakes, Internat. J. Math. Appl.,
2(3) (2014) 17-27.
[3311] S. K. Vaidya and N. H. Shah, On square divisor cordial graphs, J. Scientific
Research, 6(3) (2014) 445-455. http://www.banglajol.info/index.php/JSR/
article/view/16412
[3312] S. K. Vaidya and N. H. Shah, Cordial labeling of degree splitting graphs, J. Graph
Labeling, 1(2) (2015) 95-110.

the electronic journal of combinatorics (2023), #DS6 606

[3313] S. K. Vaidya, S. Srivastav, G. Ghodasara, and V. Kaneria, Cordial labeling for
cycle with one chord and its related graphs, Indian J. Math. Sciences, 4 (2008)
145-156.
[3314] S. K. Vaidya, S. Srivastav, V. J. Kaneria, and G. V. Ghodasara, Cordial and
3-equitable labeling of cycle with twin-chords, Proceed. First International Con-
ference on Emerging Technologies and Applications in Engineering, Technology
and Sciences, (2008) 905-907.
[3315] S. K. Vaidya, S. Srivastav, V. J. Kaneria, and K. K. Kanani, Some cycle related
cordial graphs in the context of vertex switching, Proceed. International Conf.
Discrete Math. - 2008 RMS Lecturer Note Series, No. 13 (2010) 243-252.
[3316] S. K. Vaidya and P. L. Vihol, Total product cordial graphs induced by some graph
operations on cycle related graphs, Internat. J. Inform. Sci. and Comput. Math.,
1(2) (2010) 113-126.
[3317] S. K. Vaidya and P. L. Vihol, Cordial labeling for middle graph of some graphs,
Elixir Discrete Math., 34C (2011) 2468-2475.
[3318] S. K. Vaidya and P. L. Vihol, Embedding and NP-complete problems for 3-
equitable graphs, Inter. J. Contemporary Advanced Math., 2(1) (2011) 1-7.
[3319] S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some graphs, Modern
Applied Science, 4(8) (2010) 119-126.
[3320] S. K. Vaidya and P. L. Vihol, Prime cordial labeling for some cycle related graphs,
Internat. J. Open Problems in Comput. Sci. Math., 3(5) (2010) 223-232.
[3321] S. K. Vaidya and P. L. Vihol, Fibonacci and super Fibonacci graceful labeling of
some graphs, Studies Math. Sciences, 2(2) (2011) 24-35.
[3322] S. K. Vaidya and P. L. Vihol, Radio labeling for some cycle related graphs, Interna.
J. Math. Soft Comput., 2(2) (2012) 11-24.
[3323] S. K. Vaidya and N. B. Vyas, Product cordial labeling in the context of tensor
product of graphs, J. Math. Research, 3(3) (2011) 83-88.
[3324] S. K. Vaidya and N. B. Vyas, E-cordial labeling of some mirror graphs, Internat.
Contemp. Adv. Math., 2(1) (2011) 22-27.
[3325] S. K. Vaidya and N. B. Vyas, E-cordial labeling for Cartesian product of some
graphs, Studies Math. Sci., 3(2) (2011) 11-15.
[3326] S. K. Vaidya and N. B. Vyas, Further results on E-cordial labeling, Internat. J. In-
forma. Sci. Comput. Math., 5(1) (2012) 9-18. http://www.pphmj.com/abstract/
6905.htm
[3327] S. K. Vaidya and N. B. Vyas, Antimagic labeling in the context of switching of a
vertex, Annals Pure Appl. Math., 2(1) (2012) 33-39.
[3328] S. K. Vaidya and N. B. Vyas, Some results on E-cordial Llabeling, Internat. J.
Math. Sci. Comput., 2(1) (2012) 9-13.

the electronic journal of combinatorics (2023), #DS6 607

[3329] S. K. Vaidya and N. B. Vyas, E-cordial labeling in the context of switching of
a vertex, Internat. J. Adv. Comput. Math. Sci., 3(4) (2012) 446-452. http://
bipublication.com/files/IJCMS-V3I4-2012-9.pdf
[3330] S. K. Vaidya and N. B. Vyas, Even mean labeling for path and bistar related
graphs, Internat. J. Graph Theory, 1(4) (2013) 122-130.
[3331] S. K. Vaidya and N. B. Vyas, Antimagic labeling of some path and cycle related
graphs, Annals Pure Appl. Math., 3(2) (2013) 119-128.
[3332] S. K. Vaidya and N. B. Vyas, Product cordial labeling for alternate snake
graphs, Malaya Journal of Mathematik, 2(3) (2014) 188-196. http://www.
malayajournal.org/articles/MJM082.pdf
[3333] S. K. Vaidya and N. B. Vyas, Product cordial labeling for some bistar re-
lated graphs, Adv. Modeling Optim., 16(2) (2014) 295-301. http://camo.ici.
ro/journal/vol16/v16b4.pdf
[3334] K. Vaithilingam, Difference labeling of some graph families, Internat. J. Math. Stat.
Invention (IJMSI), 2 (2014 37-43. https://www.ijmsi.org/Papers/Volume.2.
Issue.6/E026037043.pdf
[3335] K. Valentin, Polychrome labelings of trees and cycles, Ars Combin., 52 (1999)
272-284.
[3336] F. Van Bussel, Relaxed graceful labellings of trees, Electronic J. Combin., 9 (2002)
#R4. (12 pages).
[3337] S. Vani Shree snd S. Dhanalakshmi, New results on face magic mean labeling
of graphs, Math. Stat., 11(1) (2023) 199-205. https://www.researchgate.net/
publication/371253652_New_Results_on_Face_Magic_Mean_Labeling_of_
Graphs
[3338] V. Vanitha, A Study on Graph Labeling of Directed Graphs, PhD thesis, Mother
Teresa Women’s University, 2012.
[3339] M. Varadhan and S. Guruswamy, Generating graceful trees from caterpillars by
recursive attachment, Electronic Notes Disc. Math., 53 (2016) 133-147.
[3340] R. Varatharajan, S. Navanaeethakrishnan, and K. Nagarajan, Divisor cordial
graphs, Internat. J. Math. Combin., 4 (2011) 15-25.
[3341] R. Varatharajan, S. Navanaeethakrishnan, K. Nagarajan, Special classes of divisor
cordial graphs, Int. Math. Forum, 7(33-36) (2012) 1737-1749.
[3342] M. Vargheese and R. Arun, Even harmonious labelings of triangular book graphs,
Caribbean J. Sci., 53(2) (2019) 2111-2117.
[3343] P. Vasoya and D. Bantva, Optimal radio labelings of the Cartesian product of the
generalized Petersen graph and tree, arXiv:2304.10094.pdf
[3344] T. K. Mathew Varkey and B. S. Sunoj, Some new families of odd graceful graphs,
Internat. J. Math. Combin., 3 (2016) 158-161.

the electronic journal of combinatorics (2023), #DS6 608

[3345] T. K. Mathew Varkey and B. S. Sunoj, A note on absolute difference of cubic
and square sum labeling of a class of trees, Internat. J. Sci. Eng. Appl. Sci., 2(8)
(2016) 293-296. https://ijseas.com/volume2/v2i8/ijseas20160828.pdf
[3346] T. K. Mathew Varkey and B. S. Sunoj, An absolute difference of cubic and square
sum labeling of splitting graphs, Internat. Comput. Math. Sci., 5(8) (2016) 16-18.
[3347] T. K. Mathew Varkey and B. S. Sunoj, ADCSS labeling of cycle related graphs,
Internat. J. Scientific Res. Edu., 4(8) (2016) 5702-5705.
[3348] T. K. Mathew Varkey and B. S. Sunoj, An absolute difference of cubic and
square sum labeling of certain class of graphs, Internat. J. Math. Trends
Tech., 36(1) (2016) 77-79. https://www.ijmttjournal.org/2016/Volume-36/
number-1/IJMTT-V36P509.pdf
[3349] T. K. Mathew Varkey and B. S. Sunoj, Some new results on absolute difference of
cubic and square sum labeling of a class of graphs, Internat. Sci. Res., 5(8) (2016),
1465-1467. https://www.ijsr.net/archive/v5i8/ART20161261.pdf
[3350] T. K. Mathew Varkey and B. S. Sunoj, ADCSS-of product related graphs, Internat.
J. Math. Appl., 4(2B) (2016) 145-149.
[3351] T. K. Mathew Varkey and B. S. Suno, ADCSS-labeling of 2-tuple graphs of some
graphs, IOSR J. Math., 12(5)(V) (2016) 12-15.
[3352] T. K. Mathew Varkey and B.S. Sunoj, ADCSS-labeling for some total graphs, In-
ternat. Math. Trends Tech., 38(1) (2016) 1-4. https://www.ijmttjournal.org/
2016/Volume-38/number-1/IJMTT-V38P501.pdf
[3353] T. K. Mathew Varkey and B. S. Sunoj, ADCSS-Labeling of shadow graph
of some graphs, J. Comput. Math. Sci., 7(11) (2016) 593-598. http:
//www.compmath-journal.org/dnload/Mathew-Varkey-T-K-and-Sunoj-B-S-/
CMJV07I11P0593.pdf
[3354] **** B. S. Sunoj and T. K. Mathew Varkey, A note on an absolute difference
of cubic and square sum labeling, Internat. J. of Math. Sci. Engg. Appls., (IJM-
SEA) 11(I) (2017) 1-10. http://www.ascent-journals.com/IJMSEA/Vol11No1/
1-sunoj.pdf
[3355] R. Vasuki, S. Arockiaraj, On super mean graphs, Util. Math., 103 (2017) 335-351.
[3356] R. Vasuki and A. Nagarajan, Meanness of the graphs Pa,b and Pab , Internat. J.
Appl. Math., 22(4) (2009) 663-675.
[3357] R. Vasuki and A. Nagarajan, Some results on super mean graphs, Internat. J.
Math. Combin. 3 (2009) 82-96.
https://zenodo.org/record/9459#.X61bqMhKiUk
[3358] R. Vasuki and A. Nagarajan, Further results on mean graphs, Scientia Magna,
6(3) (2010) 1-14.
[3359] R. Vasuki and A. Nagarajan, Odd mean labeling of the graphs Pa,b , Pab and
b
Ph2ai , Kragujevac J. Math. 36(1) (2012) 141-150. https://imi.pmf.kg.ac.rs/
kjm/pub/13476279057933_kjom3601-15.pdf

the electronic journal of combinatorics (2023), #DS6 609

[3360] D. Vickrey, k-equitable labelings of complete bipartite and multipartite graphs,
Ars Combin., 54 (2000) 65-85.
[3361] A. Vietri, Graceful labellings for an infinite class of generalised Petersen graphs,
Ars. Combin., 81 (2006) 247-255. See also A. Vietri, Erratum: Ars Combin., 83
(2007) 381.
[3362] A. Vietri, On the graceful polynomials of a graph, Austraasian J. Com-
bin., 73(2) (2019) 261-273. https://www.researchgate.net/publication/
339676138_Difference_Perfect_Square_Cordial_Labeling_of_Some_Graphs
[3363] R. Vasuki, A. Nagarajan, and S. Arockiaraj, Even vertex odd mean labeling of
graphs, SUT J. Math., 49(2) (2013) 79-92.
[3364] B. Vasuki, L. Shobana, and M. A. Ahmed, Face antimagic labeling for double
duplication of barycentric and middle graphs, Iraqi J. Sci., (2022) 3902-3908.
doi:doi:10.24996/ijs.2022.63.9.22
[3365] B. Vasuki ·and L. Shobana, Face antimagic labeling for double duplication of crown
related graphs, AIP Conf. Proceed. 2516, 210048 (2022). 2nd Internat. Confer.
Math. Tech. Appl., ICMTA2021.
[3366] R. Vasuki, P. Sugirtha, and J. Venkateswari, Super mean labeling of some subdi-
vision graphs, Kragujevac J. Math., 41(2) (2017) 179-201.
[3367] R. Vasuki, L. Velmurugan, and P. Sugirtha, Some results on super pair sum graphs,
J. Discrete Math. Sci. Cryptogr., 20(2) (2017) 463-476.
[3368] A. Villar, On the product cordial labeling for some crown graphs, U. Southeastern
Philippines, Math. Stat. Depart., Davao City, Philippines, (2013) 19-86.
[3369] R. Vimal Kumar and D. Vijayalakshmi, Vertex magic total labeling of middle and
total graph of cycle, Commun. Fac. Sci. Univ. Ank. Ser. A1. Math. Stat., 68(2)
(2019) 1335-1340.
[3370] S. Venkatesh, Open cyclic grid graphs are graceful, IOSR J. Math., 10(2) (2014)
65-67. http://iosrjournals.org/iosr-jm/papers/Vol10-issue2/Version-6/
J010266567.pdf
[3371] S. Venkatesh and S. Bharathi, On generating graceful trees, Int. J. Pure Appl.
Math., (IJPAM) 118(9) 899-904.
[3372] S. Venkatesh, B. Mahalakshmi and N. Amirthavahini, New results on some vertex
labeling of graphs, Inter. J. Pure Appl. Math., 118(9) (2018) 891-898.
[3373] K. Venkatesan and K. Thirugnanasambandam, Super root square mean labeling
of some cycle graphs, Global J. Eng. Sci. Res., (GJESR), 5(11) (2018) 221-234.
[3374] S. Venkatesh and K. Balasubramanian, Some results on generat-
ing graceful trees,Internat. J. Engin. Tech., 7(4.10) (2018) 570-572.
https://www.researchgate.net/publication/332682658_Some_Results_
on_Generating_Graceful_Trees
[3375] S. Venkatesh, J. Salah, and G. Sethuraman, Some results on E-cordial graphs,
Internat. J. Math. Trendsand Technology, 7(2) (2014) 121-125.

the electronic journal of combinatorics (2023), #DS6 610

[3376] S. Venkatesh and S. Sivagurunathan, On the gracefulness of cycle re-
lated graphs, Int. J. Pure Appl. Math., (IJPAM) 117(15) (2017) 589-598.
https://www.researchgate.net/publication/317304532_Super_Root_
Square_Mean_Labeling_of_Some_Graphs
[3377] A. Vietri, A new infinite family of graceful generalised Petersen graphs, via “grace-
ful collages” again, Austral. J. Comb., 41 (2008) 273-282.
[3378] A. Vietri, Real-graceful labellings: a generalisation of graceful labellings, Ars Com-
bin., 102 (2011) 359-364.
[3379] A. Vietri, Necessary conditions on graceful labels: a study case on trees and other
examples, Util. Math., 89 (2012) 275-287.
[3380] A. Vietri, Sailing towards, and then against, the Graceful Tree Conjecture: some
promiscuous results, I.C.A. Bulletin, 53 (2008) 31-46.
[3381] G. R. Vijayakumar, Arithmetic labelings and geometric labelings of finite graphs,
J. Combin. Math. Combin. Comput., 75 (2010) 229-231.
[3382] G. R. Vijayakumar, Arithmetic labelings and geometric labelings of countable
graphs, Discuss. Math. Graph Theory, 30 (2010) 539-544.
[3383] G. R. Vijayakumar, A note on set graceful labeling, arXiv:1101.2729v1 [math.co]
14 Jan 2011.
[3384] G. Vijayalashmi and S. T. Arockiamary, Some results on k-prime labeling
of graphs on graph operations, Adv. Appl. Math. Sci., 21(1) (2021) 283-
298. https://www.researchgate.net/publication/357479219_SOME_RESULTS_
ON_k-PRIME_LABELING_OF_GRAPHS_ON_GRAPH_OPERATIONS/references
[3385] K. Vilfred and T. Nicholas, The integral sum graph, Graph Theory Notes N. Y.,
57 (2009) 43-47.
[3386] V. Vilfred, Families of graceful banana trees, Internat. J. Management and Sys-
tems, to appear.
[3387] V. Vilfred, Sigma partitions and sigma labeled graphs, J. Decision Math. Sci.,
10(1-3) (2005) 1-9.
P
[3388] V. Vilfred, Perfectly regular graphs or cyclic regular graphs and -labeling and
partitions, Srinivasa Ramanujan Centenary Celebrating International Conference
in Mathematics, Anna University, Madras, India, Abstract A23 (1987).
P
[3389] V. Vilfred, -labeled Graphs and Circulant Graphs, Ph.D., thesis University of
Kerala, Trivandrum, India, (1994).
[3390] V. Vilfred Kamalappan, k-Distance magic labelings and long brush
graphs, preprint. https://www.researchgate.net/publication/365373964_
k-DISTANCE_MAGIC_LABELING_AND_LONG_BRUSH_GRAPHS/
[3391] V. Vilfred and M. Jinnah, On sigma labeled graphs, (2002) unpublished.
[3392] V. Vilfred and L. M. Florida, Partition technique in the study of (a, d)-antimagic
graphs, unpublished.

the electronic journal of combinatorics (2023), #DS6 611

[3393] V. Vilfred and L. M. Florida, Odd antimagic and odd (a, d)-antimagic graphs,
unpublished.
[3394] V. Vilfred and L. M. Florida, Relation between sum, integer sum, chromatic and
edge chromatic numbers of few graphs, unpublished.
[3395] V. Vilfred and L. M. Florida, Two problems on integral sum graphs, unpublished.
[3396] V. Vilfred and L. M. Florida, Anti-sum and anti-integral sum graphs, unpublished.
[3397] V. Vilfred and L. M. Florida, Sum number and exclusiveness of graphs C4 , Ln and
P3 × P3 , unpublished.
[3398] V. Vilfred and T. Nicholas, On integral sum graphs G with ∆(G) = |V (G)| − 1,
unpublished.
[3399] V. Vilfred and T. Nicholas, Banana trees and unions of stars are integral sum
graphs, Ars Combin., 102 (2011) 79-85.
[3400] V. Vilfred and T. Nicholas, Amalgamation of integral sum graphs, fans and Dutch
M -windmills are integral sum graphs, National Seminar on Algebra and Discrete
Mathematics held at Kerala Univ., Trivandrum, India, 2005, personal communi-
cation.
[3401] R. Vimal Kumar and D. Vijayalakshmi, V -super vertex magic label-
ing of some families of graphs, Palest. J. Math., 10 (2021), Special
Issue II, 191-196. https://pjm.ppu.edu/sites/default/files/papers/PJM_
Special_Issue_July_2021_191to_196.pdf
[3402] Le Anh Vinh, Divisor graphs have arbitrary order and size, arXiv:0606483v1
[math.CO] 20 Jun 2006.
[3403] V. Vilfred, S. Somasundaram, and T. Nicholas, Classes of prime graphs, Interna-
tional J. Management and Systems, 18(2) (2002).
[3404] V. Viola and T. Nicholas, A study on radio mean Dd-distance number of some
basic graphs, Internat. J. Appl. Engin. Res., 14(8) (2019) (Special Issue) 77-80.
https://www.ripublication.com/ijaerspl2019/ijaerv14n8spl_15.pdf
[3405] V. Vishnupriya, K. Manimekalai, and J. Baskar Babujee, Edge bimagic total la-
beling for some trees, Acta Cienc. Indica Math., 35 (2009) 569-573.
[3406] C. D. Wallace, Mod Sum Numbers of Complete Bipartite Graphs, M. S. Thesis,
East Tennessee State University, 1999.
[3407] W. D. Wallis, Magic Graphs, Birkhäuser, Boston, 2001.
[3408] W. D. Wallis, Vertex magic labelings of multiple graphs, Congr. Numer., 152
(2001) 81-83.
[3409] W. D. Wallis, Two results of Kotzig on magic labelings, Bull. Inst. Combin. Appl.,
36 (2002) 23-28.
[3410] W. D. Wallis, Totally magic labellings and graphs, http://lagrange.math.siu.
edu/mcsorley/papers/NtmgFIN.pdf

the electronic journal of combinatorics (2023), #DS6 612

[3411] W. D. Wallis, E. T. Baskoro, M. Miller, and Slamin, Edge-magic total labelings,
Australas. J. Combin., 22 (2000) 177-190.
[3412] C. Wang, M. J. A. Khan, M. Ibrahim, E. Bonyah, M. K. Siddiqui, and S. Khalid,
On edge irregular reflexive labeling for generalized prism, J. Math., 2022, Art.
ID 2886555, 7 pp. https://downloads.hindawi.com/journals/jmath/2022/
2886555.pdf
[3413] G. Wang, On the number of graceful trees, Internat. J. Math. Combin., 1 (2008)
91-101.
[3414] J.-G. Wang, D. J. Jin, X.-G Lu, and D. Zhang, The gracefulness of a class of
lobster trees, Math. Comput. Modelling, 20 (1994) 105-110.
[3415] H. Wang, The sum numbers and the integral sum numbers of the graph
Kn+1 \ E(K1,r ), Discrete Math., 309 (2009) 4137-4143.
[3416] H. Wang and J. Gao, The sum numbers and the integral sum numbers of Pn and
Fn , Ars Combin., 96 (2010) 9-31.
[3417] H. Wang and J. Gao, The sum numbers and the integral sum numbers of Cn and
Wn , Ars Combin., 96 (2010) 479-488.
[3418] H. Wang and P. Li, Some results on exclusive sum graphs, J. Appl. Math. Compu.,
34 (2010) 343-351.
[3419] H. Wang and C. Li, New results on sum graph theory, Ars Combin., 106 (2012)
509-519.
[3420] H. Wang, C. Li, and B. Wei, Some results on integral sum graphs with no saturated
vertices, Util. Math., 97 (2015) 287-294.
[3421] H. Wang, Y. Ji, and P. Li, The sum numbers and integral sum numbers of the
graph Kn \E(Cn−1 ), Ars Comb., 101 (2011) 15-26.
[3422] H. Wang, J. Xu, M. Ma, and H. Zhang, A new type of graphical passwords based on
odd-elegant labelled graphs, Security and Communication Networks, 2018, Article
ID 9482345, 11 pages,
[3423] H. Wang, J. Xu, and B. Yao. Twin odd-graceful trees towards information security,
Procedia Comput. Sci., 107 (2017) 15-20. doi:10.1016/j.procs.2017.03.050
[3424] H. Wang, J. Xu, and B. Yao, Exploring new cryptographical construction of com-
plex network data, IEEE First International Conference on Data Science in Cy-
berspace, IEEE Comput. Soc., (2016) 155-160.
[3425] H. Wang, J, Xu, and B. Yao, On generalized total graceful labelling of graphs, Ars
Combin., 140 (2018) 359-371.
[3426] H. Wang, X. Xu, Y. Yang, B. Zhang, M. Luo, and G. Wang, Radio number of
ladder graphs, Int. J. Comput. Math., 88 (2011) 2026-2034.
[3427] H. Wang, B. Yao, and M. Yao, Generalized edge-magic total labellings of models
from researching networks, Inform. Sci., 279 (2014) 460-467.

the electronic journal of combinatorics (2023), #DS6 613

[3428] J.-W. Wang, Vertex ranking of graphs, Master Thesis, Department of Applied
Math., National Chiao-Tung University, June 1997.
[3429] S. Wang and Y. Gao, Product antimagic labeling of caterpillars, J. Math.
(2021) Art. ID 3493941, 4 pp. https://www.hindawi.com/journals/jmath/
2021/3493941/
[3430] T.-L. Wong and X. Zhu, Antimagic labelling of vertex weighted graphs, J. Graph
Theory, 70(3) (2012) 348-359.
[3431] T.-M. Wang, Toroidal grids are anti-magic, Computing and combinatorics, Lecture
Notes in Comput. Sci., 3595, Springer, Berlin (2005) 671-679.
[3432] T.-M. Wang and C.-C. Hsiao, On anti-magic labeling for graph products, Discrete
Math., 308 (2008) 3624-3633.
[3433] T.-M. Wang, C.-C. Hsiao, S.-M. Lee, A note on edge-graceful spectra of the square
of paths, Discrete Math., 308 (2008) 5878-5885
[3434] T.-M. Wang, C.-C. Hsiao and S.-M. Lee, On anti-magic labeling of graphs, Discrete
Math., 308 (16) 3624-3633.
[3435] T.-M. Wang and S. M. Lee, On edge-graceful spectrum of bicyclic graphs, Congr.
Numer., 205 (2010) 161-173.
[3436] T.-M. Wang, C.-M. Lin, and S.-M. Lee, On edge-balance index sets of regular
graphs, The 26th Workshop on Combinatorial Mathematics and Computation The-
ory, 218-223.
[3437] T.-M. Wang, C.-M. Lin, and S.-M. Lee, Edge-balance index sets of prisms and
Möbius ladders, unpublished.
[3438] T. Wang and D. M. Li, Gracefulness of some special graph classes, J. Wuhan Univ.
Natur. Sci. Ed., 58(5) (2012) 437-440.
[3439] T. Wang, D. Li, and Q. Wang, some classes of antimagic graphs with regular
subgraphs, Ars Combin., 111 (2013) 241-250.
[3440] T. Wang, H. S. Liu, and D. M. Li, Gracefulness of graphs related to wheels, Acta
Sci. Natur. Univ. Sunyatseni 50(6) (2011) 16-19.
[3441] T. Wang, M. J. Liu, and D. M. Li, Some classes of disconnected antimagic graphs
and their joins, Wuhan Univ. J. Nat. Sci., 17(3) (2012) 195-199.
[3442] T. Wang, M. J. Liu, and D. M. Li, A class of antimagic join graphs, Acta Math.
Sin. (Engl. Ser.), 29(5) (2013) 1019-1026.
[3443] T. Wang, W. Miao, and D. Li, Deming, Antimagic graphs with even factors, Wuhan
Univ. J. Nat. Sci., 20(3) (2015) 193-196.
[3444] T. Wang, Q. Wang, and D. M. Li, Gracefulness of unconnected graphs (P3 +Km ∪G
and (C3 + Km ∪ G, Natur. Univ. Sunyatseni, 51(5) (2012) 54-57, 62.
(k)
[3445] T. Wang, Q. Wang, and D. M. Li, Gracefulness of disconnected graph Wm ∪ G,
J. Hefei Univ. Technol. Nat. Sci., 35(7) (2012) 987-990.

the electronic journal of combinatorics (2023), #DS6 614

[3446] T. Wang, S.-F. Yan, D. M. Li, Graceful labeling of the union of some graphs,
Math. Pract. Theory, 42(16) (2012) 207-212.
[3447] T.-M. Wang, C.-C. Yang, L.-H. Hsu, and E. Cheng, Infinitely many equivalent
versions of the graceful tree conjecture, Appl. Anal. Discrete Math., 9(1) (2015)
1-12.
[3448] T.-M. Wang and G.-H. Zhang, Note on E-super vertex magic graphs, Discrete
Appl. Math., 178 (2014) 160-162.
[3449] T.-M. Wang and G.-H. Zhang, On antimagic labeling of odd regular graphs, Lecture
Notes in Comput. Sci., S. Arumugam and B. Smyth (Eds.): IWOCA 2012, LNCS
7643 162-168, Springer-Verlag Berlin Heidelberg 2012.
[3450] T.-M. Wang and G.-H. Zhang, On vertex magic total labeling of disjoint union of
sun graphs, Util. Math., 103 (2017) 289-298.
[3451] T.-M. Wang and G.-H. Zhang, On edge-graceful regular graphs with particular
3-factors, Elect. Notes Discr. Math., 63 (2017) 33-40.
[3452] T.-M. Wang and G.-H. Zhang, On edge-graceful labeling and deficiency for regular
graphs, AKCE Int. J. Graphs Comb., 15(1) (2018) 105-111.
[3453] W. Wang, M. Zhang, H. Yu, and D. Shi, The mod sum number of even fans and
symmetric complete bipartite graphs, Ars Combin., 94 (2010) 445-457.
[3454] X. Wang and Y. Chang, Further results on (v, 4, 1)-perfect difference families,
Discrete Math., 310 (2010) 1995-2006.
[3455] Y. Wang and B. Liu, The sum number and integral sum number of complete
bipartite graphs, Discrete Math., 239 (2001) 69-82.
[3456] W. Wannasit and S. El-Zanati, On free α-labelings of cubic bipartite graphs, 24th
MCCCC. J. Combin. Math. Combin. Comput., 82 (2012) 269-293.
[3457] M. E. Watkins, A theorem on Tait colorings with an application to the generalized
Petersen graphs, J. Combin. Theory, 6 (1969) 152-164.
[3458] L. X. Wei and Z. Z. Jia, The gracefulness of unconnected graphs G1 ∪ G2 and
G1 ∪ G2 ∪ K2 , Acta Math. Appl. Sin., 28 (2005) 689-694.
[3459] L. X. Wei, S. F. Yan, and K. L. Zhang, The researches on gracefulness of two kinds
of unconnected graphs, J. Shandong Univ. Nat. Sci. 43 (2008) 7 pp.
(1) (2)
[3460] L. X. Wei and K. L. Zhang, Researches on graceful graphs (P1 ∨ Pn ) ∪ (P1 ∨ P2n )
and (P2 ∨ K n ) ∪ Gn−1 . J. Hefei Univ. Tech., 31 (2008) 276-279.
[3461] J. Wei, T, Wang, and C. Sun, Gracefulness of several unconnected graphs with
wheel, Wuhan Univ. J. Nat. Sci., 21(3) (2016) 199-203.
[3462] L. X. Wei and K. L. Zhang, Graceful graphs on several kinds of union graphs, Acta
Sci. Natur. Univ. Sunyatseni, 47 (2008) 10-13.
[3463] Y.-H. Wen, Necessary and sufficient condition for the class of (P, P + 1)-graph to
be balanced, J. Lanzhou Univ. Nat. Sci., 43 (2007) 104-106.

the electronic journal of combinatorics (2023), #DS6 615

[3464] Y.-H. Wen, Friendliness of generalized wheel, J. Lanzhou Univ. Nat. Sci., 44
(2008) 103-108.
[3465] Y. Wen and S. M. Lee, On Eulerian graphs of odd sizes which are fully magic,
unpublished.
[3466] Y. Wen, S.-M. Lee, H.-H. Su, On Z2 ⊕ Z2 -magic graphs, Congr. Numer., 199
(2009) 13-31.
[3467] Y. Wen, S. M. Lee, and H. Sun, On the supermagic edge-splitting extension of
graphs, Ars Combin., 79 (2006) 115-128.
[3468] R. W. Whitty, Rook polynomials on 2-dimensional surfaces and graceful labellings
of graphs, Discrete Math., 308 (2008) 674-683.
[3469] T. Wichianpaisarn and U. Mato, Star-supermagic decompositions of the complete
bipartite graph minus a one-factor, Internat. J. Math. Math. Sci., (2017) Article
ID 5104701, 4 pp.
[3470] K. Wijaya and E. Baskoro, Edge-magic labelings of a product of two graphs (in
Indonesian), Proc. Seminar MIPA, ITB Bandung Indonesia, October 2000.
[3471] K. Wijaya, Slamin, Surahmat, and S. Jendroľ, Total vertex irregular labeling of
complete bipartite graphs, J. Combin. Math. Combin. Comput., 55 129-136.
[3472] D. E. Wijayanti, N. Hidayat, D. Indriati, A. R. Alghofari, and S. Slamin, To-
tal distance vertex irregularity strength of some corona product graphs, Elect. J.
Graph Th. Appl., 11(1) (2023) 209. https://www.ejgta.org/index.php/ejgta/
article/view/1473/pdf_273
[3473] D. E. Wijayanti, H. Noor, D. Indriati, A. R. Alghofari, and Slamin, On distance
vertex irregular total k-labeling, 2023 preprint.
[3474] D. E. Wijayanti, H. Noor, D. Indriati, and A. R. Alghofari, The total distance
vertex irregularity strength of fan and wheel graphs, AIP Conference Proceed-
ings, 2326 (2021), 020043-1- 020043-14. https://aip.scitation.org/doi/pdf/
10.1063/5.0039904
[3475] D. E. Wijayanti, H. Noor, D. Indriati, A. R. Alghofari, and Slamin, On d-distance
vertex irregular total k-labeling, submitted (2021)
[3476] H. S. Wilf and N. A. Yoshimura, Ranking rooted trees, and a graceful application,
in Discrete Algorithms and Complexity Proceedings of the Japan-US Joint Seminar,
June 4–6, 1986, Kyoto, Japan, edited by D. S. Johnson, et al. 341-349.
[3477] L. K. Wilson and V. M. Bebincy, Studies on some wheel related Zumkeller graphs,
AIP Conference Proceedings (2022) 130049.
[3478] L. K. Wilson and V. M. Bebincy, Zumkeller labeling of some path related
graphs, Malaya J. Math., 9(1) (2021) 519-523. https://www.malayajournal.
org/articles/MJM09010087.pdf
[3479] L. K. Wilson and H. Jini, Prime labeling of torch graph, Malaya J. Mat., 9(1)
(2021) 890–895. https://www.malayajournal.org/articles/MJM09010157.pdf

the electronic journal of combinatorics (2023), #DS6 616

[3480] S. Wilson and A. Riskin, Edge-graceful labellings of odd cycles and their products,
Bulletin of the ICA, 24 (1998) 57-64.
[3481] S. Winters, personal communication (circa 1990).
[3482] J. Wojciechowski, Long Induced Cycles in the Hypercube and Colourings of
Graphs, Ph. D. Thesis, Cambridge University, England, 1990.
[3483] J. Wojciechowski, Equitable labelings of cycles, J. Graph Theory, 17 (1993) 531-
547.
[3484] T. Wong and X. Zhu, Antimagic labelling of vertex weighted graphs, J. Graph
Theory, 70(3) (2012) 348-350.
[3485] D. Wood, On vertex-magic and edge-magic total injections of graphs, Australas.
J. Combin., 26 (2002) 49-63.
[3486] J. Wu, J. Mao, and D. Li, New types of integral sum graphs, Discrete Math., 260
(2003) 163-176.
[3487] S.-L. Wu, Graceful labelings of graphs associated with vertex-saturated graphs,
Ars Combin., 62 (2002) 109-120.
[3488] S.-L. Wu, New families of sequential graphs, Ars Combin., 69 (2003) 9-17.
[3489] S.-L. Wu, New graceful families on bipartite graphs, Ars Combin., 73 (2004) 79-87.
[3490] S.-L. Wu, A necessary condition for the existence of an α-labeling, unpublished.
[3491] S.-L. Wu, Graceful labelings of vertex-saturated graphs and related graphs, un-
published.
[3492] S.-L. Wu and H.-C. Lu, On the constructions of new families of graceful graphs,
Ars Combin., 106 (2012) 235-246.
[3493] C. Wyels and M. Tomova, Radio Labeling Cartesian graph products, 9th Cologne-
Twente Workshop on Graphs and Combinatorial Optimization, Cologne,Germany,
May 25-27, 2010. Extended Abstracts (2010) 163–167.
[3494] D. A. Xavier and R. Rathi, Proper lucky number of hexagonal mesh and hon-
eycomb network, Math. Internat. J. Math. Trends Tech., 48 (2017) 223-238.
doi:10.14445/22315373/IJMTT-V48P532
[3495] Y. Xi, Y. Yang, Mominul, and L. Wang, Super vertex-magic total labelings of
W3,n , Ars Combin., 86 (2008) 121-128.
[3496] Y. Xi, Y. Yang, and L. Wang, On harmonious labeling of the double triangular
snake, Indian J. Pure Appl. Math., 39 (2008) 177-184.
[3497] L. T. Xie and G. Z. Liu, A survey of the problem of graceful trees, Qufu Shiyuan
Xuebao, (1984) 8-15.
[3498] J. Xie, T. Zhao, and B. Yao, The gracefulness of super sun-graphs, 2018 IEEE
3rd Adv. Infor. Tech., Elect. Automa. Control Conf., (IAEAC) (2018) 2098-2109.
doi:10.1109/IAEAC.2018.8577870
[3499] B. Xu, On integral sum graphs, Discrete Math., 194 (1999) 285-294.

the electronic journal of combinatorics (2023), #DS6 617

[3500] S. D. Xu, Cycles with a chord are harmonious, Mathematica Applicata, 8 (1995)
31-37.
[3501] S. D. Xu, Harmonicity of triangular snakes, J. Math. Res. Exposition, 15 (1995)
475-476.
~ m,
[3502] X. Xu, Jirimutu, L. Wang, and Z. Min, On the gracefulness of the digraphs n-C
Ars Combin., 92 (2009) 419-428.
[3503] X. Xu, J.-M. Xu, M. Lü, Z. Baosheng, and C. Nan, On (a, d)-antimagic labelings
of generalized Petersen graphs, Ars Combin., 90 (2009) 411-421.
(t)
[3504] X. Xu, Y. Yang, H. Li, and Y. Xi, The graphs C11 are graceful for t ≡ 0, 1 (mod 4).
Ars Combin., 88 (2008) 429-435.
(t)
[3505] X. Xu, Y. Yang, L. Han, and H. Li, The graphs C13 are graceful for t ≡ 0, 1
(mod 4). Ars Combin., 90 (2009) 25-32.
[3506] X. Xu, Y. Yang, Y. Xi, K. M. M. Haque, and L. Shen, Super edge-magic labelings
of generalized Petersen graphs P (n, 3), Ars Combin., 85 (2007) 19-31.
[3507] X. Xu, Y. Yang, Y. Xi, and H. Li, On (a, d)-antimagic labelings of generalized
Petersen graphs P (n, 3), Ars Combin., 86 (2008) 23-31.
[3508] L. Yahyaei and S. A. Katre, Representation number of a caterpillar, J. Combin.
Math. Combin. Comput., 101 (2017) 47-57.
[3509] Q. T. Yan, A proof of a conjecture related to of windmill graphs, Math. Practice
Theory, 34 (2004) 116-117.
[3510] Q. T. Yan, The graceful labelings of P2r,2m , J. Systems Sci. Math. Sci., 26(5)
(2006) 513-517.
[3511] Q. T. Yan, Odd gracefulness and odd strongly harmoniousness of the product
graphs Pn × Pm , J. Systems Sci. Math. Sci., 30 (2010) 341-348.
[3512] W. Yan and B. Liu, Some results on integral sum graphs, Discrete Math., 240
(2001) 219-229.
[3513] W. Yan and B. Liu, The sum number and integral sum number of complete bipar-
tite graphs, Discrete Math., 239(1-3) (2001) 69-82.
[3514] D. Yang, A note on antimagic orientations of even regular graphs, Discrete Appl.
Math., 267 (2019) 224-228.
[3515] D. Yang, J. Carlson, A. Owens, K. E. Perry, I. Singgih, Z.-X. Song, F. Zhang,
X. Zhang, Antimagic orientations of graphs with large maximum degree, Discrete
Math., 343(12) (2020) 112-23. arXiv:1908.06072
[3516] H. Yang, M. A. Rashid, S. Ahmad, M. K. Siddiqui, and M. F. Hanif, Cycle super
magic labeling of pumpkin, octagonal and hexagonal graphs, J. Discrete Math.
Sci. Cryptogr., 22(7) (2019) 1165-1176.
[3517] H. Yang, M. K. Siddiqui, M. Ibrahim, S. Ahmad, and A. Ahmad, Computing the
irregularity strength of planar graphs, Mathematics, (2018) 6, 150.

the electronic journal of combinatorics (2023), #DS6 618

 Sn
[3518] X.-W Yang and W. Pan, Gracefulness of the graph i=1 Fmi ,4 , J. Jilin Univ. Sci.,
41 (2003) 466-469.
(t)
[3519] Y. Yang, X. Lin, C. Yu, The graphs C5 are graceful for t ≡ 0, 3 (mod 4), Ars
Combin. 74 (2005) 239-244.
[3520] Y. Yang, W. Lu, and Q. Zeng, Harmonious graphs C2k ∪ C2j+1 , Util. Math., 62
(2002) 191-198.
[3521] Y. S. Yang, Q. Rong, and X. R. Xu, A class of graceful graphs, J. Math. Research
and Exposition, 24 (2004) 520-524.
[3522] Y. C. Yang and X. G. Wang, On the gracefulness of the product Cn × P2 , J. Math.
Research and Exposition, 1 (1992) 143-148.
[3523] Y. C. Yang and X. G. Wang, On the gracefulness of the union of two stars and
three stars, Combinatorics, Graph Theory, Algorithms and Applications (Beijing,
1993), 417-424, World Sci. Publishing, River Edge, NJ, 1994.
[3524] Y. C. Yang and X. G. Wang, On the gracefulness of product graph C4n+2 × P4m+3 ,
Combinatorics, Graph Theory, Algorithms and Applications (Beijing, 1993), 425-
431, World Sci. Publishing, River Edge, NJ, 1994.
(t)
[3525] Y. Yang, X. Xu, Y. Xi, H. Li, and K. Haque, The graphs C7 are graceful for
t ≡ 0, 1 (mod 4), Ars Combin., 79 (2006) 295-301.
(t)
[3526] Y. Yang, X. Xu, Y. Xi, and H. Huijun, The graphs C9 are graceful for t ≡ 0, 3
(mod 4), Ars Combin., 85 (2007) 361-368.
[3527] Y. Yang, X. Xu, Y. Xi, and J. Qian, On harmonious labelings of the balanced
quadruple shells. Ars Combin., 75 (2005) 289-296.
[3528] B. Yao, X. Chen, M. Yao, and H. Cheng, On (k, λ)-magically total labeling of
graphs, JCMCC, 87 (2013) 237-253.
[3529] B. Yao, H. Cheng, M. Yao, and M. Zhao, Meimei, A note on strongly graceful
trees, Ars Combin., 92 (2009) 155-169.
[3530] B. Yao, H. Cheng, Z. Zhongfu, and M. Yao, Labellings of trees with larger maximal
degrees, unpublished.
[3531] B. Yao, X. Liu and M. Yao, Connections between labellings of trees, Bull. Iranian
Math. Soc., 43(2) (2017) 275-283.
[3532] B. Yao, M. Yao, and H. Cheng, On gracefulness of directed trees with short diam-
eters, Bull. Malays. Math. Sci. Soc., (2) 35(1) (2012) 133-146.
[3533] V. Yegnanarayanan, On some additive analogues of graceful theme: cycle-related
graphs, Southeast Asian Bull. Math., 23 (1999) 317-333.
[3534] V. Yegnanarayanan, On magic graphs. Util. Math., 59 (2001) 181-204.
[3535] V. Yegnanarayanan and P. Vaidhyanathan, On nice (1, 1) edge-magic graphs, Elec-
tronic Notes Discr. Math., 33 (2009) 115-122.
[3536] Z. B. Yilma, Antimagic properties of graphs with large maximum degree, J. Graph
Th., 72(4) (2013) 367-373.

the electronic journal of combinatorics (2023), #DS6 619

[3537] R. Yilmaz and I. Cahit, E-cordial graphs, Ars Combin., 46 (1997) 251-266.
[3538] K.-K. Yoong, R. Hasni, G.-C. Lau, M. A. Asim, and A. Ahmad, Reflexive edge
strength of convex polytopes and corona product of cycle with path, AIMS Math.,
7(7) (2022) 11784-11800. https://www.aimspress.com/article/doi/10.3934/
math.2022657?viewType=HTM
[3539] K. K. Yoong, R. Hasni, G. C. Lau, and M. J. Irfan, Edge irregular reflexive labeling
for some classes of plane graphs, Malaysian J. Math. Sci., 16(1) (2022) 25-36.
https://doi.org/10.47836/mjms.16.1.03
[3540] L. You, J. Yang and Z. You, The maximal total irregularity of unicyclic graphs,
Ars Combin., 114 (2014) 153-160.
[3541] M. Z. Youssef, On Graceful, Harmonious and Prime Labelings of graphs, Ph. D.
Thesis, Department of Mathematics, Ain Shams University, 2000.
[3542] M. Z. Youssef, New families of graceful graphs, Ars Combin., 67 (2003) 303-311.
[3543] M. Z. Youssef, Two general results on harmonious labelings, Ars Combin., 68
(2003) 225-230.
[3544] M. Z. Youssef, A necessary condition on k-equitable labelings, Util. Math., 64
(2003) 193-195.
[3545] M. Z. Youssef, Pseudograceful labelings of graphs, Ars Combin., 76 (2005) 241-
247.
[3546] M. Z. Youssef, On Skolem-graceful and cordial graphs, Ars Combin., 78 (2006)
167-177.
[3547] M. Z. Youssef, On k-cordial labelling, Australas. J. Combin., 43 (2009) 31-37.
[3548] M. Z. Youssef, Graph operations and cordiality, Ars Combin., 97 (2010) 161-174.
[3549] M. Z. Youssef, On Ek -cordial labeling, Ars Combin., 104 (2012) 271-279.
[3550] M. Z. Youssef, On k-equitable and k-balanced labeling of graphs, Ars Combin.,
108 (2013) 51-64.
[3551] M. Z. Youssef, On α-labelling of disconnected graphs, Ars Comb., 123 (2015)
329-338.
[3552] M. Z. Youssef, Note on even harmonious labeling of cycles, Util. Math., 100 (2016)
137-142.
[3553] M. Z. Youssef, personal communication (2014).
[3554] M. Z. Youssef, On even harmonious labelings, Util. Math., 110 (2019) 243-253.
[3555] M. Z. Youssef and N. A. Al-Kuleab, Some new results on k-cordial labeling, Ars
Combin., 126 (2016) 311-322.
[3556] M. Z. Youssef and N. A. Al-Kuleab, 4-cordiality of some regular graphs and the
complete 4-partite graph, J. Combin. Math. Combin. Comput., 76 (2011) 131-136.
[3557] M. Z. Youssef and N. A. Al-Kuleab, 3-equitable labelings of ladders and graphs
related to cycles, Utilitas Math., 92 (2013) 261-274.

the electronic journal of combinatorics (2023), #DS6 620

[3558] M. Z. Youssef and Z. S. Almoreed, On odd prime labeling of graphs, Open J.
Discret. Appl. Math., 3(3) (2020) 33-40. https://pisrt.org/psrpress/j/odam/
2020/3/5/on-odd-prime-labeling-of-graphs.pdf
[3559] M. Z. Youssef and E.A. El Sakhawi, Some properties of prime graphs, Ars Combin.,
84 (2007) 129-140.
[3560] P. Yu, A proof of a conjecture about arithmetic graphs, J. Math. Res. Exposition,
16 (1996) 594-598.
[3561] P. Yu, Strongly arithmetic graphs, Chinese Quart. J. Math., 15 (2000) 22-27.
[3562] T.-K. Yu, D. T. Lee, and Y.-X. Chen, Graceful and harmonious labelings on 2-
cube, 3-cube and 4-cube snakes, unpublished.
[3563] Y.-H. Yu, W.-X. Wang, and L.-x. Song, The gracefulness of a kind of unconnected
graphs, Adv. Intelligent Soft Comput., 128 (2012) 525-531.
[3564] X. Yue, Y. Yuan-sheng, and M. Xin-hong, Skolem-gracefulness of k-stars, Ars
Combin., 98 (2011) 149-160.
[3565] J. Yuan and W. Zhu, Some results on harmonious labelings of graphs, J. Zhengzhou
Univ. Nat. Sci. Ed., 30 (1998) 7-12.
[3566] Y. Yuansheng, X. Yue, X. Xirong, and M. Xinhong, Super edge magic labelings
of book graphs Bn , unpublished. Abstract at https://www.researchgate.net/
publication/268023455_Super_edge-magic_labelings_of_book_graphs_B_n
[3567] X. Yue, Y. Yuansheng, and W. Liping, One edge union of k shell graphs is cordial,
Ars Combin., 86 (2008) 403-408.
[3568] O. A. Zahraa, E. A. Nabeel, and F. A. Fawzi, Dividing graceful labeling of certain
tree graphs, Tikrit J. Pure Sci., 25(4) (2020) 123-126.
[3569] A. Zak, Harmonious orders of graphs, Discrete Math., 309 (2009)
6055-6064. https://www.sciencedirect.com/science/article/pii/
S0012365X09002714?via%3Dihub
[3570] D. Zala, N. Chotaliya, and M. A. Chaurasiya, Even-odd harmonious labeling of
some graphs, Internat. J. Innov. Tech. Exploring Eng., - Special Issue, 10(4) (2021)
149-151. doi:10.35940/ijitee.d8513.0210421
[3571] M. R. Zeen El Deen, Edge even graceful labeling of some graphs, J. Egyptian Math.
Soc., 27(20) (2019) 1-15.
[3572] M. R. Zeen El Deen, Edge δ-graceful labeling for some cyclic-related graphs, Adv.
Math. Phys., 2020 (2020), 6273245 https://downloads.hindawi.com/journals/
amp/2020/6273245.pdf
[3573] M. R. Zeen El Deen and G. Elmahdy, New classes of graphs with edge δ− grace-
ful labeling, AIMS Math. (2022) 7(3) 3554-3589. https://www.aimspress.com/
article/doi/10.3934/math.2022197?viewType=HTML
[3574] M. R. Zeen El Deen, G. M. Elmahdy, E. M. Elkholy, and H. M. El-Sherbiny, Half-
Zumkeller labeling for some Cartesian product graphs, Frontiers Sci. Res. Tech.,
4 (2022) 99-110. doi:10.21608/FSRT.2022.169109.1072

the electronic journal of combinatorics (2023), #DS6 621

[3575] M. R. Zeen El Deen and N. A. Omar, Further results on edge even graceful labeling
of the join of two graphs, J. Egyptian Math. Soc., 28, article 21, (2020) https:
//doi.org/10.1186/s42787-020-00077-5
[3576] D. Zhang, Y-S. Ho, S. M. Lee, and Y. Wen, On the balance index sets of trees
with diameter at most four, unpublished.
[3577] D. Zhang, S. M. Lee, and L. Wen, On the balancedness of galaxies with at most
four stars, J. Combin. Math. Combin. Comput., 50 (2004) 3-15.
[3578] F. Zhang, S. Nazeer, M. Habib, T. J. Zia, and Z. Ren, Radio number for generalized
Petersen graphs P (n, 2), IEEE Access (2019) PP(99):1-9.
[3579] G.-H. Zhang and T.-M. Wang, E-super vertex magic regular graphs of odd degree,
The Eighth International Workshop on Graph Labelings (IWOGL 2014), Electron.
Notes Discrete Math., 48 (2015) 49-56.
[3580] P. Zhang, Radio labelings of cycles, Ars Combin., 65 (2002) 21-32.
[3581] X. Zhang, M. Ibrahim, S. ul Haq Bokhary, and M. K. Siddiqui, Edge irregular
reflexive labeling for the disjoint union of gear graphs and prism graphs, Mathe-
matics, 6(9):142 (2018), 10 pages. https://www.mdpi.com/2227-7390/6/9/142
[3582] X. Zhang, C. Ye, S. Zhang, and B. Yao, Graph colorings and labelings having
multiple restrictive conditions in topological coding, Mathematics, 10 1592 (2022)
1-9. https://www.mdpi.com/2227-7390/10/9/1592
[3583] X. Zhang, H. Sun, and B. Yao, Graph theory towards module-K odd-elegant la-
belling of graphical passwords, MATEC Web of Conferences 139, 00206 (2017)
ICMITE 2017 doi:10.1051/matecconf/201713900206
[3584] Z. Zhang, T. Mehmood, A. ur Rehman, M. Hussain, and X. Zhang, On valuation
of edge irregularity strength of certain graphical families, Hindawi J. Math., 2022,
Article ID 3230932, 8 pages https://doi.org/10.1155/2022/3230932
[3585] Z. Zhang, M. Naeem, A. Tariq, and W. Zhao, On square sum labeling of two
families of Petersen graphs, J. Math. (2022), Art. ID 1872695, 14 pp. 519-523
https://www.hindawi.com/journals/jmath/2022/1872695/
[3586] Z. Zhang, Q. Zhang, and C. Wang, On (a, b; n)-graceful labeling of path Pn , Ars
Combin., 132 (2017) 110-119.
[3587] L. Zhao, W. Feng, and Jirimutu On the gracefulness of the digraphs n − C ~ m , Util.
Math., 82 (2010) 129-134.
[3588] L. Zhao and Jirimutu, On the gracefulness of the digraph n − C ~ m for m =
5, 7, 9, 11, 13, J. Prime Res. Math., 12(4)Classes of prime graphs, (2008) 118-126.
[3589] L. Zhao, Siqintuya, and Jirimutu, On the gracefulness of the digraphs n − C ~ m , Ars
Combin., 99 (2011) 421-428.
[3590] S. L. Zhao, All trees of diameter four are graceful, Graph Theory and its Applica-
tions: East and West (Jinan, 1986), 700-706, Ann. New York Acad. Sci., 576, New
York Acad. Sci., New York, 1989.

the electronic journal of combinatorics (2023), #DS6 622

[3591] X. Y. Zhao, F. Ma, Yao, B. Yao, A class of trees having strongly graceful labellings,
J. Jilin Univ. Sci., 54(2) (2016) 222-228.
[3592] Y. Zhao, personal communication (2010).
[3593] G. Zhenbin, The labelings of a variation of banana trees, Ars Combin., 94 (2010)
175-181.
[3594] G. Zhenbin, (a, d)-edge-antimagic total labelings of cycle, Ars Combin., 101 (2011)
217-223.
[3595] G. Zhenbin and F. Chongjin, Some discussions on super edge-magic labelings of
St(a1 , . . . , an ), Ars Combin. 108 (2013) 187-192.
[3596] L. Zhihe, The balanced properties of bipartite graphs with applications, Ars Com-
bin., 48 (1998) 283-288.
[3597] S. C. Zhou, Gracefulness of the graph Km ∪ Kn , J. Lanzhou Railway Inst., 12
(1993) 70-72.
[3598] S. Zhou, Unifying approaches for constructing labeled graphs from known ones, J.
Combin., Inform. System Sci., 20 (1995) 305-319.
[3599] S. Zhou and J. Yuan, On constructions of sequential graphs, Mathematica Appli-
cata, 6 (Supplement) (1993) 104-108.
[3600] X. Zhou, B. Yao, and X. Chen, Every lobster is odd-elegant, Infor. Process. Letters,
113 (2013) 30-33.
[3601] X. Zhou, B. Yao, X. Chen, and H. Tao, A proof to the odd-gracefulness of all
lobsters, Ars Combin., 103 (2012) 13-18.
[3602] Z. Zhu and C. Liu, Characterizations and structure of sequential graphs, Ars Com-
bin., 116 (2014) 279-288.

the electronic journal of combinatorics (2023), #DS6 623

Index
(α1 , α2 , . . . , αk )-cordial, 313 Ek -regular, 185
(α1 , α2 , . . . , αk )-cordial graph, 313 F -geometric mean, 349
(α1 , α2 , . . . , αk )-cordial labeling, 313 Fn , 50
(a, d)-F -antimagic, 231 F ln , 288, 316
(a, d)-1-vertex-antimagic vertex, 234 G H, 21
(a, d)-distance antimagic, 227 G ⊗ H, 81
(a, d) − D antimagic, 233 G∗ , 95, 104
(a, r)-geometric, 376 G0 , 35
(k, d)-Heronian mean, 356 G1 ⊕ G2 , 55
(k, d)-Skolem graceful, 83 G1 ô G2 , 279
(k, d)-graceful labeling, 80 G1 [G2 ], 25
(k, d)-hooked Skolem graceful, 40 H-E-super magic, 194
(m, n)-gon star, 273 H-E-super magic decomposable, 194
< Km1 ,n1 , . . . , Kmt ,nt >, 36 H-cordial, 98
A-antimagic, 221 H-covering, 158, 240, 371
A-cordial graph, 99 H-decomposable, 194
A-magic, 206 H-graph of Pn , 335
B(n, r, m), 26 H-graph of a path, 343
∗
Bn,n , 309 H-magic, 190
Bm , 24 H-supermagic strength, 194
Bn,n , 309 H-union, 114
C(G1 , G2 , . . . , Gn ), 36 H − V -super magic decomposable, 194
C(n · G), 36 Hn , 335
CDm (G), 375 Hn -cordial, 98
Cm ∗ Cn , 385 Hn -graph, 120
Cm @Cn , 206 JFn , 385
Cm @Cn , 120 Jn , 385
Cm @Pn , 103 KP (r, s, l), 69
+ (m)
Cn,k , 18 Kn , 26
(t)
Cn , 20 M (G), 38, 95
Circ(n, s), 227 Mm (G), 134
D-distance, 227 Mn , 24
D-distance antimagic, 227 P (G, f ), 39
D-distance magic, 233 P (n, k), 32
D-weight, 233 P (n · G), 36
DStn ), 37 Pnt , 37
D2 (G), 85, 113 Pnt (tn · H), 37
Dm (G), 87, 134, 375 Pn @K1,n , 122
E-super vertex magic, 184 Pnk , 32
Ek -cordial, 99 Pt (G), 96

the electronic journal of combinatorics (2023), #DS6 624

Pt (u, v), 96 a-vertex multiple magic, 146
Pa,b , 34, 331 b-edge consecutive magic labeling, 213
P ln , 37 b-edge multiple magic, 146
R-ring-magic, 209 d-antimagic, 225
Rm (G), 39 d-graceful, 60
S(G1 , G2 , . . . , Gn ), 36 f -permutation graph, 39
S(n · G), 36 grac(G), 42
Sm , 24 k-cordial labeling, 99
Sn , 238 k-difference cordial, 323
Sm,n , 115 k-even mean graph, 342
Splm (G), 134 k-even mean labeling, 343
St(n), 30 k-even sequential harmonious, 122
St(n1 , n2 , . . . , nk ), 83 k-fold, 173
T (G), 109 k-graceful, 78
T (Pn ), 39 k-graceful digraph, 82
Tp -tree, 80 k-magic, 148
W (t, n), 16 k-mean graph, 334
Γ-distance magic, 201 k-multilevel corona, 141
α-labeling k-prime, 279
eventually, 58 k-prime cordial, 328
free, 62 k-product cordial, 310
near, 63 k-ranking, 381
strong, 62 minimal, 381
weakly, 61, 72 k-remainder cordial, 103
α-deficit, 59 k-super mean, 335
α-labeling, 20, 51, 72, 84 k-total product cordial, 311
α-mean labeling, 332 k-totally magic cordial, 210
α-size, 60 k-ubiquitously graceful, 11
α-valuation, 51 k-vertex amalgamation, 56
β-valuation, 6 kCn -snake, 21, 67
χslat (G), 236 linear, 21
δ-optimal, 270 m-gracefulness, 73
δ-optimal summable, 270 m-mirror graph, 134
γ-labeling, 70 m-shadow graph, 134
ρ̂-labelings, 67 m-splitting graph, 134
ρ-labeling, 68 mG, 28
ρ-valuation, 68 n-cone, 16
ρ+ -labeling, 69 n-cube, 25, 51
ρ? , 68 n-point suspension, 16
θ-labeling, 69 nth quadrilateral snake, 386
ρ̃-labelings, 72 n·C ~ m , 42
a-vertex consecutive bimagic labeling, 214 q-labeling number, 403
a-vertex consecutive magic labeling, 213 r-distant irregular, 374

the electronic journal of combinatorics (2023), #DS6 625

r-distant irregularity strength, 374 armed crown, 318
rn ? (f ), 299
s(G), 361 balance index set, 110
sg (G), 369 balanced cordial, 104
t-fold, 56 balanced distance graphs, 202
t-join (m, n) kite, 393 bamboo tree, 10, 85
t-ply graph, 96 banana tree, 13, 75, 85
tdis(G), 374 barycentric subdivision, 36
ts(G), 369 bent ladder, 382
w-graph, 156 beta combination graph, 394
w-tree, 156 beta-number, 71
y-tree, 13 bi-odd sequential, 119
0-magic, 211 bicomposition, 69
1-vertex bimagic, 204 bigraceful graph, 40
2-link fence, 56 bipartite labeling, 60
3-equitable prime cordial, 328 bistar, 160, 165
3-product cordial, 308 block, 20, 169
3-total super sum cordial graph, 313 block graph, 397
3-total super sum cordial labeling, 313 block-cut-vertex graph, 169
block-cutpoint, 55
abbreviated double tree of T , 149 block-cutpoint graph, 20
absolutely harmonious graph, 121 book, 7, 19, 24, 155
additively (a, r)-geometric, 376 generalized, 276
adjacency matrix, 68 stacked, 24
almost graceful labeling, 67 boundary value, 57
almost-bipartite graph, 70 bow graph, 18
alpha-number, 169 broom, 143
alternate hexagonal snake, 21
alternate quadrilateral snake, 279, 306, 320 cactus
alternate shell, 94 k-angular, 89
alternate triangular snake, 278, 306, 320 triangular, 20
amalgamation, 193 Cartesian product, 23, 288
analytic mean graph, 355 cartoon flower
antimagic edge chromatic, 225 graph, 143
antimagic orientation, 223 caterpillar, 10, 51, 63, 75, 117, 161
antipodal balanced, 203 caterpillar cycle, 381
antiprism, 194, 232, 255, 368 cells, 55
apex, 18, 113 chain graph, 55, 169
arank number, 382 chain of cycles, 19
arbitrarily distance antimagic, 227 chain tree, 55
arbitrarily graceful, 78 chord, 17
arbitrary supersubdivision, 34, 95 chordal ring, 183, 233
arithmetic, 124 circulant graph, 144
circular lobster, 382

the electronic journal of combinatorics (2023), #DS6 626

closed m-shadow of a graph, 375 cyclic decomposition, 68
closed helm, 16 cylinders, 195
coalescence, 54
Dd-length, 303
cocktail party graph, 134, 184, 268
decomposition, 6, 51, 63, 67, 70
coconut tree, 283
deficiency
color number, 235
edge-magic, 167
comb tree, 382
super edge-magic, 167
combination graph, 393
degree splitting graph, 322
combs, 35
degree-magic, 141
complete
difference cordial labeling, 320
n-partite graph, 91, 261
difference graph, 388
bipartite graph, 20, 25
direct product, 200
graph, 25
directed edge-graceful, 296
tripartite graph, 25
directed graceful graph, 42
complete mixed generalized sausage graph,
dis(G), 374
217
disjoint union, 28
complete star, 364
distance k-antimagic, 226
component, 280
distance antimagic, 226
composition, 25, 89, 288
labeling, 219
conjunction, 305
distance magic labeling, 198
consecutive radio labeling, 299
distance reflexive strength, 371
consecutively super edge-magic, 164
divisor cordial, 314
consecutively super edge-magic deficiency,
divisor graph, 396
164
dodecahedron, 40
contra harmonic mean, 348
double alternate hexagonal snake, 21
contraharmonic mean, 348
double alternate quadrilateral snake, 279
convex polytope, 195, 254
double alternate quadrilateral snake, 306,
cordial graph, 90
320
cordial labeling, 89
double alternate triangular snake, 278, 306,
corona, 21, 155
320
covering, 241
double coconut trees, 283
critical number, 57
double cone, 16
crown, 21, 115, 117, 265, 379
double fans, 35
cube, 24, 40
double graph of G, 142
cube divisor cordial, 316
double hexagonal snake, 21
cubic graph, 171
double path union, 82
cycle, 6, 268
double quadrilateral snake, 278, 306, 320
cycle of a graph, 209
double star, 149
cycle of graphs, 36, 333
double step grid graph, 37
cycle with a Pk -chord, 17
double tree, 149
cycle with parallel Ck − chord, 18
double triangular snake, 278, 306, 320, 334
cycle with parallel Pk chords, 17
dragon, 19
cyclic G-decomposition, 63
duplication of a vertex, 35, 306

the electronic journal of combinatorics (2023), #DS6 627

duplication of an edge, 35, 95, 306 EP-cordial graph, 310
Dutch t-windmill, 20 EP-cordial labeling, 310
Dutch windmill, 147 Eulerian graph, 112
even 2a-sequential, 138
EBI(G), 111 even 1-vertex bimagic, 204
edge H-irregularity strength, 371 even graceful, 57
edge amalgamation, 276 even mean labeling, 342
edge bimagic total , 204 even vertex equitable even, 387
edge comb product, 135 even vertex magic total, 186
edge even graceful labeling, 73 even vertex odd mean, 343
edge irregular total labeling, 362 even-even, 88
edge irregularity strength, 372 even-odd harmonious, 138
edge linked cyclic snake, 331 exclusive sum labeling, 269
edge magic graceful, 158 exclusive sum number, 269
edge magic strength, 146 extended w-tree, 156
edge pair sum, 359 extended edge vertex cordial labeling, 106
edge parity, 61 extended jewel graph, 353
edge product cordial labeling, 318
edge reduced face, 195, 254
integral sum number, 267 face irregular total k-labeling, 370
sum number, 267 fan, 50, 126, 140, 152, 155, 166, 183, 195,
edge trimagic total labeling, 172 272
edge-antimagic graceful, 234 fence, 56
edge-antimagic total, 222 FI(G), 107
edge-balance index, 111 Fibonacci graceful, 75
edge-coloring k-vertex weighting, 404 firecracker, 13
edge-covering, 371 flag, 91, 122, 296
edge-decomposition, 64 flower, 16, 181, 272
edge-friendly index, 109 folded hypercube
edge-graceful deficiency, 289 graphs, 201
edge-graceful spectrum, 290 forest, 167
edge-magic index, 173 free α-labeling, 62
edge-magic injection, 160 friendly index set, 107
edge-magic total friendship graph, 20, 89, 166, 181, 183, 195,
labeling, 147 269
edge-odd graceful, 86, 88 full r-ary tree, 13
edge-prime graph, 283 full edge-friendly index, 109
ehs(G, H), 371 full friendly index set, 111
elegant, 126 full hexagonal caterpillars, 56
elegant labeling, 126 full product-cordial index, 308
elem. parallel transformation, 80 fully magic, 207
elementary transformation, 53, 157 fully product-cordial, 308
envelope graph, 111 functional extension, 149

the electronic journal of combinatorics (2023), #DS6 628

gamma-number, 41 A-antimagic, 221
gear graph, 16 A-cordial, 99
generalized A-vertex magic, 145
book, 276 C-geometric, 349
bundle, 97 D-distance, 227
fan, 97 D-distance antimagic, 227
wheel, 97 E-cordial, 295
generalized kCn -snake, 331 E-super arthmetic graceful, 404
generalized antiprism, 247 E-super vertex magic, 184
generalized caterpillar, 35 Ek -cordial, 99
generalized edge linked cyclic snake, 331 G-distance magic, 201
generalized helm, 181, 365 G-snake, 21
generalized Jahangir graph, 181 H-cordial, 98
generalized prisms, 299 H-elegant, 128
generalized sausage graph, 217 H-group magic, 145
generalized shackle, 240 H-harmonious, 128
generalized spider, 34 Hk -cordial, 98
generalized web, 16, 181 Hn -cordial, 98
geometric mean 3-equitable, 361 S-magic, 145
geometric mean cordial, 361 V -cordial, 329
glutting number, 329 V -super vertex magic, 143
Golomb ruler, 27 Vk super vertex in-magic, 215
graceful Vk -super vertex magic, 185
almost super Fibonacci, 76 ∆-optimum summable, 269
graceful center, 62 Γ irregular, 369
graceful game, 74 θ-Petersen, 291
graceful graph, 6 a-vertex multiple magic, 146
gracesize, 61 b-edge multiple magic, 146
gracious k-labeling, 63 d-graceful, 60
gracious labeling, 63 f -permutation, 39
graph, 152, 322, 341 g-graph, 268
(α1 , α2 , . . . , αk )-cordial, 313 k-antimagic, 224
(ω, k)-antimagic, 224 k-balanced, 106, 115
(a, d)-F -antimagic, 231 k-difference cordial, 323
(a, d)-antimagic, 229 k-distance magic, 199
(a, d)-distance antimagic, 227 k-edge-magic, 148
(a, r)-geometric, 376 k-enriched fan, 18
(k + 1)-equitable mean, 360 k-even edge-graceful, 290
(k, λ)-magically total labeling, 205 k-magic, 148
(k, d)-Heronian mean, 356 k-modular multiplicative, 378
(k, d)-Skolem graceful, 83 k-multilevel corona, 141
(k, d)-arithmetic, 123 k-prime cordial, 328
(k, d)-balanced, 82 k-prime total, 280

the electronic journal of combinatorics (2023), #DS6 629

 k-product cordial, 310 arithmetic, 124, 377
k-shifted antimagic, 220 armed crown, 318
k-super cube root cube mean, 339 armed helms, 92
k-super graceful, 73 balanced distance, 202
k-super root square mean, 338 balloon, 120
k-ubiquitously, 11 barbell, 362
kth Fibonacci prime, 284 basket, 370
k(G) snake, 132 bent ladder, 382
m-level wheel, 292 beta combination, 394
m-mirror, 134 bi-odd sequential, 119
m-shadow, 134 bicomposition, 69
m-splitting, 134 biconditional cordial, 106
n-uniform, 365 bicyclic, 291, 305
n-uniform cactus chain, 365 bigraceful, 40
p-distance magic, 199 block, 397
t-m-Zumkeller, 399 bow, 18, 314
t-uniform homeomorph, 96 braid, 172
w-graph, 156 braided star, 280, 321
w-tree, 156 branched-prism, 247
(1,0,0)-F-face magic mean, 350 broken wheel, 108
2-odd, 402 broom, 143, 184
3-equitable prime cordial, 328 butterfly, 122, 291, 296
3-product cordial, 308 cactus, 365
3-total super sum cordial labeling, 313 calendula, 190
F -root square mean, 338 caterpillar cycle, 381
k-odd edge mean, 341 centered triangular difference mean, 347
aboreale star, 322 centered triangular mean, 346
absolutely antimagic, 220 centroidal mean, 336
absolutely harmonious, 121 chain, 194, 372
additively (a, r)-geometric, 376 chordal ring, 183, 233
additively (a, r)∗-geometric, 376 circle, 133
almost-bipartite, 70 circulant, 144
alternate hexagonal snake, 21 circular ladders, 98
alternate quadrilateral snake, 279, 306, circular lobster, 382
320, 395 circulent, 227
alternate shell, 94 closed distance magic, 200
alternate triangular snake, 278, 306, closed helm, 16
320, 395 cocktail party, 134, 184, 268
analytic mean, 355 coconut tree, 283
analytic odd mean, 355 comb tree, 382
antimagic, 216 combs, 35
arbitrarily graceful, 78 complete, 25
arbitrary calendula, 344 complete mixed generalized sausage

the electronic journal of combinatorics (2023), #DS6 630

 graph, 217 double squid, 136
composition, 25 double step grid, 37
cone, 309 double triangular, 20
conservative, 141 double triangular snake, 278, 306, 320
contra harmonic mean, 348 double wheels, 25
contraharmonic mean, 348 double-sided arrow, 358
cordial, 166 dragon, 358
countable infinite, 154 dumbbell, 122, 291
cube root cube mean, 339 edge corona path, 192, 232
cube sum, 391 edge linked cyclic snake, 331
cycle butterfly, 326 edge magic graceful, 158
cycle with parallel chords, 28 edge pair sum, 359
cyclic snake, 341 edge product cordial, 318, 319
dandelion, 299 edge vertex prime, 283
decomposable, 163 edge-friendly, 106
degree-magic, 141 edge-magic, 171
diamond, 79 edge-prime, 283
difference, 388 EP-cordial, 310
difference cordial, 320 even 2a-sequential, 138
difference perfect square cordial, 392 even edge-graceful, 293
directed, 8 even vertex odd mean, 343
directed Γ-distance magic, 202 even-multiple subdivision, 93
directed edge-graceful, 296 evensum, 401
disconnected, 28 extended w-tree, 156
distance, 302 extended jewel, 353
distance k-antimagic, 226 extended vertex edge additive cordial,
distance antimagic, 226 106
distance irregular k, 371 extra Skolem difference mean, 345
divisor, 396 face integer edge cordial, 330
divisor 3-equitable, 398 face-magic toridal, 203
double alternate hexagonal snake, 21 fan, 50
double alternate quadrilateral snake, festoon, 122, 296
279, 306, 320 Fibonacci, 312
double alternate trirangular snake, 278, Fibonacci divisor cordial, 313
306, 320 Fibonacci graceful, 76
double arrow, 209 Fibonacci mean antimagic, 223
double coconut tree, 283 Fibonacci range, 405
double divisor cordial, 318 firecracker, 135
double fans, 35 flower, 288, 316
double graph of G, 142 flower snark, 326
double hexagonal snake, 21 friendship, 20
double quadrilateral snake, 278, 306, fully product-cordial, 308
320 generalize shacke, 240

the electronic journal of combinatorics (2023), #DS6 631

 generalized caterpillar, 35 jewel, 333, 385
generalized cycle star, 283 join, 30
generalized edge linked cyclic snake, 331 join sum, 36, 133
generalized helm, 181, 363, 365 kayak paddle, 19
generalized Jahangir, 168, 181 king, 402
generalized sausage, 217 kite, 19, 165
generalized spider, 34 Knödel, 183, 274
generalized web, 16, 181 komodo dragon with many tails, 38
generalized wheel, 308 komodo dragons, 38
globe, 108, 330 Kusadama, 321
graceful, 6 ladder, 23
graceful antimagic, 234 Lehmer-4 mean, 348
gracefulness, 73 lict, 86
graph-block chain, 34 lilly, 104, 389
grid-like, 53 line-graceful, 378
group S3 , 327 linear cactus, 129
group S3 cordial remainder, 401 litact, 86
group S3 mean cordial, 352 local edge antimagic, 225
hair-kC4 graph, 132 lollipop, 362
half-Zumkeller, 399 long brush, 199
Halin, 147 lotus, 79, 312
Hamming-graceful, 116 Lucas divisor cordial, 317
handicap distance d-antimagic, 219 lucky edge, 400
Harary, 246 middle, 95
harmonic mean, 347 millipede, 81
harmonious, 7 minimally k-equitable, 115
hefty V4 -magic, 146 mirror, 38
hetro-cordial, 330 mixed generalized sausage, 217
hexagonal snake, 21 modular multiplicative, 378
highly vertex prime, 280 multiple shell, 114
holiday star, 321 Mycielskian, 199
homo-cordial, 330 Mycieski, 113
hybrid quadrilateral snake, 131 Napier bridge, 309
hyper strongly multiplicative, 377 node-graceful, 83
ideal magic, 161 north star, 312
indexable, 125 odd (a, d)-antimagic, 233
integer cordial, 104 odd antimagic, 233
integer edge cordial, 330 odd Fibonacci mean, 342
integral sum, 262 odd prime, 284
irregular quadrilateral snake, 320 odd sum, 120
irregular triangular snake, 320 odd vertex equitable even, 386
Jahangir, 90 odd vertex magic, 143
jelly fish, 158, 395 one modulo N graceful, 75

the electronic journal of combinatorics (2023), #DS6 632

 one modulo N difference mean, 355 semismooth graceful, 81
one modulo three square mean, 354 semitotal-block, 389
one-sided arrow, 358 set graceful, 382
ordered, 222 set sequential, 382
orientable Gamma-distance magic, 202 set-cordial, 329
pagoda, 350 shacke, 239
pair mean, 360 shackle, 193
pair sum, 358 shadow, 85, 113
pair sum modulo, 360 sharp, 222
para-squares cactus, 365 shell-butterfly, 18
para-squares cactus chain, 365 shell-type, 18
parity combination cordial, 329 shellflower, 18
path-block chain, 34 shipping, 392
pentagonal sum, 396 signed cordial, 403
perfect, 397 signed product cordial, 325, 403
perfect super edge-magic, 159 simply sequential, 380
Perrin graceful, 77 Skolem difference Lucas mean, 345
plus, 37, 135 Skolem difference mean, 344
polar grid, 57 Skolem even difference mean, 346
prime, 273, 279 Skolem labeled, 83
prime distance, 401 Skolem-graceful, 82
prime graceful, 41 slanting ladder, 120, 209
prime odd mean, 341 smooth graceful, 38
pronic graceful, 64 sparkler, 290
pseudo-magic, 146 sparklers, 122
pumpkin, 191 splitting, 35
pyramid, 79, 134 square difference, 389, 391
radio mean, 352 square harmonious, 122
reduction, 382 square product, 404
relaxed mean, 335 square sum, 389
remainder cordial, 102, 318 squid, 136
replicated, 39 SSG(n), 86, 134
restricted k-mean, 335 star, 24
restricted triangular difference mean, star extension, 127
355 star of, 95, 104
rigid ladders, 332 step grid, 37, 333
root square mean, 339 step ladder, 134
SD-divisor, 398 strong edge-graceful, 289
SD-harmonius, 404 strong face plane, 218
SD-prime cordial, 278 strong magic, 161
semi Jahangir, 172, 209 strong sum, 262
semi-edge-prime, 283 strong super edge-magic, 159
semi-magic, 140 strongly c-elegant, 130

the electronic journal of combinatorics (2023), #DS6 633

 strongly k-indexable, 166 umbrella, 108, 158
strongly 1-harmonious, 166 unicyclic, 17
strongly felicitous, 130 uniform bow, 18
strongly harmonious, 117 uniformly balanced, 105
strongly indexable, 124 uniformly cordial, 103
strongly multiplicative, 377 universal alpha-graceful, 62
subdivided shell, 75, 86, 133 universal graceful, 62
sum divisor cordial, 315 vanessa, 104
sun, 238 vertex k-prime, 302
sunflower, 92 vertex even mean, 341
super (a, d)-F -antimagic, 231 vertex magic, 145
super edge magic graceful, 158 vertex odd divisor cordial, 317
super edge-graceful, 58 vertex odd graceful, 88
super graceful, 73 vertex product, 311
super Lehmer-3 mean, 348 vertex switching, 36, 77, 95, 217
super pair sum, 359 vertex-edge neighborhood-prime, 282
super root square mean, 338 weak antimagic, 221
super subdivision, 386 weak magic, 161
super vertex mean, 334 weak sum, 270
supermagic, 140 web graph without a center, 275
supersubdivision, 33 weighted-k-antimagic, 226
swastik, 38 zero divisor, 315
tadpoles, 19 zero-sum A-magic, 206
theta, 127 zig-zag triangle, 153
theta graph, 35 Zumkeller, 398, 399
Toeplitz, 249 graph labeling, 6
torch, 35, 274 graph-block chain, 34
tortoise, 336 graphs
total, 39, 305 double-sided step, 358
total edge Fibonacci irregular, 368 dragon, 336
total mean cordial, 351, 353 exponential, 357
total mean labeling, 344 lilly, 210
total mixed, 373 long dumbell, 404
total prime, 280 middle, 338
totally antimagic total, 222 multi-bridge, 220
totally magic, 187 octopus, 210
triangular belt, 172 one-sided step, 358
triangular difference mean, 347 vanessa, 210
triangular ladders, 309 weighted k-list-antimagic, 226
triangular snake, 20 grid, 23, 79
triangular tree, 51 grid-like graph, 53
twisted cylinder, 111, 308 group irregularity strength, 369
T–IASL signed graph, 384
half-Zumkeller, 399

the electronic journal of combinatorics (2023), #DS6 634

Halin graph, 147 irregularity strength, 361
Hamming-graceful graph, 116 irregulat fense, 56
handicap distance antimagic graphs, 219
handicap incomplete tournament, 219 jewel graph, 333
harmonic mean, 347 join product, 168
harmonious graph, 7 join sum, 36
harmonious number, 122 kayak paddle, 19, 69
harmonious order, 40 kite, 19, 59, 165, 185
Heawood graph, 40, 62 Kotzig’s Conjecture, 68
helm, 16, 272
closed, 92 L-cordial, 103
generalized, 92 labeling
Herschel graph, 40, 229 (α1 , α2 , . . . , αk )-cordial, 313
hexagonal lattice, 195 (ω, k)-antimagic, 224
hexagonal snake, 21 (a, b)-consecutive, 290
holey α-labeling, 67 (a, b; n)-graceful, 41
homeomorph, 110 (a, d)- vertex-antimagic edge, 229
honeycomb graph, 256 (a, d)-H-antimagic total labeling, 240
hooked Skolem sequence, 84 (a, d)-1-vertex-antimagic vertex, 234
host graph, 58 (a, d)-distance antimagic, 227
hybrid quadrilateral snake, 131 (a, d)-edge-antimagic total, 241
hypercycle, 267 (a, d)-edge-antimagic vertex, 241
strong, 267 (a, d)-face antimagic, 254
hypergraph, 144, 173, 224, 267 (a, d)-indexable, 241
hyperwheel, 267 (a, d)-vertex-antimagic total, 238
(a, r)-geometric, 376
IC-coloring, 380 (k, λ)-magically total labeling, 205
IC-index, 380 (k, d)-Heronian mean, 356
icicle graph, 382 (k, d)-Skolem, 83
icosahedron, 40 (k, d)-arithmetic, 123
index of cordiality, 95 (k, d)-even mean, 343
index of product cordiality, 312 (k, d)-graceful, 80
integer-antimagic spectrum, 222 (k, d)-hooked Skolem graceful, 40
integer-magic spectrum, 148, 208 (k, d)-odd mean, 342
integral radius, 267 (k, d)-super mean, 347
integral sum A-magic, 206
number, 265 A-vertex magic, 145
tree, 265 C-geometric mean, 349
integral sum-diameter, 263 D-magic, 203
irregular crown, 159 E-cordial, 295
irregular labeling, 361 E-sum cordial, 312
irregular quadrilateral snake, 320 F -centroidal mean, 336
irregular triangle snake, 320 F -geometric, 349

the electronic journal of combinatorics (2023), #DS6 635

 G-distance magic, 201 k-prime total, 280
H-E-super magic, 194 k-product, 309
H-group magic, 145 k-product cordial, 310
H-irregular k, 371 k-remainder cordial, 103
H-magic, 190 k-sequential, 379
P (a)Q(1)-super vertex-graceful, 294 k-sequentially additive, 387
Q(a)P (b)-super edge-graceful, 294 k-super cube root mean labeling, 339
R-ring-magic, 209 k-super harmonic, 356
V -cordial, 329 k-super labeling, 73
V -super vertex magic, 143 k-super mean, 335, 347
VK -super vertex magic, 185 k-total product cordial, 311
Vk -super vertex in-magic labeling, 215 k-totally magic cordial, 210
∆-exclusive sum labeling, 269 kth Fibonacci prime, 284
Γ irregular, 369 m-bonacci graceful, 63
Θ-graceful, 77 t-m-Zumkeller, 399
α-, 51 t-harmonious, 40
α-mean, 332 w-sum, 270
ρ? , 68 (1,0,0)-F-face magic, 350
σ-, 69 1-vertex bimagic, 204
a-vertex consec. edge bimagic, 213 1-vertex magic, 198
a-vertex-consecutive magic, 186 1-vertex magic vertex, 211
d-antimagic, 225 3-equitable prime cordial, 328
d-antimagic of type (1, 1, 1), 254 3-product cordial, 308
d-graceful, 60 3-total super sum cordial labeling, 313
k-DML, 199 (k, d)-indexable, 124
k-antimagic, 224 absolute differences of cubic and square
k-balanced, 106 difference, 402
k-cordial, 99 absolute graceful, 358
k-distance magic, 199 absolutely harmonious, 121
k-edge graceful, 290 additively (a, r)-geometric, 376
k-edge-magic, 148 additively (a, r)∗-geometric, 376
k-equitable, 112, 115 additively (k, d)-sequential, 388
k-even edge-graceful, 290 additively graceful, 123
k-even mean, 342, 343 almost graceful, 67
k-even sequential harmonious, 122 almost magic, 204
k-graceful, 82 analytic mean, 355
k-indexable, 124 analytic odd mean, 355
k-labeling, 302 antimagic, 216, 223
k-mean, 334 arbitrarily graceful, 78
k-odd edge mean, 341 arithmetic sequential graceful, 63
k-odd mean, 342 balanced, 51, 105
k-prime, 279 balanced cordial, 104
k-prime cordial, 328 balanced mean cordial, 353

the electronic journal of combinatorics (2023), #DS6 636

 beta combination, 394 edge-friendly, 106
bi-odd sequential, 119 edge-graceful, 287
bigraceful, 64 edge-magic, 151, 171
binary magic total, 211 edge-magic total, 151
bipartite, 60 edge-odd graceful, 86, 88
C-exponential mean, 357 edge-prime, 283
centered triangular difference mean, 347 elegant, 126
centered triangular mean, 346 EP-cordial, 310
complete k-equitable, 116 equitable, 204
consecutive, 130 even 2a-sequential, 138
consecutive radio, 299 even 1-vertex bimagic, 204
coprime, 284 even falicitous, 130
cordial, 89 even mean labeling, 342
cordial edge deficiency, 104 even sequential harmonious, 121
cordial vertex deficiency, 104 even sum, 401
cube difference, 392 even vertex equitable even, 387
cube divisor cordial, 316 even vertex magic total, 186
cube root mean labeling, 339 even vertex odd mean, 343
cubic roots cordial, 100 even-even, 88
difference cordial, 320 even-odd harmonious, 138
difference perfect aquare cordial, 392 exponential, 357
directed Γ-distance magic, 202 extended edge vertex cordial labeling,
directed edge-graceful, 296 106
distance k-antimagic, 226 F-face mean, 357
distance magic, 198, 211 face integer edge cordial, 330
distance vertex irregular total k- face irregular total k-labeling, 370
labeling, 374 felicitous, 128
dividing graceful, 404 Fibonacci, 312
divisor 3-equitable, 398 Fibonacci divisor, 313
divisor cordial, 314 Fibonacci graceful, 75
double divisor cordial, 318 Fibonacci mean antimagic, 223
edge bimagic, 204 friendly, 103
edge bimagic total, 214 fuzzy quotient-3 cordial, 330
edge even graceful, 73 geometric mean, 354
edge irregular k-labeling, 372 geometric mean 3-equitable, 361
edge irregular reflexive k-labeling, 370 geometric mean cordial, 361
edge irregular total, 362 graceful antimagic, 234
edge mumbering, 405 graceful data structure, 67
edge pair sum, 359 graceful difference, 43
edge product cordial, 318 graceful-harmonius, 42
edge trimagic total, 172 gracefully consistent, 58
edge vertex prime, 283 gracious, 63
edge-antimagic graceful, 234 group S3 , 327

the electronic journal of combinatorics (2023), #DS6 637

 group S3 cordial, 401 nice (1, 1) edge-magic, 160
group S3 mean cordial, 352 non-inclusive distance vertex irregular
half-Zumkeller, 399 k-labeling, 374
handicap distance d-antimagic, 219 numbering, 170, 405
harmonious numbering, 122 odd 1-vertex bimagic, 204
hetro-cordial, 330 odd Fibonacci mean, 341
highly vertex prime, 280 odd harmonious, 131, 136
homo-cordial, 329 odd mean, 340
in-magic total, 163 odd prime, 284
inclusive distance vertex irregular, 374 odd sum, 120
indexable, 125 odd vertex equitable, 386
integer cordial, 104 odd-elegant, 128
integer cordial edge, 330 odd-even, 81, 88
interlaced, 51 odd-graceful, 67, 84
irregular, 361 one modulo N graceful, 75
l, 88 one modulo N-difference, 355
L-cordial, 103 one modulo three graceful, 75
Lehmer-4, 348 one modulo three mean, 353
line-graceful, 378 one modulo three root square mean, 354
local antimagic, 235 optimal k-equitable, 116
localedge antimagic, 225 optimal sum graph, 261
Lucas divisor cordial, 317 ordered, 222
lucky, 399 orientable Γ-distance magic, 202
lucky edge, 400 pair mean, 360
magic, 140, 146 pair sum, 358
consecutive, 195 parity combination cordial, 329
of type (0,1,1), 195 partial vertex, 106
of type (1,0,0), 195 partitional, 118
of type (1,1,0), 195 Pell graceful, 77
of type (1,1,1), 195 pentagonal sum, 396
magic valuation, 151 perfect super edge-magic, 159
mean, 331 Perrin graceful, 77
mean cordial, 350 polychrome, 128
mean square cordial, 337 prime, 272
minium coprime, 284 prime cordial, 324
MMD, 398 prime-magic, 143
modular irregular, 375 product antimagic, 259
modular multiplicative divisor, 398 product cordial labeling, 304
near mean, 358 product edge-antimagic, 260
near-elegant, 126 product edge-magic, 260
nearly distance magic, 203 product integer cordial, 104
nearly graceful, 67 product magic, 259
neighborhood-prime, 280 product-irregular, 373

the electronic journal of combinatorics (2023), #DS6 638

 pronic graceful, 64 Skolem even difference mean, 346
pronic Heron mean, 357 Skolem even vertex odd difference
proper lucky, 399 mean, 346
properly even harmonious, 137 Skolem odd difference mean, 345
pseudo α, 71 Skolem-graceful, 82
pseudograceful, 70 square difference, 391, 392
quotient, 403 square divisor cordial, 316
radio ?, 299 square harmonius, 123
radio antipodal, 302 square sum, 389
radio antipodal geometric mean, 350 strength sum, 165
radio geometric mean, 349 strong edge-graceful, 289
radio mean, 352 strong rainbow antimagic, 220
radio mean D-distance, 352 strong super edge-magic, 159
radio mean Dd-distance, 303 strongly (k, d)-indexable, 124
radio mean square, 339 strongly c-harmonious, 117
rainbow antimagic vertex, 220 strongly k-elegant, 126
range-relaxed graceful, 74 strongly balanced, 105
real-graceful, 41 strongly edge-magic, 161
relaxed mean, 335 strongly even harmonious, 137
remainder cordial, 102, 318 strongly graceful, 51, 61
restricted k-mean, 334 strongly harmonious, 33, 117, 120
restricted triangular difference mean, strongly indexable, 124
355 strongly odd harmonious, 131
reverse edge magic, 149 strongly super edge-graceful, 294
reverse edge-trimagic, 172 strongly vertex-magic total, 185
reverse super edge magic, 149 sum divisor cordial, 315
reverse super edge-trimagic, 172 sum graph, 261
rosy, 68 sum perfect square, 391
SD-divisor, 398 super (a, d)-F -antimagic, 231
SD-prime cordial, 278 super (a, d)-edge-antimagic graceful,
semi (k, d)-arithmetric, 123 234
semi harmonious, 123 super (a, d)-vertex-antimagic total, 238
semi-elegant, 126 super edge bimagic cordial, 206
sequential, 117 super edge-antimagic total, 243
set-ordered odd-graceful, 86 super edge-graceful, 291
set-ordered strongly k-elegant, 127 super edge-magic, 161
sharp ordered, 222 super edge-magic total, 152
sigma, 198 super Fibonacci graceful, 76
signed cordial, 403 super geometric mean, 349
signed product cordial, 325, 403 super graceful, 73
simply sequential, 379 super Lehmer-3 mean, 348
Skolem difference Lucas mean, 345 super mean, 334
Skolem difference mean, 344 super pair sum, 359

the electronic journal of combinatorics (2023), #DS6 639

 super root mean, 338 zero-sum A-magic, 206
super vertex local antimagic total, 236 Zumkeller, 398
super vertex mean, 334 Zumkeller cordial, 399
super vertex-graceful, 294 labeling number, 58
super vertex-magic total, 182 lableing
supermagic, 140, 167 closed distance magic, 200
total, 222 lableling
total H-irregular α, 369 face integer cordial, 104
total cordial, 107 ladder, 23, 117, 195, 196
total edge product cordial, 319 Langford sequence, 158
total irregular total k, 369 level joined planar grid, 126
total magic cordial, 209 lexicographic product, 147
total mean, 344 linear cyclic snake, 21
total mean cordial, 351, 353 lobster, 12, 68
total neighborhood prime, 281 local antimagic chromatic number, 234
total prime, 280 local antimagic vertex coloring, 234
total product cordial labeling, 309 lotus inside a circle, 196
totally antimagic total, 222 Lucas divisor cordial, 317
totally magic, 187 lucky number, 400
totally magic cordial, 212
totally vertex-magic cordial, 212 Möbius grid, 248
triangular difference mean, 346 Möbius ladder, 24, 118, 140, 146, 195, 273,
triangular graceful, 74 289
triangular sum, 395 magic b-edge consecutive, 186
universal antimagic, 228 magic constant, 151, 203
vertex k-prime, 302 magic square, 140
vertex balanced cordial, 104 magic strength, 146, 160
vertex equitable, 384 magic sum index, 145
vertex even mean, 341 mean cordial, 350
vertex irregular reflexive k-labeling, 371 mean graph, 331
vertex irregular total, 362 mean number, 350
vertex magic total, 146 middle graph, 95
vertex odd divisor cordial, 317 minimum coprime number, 284
vertex odd mean, 341 mirror graph, 38
vertex prime, 279 mixed generalized sausage graph, 217
vertex product cordial, 311 mod difference digraph, 388
vertex-bimagic, 204 mod integral sum graph, 268
vertex-edge neighborhood-prime, 282 mod integral sum number, 268
vertex-friendly, 110 mod sum graph, 268
vertex-graceful, 293 mod sum number, 268
vertex-magic total, 179 mod sum* graph, 270
vertex-relaxed graceful, 74 mod sum* number, 270
weak antimagic, 221 modular irregularity strength, 375

the electronic journal of combinatorics (2023), #DS6 640

Mongolian tent, 23, 79 pentagonal number, 396
Mongolian village, 23, 79 pentagonal sum labeling, 396
MSG, 268 perfect Golomb ruler, 27
multigraph, 167, 173 perfect system of difference sets, 80
multiple shell, 18 permutation graph, 393
mutation, 185 Perrin seqence, 77
mutual duplication, 332 Petersen graph, 40
generalized, 32, 89, 155, 166, 180, 230,
near α-labeling, 63 238, 241
nearly distance magic, 203 planar bipyramid, 195
nearly graceful labeling, 67 planar graph, 195, 254
neighborhood-prime, 280 Platonic family, 195
non-inclusive distance irregularity strength, plus graph, 37, 135
374 polargrid, 57
nullset, 145 polyminoes, 79
numbering, 170 polyominoes, 57
Oberwolfash Problem, 41 power graph, 40
oblong numbers, 403 prime cordial
odd 1-vertex bimagic, 204 strongly, 327
odd harmonious, 131, 136 prime cordial labeling, 324
odd mean graph, 340 prime graceful, 41
odd mean labeling, 340 prime graph, 273, 279
odd prime graph, 284 prime labeling, 272
odd-elegant, 128 prism, 23, 24, 195, 238, 254
odd-even, 81, 88 product cordial, 304
odd-graceful labeling, 67, 84 product cordial labeling, 304
olive tree, 10 product graph, 261
one modulo N graceful, 75 product irregularity strength, 373
one modulo three graceful labeling, 75 product-cordial index, 308
one-point union, 20, 26, 52, 84, 89, 129 product-cordial set, 308
open star of G, 208 pronic number, 64, 357
optimal sum graph, 261 properly even harmonious, 137
pseudo α-labeling, 71
pair mean, 360 pseudo-magic graph, 146
pair mean graph, 360 pseudograceful labeling, 70
pair sum, 358
pair sum graph, 358 quadrilateral snakes, 21
parachutes, 229 quotient labeling number, 403
parallel chord, 108 radio k-chromatic number, 302
path, 18, 126 radio k-coloring, 301
path union, 36, 97 radio k-number, 302
path-block chain, 34 radio star-number, 299
pendent edge, 59 radio antipodal geometric number, 350

the electronic journal of combinatorics (2023), #DS6 641

radio antipodal labeling, 302 multiple, 18
radio antipodal number, 302 shell graph, 102
radio geometric mean number, 350 Skolem labeled graph, 83
radio graceful, 299 Skolem sequence, 12, 28
radio labeling, 298 Skolem-graceful labelings, 82
radio mean D-distance number, 352 SLAT, 236
radio mean labeling, 352 smooth graceful, 38
radio mean number, 352 snake, 20, 55
radio mean square number, 339 n-polygonal, 75
radio number, 298 double triangular, 20
rainbow antimagic connection number, 220 edge linked cyclic, 331
range-relaxed graceful game, 74 generalized edge linked cyclic, 331
range-relaxed graceful labeling, 74 quadrilateral, 53
rank number, 381 triangular, 20, 67
real sum graph, 261 snake polyomono, 55
reflexive edge strength, 370 sparse semi-magic square, 187
reflexive vertex strength, 371 special super edge-magic, 162
regular graph, 140, 144, 155, 181, 211 spider, 10
regular tree, 56 split graph, 218
relaxed mean graph, 335 splitting graph, 35, 85, 322
remainder cordial, 102 spum, 261
replicated graph, 39 square difference graph, 391
representation, 303 square divisor cordial, 316
representation number, 303 SSG(n), 86
restricted triangular difference mean, 355 SSG(n), 134
rigid ladders, 332 stable set, 34, 39, 54
Ringel-Kotzig, 10 star, 29, 31, 181, 379
root, 91 star of G, 310
root-union, 109 star of a G, 95, 104
star of graphs, 36
saturated vertex, 262 star super edge-magic deficiency, 154
SD-divisor, 398 step grid graph, 37, 333
SD-prime cordial, 278 step ladder, 134
semi-edge-prime graph, 283 straight simple polyominal caterpillars, 56
semismooth graceful, 81 strength
separating set, 382 edge magic, 146
sequential join, 59 magic, 146, 160
sequential number, 169 maximum magic, 161
set-ordered odd-graceful, 86 strength sum, 165
shackle, 239 strong product of graphs, 200
shadow graph, 85, 113 strong A-magic, 145
shadow of a graph G, 375 strong k-combination graph, 394
shell, 18, 92, 94, 113 strong k-permutation graph, 394

the electronic journal of combinatorics (2023), #DS6 642

strong beta-number, 71 super Fibonacci graceful, 76
strong edge antimagic, 225 super geometric mean, 349
strong edge-graceful, 289 super graceful, 73
strong gamma-number, 41 super labeling, 222
strong harmonious number, 122 super magic frame, 143
strong product, 373 super magic strength, 147, 165
strong rainbow antimagic connection num- super mean, 334
ber, 220 super mean number, 340
strong sequential number, 169 super subdivision, 386
strong sum graph, 262 super vertex local antimagic total chromatic
strong supersubdivision, 34 number, 236
arbitrary, 34 super vertex mean, 334
strong vertex-graceful, 293 super vertex-magic total, 182
strongly c-harmonious, 117 super weak sumgraph, 270
strongly *-graph, 395 superdivision
strongly antimagic, 225 arbitrary, 34
strongly even harmonious, 137 supersubdivision, 33, 97
strongly graceful labeling, 61 arbitrary, 34
strongly harmonious, 33, 117 swastik graph, 38
strongly odd harmonious, 131 switching invariant, 276
strongly prime cordial, 327 symmetric product, 25, 55
strsG, 165
stunted tree, 68 tadpoles, 19
subdivided shell graph, 75, 86, 133 tensor product, 81, 87, 106, 313
subdivision, 12, 23, 85, 196 tes(G), 362
sum graph, 261 theta graph, 127
mod, 268 theta graphs, 35
mod integral, 268 toroidal polyhex, 247
real, 261 torus grid, 24
sum number, 261 total H-irregularity strength, 369
sum perfect square, 391 total edge (vertex) irregular strength, 362
sum* graph, 270 total edge irregularity strength, 362
sum* number, 270 total edge product cordial labeling, 319
sum-diameter, 263 total graph, 39, 109, 305
sunflower, 92, 288 total labeling, 222
super (a, d)-F -antimagic, 231 total mean cordial, 351
super (a, d)-H-antimagic total labeling, 240 total mixed, 373
super (a, d)-edge-antimagic graceful, 234 total negative, 373
super d-antimagic, 225 total negative edge, 373
super edge magic graceful, 158 total positive edge, 373
super edge-magic deficiency, 154 total product cordial, 310
super edge-magic total labeling, 312
labeling, 147 total product cordial labeling, 309

the electronic journal of combinatorics (2023), #DS6 643

total stable, 373 weighted-k-antimagic, 226
total stable edge, 373 wheel, 16, 117, 140, 151, 183, 195, 216, 241
totally magic cordial, 212 windmill, 26, 91
totally magic cordial deficiency, 211 working vertex, 269
totally vertex-magic cordial labeling, 212 wreath product, 129
tr(G), 300
tree, 6, 218, 268 Young tableau, 23, 79
binary, 155 zero-sum A-magic, 206
path-like, 157 zero-sum h-magic, 145
symmetrical, 10
triameter, 300
triangular graceful labeling, 74
triangular snake, 20
tvs(G), 362

umbrella, 158
unicyclic graph, 19
uniform-distant tree, 13
union, 27, 151, 165, 167, 181, 265, 273, 280
universal antimagic, 228
unlabeled vertices, 106

vertex H-irregularity strenght, 372

vertex balance index set, 111
vertex balanced cordial, 104
vertex equitable, 384
vertex irregular total labeling, 362
vertex parity, 61
vertex prime labeling, 279
vertex switching, 36, 77, 95, 217, 276
vertex weight, 235
vertex-antimagic total, 222
vertex-graceful, 293
vertex-relaxed graceful labeling, 74
vhs(G, H), 372

weak sum graph, 270

weak tensor product, 59, 63
weakly α-labeling, 61
web, 16
generalized, 161
weight, 254
weight of vertex, 374
weight universal antimagic, 228

the electronic journal of combinatorics (2023), #DS6 644