SCOPUS 정보 검색 플랫폼

Networks

Volumn 29, Issue 1, 1997, Pages 39-47

Counting Small Cycles in Generalized de Bruijn Digraphs

(2) Hasunuma, Toru a Shibata, Yukio a

a GUNMA UNIVERSITY (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347140012 PISSN: 00283045 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0037(199701)29:1<39::AID-NET4>3.0.CO;2-D Document Type: Article

Times cited : (9)

References (14)

1
- 0002555329
- De Bruijn and Kautz networks: A competitor for the hypercube?
- (F. André and J. P. Verjus, Eds.). Elsevier North-Holland, Amsterdam
- J.-C. Bermond and C. Peyrat, De Bruijn and Kautz networks: A competitor for the hypercube? Hypercube and Distributed Computers. (F. André and J. P. Verjus, Eds.). Elsevier North-Holland, Amsterdam (1989).
- (1989) Hypercube and Distributed Computers
- Bermond, J.-C.¹ Peyrat, C.²

2
- 0040868008
- The Hamiltonian property of generalized de Bruijn digraphs
- D. Z. Du, D. F. Hsu, F. K. Hwang, and X. M. Zhang, The Hamiltonian property of generalized de Bruijn digraphs. J. Combin. Theory Ser. B 52 (1991) 1-8.
- (1991) J. Combin. Theory Ser. B , vol.52 , pp. 1-8
- Du, D.Z.¹ Hsu, D.F.² Hwang, F.K.³ Zhang, X.M.⁴

3
- 0003147073
- Generalized de Bruijn digraphs
- D. Z. Du and F. K. Hwang, Generalized de Bruijn digraphs. Networks 18 (1988) 27-38.
- (1988) Networks , vol.18 , pp. 27-38
- Du, D.Z.¹ Hwang, F.K.²

4
- 0004201481
- Aegean Park Press, Laguna Hills, CA
- S. W. Golomb, Shift Register Sequence. Aegean Park Press, Laguna Hills, CA (1982).
- (1982) Shift Register Sequence
- Golomb, S.W.¹

5
- 0002485541
- Line graphs and line digraphs
- Academic Press, New York
- R. L. Hemminger and L. W. Beineke, Line graphs and line digraphs. Selected Topics in Graph Theory. Academic Press, New York (1983) 271-305.
- (1983) Selected Topics in Graph Theory , pp. 271-305
- Hemminger, R.L.¹ Beineke, L.W.²

6
- 0019579044
- Design to minimize diameter on building-block network
- M. Imase and M. Itoh, Design to minimize diameter on building-block network. IEEE Trans. Comput. C-30 (1981) 439-442.
- (1981) IEEE Trans. Comput. , vol.C-30 , pp. 439-442
- Imase, M.¹ Itoh, M.²

7
- 0022024631
- Connectivity of regular directed graphs with small diameters
- M. Imase, T. Soneoka, and K. Okada, Connectivity of regular directed graphs with small diameters. IEEE Trans. Comput. C-34 (1985) 267-273.
- (1985) IEEE Trans. Comput. , vol.C-34 , pp. 267-273
- Imase, M.¹ Soneoka, T.² Okada, K.³

8
- 0041884926
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- X. Li and F. Zhang, On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs. Discr. Math. 94 (1991) 189-197.
- (1991) Discr. Math. , vol.94 , pp. 189-197
- Li, X.¹ Zhang, F.²

9
- 0348045454
- Directed graphs with the unique path property
- (Proc. Colloq. Balatonfürer, 1969), North-Holland, Amsterdam
- N. S. Mendelsohn, Directed graphs with the unique path property. Combinatorial Theory and Its Applications II (Proc. Colloq. Balatonfürer, 1969), North-Holland, Amsterdam (1970) 783-799.
- (1970) Combinatorial Theory and Its Applications II , pp. 783-799
- Mendelsohn, N.S.¹

10
- 0042644459
- General properties of c-circulant digraphs
- M. Mora, O. Serra, and M. A. Fiol, General properties of c-circulant digraphs. Ars Combin. 25C (1988) 241-252.
- (1988) Ars Combin. , vol.25 C , pp. 241-252
- Mora, M.¹ Serra, O.² Fiol, M.A.³

11
- 0012403710
- Direct graphs with minimum diameter and maximal connectivity
- School of Engineering, July
- S. M. Reddy, D.K. Pradhan, and J. G. Kuhl, Direct graphs with minimum diameter and maximal connectivity. School of Engineering, Oakland University Technical Report (July 1980).
- (1980) Oakland University Technical Report
- Reddy, S.M.¹ Pradhan, D.K.² Kuhl, J.G.³

12
- 0027874816
- Fault-tolerant ring embedding in de Bruijn networks
- R. A. Rowley and B. Bose, Fault-tolerant ring embedding in de Bruijn networks. IEEE Trans. Comput. C-42 (1993) 1480-1486.
- (1993) IEEE Trans. Comput. , vol.C-42 , pp. 1480-1486
- Rowley, R.A.¹ Bose, B.²

13
- 0028374305
- Counting closed walks in generalized de Bruijn graphs
- Y. Shibata, M. Shirahata, and S. Osawa, Counting closed walks in generalized de Bruijn graphs. Info. Process. Lett. 49 (1994) 135-138.
- (1994) Info. Process. Lett. , vol.49 , pp. 135-138
- Shibata, Y.¹ Shirahata, M.² Osawa, S.³

14
- 0004156748
- Cambridge University Press, Cambridge
- J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge University Press, Cambridge (1992).
- (1992) A Course in Combinatorics
- Van Lint, J.H.¹ Wilson, R.M.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.