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

A result onk-valent graphs and its application to a graph embedding problem

โœ Scribed by Paul E. Dunne

Publisher
Springer-Verlag
Year
1987
Tongue
English
Weight
476 KB
Volume
24
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The strength of a graph and its applicat
The strength of a graph and its application to organizational structure
โœ Michael F. Capobianco; John C. Molluzzo ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

The strength of a point in a graph is defined as the increase in the number of connected components in the graph upon removal of the point. Given an ordering of the points of a graph, the strength vector S of the graph is the vector whose ith component is the strength of the ith point of the graph.

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