-
1
-
-
0012419504
-
On connectivity of the Cartesian product of two graphs
-
W.S. Chiue and B.S. Shieh, On connectivity of the Cartesian product of two graphs, Appl Math Comput 102 (1999), 129-137.
-
(1999)
Appl Math Comput
, vol.102
, pp. 129-137
-
-
Chiue, W.S.1
Shieh, B.S.2
-
2
-
-
0024765312
-
Generalized measures of fault tolerance with application to n-cube networks
-
A.H. Esfahanian, Generalized measures of fault tolerance with application to n-cube networks, IEEE Trans Comput 38 (1989), 1586-1591.
-
(1989)
IEEE Trans Comput
, vol.38
, pp. 1586-1591
-
-
Esfahanian, A.H.1
-
3
-
-
0024281477
-
On computing a conditional edge-connectivity of a graph
-
A.H. Esfahanian and S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform Process Lett 27 (1988), 195-199.
-
(1988)
Inform Process Lett
, vol.27
, pp. 195-199
-
-
Esfahanian, A.H.1
Hakimi, S.L.2
-
4
-
-
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), 253-256.
-
(1990)
Ars Combin
, vol.29 B
, pp. 253-256
-
-
Fiol, M.A.1
Fábrega, J.2
Escudero, M.3
-
5
-
-
14644395517
-
Sufficient conditions for graphs to be X'-optimal, super-edge-connected, and maximally edge-connected
-
A. Hellwig and L. Volkmann, Sufficient conditions for graphs to be X'-optimal, super-edge-connected, and maximally edge-connected, J Graph Theory 48 (2005), 228-246.
-
(2005)
J Graph Theory
, vol.48
, pp. 228-246
-
-
Hellwig, A.1
Volkmann, L.2
-
6
-
-
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.1
-
7
-
-
34250631758
-
On restricted edge-connectivity of vertex-transitive graphs
-
L. Li and J.M. Xu, On restricted edge-connectivity of vertex-transitive graphs, J China Univ Sci Tech 34 (2004), 266-272.
-
(2004)
J China Univ Sci Tech
, vol.34
, pp. 266-272
-
-
Li, L.1
Xu, J.M.2
-
9
-
-
84867947324
-
On a kind of restricted edge connectivity of graphs
-
J.X. Meng and Y.H. Ji, On a kind of restricted edge connectivity of graphs, Discrete Appl Math 117 (2002), 183-193.
-
(2002)
Discrete Appl Math
, vol.117
, pp. 183-193
-
-
Meng, J.X.1
Ji, Y.H.2
-
10
-
-
0141764680
-
Super edge- and point-connectivities of the Cartesian product of regular graphs
-
B.S. Shieh, Super edge- and point-connectivities of the Cartesian product of regular graphs, Networks 40 (2002). 91-96.
-
(2002)
Networks
, vol.40
, pp. 91-96
-
-
Shieh, B.S.1
-
11
-
-
21144434889
-
Restricted edge-connectivity and minimum edge-degree
-
N. Ueffing and L. Volkmann, Restricted edge-connectivity and minimum edge-degree, Ars Combin 66 (2003), 193-203.
-
(2003)
Ars Combin
, vol.66
, pp. 193-203
-
-
Ueffing, N.1
Volkmann, L.2
-
14
-
-
30844438528
-
On restricted edge-connectivity of regular digraphs
-
J.M. Xu and M. Lu, On restricted edge-connectivity of regular digraphs, Taiwan J Math 9 (2005), 661-670.
-
(2005)
Taiwan J Math
, vol.9
, pp. 661-670
-
-
Xu, J.M.1
Lu, M.2
-
15
-
-
15844378752
-
Super connectivity of line graphs
-
J.M, Xu, M. Lü, M.J. Ma, and A. Hellwig, Super connectivity of line graphs, Inform Process Lett 94 (2005), 191-195.
-
(2005)
Inform Process Lett
, vol.94
, pp. 191-195
-
-
Xu, J.M.1
Lü, M.2
Ma, M.J.3
Hellwig, A.4
-
16
-
-
31244433586
-
On restricted edge-connectivity of graphs
-
J.M. Xu and K.L. Xu, On restricted edge-connectivity of graphs, Discrete Math 243 (2002), 291-298.
-
(2002)
Discrete Math
, vol.243
, pp. 291-298
-
-
Xu, J.M.1
Xu, K.L.2
-
17
-
-
0024072093
-
Graph theoretic reliability analysis for the Boolean n-cube networks
-
C.S. Yang, J.F. Wang, J.Y. Lee, and F.T. Boesch, Graph theoretic reliability analysis for the Boolean n-cube networks, IEEE Trans Circuits Syst 35 (1988), 1175-1179.
-
(1988)
IEEE Trans Circuits Syst
, vol.35
, pp. 1175-1179
-
-
Yang, C.S.1
Wang, J.F.2
Lee, J.Y.3
Boesch, F.T.4
-
18
-
-
0040389840
-
The number of spanning trees of the regular networks
-
C.S. Yang, J.F. Wang, J.Y. Lee, and F.T. Boesch, The number of spanning trees of the regular networks, Int J Comput Math 23 (1988), 185-200.
-
(1988)
Int J Comput Math
, vol.23
, pp. 185-200
-
-
Yang, C.S.1
Wang, J.F.2
Lee, J.Y.3
Boesch, F.T.4
|