A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to H. The graph G is said to be (a, d)-H-antimagic if there exists a bijection from the vertex set V(G) and the edge set E(G) onto the set of integers 1, 2, …,VG+E(G) such that, for all subgraphs H′ of G isomorphic to H, the sum of labels of all vertices and edges belonging to H′ constitute the arithmetic progression with the initial term a and the common difference d. G is said to be a super (a, d)-H-antimagic if the smallest possible labels appear on the vertices. In this paper, we study super tree-antimagic total labelings of disjoint union of graphs
A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually th...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
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...
Prostý graf G má H-pokrytí, jestliže každá hrana v E(G) je v podgrafu grafu G, isomorfním s H, a (a,...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
Let H and G be finite simple graphs where every edge of G belongs to at least one subgraph that is i...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
A graph G(V,E) has a H-covering if every edge in E belongs to a sub-graph of G isomorphic to H. An (...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
Let G = (V (G),E(G)) be a simple graph and H be a subgraph of G. G admits an H-covering, if every ed...
AbstractLet H be a graph. Graph G = (V, E) admits a H-covering, if every edge in E(G) belongs to at ...
Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually th...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...
A simple graph G = (V; E) admits an H-covering if every edge in E belongs to at least one subgraph o...
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...
Prostý graf G má H-pokrytí, jestliže každá hrana v E(G) je v podgrafu grafu G, isomorfním s H, a (a,...
A simple graph G = (V, E) admits an H-covering, if every edge in E(G) belongs to a subgraph of G iso...
Let H and G be finite simple graphs where every edge of G belongs to at least one subgraph that is i...
A simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic to...
A graph G(V,E) has a H-covering if every edge in E belongs to a sub-graph of G isomorphic to H. An (...
An (a,d)-H-antimagic total labeling of a simple graph G admitting an H-covering is a bijection φ:V(G...
Let G = (V (G),E(G)) be a simple graph and H be a subgraph of G. G admits an H-covering, if every ed...
AbstractLet H be a graph. Graph G = (V, E) admits a H-covering, if every edge in E(G) belongs to at ...
Let G=(V,E) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G...
A graph G is called (a, d)-edge-antimagic total if it admits a labeling of the vertices and edges by...
A labeling of a graph is a mapping that carries some sets of graph elements into numbers (usually th...
Suppose G is a finite graph with vertex-set V(G) and edge-set E(G). An (a, d) -edge-antimagic total ...
A simple graph G=(V,E) is said to be an H-covering if every edge of G belongs to at least one subgra...