𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A characterization of database graphs admitting a simple locking protocol

✍ Scribed by Zvi Kedem; Abraham Silberschatz

Book ID
104706510
Publisher
Springer-Verlag
Year
1981
Tongue
English
Weight
598 KB
Volume
16
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simple proof of the characterization o
A simple proof of the characterization of antipodal graphs
✍ Garry Johns πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 88 KB

The antipodal graph A(G) of a graph G is defined as the graph on the same vertex set as G with two vertices being adjacent in A(G) if the distance between them in G is the diameter of G. (If G is disconnected then we define &am(G) = co.) Aravamudhan and Rajendran [l, 21 gave the following character