“digraph”簡單造句，digraph造句子

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

We shall abbreviate 'directed graph 'to digraph.

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

We shall abbreviate the "directed graph" to digraph.

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

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

A digraph D is unilateral.

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

Furhter investigation on strong connectivity of Cayley digraph