The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 2 of 2

Showing per page

Value sets of graphs edge-weighted with elements of a finite abelian group

Edgar G. DuCasse, Michael L. Gargano, Louis V. Quintas (2010)

Discussiones Mathematicae Graph Theory

Given a graph G = (V,E) of order n and a finite abelian group H = (H,+) of order n, a bijection f of V onto H is called a vertex H-labeling of G. Let g(e) ≡ (f(u)+f(v)) mod H for each edge e = u,v in E induce an edge H-labeling of G. Then, the sum H v a l f ( G ) e E g ( e ) m o d H is called the H-value of G relative to f and the set HvalS(G) of all H-values of G over all possible vertex H-labelings is called the H-value set of G. Theorems determining HvalS(G) for given H and G are obtained.

Vertex-antimagic total labelings of graphs

Martin Bača, James A. MacDougall, François Bertault, Mirka Miller, Rinovia Simanjuntak, Slamin (2003)

Discussiones Mathematicae Graph Theory

In this paper we introduce a new type of graph labeling for a graph G(V,E) called an (a,d)-vertex-antimagic total labeling. In this labeling we assign to the vertices and edges the consecutive integers from 1 to |V|+|E| and calculate the sum of labels at each vertex, i.e., the vertex label added to the labels on its incident edges. These sums form an arithmetical progression with initial term a and common difference d. We investigate basic properties of these labelings, show...

Currently displaying 1 – 2 of 2

Page 1