메뉴 건너뛰기




Volumn 183, Issue 1-3, 1998, Pages 27-38

Super line-connectivity of consecutive-d digraphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0037801359     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00079-4     Document Type: Article
Times cited : (6)

References (33)
  • 2
    • 0002555329 scopus 로고
    • De Bruijn and Kautz networks: A competitor for the hypercube?
    • F. Andre, J.P. Verjus (Eds.), North-Holland, Amsterdam
    • J.C. Bermond, C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube?, in: F. Andre, J.P. Verjus (Eds.), Hypercube and Distributed Computers, North-Holland, Amsterdam, 1989 pp. 279-294.
    • (1989) Hypercube and Distributed Computers , pp. 279-294
    • Bermond, J.C.1    Peyrat, C.2
  • 5
    • 0042659960 scopus 로고
    • Modeling of interconnection networks using de Bruijn graphs
    • A. Vitanyi (Ed.), Budapest
    • J. Bond, A. Ivanyi, Modeling of interconnection networks using de Bruijn graphs, in: A. Vitanyi (Ed.), Proc. 3rd Conf. of Program Designers, Budapest, 1987, pp. 75-88.
    • (1987) Proc. 3rd Conf. of Program Designers , pp. 75-88
    • Bond, J.1    Ivanyi, A.2
  • 10
    • 0003170821 scopus 로고
    • Hamiltonian property of d-consecutive digraphs
    • D.-Z. Du, D.F. Hsu, F.K. Hwang, Hamiltonian property of d-consecutive digraphs, Math. Comput. Modeling 17 (11) (1993) 61-63.
    • (1993) Math. Comput. Modeling , vol.17 , Issue.11 , pp. 61-63
    • Du, D.-Z.1    Hsu, D.F.2    Hwang, F.K.3
  • 12
    • 0042659956 scopus 로고
    • Modifications of consecutive-d digraphs
    • D.F. Hsu, A.L. Rosenberg, D. Soteau (Eds.), American Mathematical Society, Providence, RI
    • D.-Z. Du, D.F. Hsu, D.J. Kleitman, Modifications of consecutive-d digraphs, in: D.F. Hsu, A.L. Rosenberg, D. Soteau (Eds.), Interconnection Networks and Mapping and Scheduling Parallel Computations, American Mathematical Society, Providence, RI, 1994, pp. 75-85.
    • (1994) Interconnection Networks and Mapping and Scheduling Parallel Computations , pp. 75-85
    • Du, D.-Z.1    Hsu, D.F.2    Kleitman, D.J.3
  • 14
    • 38249013144 scopus 로고
    • Connectivity of consecutive-d digraphs
    • D.-Z. Du, D.F. Hsu, G.W. Peck, Connectivity of consecutive-d digraphs, Discrete Appl. Math. 37/38 (1992) 169-177.
    • (1992) Discrete Appl. Math. , vol.37-38 , pp. 169-177
    • Du, D.-Z.1    Hsu, D.F.2    Peck, G.W.3
  • 15
    • 0003147073 scopus 로고
    • Generalized de Bruijn digraphs
    • D.-Z. Du, F.K. Hwang, Generalized de Bruijn digraphs, Networks 18 (1988) 27-33.
    • (1988) Networks , vol.18 , pp. 27-33
    • Du, D.-Z.1    Hwang, F.K.2
  • 16
    • 0021422681 scopus 로고
    • Line digraph iterations and the (d,k) digraph problem
    • M.A. Fiol, J.L.A. Yebra, I. Alegre, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput. C-33 (1984) 702-713.
    • (1984) IEEE Trans. Comput. , vol.C-33 , pp. 702-713
    • Fiol, M.A.1    Yebra, J.L.A.2    Alegre, I.3
  • 17
    • 0040817748 scopus 로고
    • Vosperian and superconnected abelian Cayley digraphs
    • Y.O. Hamidoune, A.S. Llado, O. Serra, Vosperian and superconnected abelian Cayley digraphs, Graphs Combin. 7 (1991) 143-152.
    • (1991) Graphs Combin. , vol.7 , pp. 143-152
    • Hamidoune, Y.O.1    Llado, A.S.2    Serra, O.3
  • 21
    • 0023383399 scopus 로고
    • The hamiltonian property of linear functions
    • F.K. Hwang, The hamiltonian property of linear functions, Oper. Res. Lett. 6 (1987) 125-127.
    • (1987) Oper. Res. Lett. , vol.6 , pp. 125-127
    • Hwang, F.K.1
  • 22
    • 0019579044 scopus 로고
    • Design to minimize a diameter on building block network
    • M. Imase, M. Itoh, Design to minimize a diameter on Building block network, IEEE Trans. Comput. C-30 (1981) 439-443.
    • (1981) IEEE Trans. Comput. , vol.C-30 , pp. 439-443
    • Imase, M.1    Itoh, M.2
  • 23
    • 0020795920 scopus 로고
    • A design for directed graph with minimum diameter
    • M. Imase, M. Itoh, A design for directed graph with minimum diameter, IEEE Trans. Comput. C-32 (1983) 782-784.
    • (1983) IEEE Trans. Comput. , vol.C-32 , pp. 782-784
    • Imase, M.1    Itoh, M.2
  • 24
    • 0022024631 scopus 로고
    • Connectivity of regular directed graphs with small diameter
    • M. Imase, T. Soneoka, K. Okada, Connectivity of regular directed graphs with small diameter, IEEE Trans. Comput. C-34 (1985) 267-273.
    • (1985) IEEE Trans. Comput. , vol.C-34 , pp. 267-273
    • Imase, M.1    Soneoka, T.2    Okada, K.3
  • 25
  • 28
    • 0042644459 scopus 로고
    • General properties of c-circulant digraphs
    • M. Mora, O. Serra, 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.1    Serra, O.2    Fiol, M.A.3
  • 31
    • 38249019633 scopus 로고
    • Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter I
    • T. Soneoka, H. Nakada, M. Imase, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter I, Discrete Appl, Math. 27 (1990) 255-265.
    • (1990) Discrete Appl, Math. , vol.27 , pp. 255-265
    • Soneoka, T.1    Nakada, H.2    Imase, M.3
  • 32
    • 0042659949 scopus 로고    scopus 로고
    • Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter II
    • T. Soneoka, M. Imase, Y. Manabe, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter II, Discrete Appl. Math. 64 (1996) 267-279.
    • (1996) Discrete Appl. Math. , vol.64 , pp. 267-279
    • Soneoka, T.1    Imase, M.2    Manabe, Y.3


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