Antipodal graphs and digraphs.

Johns, Garry; Sleno, Karen

Displaying similar documents to “Antipodal graphs and digraphs.”

The signed k-domination number of directed graphs

Maryam Atapour, Seyyed Sheikholeslami, Rana Hajypory, Lutz Volkmann (2010)

Open Mathematics

Similarity:

The extremal connectivity of the strictly weak digraph

Milan Mikola (1976)

Mathematica Slovaca

Similarity:

Isomorphisms and traversability of directed path graphs

Hajo Broersma, Xueliang Li (2002)

Discussiones Mathematicae Graph Theory

Similarity:

The concept of a line digraph is generalized to that of a directed path graph. The directed path graph Pₖ(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. In this introductory paper several properties of P₃(D) are studied, in particular with respect to isomorphism and traversability....