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 …

Let H be a graph. A graph G=(V, E) is said to be H-magic if every edge of G belongs to at
least one subgraph isomorphic to H and there is a total labeling f: V∪ E→{1, 2,...,| V|+| E|} …

Super (a, d)-H-antimagic total labelings for shackles of a connected graph H Page 1
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (2013), Pages 127–138 Super …

A simple graph G=(V (G), E (G)) admits an H-covering if every edge in E (G) belongs to a
subgraph of G that is isomorphic to H. An (a, d)-H-antimagic total labeling of G is a bijective …

Let H be a graph. A graph G=(V, E) admits an H-covering if every edge in E belongs to a
subgraph of G isomorphic to H. A graph G is called H-magic if there is a fixed integer k and a …

A bijective function with domain union of vertex and edge set to a range natural numbers to
onward count of vertices and edges of a graph. If there is a bijective function G, then G is …

The concepts of fuzzy labeling and fuzzy magic labeling graph are introduced. Fuzzy magic
labeling for some graphs like path, cycle, and star graph is defined. It is proved that every …

A graph Γ (simple, finite, undirected) with an Ω-covering has an (α, δ)-Ω-antimagic labeling if
the weights of all subgraphs Ω of graph Γ constitute an arithmetic progression with the …

Let H be a graph. Graph G=(V, E) admits a H-covering, if every edge in E (G) belongs to at
least one subgraph of G isomorphic to a given graph H. A graph G is said to be an (a, d)-H …

Academic Editor: Wei Gao Received: 2 July 2020; Accepted: 18 January 2021; Published:
21 January 2021. Abstract: Graph labeling plays an important role in different branches of …