An Alternative Construction to the Transitive Closure of a Directed Graph
classification
🧮 math.CO
keywords
directedgraphtransitiveconstructionarrowsclosureformedvertices
read the original abstract
One must add arrows which are forced by transitivity to form the transitive closure of a directed graph. We introduce a construction of a transitive directed graph which is formed by adding vertices instead of arrows and which preserves the transitive relationships formed by distinct vertices in the original directed graph. Our construction does not apply to all directed graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.