Now showing items 1-1 of 1
Boolean distance for graphs
(Elsevier, 1982)
The boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (O if X = y). It is determined in terms of the block-cutpoint graph of G, and ...