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 …

A simple graph G=(V, E) admits an H-covering if every edge in the edge set E (G) belongs to
at least one subgraph of G isomorphic to a given graph H. A graph G having an H-covering …

Let G=(V, E) be a finite simple graph with v=| V (G)| vertices and e=| E (G)| edges. Further
suppose that H:={H 1, H 2,…, H t} is a family of subgraphs of G. In case, each edge of E (G) …

Let G=(V, E) be a~ finite simple graph with| V (G)| vertices and| E (G)| edges. An edge-
covering of G is a family of subgraphs H 1, H 2,…, H t such that each edge of E (G) belongs …

The paper deals with the problem of labeling the vertices and edges of a plane graph in
such a way that the labels of the vertices and edges surrounding that face add up to a weight …

In this paper we deal with the problem of labeling the vertices, edges, and faces of a toroidal
fullerene H_m^ n with mn hexagons by the consecutive integers from 1 up to V (H_m^ n)+ E …

For a graph G a bijection from the vertex set and the edge set of G to the set {1, 2,...,| V (G)|+|
E (G)|} is called a total labeling of G. The edge-weight of an edge is the sum of the label of …

Abstract A simple graph G=(V, E) admits an H-covering if every edge in E belongs to at least
one subgraph of G isomorphic to a given graph H. Then the graph G is (a, d)-H-antimagic if …

Suppose G is a finite plane graph with vertex set V (G) and edge set E (G). A d-antimagic
labeling of type (1, 1, 0) of G is a one-to-one map from V (G)∪ E (G) onto the integers 1 …

Abstract A simple graph G=(V, E) admits an H-covering if every edge in E belongs at least to
one subgraph of G isomorphic to a given graph H. Then the graph G admitting an H …