Advances in Applied Probability, Vol. 24, No. 4 (Dec., 1992), pp. 845-857 (13 pages) A three-parameter model of a random directed graph (digraph) is specified by the ...

Graph distinguishing numbers constitute a vital parameter in understanding the symmetry properties of graphs. Fundamentally, the distinguishing number of a graph is the minimal number of labels ...

In mathematics and computer science, a directed acyclic graph, is a finite directed graph with no directed cycles. It consists of finitely many vertices and edges, with each edge directed from one ...

In the present paper we investigate (p, q)-directed complete bipartite graphs K → p,q , n-directed paths P → n and n-directed cycles C → n from the perspective of Granular Computing. For each model, ...