Asymptotic comparison of two constructions for large digraphs of given degree and diameter

Mária Ždímalová; Ľubica Staneková

Displaying similar documents to “Asymptotic comparison of two constructions for large digraphs of given degree and diameter”

On minimal regular digraphs with girth 4

Qiao Li, Richard A. Brualdi (1983)

Czechoslovak Mathematical Journal

Similarity:

A remark on almost Moore digraphs of degree three.

Baskoro, E.T., Miller, M., Širáň, J. (1997)

Acta Mathematica Universitatis Comenianae. New Series

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