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

Trimming of Graphs, with Application to Point Labeling

โœ Scribed by Thomas Erlebach; Torben Hagerup; Klaus Jansen; Moritz Minzlaff; Alexander Wolff

Publisher
Springer
Year
2009
Tongue
English
Weight
632 KB
Volume
47
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An application of the combinatorial Null
An application of the combinatorial Nullstellensatz to a graph labelling problem
โœ Dan Hefetz; Annina Saluz; Huong T. T. Tran ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB

## Abstract An __antimagic labelling__ of a graph __G__ with __m__ edges and __n__ vertices is a bijection from the set of edges of __G__ to the set of integers {1,โ€ฆ,__m__}, such that all __n__ vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with tha

Magic labeling in graphs: Bounds, comple
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP
โœ Kalantari, B.; Khosrovshahi, G. B. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 674 KB

Let G be an undirected graph with n vertices and m edges. A natural number A is said to be a magic labeling, positive magic /abe/ing, and fractional positive magic /abe/ing, if the edges can be labeled with nonnegative intqers, naturals, and rationals 2 1 , respectively, so that for each vertex the

Codings of graphs with binary edge label
Codings of graphs with binary edge labels
โœ Martin Aigner; Eberhard Triesch ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 424 KB