Name
Abstract | ||
|---|---|---|
The concept of consecutive- d digraph is proposed by Du, Hsu and Hwang. It generalizes the class of de Bruijin digraphs, the class of Imase-Itoh digraphs and the class of generalized de Bruijin graphs. We modify consecutive- d digraphs by connecting nodes with a loop into a circuit and deleting all loops. The result in this paper shows that the link-connectivity or the connectivity of modified consecutive- d digraphs get better. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0166-218X(92)90131-S | Discrete Applied Mathematics |
Keywords | Field | DocType |
consecutive-d digraph | Discrete mathematics,Graph,Combinatorics,Hamiltonian path,Directed graph,Partition (number theory),Mathematics,Digraph | Journal |
Volume | ISSN | Citations |
37-38, | Discrete Applied Mathematics | 9 |
PageRank | References | Authors |
1.11 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| D.-Z. Du | 1 | 219 | 52.53 |
| D. F. Hsu | 2 | 338 | 32.90 |
| G. W. Peck | 3 | 27 | 4.13 |