Directed path graphs

Haitze J. Broersma, Xueliang Li, Xueliang Li

Research output: Book/ReportReportProfessional

18 Citations (Scopus)
10 Downloads (Pure)

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 languageEnglish
Place of PublicationEnschede
PublisherUniversiteit Twente
Number of pages10
Publication statusPublished - 1996

Publication series

NameMemorandum
PublisherUniversity of Twente, Department of Applied Mathematics
No.1310

Fingerprint

Path
Graph in graph theory
Line Digraph
Digraph
Isomorphism
Arc of a curve
Cycle

Keywords

  • IR-30683
  • METIS-141324

Cite this

Broersma, H. J., Li, X., & Li, X. (1996). Directed path graphs. (Memorandum; No. 1310). Enschede: Universiteit Twente.
Broersma, Haitze J. ; Li, Xueliang ; Li, Xueliang. / Directed path graphs. Enschede : Universiteit Twente, 1996. 10 p. (Memorandum; 1310).
@book{36cf744e0e17467eb4add95381b434ff,
title = "Directed path graphs",
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.",
keywords = "IR-30683, METIS-141324",
author = "Broersma, {Haitze J.} and Xueliang Li and Xueliang Li",
year = "1996",
language = "English",
series = "Memorandum",
publisher = "Universiteit Twente",
number = "1310",

}

Broersma, HJ, Li, X & Li, X 1996, Directed path graphs. Memorandum, no. 1310, Universiteit Twente, Enschede.

Directed path graphs. / Broersma, Haitze J.; Li, Xueliang; Li, Xueliang.

Enschede : Universiteit Twente, 1996. 10 p. (Memorandum; No. 1310).

Research output: Book/ReportReportProfessional

TY - BOOK

T1 - Directed path graphs

AU - Broersma, Haitze J.

AU - Li, Xueliang

AU - Li, Xueliang

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - IR-30683

KW - METIS-141324

M3 - Report

T3 - Memorandum

BT - Directed path graphs

PB - Universiteit Twente

CY - Enschede

ER -

Broersma HJ, Li X, Li X. Directed path graphs. Enschede: Universiteit Twente, 1996. 10 p. (Memorandum; 1310).