### Abstract

The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in D form a directed path on k + 1 vertices or form a directed cycle on k vertices in D. Several properties of $\overrightarrow P_k(D)$ are studied, in particular with respect to isomorphism and traversability.

Original language | English |
---|---|

Place of Publication | Enschede |

Publisher | Universiteit Twente |

Number of pages | 10 |

Publication status | Published - 1996 |

### Publication series

Name | Memorandum |
---|---|

Publisher | University of Twente, Department of Applied Mathematics |

No. | 1310 |

### Keywords

- IR-30683
- METIS-141324

## Fingerprint Dive into the research topics of 'Directed path graphs'. Together they form a unique fingerprint.

## Cite this

Broersma, H. J., Li, X., & Li, X. (1996).

*Directed path graphs*. (Memorandum; No. 1310). Enschede: Universiteit Twente.