✦ LIBER ✦

Group labelings of graphs

✍ Scribed by Paul H. Edelman; Michael Saks

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 181 KB
Volume: 3
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190030205

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Given a graph Γ an abelian group G, and a labeling of the vertices of Γ with elements of G, necessary and sufficient conditions are stated for the existence of a labeling of the edges in which the label of each vertex equals the product of the labels of its incident edges. Such an edge labeling is called compatible. For vertex labelings satisfying these conditions, the set of compatible edge labelings is enumerated.

📜 SIMILAR VOLUMES

On sequential labelings of graphs

✍ Thom Grace 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

A valuation on a simple graph G IS an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. pvaluations, also called graceful labelings, and a-valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been intro

Harmonious labelings of windmill graphs

Harmonious labelings of windmill graphs and related graphs

✍ D. Frank Hsu 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract A strongly harmonious labeling is the nonmodular version of a harmonious labeling. The windmill graph __K__^(__t__^)~__n__~ is the graph consisting of __t__ copies of the complete graph __K~n~__ with a vertex in common. It is shown that, for __t__ ≥ 1, __K__^(__t__^)~__n__~ is strongly

Convex labelings of trees

✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T

Group connectivity of complementary grap

Group connectivity of complementary graphs

✍ Xinmin Hou; Hong-Jian Lai; Ping Li; Cun-Quan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

## Abstract Let __G__ be a 2‐edge‐connected undirected graph, __A__ be an (additive) abelian group and __A__\* = __A__−{0}. A graph __G__ is __A__‐connected if __G__ has an orientation __D__(__G__) such that for every function __b__: __V__(__G__)↦__A__ satisfying , there is a function __f__: __E__(

Antimagic labelling of vertex weighted g

Antimagic labelling of vertex weighted graphs

✍ Tsai-Lien Wong; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## Abstract Suppose __G__ is a graph, __k__ is a non‐negative integer. We say __G__ is __k__‐antimagic if there is an injection __f__: __E__→{1, 2, …, |__E__| + __k__} such that for any two distinct vertices __u__ and __v__, . We say __G__ is weighted‐__k__‐antimagic if for any vertex weight functi

Number of labeled 4-regular graphs

✍ R. C. Read; N. C. Wormald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 305 KB

## Abstract Several operations on 4‐regular graphs and pseudographs are analyzed and equations are obtained relating the numbers of these graphs on given numbers of labeled points. These equations are used recursively to find the numbers of 4‐regular graphs on up to 13 labeled points.