Relasi Ketercapaian pada Vertex dari Digraph

Abstract

In this thesis we investigates reachabiIity relations on the vertices of digraphs. If W is a walk in a digraph D, then the height of W is equal to the number of arcs traversed, in the direction coinciding with their orientation, minus the number of arcs traversed opposite to their orientation. Two vertices u,u E V (D) are related if there exists a walk of height 0 between u and v such that the height of every subwalk of W, starting at u, is contained in the interval [a, b], where is a non-positive integer or a = -oo and b is a non-negative integer or b = oo.