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

A new characterization of graphs based on interception relations

โœ Scribed by Paz, Azaria; Pearl, Judea; Ur, Shmuel

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
713 KB
Volume
22
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

While graphs are normally defined in terms of the 2-place relation of adjacency, we take the 3-place relation of interception as the basic primitive of their definition. The paper views graphs as an economical scheme for encoding interception relations, and establishes an axiomatic characterization of relations that lend themselves to representation in terms of graph interception, thus providing a new characterization of graphs. o 1996

๐Ÿ“œ SIMILAR VOLUMES

Hierarchical spatial relation based on a
Hierarchical spatial relation based on a contiguity graph
โœ Sung-Hye Choe; Jong-Hee Park; Sung-Soo Pyo ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 404 KB

Autonomous agents traversing a natural space need to be knowledgeable of its space configuration. The existing space models in geographic information systems and robotics, however, deal with only the topological relations among numerous types of spatial relations. We aim to develop an enhanced space

On a Characterization of Bilinear Forms
On a Characterization of Bilinear Forms Graphs
โœ K. Metsch ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

We show that the bilinear forms graphs H q (n, d) of diameter d โ‰ฅ 3 are characterized as distanceregular graphs by their parameters provided that either n โ‰ฅ d + 3 and q โ‰ฅ 3, or n โ‰ฅ d + 4 and q = 2. As a corollary of the method used, we can show the following. If is a distance-regular graph with clas

On cycle bases of a graph
On cycle bases of a graph
โœ M. M. Sysล‚o ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 358 KB
A note on the characterization of domina
A note on the characterization of domination perfect graphs
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, ฮณ(__H__) = __i__(__H__), where ฮณ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of