digraph造句

A digraph D is unilateral.

We shall abbreviate 'directed graph 'to digraph.

We shall abbreviate the "directed graph" to digraph.

Furhter investigation on strong connectivity of Cayley digraph

Special primitive two-colored digraphs whose uncolored digraph consist of two cycles are considered.

By using the matrix representation of a digraph, some results about the index of convergence and period of a line digraph are obtained.

By using Boolean matrix, some results of power convergence exponent of line digraph are given.

Thus, the problem of efficiently finding the basic set of directed circuits in a digraph is solved.

In this paper a new algorithm for finding all directed Hamiltonian circuits in a digraph is presented.