Brown, Jason I.; Colbourn, Charles J.; Cox, Danielle; Graves, Christina; Mol, Lucas Network reliability: heading out on the highway. (English) Zbl 1528.90087 Networks 77, No. 1, 146-160 (2021). MSC: 90B25 90B10 PDFBibTeX XMLCite \textit{J. I. Brown} et al., Networks 77, No. 1, 146--160 (2021; Zbl 1528.90087) Full Text: DOI
Wu, Bang Ye; Wang, Hung-Lung The next-to-shortest path problem on directed graphs with positive edge weights. (English) Zbl 1386.05082 Networks 65, No. 3, 205-211 (2015). MSC: 05C22 05C12 05C38 05C10 05C20 05C85 PDFBibTeX XMLCite \textit{B. Y. Wu} and \textit{H.-L. Wang}, Networks 65, No. 3, 205--211 (2015; Zbl 1386.05082) Full Text: DOI
Balbuena, Camino; García-Vázquez, Pedro; Hansberg, Adriana; Montejano, Luis Pedro On the super-restricted arc-connectivity of \(s\)-geodetic digraphs. (English) Zbl 1269.05043 Networks 61, No. 1, 20-28 (2013). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{C. Balbuena} et al., Networks 61, No. 1, 20--28 (2013; Zbl 1269.05043) Full Text: DOI
Brown, J. I.; Dilcher, K. On the roots of strongly connected reliability polynomials. (English) Zbl 1207.05094 Networks 54, No. 2, 108-116 (2009). MSC: 05C31 90B25 05C40 PDFBibTeX XMLCite \textit{J. I. Brown} and \textit{K. Dilcher}, Networks 54, No. 2, 108--116 (2009; Zbl 1207.05094) Full Text: DOI
Hou, Xinmin; Xu, Jun-Ming; Xu, Min The forwarding indices of wrapped butterfly networks. (English) Zbl 1208.68044 Networks 53, No. 4, 329-333 (2009). MSC: 68M10 05C20 90B18 PDFBibTeX XMLCite \textit{X. Hou} et al., Networks 53, No. 4, 329--333 (2009; Zbl 1208.68044) Full Text: DOI
Yong, Xuerong; Zhang, Yuanping; Golin, Mordecai J. The number of spanning trees in a class of double fixed-step loop networks. (English) Zbl 1155.05032 Networks 52, No. 2, 69-77 (2008). MSC: 05C20 05C05 05C30 68R10 PDFBibTeX XMLCite \textit{X. Yong} et al., Networks 52, No. 2, 69--77 (2008; Zbl 1155.05032) Full Text: DOI
Gómez, J. Large vertex symmetric digraphs. (English) Zbl 1134.05031 Networks 50, No. 4, 241-250 (2007). Reviewer: Ján Plesník (Bratislava) MSC: 05C20 05C12 05C25 PDFBibTeX XMLCite \textit{J. Gómez}, Networks 50, No. 4, 241--250 (2007; Zbl 1134.05031) Full Text: DOI
Brown, J. I.; Li, Xiaohu Uniformly optimal digraphs for strongly connected reliability. (English) Zbl 1112.05044 Networks 49, No. 2, 145-151 (2007). MSC: 05C20 05C40 90B25 PDFBibTeX XMLCite \textit{J. I. Brown} and \textit{X. Li}, Networks 49, No. 2, 145--151 (2007; Zbl 1112.05044) Full Text: DOI
Balbuena, C.; Marcote, X.; Ferrero, D. Diameter vulnerability of iterated line digraphs in terms of the girth. (English) Zbl 1067.68099 Networks 45, No. 2, 49-54 (2005). MSC: 68R10 68M10 PDFBibTeX XMLCite \textit{C. Balbuena} et al., Networks 45, No. 2, 49--54 (2005; Zbl 1067.68099) Full Text: DOI
Plesník, Ján Minimum \(k\)-geodetically connected digraphs. (English) Zbl 1055.05072 Networks 44, No. 4, 243-253 (2004). Reviewer: Gregory Gutin (Egham, Surrey) MSC: 05C20 05C12 05C40 68R10 PDFBibTeX XMLCite \textit{J. Plesník}, Networks 44, No. 4, 243--253 (2004; Zbl 1055.05072) Full Text: DOI
Gómez, José; Canale, Eduardo A.; Muñoz, Xavier Unilaterally connected large digraphs and generalized cycles. (English) Zbl 1031.05059 Networks 42, No. 4, 181-188 (2003). MSC: 05C20 05C35 05C38 PDFBibTeX XMLCite \textit{J. Gómez} et al., Networks 42, No. 4, 181--188 (2003; Zbl 1031.05059) Full Text: DOI
Comellas, Francesc; Fiol, Miquel Angel; Gimbert, Joan; Mitjana, Margarida The spectra of wrapped butterfly digraphs. (English) Zbl 1018.05066 Networks 42, No. 1, 15-19 (2003). MSC: 05C50 05C20 PDFBibTeX XMLCite \textit{F. Comellas} et al., Networks 42, No. 1, 15--19 (2003; Zbl 1018.05066) Full Text: DOI
Balbuena, C.; Fàbrega, J.; Marcote, X.; Pelayo, I. Superconnected digraphs and graphs with small conditional diameters. (English) Zbl 0999.05048 Networks 39, No. 3, 153-160 (2002). Reviewer: F.Gliviak (Bratislava) MSC: 05C20 05C40 05C12 PDFBibTeX XMLCite \textit{C. Balbuena} et al., Networks 39, No. 3, 153--160 (2002; Zbl 0999.05048) Full Text: DOI
Carmona, A.; Fàbrega, J. On the superconnectivity and the conditional diameter of graphs and digraphs. (English) Zbl 0984.05052 Networks 34, No. 3, 197-205 (1999). MSC: 05C40 PDFBibTeX XMLCite \textit{A. Carmona} and \textit{J. Fàbrega}, Networks 34, No. 3, 197--205 (1999; Zbl 0984.05052) Full Text: DOI
Koh, K. M.; Tay, E. G. On optimal orientations of Cartesian products of even cycles. (English) Zbl 0990.05062 Networks 32, No. 4, 299-306 (1998). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{K. M. Koh} and \textit{E. G. Tay}, Networks 32, No. 4, 299--306 (1998; Zbl 0990.05062) Full Text: DOI
Hasunuma, Toru; Shibata, Yukio Counting small cycles in generalized de Bruijn digraphs. (English) Zbl 0881.90120 Networks 29, No. 1, 39-47 (1997). MSC: 90C35 PDFBibTeX XMLCite \textit{T. Hasunuma} and \textit{Y. Shibata}, Networks 29, No. 1, 39--47 (1997; Zbl 0881.90120) Full Text: DOI
Hartmann, Mark; Orlin, James B. Finding minimum cost to time ratio cycles with small integral transit times. (English) Zbl 0786.90081 Networks 23, No. 6, 567-574 (1993). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{M. Hartmann} and \textit{J. B. Orlin}, Networks 23, No. 6, 567--574 (1993; Zbl 0786.90081) Full Text: DOI
Hagstrom, Jane Nichols Computing rooted communication reliability in an almost acyclic digraph. (English) Zbl 0751.90033 Networks 21, No. 5, 581-593 (1991). Reviewer: P.Reichensperger (Oberasbach) MSC: 90B25 90B18 90C60 90-08 PDFBibTeX XMLCite \textit{J. N. Hagstrom}, Networks 21, No. 5, 581--593 (1991; Zbl 0751.90033) Full Text: DOI
Roberts, Fred S.; Xu, Yonghua On the optimal strongly connected orientations of city street graphs. II: Two East-West avenues or North-South streets. (English) Zbl 0708.05026 Networks 19, No. 2, 221-233 (1989). Reviewer: Wai-Kai Chen MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{F. S. Roberts} and \textit{Y. Xu}, Networks 19, No. 2, 221--233 (1989; Zbl 0708.05026) Full Text: DOI
Mrozek, Marian Transitively reduced and transitively closed event networks. (English) Zbl 0669.90089 Networks 19, No. 1, 47-72 (1989). MSC: 90C35 90B35 PDFBibTeX XMLCite \textit{M. Mrozek}, Networks 19, No. 1, 47--72 (1989; Zbl 0669.90089) Full Text: DOI
Politof, Themistocles On a property of cyclic covers of p-graphs. (English) Zbl 0643.05042 Networks 18, No. 1, 51-53 (1988). Reviewer: N.Quimpo MSC: 05C38 05C20 PDFBibTeX XMLCite \textit{T. Politof}, Networks 18, No. 1, 51--53 (1988; Zbl 0643.05042) Full Text: DOI
Nakayama, A.; Peroche, B. Linear arboricity of digraphs. (English) Zbl 0649.05029 Networks 17, No. 1, 39-53 (1987). MSC: 05C20 05C05 05C38 PDFBibTeX XMLCite \textit{A. Nakayama} and \textit{B. Peroche}, Networks 17, No. 1, 39--53 (1987; Zbl 0649.05029) Full Text: DOI
Perl, Yehoshua Digraphs with maximum number of paths and cycles. (English) Zbl 0645.90094 Networks 17, No. 3, 295-305 (1987). MSC: 90C35 90B10 05C38 PDFBibTeX XMLCite \textit{Y. Perl}, Networks 17, No. 3, 295--305 (1987; Zbl 0645.90094) Full Text: DOI
Agrawal, Avinash; Satyanarayana, A. Network reliability analysis using 2-connected digraph reductions. (English) Zbl 0585.90040 Networks 15, 239-256 (1985). MSC: 90B25 90B10 60K10 PDFBibTeX XMLCite \textit{A. Agrawal} and \textit{A. Satyanarayana}, Networks 15, 239--256 (1985; Zbl 0585.90040) Full Text: DOI
Szwarcfiter, Jayme L. On digraphs with a rooted tree structure. (English) Zbl 0582.05030 Networks 15, 49-57 (1985). Reviewer: G.Chaty MSC: 05C20 68R10 05C05 68P10 PDFBibTeX XMLCite \textit{J. L. Szwarcfiter}, Networks 15, 49--57 (1985; Zbl 0582.05030) Full Text: DOI Link
Esfahanian, Abdol H.; Hakimi, S. Louis On computing the connectivities of graphs and digraphs. (English) Zbl 0542.68051 Networks 14, 355-366 (1984). MSC: 68R10 05C40 PDFBibTeX XMLCite \textit{A. H. Esfahanian} and \textit{S. L. Hakimi}, Networks 14, 355--366 (1984; Zbl 0542.68051) Full Text: DOI
Kano, Mikio; Sakamoto, Akio Ranking the vertices of a weighted digraph using the length of forward arcs. (English) Zbl 0507.05035 Networks 13, 143-151 (1983). MSC: 05C20 05C35 05C99 PDFBibTeX XMLCite \textit{M. Kano} and \textit{A. Sakamoto}, Networks 13, 143--151 (1983; Zbl 0507.05035) Full Text: DOI
Martello, Silvano; Toth, Paolo Finding a minimum equivalent graph of a digraph. (English) Zbl 0484.68049 Networks 12, 89-100 (1982). MSC: 68R10 05C20 68Q25 PDFBibTeX XMLCite \textit{S. Martello} and \textit{P. Toth}, Networks 12, 89--100 (1982; Zbl 0484.68049) Full Text: DOI