SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 22, Issue 4, 1996, Pages 281-292

Distance Connectivity in Graphs and Digraphs

(3) Balbuena, M C a Carmona, A a Fiol, M A a

a UNIVERSITAT POLITÈCNICA DE CATALUNYA (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030488625 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0118(199608)22:4<281::AID-JGT1>3.0.CO;2-H Document Type: Article

Times cited : (10)

References (17)

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
- 0001195852
- Large fault-tolerant interconnection networks
- J.-C. Bermond, N. Homobono, and C. Peyrat, Large fault-tolerant interconnection networks. Graphs and Combinatorics 5 (1989), 107-123.
- (1989) Graphs and Combinatorics , vol.5 , pp. 107-123
- Bermond, J.-C.¹ Homobono, N.² Peyrat, C.³

3
- 0004200084
- Academic Press, London
- B. Bollobás, Extremal Graph Theory. Academic Press, London (1978).
- (1978) Extremal Graph Theory
- Bollobás, B.¹

4
- 0004275036
- Wadsworth, Monterey, CA
- G. Chartrand and L. Lesniak, Graphs and Digraphs. Wadsworth, Monterey, CA (1986).
- (1986) Graphs and Digraphs
- Chartrand, G.¹ Lesniak, L.²

5
- 84986522954
- Maximally connected digraphs
- J. Fàbrega and 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.²

6
- 0040223169
- Extraconnectivity of graphs with large girth
- F. Fàbrega and M. A. Fiol, Extraconnectivity of graphs with large girth. Discrete Math. 127 (1994), 163-170.
- (1994) Discrete Math. , vol.127 , pp. 163-170
- Fàbrega, F.¹ Fiol, M.A.²

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

8
- 38149146968
- On the distance connectivity of graphs and digraphs
- M. A. Fiol and J. Fàbrega, On the distance connectivity of graphs and digraphs. Discrete Math. 125 (1994), 169-176.
- (1994) Discrete Math. , vol.125 , pp. 169-176
- Fiol, M.A.¹ Fàbrega, J.²

9
- 0021422681
- Line digraph iterations and the (d, k) digraph problem
- M. A. Fiol, J. L. A. Yebra, and I. Alegre, Line digraph iterations and the (d, k) digraph problem. IEEE Trans. Comput. C-33 (1984), 400-403.
- (1984) IEEE Trans. Comput. , vol.C-33 , pp. 400-403
- Fiol, M.A.¹ Yebra, J.L.A.² Alegre, I.³

10
- 0040083859
- Connectivity in digraphs
- Springer, Berlin
- D. Geller and F. Harary, Connectivity in digraphs. Lecture Notes in Mathematics, Vol. 186, Springer, Berlin (1970), 105-114.
- (1970) Lecture Notes in Mathematics , vol.186 , pp. 105-114
- Geller, D.¹ Harary, F.²

11
- 0020827886
- Conditional connectivity
- F. Harary, Conditional connectivity, Networks 13 (1983), 347-357.
- (1983) Networks , vol.13 , pp. 347-357
- Harary, F.¹

12
- 0042779627
- Dunod, Paris
- F. Harary, R. Z. Norman, and D. Cartwright, Introduction à la Théorie des Graphes Orientés. Dunod, Paris (1968).
- (1968) Introduction à la Théorie des Graphes Orientés
- Harary, F.¹ Norman, R.Z.² Cartwright, D.³

13
- 0003780715
- Addison-Wesley, Reading, MA
- F. Harary, Graph Theory. Addison-Wesley, Reading, MA (1971).
- (1971) Graph Theory
- Harary, F.¹

14
- 0039112389
- Strongly geodetic directed graphs
- Math. Publ.
- J. Plesník and Š. Znám, Strongly geodetic directed graphs, Acta Fac. Rerum Natur. Univ. Comenian., Math. Publ. 29 (1974), 29-34.
- (1974) Acta Fac. Rerum Natur. Univ. Comenian. , vol.29 , pp. 29-34
- Plesník, J.¹ Znám, Š.²

15
- 0040083858
- On equality of edge-connectivity and minimum degree of a graph
- J. Plesník and Š. Znám, On equality of edge-connectivity and minimum degree of a graph, Arch. Math. (Brno) 25 (1989), 19-26.
- (1989) Arch. Math. (Brno) , vol.25 , pp. 19-26
- Plesník, J.¹ Znám, Š.²

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

17
- 1542403140
- A lower bound for the number of vertices of a graph
- M. E. Watkins, A lower bound for the number of vertices of a graph. Amer. Math. Monthly 74 (1967), 297.
- (1967) Amer. Math. Monthly , vol.74 , pp. 297
- Watkins, M.E.¹

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