Generalized uniformly line vulnerable digraphs

Peter Horák

Displaying similar documents to “Generalized uniformly line vulnerable digraphs”

A note on removing a point of a strong digraph

Peter Horák (1983)

Mathematica Slovaca

Similarity:

Radii and centers in iterated line digraphs

Martin Knor, L'udovít Niepel (1996)

Discussiones Mathematicae Graph Theory

Similarity:

We show that the out-radius and the radius grow linearly, or "almost" linearly, in iterated line digraphs. Further, iterated line digraphs with a prescribed out-center, or a center, are constructed. It is shown that not every line digraph is admissible as an out-center of line digraph.

Which directed graphs have a solution?

Mehdi Behzad, Frank Harary (1977)

Mathematica Slovaca

Similarity:

Comparing a Cayley digraph with its reverse.

Abas, M. (2000)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

On Hallian digraphs and their binding number

Mieczysław Borowiecki, Danuta Michalak (1989)

Banach Center Publications

Similarity:

k-Kernels and some operations in digraphs

Hortensia Galeana-Sanchez, Laura Pastrana (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel of D if it satisfies the following two conditions: for every pair of different vertices u,v ∈ N it holds that every directed path between them has length at least k and for every vertex x ∈ V(D)-N there is a vertex y ∈ N such that there is an xy-directed path of length at most k-1. In this paper, we consider some operations on digraphs and prove the existence of k-kernels in digraphs formed...

Problems on fully irregular digraphs

Zdzisław Skupień (1999)

Discussiones Mathematicae Graph Theory

Similarity: