SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Discrete Mathematics

Volumn 255, Issue 1-3, 2002, Pages 13-23

On the superconnectivity of generalized p-cycles

(3) Balbuena, C a Pelayo, I a Gomez J a

a UNIVERSITAT POLITÈCNICA DE CATALUNYA (Spain)

Author keywords

Diameter; Directed graph; Line digraph; P cycle; Parameter ; Superconnectivity

Indexed keywords

EID: 31244435985 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/S0012-365X(01)00383-1 Document Type: Article

Times cited : (6)

References (19)

1
- 0002765799
- On the linegraph of a directed graph
- M. Aigner, On the linegraph of a directed graph, Math. Z. 102 (1967) 56-61.
- (1967) Math. Z. , vol.102 , pp. 56-61
- Aigner, M.¹

2
- 0037904776
- On the connectivity and superconnectivity of bipartite digraphs and graphs
- C. Balbuena, A. Carmona, On the connectivity and superconnectivity of bipartite digraphs and graphs, Ars Combin. 61 (2001).
- (2001) Ars Combin. , vol.61
- Balbuena, C.¹ Carmona, A.²

3
- 0001195852
- Large fault-tolerant interconnection networks
- J.-C. Bermond, N. Homobono, C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin. 5 (1989) 107-123.
- (1989) Graphs Combin. , vol.5 , pp. 107-123
- Bermond, J.-C.¹ Homobono, N.² Peyrat, C.³

4
- 84941474134
- Synthesis of reliable networks - A survey
- F.T Boesch, Synthesis of reliable networks - A survey, IEEE Trans. Reliab. 35 (1986) 240-246.
- (1986) IEEE Trans. Reliab. , vol.35 , pp. 240-246
- Boesch, F.T.¹

5
- 84986495442
- Circulants and their connectivities
- F. Boesch, R. Tindell, Circulants and their connectivities, J. Graph Theory 8 (1984) 487-499.
- (1984) J. Graph Theory , vol.8 , pp. 487-499
- Boesch, F.¹ Tindell, R.²

6
- 84986522954
- Maximally connected digraphs
- J. Fàbrega, M.A. Fiol, Maximally connected digraphs, J. Graph Theory 13 (1989) 657-668.
- (1989) J. Graph Theory , vol.13 , pp. 657-668
- Fàbrega, J.¹ Fiol, M.A.²

7
- 0041538102
- Bipartite graphs and digraphs with maximum connectivity
- J. Fàbrega, M.A. Fiol, Bipartite graphs and digraphs with maximum connectivity, J. Discrete Appl. Math. 69(3) (1996) 269-278.
- (1996) J. Discrete Appl. Math. , vol.69 , Issue.3 , pp. 269-278
- Fàbrega, J.¹ Fiol, M.A.²

8
- 84987487270
- On super-edge-connected digraphs and bipartite digraphs
- M.A. Fiol, On super-edge-connected digraphs and bipartite digraphs, J. Graph Theory 16 (1992) 545-555.
- (1992) J. Graph Theory , vol.16 , pp. 545-555
- Fiol, M.A.¹

9
- 0009001527
- Short paths and connectivity in graphs and digraphs
- M.A. Fiol, J. Fàbrega, M. Escudero, Short paths and connectivity in graphs and digraphs. Ars Combin. 29 B (1990) 17-31.
- (1990) Ars Combin. , vol.29 , pp. 17-31
- Fiol, M.A.¹ Fàbrega, J.² Escudero, M.³

10
- 0021422681
- 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) 400-403.
- (1984) IEEE Trans. Comput. C-33 , pp. 400-403
- Fiol, M.A.¹ Yebra, J.L.A.² Alegre, I.³

11
- 0003451932
- Springer, Berlin
- D. Geller, F. Harary, Connectivity in Digraphs, Lecture Notes in Mathematics, Vol. 186, Springer, Berlin, 1970, pp. 105-114.
- (1970) Lecture Notes in Mathematics , vol.186 , pp. 105-114
- Geller, D.¹ Harary, F.² Digraphs, C.I.³

12
- 0038815686
- Large Generalized Cycles
- J. Gómez, C. Padró, S. Perennes, Large Generalized Cycles, Discrete Appl. Math. 89 (1998) 107-123.
- (1998) Discrete Appl. Math. , vol.89 , pp. 107-123
- Gómez, J.¹ Padró, C.² Perennes, S.³

13
- 0039978445
- A property of α-fragments of a digraph
- Y.O. Hamidoune, A property of α-fragments of a digraph, Discrete Math. 31 (1980) 105-106.
- (1980) Discrete Math. , vol.31 , pp. 105-106
- Hamidoune, Y.O.¹

14
- 0040817748
- Vosperian and superconnected abelian Cayley digraphs
- Y.O. Hamidoune, A.S. Lladó, 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.¹ Lladó, A.S.² Serra, O.³

15
- 0022024631
- 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. C , vol.34 , pp. 267-273
- Imase, M.¹ Soneoka, T.² Okada, K.³

16
- 0008393057
- Results on the edge-connectivity of graphs
- L. Lesniak, Results on the edge-connectivity of graphs, Discrete Math. 8 (1974) 351-354.
- (1974) Discrete Math. , vol.8 , pp. 351-354
- Lesniak, L.¹

17
- 33750991527
- Gómez, on the connectivity of generalized p-cycles
- I. Pelayo, C. Balbuena, Gómez, On the connectivity of generalized p-cycles, Ars combin. 3-21.
- Ars Combin. , pp. 3-21
- Pelayo, I.¹ Balbuena, C.²

18
- 0020237967
- On digraphs with minimum diameter and maximum connectivity
- S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, Proceedings of the 20th Annual Allerton Conference, 1982, pp. 1018-1026.
- (1982) Proceedings of the 20th Annual Allerton Conference , pp. 1018-1026
- Reddy, S.M.¹ Kuhl, J.G.² Hosseini, S.H.³ Lee, H.⁴

19
- 38249013054
- Super edge-connectivity of dense digraphs and graphs
- T. Soneoka, Super edge-connectivity of dense digraphs and graphs, Discrete Appl. Math. 37/38 (1992) 511-523.
- (1992) Discrete Appl. Math. , vol.37-38 , pp. 511-523
- Soneoka, T.¹

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