Works matching IS 00283045 AND DT 2009 AND VI 54 AND IP 2

Results: 8

A generalization of an edge-connectivity theorem of Chartrand.

Published in:

Networks, 2009, v. 54, n. 2, p. 82, doi. 10.1002/net.20297

By:

Boesch, Frank;
Gross, Daniel;
Saccoman, John T.;
Kazmierczak, L. William;
Suffel, Charles;
Suhartomo, Antonius

Publication type:

Article

A survey of some network reliability analysis and synthesis results.

Published in:

Networks, 2009, v. 54, n. 2, p. 99, doi. 10.1002/net.20300

By:

Boesch, F.T.;
Satyanarayana, A.;
Suffel, C.L.

Publication type:

Article

The rainbow connectivity of a graph.

Published in:

Networks, 2009, v. 54, n. 2, p. 75, doi. 10.1002/net.20296

By:

Chartrand, Gary;
Johns, Garry L.;
McKeon, Kathleen A.;
Zhang, Ping

Publication type:

Article

Liar's domination.

Published in:

Networks, 2009, v. 54, n. 2, p. 70, doi. 10.1002/net.20295

By:

Slater, Peter J.

Publication type:

Article

Sufficient degree conditions for k-edge-connectedness of a graph.

Published in:

Networks, 2009, v. 54, n. 2, p. 95, doi. 10.1002/net.20299

By:

Bauer, D.;
Hakimi, S.L.;
Kahl, N.;
Schmeichel, E.

Publication type:

Article

A eulogy for Frank Boesch.

Published in:

Networks, 2009, v. 54, n. 2, p. 69, doi. 10.1002/net.20294

By:

Suffel, Charles

Publication type:

Article

Packing the Steiner trees of a graph.

Published in:

Networks, 2009, v. 54, n. 2, p. 90, doi. 10.1002/net.20298

By:

Petingi, L.;
Talafha, M.

Publication type:

Article

On the roots of strongly connected reliability polynomials.

Published in:

Networks, 2009, v. 54, n. 2, p. 108, doi. 10.1002/net.20301

By:

Brown, J. I.;
Dilcher, K.

Publication type:

Article