𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Point determination in graphs

✍ Scribed by David P. Sumner

Book ID
107748153
Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
723 KB
Volume
5
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On 1-factors of point determining graphs
On 1-factors of point determining graphs
✍ Dennis P. Geoffroy πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 532 KB

A graph G is said to be point determinie, g if and only if distinct poiuts of G have distinc~ neigh~orhcods~ Fo: such a graph G. the nucleus is defined to !'.e the set G ~ consisting of a!! points v o[ G for ~vhich G-r is a point determini~'g graph. h~ [4]. Samner exhibited several famiiies of grat

On point-halfspace graphs
On point-halfspace graphs
✍ Edward R. Scheinerman; Ann N. Trenk; Daniel Ullman πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 744 KB

## Abstract The following definition is motivated by the study of circle orders and their connections to graphs. A graphs __G__ is called a __point‐halfspace graph__ (in R^k^) provided one can assign to each vertex __v__ Ο΅ (__G__) a point p~v~ R^k^ and to each edge __e__ Ο΅ __E__(__G__) a closed hal