nan Slamin

( a,d )-edge-antimagic total labelings of caterpillars

For a graph G = (V,E), a bijection g from V(G) ∪ E(G) into { 1,2, ..., ∣ V(G) ∣ + ∣ E(G) ∣ } is called (a,d)-edge-antimagic total labeling of G if the edge-weights w(xy) = g(x) + g(y) + g(xy), xy ∈ E(G), form an arithmetic progression with initial term a and common difference d. An (a,d)-edge-antimagic total labeling g is called super (a,d)-edge-antimagic total if g(V(G)) = { 1,2,..., ∣ V(G) ∣ } . We study super (a,d)-edge-antimagic total properties of stars Sn and caterpillar Sn1,n2,...,nr.

Vertex-antimagic total labelings of graphs

In this paper we introduce a new type of graph labeling, the

Vertex-Magic Total Labelings Of Generalized Petersen Graphs

(a, d)

Bounds on the number of isolates in sum graph labeling

- vertex-antimagic total labeling, which is a generalization of several other types of labelings. A connected graph

On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree

G(V,E)

Construction Techniques for Digraphs with Minimum Diameter

is said to be

Survey of certain valuations of graphs

(a, d)

Connected graphs which are not mod sum graphs

-vertex-antimagic total if there exist positive integers

Edge-magic total labelings of wheels, fans and friendship graphs

a

On d-antimagic labelings of prisms.

,