๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On -fold -and circular -labelings of graphs

โœ Scribed by Wensong Lin; Pu Zhang


Book ID
119225025
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
315 KB
Volume
160
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ 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

On Partitional Labelings of Graphs
โœ Rikio Ichishima; Akito Oshima ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 191 KB
Group labelings of graphs
โœ Paul H. Edelman; Michael Saks ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 181 KB

## 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

Pair Labelings of Graphs
โœ Guichard, David R.; Krussel, John W. ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 783 KB
Harmonious labelings of windmill 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

On L(d,1)-labelings of graphs
โœ Gerard J. Chang; Wen-Tsai Ke; David Kuo; Daphne D.-F. Liu; Roger K. Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB