Hong, Yanmei Realizability of fault-tolerant graphs. (English) Zbl 1332.05081 Bull. Malays. Math. Sci. Soc. (2) 39, No. 2, 619-631 (2016). MSC: 05C40 05C07 PDF BibTeX XML Cite \textit{Y. Hong}, Bull. Malays. Math. Sci. Soc. (2) 39, No. 2, 619--631 (2016; Zbl 1332.05081) Full Text: DOI OpenURL
Tian, Yingzhi; Meng, Jixiang Restricted connectivity for some interconnection networks. (English) Zbl 1325.05100 Graphs Comb. 31, No. 5, 1727-1737 (2015). Reviewer: Yilun Shang (Shanghai) MSC: 05C40 05C82 05C25 PDF BibTeX XML Cite \textit{Y. Tian} and \textit{J. Meng}, Graphs Comb. 31, No. 5, 1727--1737 (2015; Zbl 1325.05100) Full Text: DOI OpenURL
Carballosa, Walter; Portilla, Ana; Rodríguez, José M.; Sigarreta, José M. Planarity and hyperbolicity in graphs. (English) Zbl 1327.05257 Graphs Comb. 31, No. 5, 1311-1324 (2015). MSC: 05C69 05A20 05C50 PDF BibTeX XML Cite \textit{W. Carballosa} et al., Graphs Comb. 31, No. 5, 1311--1324 (2015; Zbl 1327.05257) Full Text: DOI OpenURL
Wu, Mei-Hui; Chung, Long-Yeu The number of spanning trees of the Cartesian product of regular graphs. (English) Zbl 1407.05057 Math. Probl. Eng. 2014, Article ID 750618, 9 p. (2014). MSC: 05C05 05C30 PDF BibTeX XML Cite \textit{M.-H. Wu} and \textit{L.-Y. Chung}, Math. Probl. Eng. 2014, Article ID 750618, 9 p. (2014; Zbl 1407.05057) Full Text: DOI OpenURL
Wu, Jichang; Ou, Jianping On edge cut of graphs leaving components of order at least five. (English) Zbl 1282.05083 Graphs Comb. 29, No. 6, 1973-1981 (2013). MSC: 05C40 68R10 68M15 PDF BibTeX XML Cite \textit{J. Wu} and \textit{J. Ou}, Graphs Comb. 29, No. 6, 1973--1981 (2013; Zbl 1282.05083) Full Text: DOI OpenURL
Ou, Jianping On optimizing edge connectivity of product graphs. (English) Zbl 1222.05226 Discrete Math. 311, No. 6, 478-492 (2011). MSC: 05C76 05C40 PDF BibTeX XML Cite \textit{J. Ou}, Discrete Math. 311, No. 6, 478--492 (2011; Zbl 1222.05226) Full Text: DOI OpenURL
Lü, Min; Chen, Guo-Liang; Xu, Xi-Rong On super edge-connectivity of product graphs. (English) Zbl 1185.05092 Appl. Math. Comput. 207, No. 2, 300-306 (2009). MSC: 05C40 PDF BibTeX XML Cite \textit{M. Lü} et al., Appl. Math. Comput. 207, No. 2, 300--306 (2009; Zbl 1185.05092) Full Text: DOI OpenURL
Wojciechowski, Jacek; Arabas, Jarosław; Sawionek, Błaẓej Heuristic maximization of the number of spanning trees in regular graphs. (English) Zbl 1142.90041 J. Franklin Inst. 343, No. 3, 309-325 (2006). MSC: 90C59 05E30 90C35 PDF BibTeX XML Cite \textit{J. Wojciechowski} et al., J. Franklin Inst. 343, No. 3, 309--325 (2006; Zbl 1142.90041) Full Text: DOI OpenURL
Chen, Y-Chuang; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Kao, Shin-Shin Super-connectivity and super-edge-connectivity for some interconnection networks. (English) Zbl 1025.05037 Appl. Math. Comput. 140, No. 2-3, 245-254 (2003). Reviewer: Peter Horák (Tacoma) MSC: 05C40 PDF BibTeX XML Cite \textit{Y-C. Chen} et al., Appl. Math. Comput. 140, No. 2--3, 245--254 (2003; Zbl 1025.05037) Full Text: DOI OpenURL
Chiue, Wen-Sz; Shieh, Bih-Sheue On connectivity of the cartesian product of two graphs. (English) Zbl 0927.05048 Appl. Math. Comput. 102, No. 2-3, 129-137 (1999). Reviewer: P.Horák (Safat) MSC: 05C40 05C75 PDF BibTeX XML Cite \textit{W.-S. Chiue} and \textit{B.-S. Shieh}, Appl. Math. Comput. 102, No. 2--3, 129--137 (1999; Zbl 0927.05048) Full Text: DOI OpenURL
Yang, C. S.; Han, L. C. The number of spanning trees of the generalized hypercube network. (English) Zbl 0787.05068 Math. Comput. Modelling 17, No. 6, 97-107 (1993). Reviewer: J.Sedláček (Praha) MSC: 05C50 05C05 05C30 PDF BibTeX XML Cite \textit{C. S. Yang} and \textit{L. C. Han}, Math. Comput. Modelling 17, No. 6, 97--107 (1993; Zbl 0787.05068) Full Text: DOI OpenURL
Yang, C. S. Reliability analysis on the multiple-loop network. (English) Zbl 0765.60090 Int. J. Syst. Sci. 23, No. 12, 2335-2348 (1992). MSC: 60K10 90B25 PDF BibTeX XML Cite \textit{C. S. Yang}, Int. J. Syst. Sci. 23, No. 12, 2335--2348 (1992; Zbl 0765.60090) Full Text: DOI OpenURL
Fraigniaud, Pierre; Peyrat, Claudine Broadcasting in a hypercube when some calls fail. (English) Zbl 0735.68005 Inf. Process. Lett. 39, No. 3, 115-119 (1991). MSC: 68M10 68M15 PDF BibTeX XML Cite \textit{P. Fraigniaud} and \textit{C. Peyrat}, Inf. Process. Lett. 39, No. 3, 115--119 (1991; Zbl 0735.68005) Full Text: DOI OpenURL
Hsieh, Wen-Shyong; Yang, Chu-Sing; Tzeng, Jih-Shaw Graph theoretic characterization and reliability of the multiple-clique network. (English) Zbl 0706.05052 Math. Comput. Modelling 13, No. 9, 49-58 (1990). MSC: 05C99 90B25 PDF BibTeX XML Cite \textit{W.-S. Hsieh} et al., Math. Comput. Modelling 13, No. 9, 49--58 (1990; Zbl 0706.05052) Full Text: DOI OpenURL
Huang, T.-C.; Wang, J.-F.; Yang, C.-S.; Lee, J.-Y. The number of spanning trees of the generalized Boolean \(n\)-cube network. (English) Zbl 0661.94026 Comput. Math. Appl. 16, No. 9, 715-725 (1988). MSC: 94C10 94C15 PDF BibTeX XML Cite \textit{T. C. Huang} et al., Comput. Math. Appl. 16, No. 9, 715--725 (1988; Zbl 0661.94026) Full Text: DOI OpenURL
Yang, C. S.; Wang, J. F.; Lee, J. Y. Reliability properties of the hypercube network. (English) Zbl 0643.94045 Comput. Math. Appl. 14, 541-548 (1987). MSC: 94C15 PDF BibTeX XML Cite \textit{C. S. Yang} et al., Comput. Math. Appl. 14, 541--548 (1987; Zbl 0643.94045) Full Text: DOI OpenURL