Zhao, Yanhua Cycles are the only connectivity double-critical graphs. (English) Zbl 1464.05213 Util. Math. 117, 117-123 (2020). MSC: 05C38 05C40 05C15 PDFBibTeX XMLCite \textit{Y. Zhao}, Util. Math. 117, 117--123 (2020; Zbl 1464.05213)
Bafandeh, Bahareh; Moazzami, Dara On the higher-order edge-tenacity of a graph. (English) Zbl 1407.05215 Util. Math. 108, 195-212 (2018). MSC: 05C82 05C40 PDFBibTeX XMLCite \textit{B. Bafandeh} and \textit{D. Moazzami}, Util. Math. 108, 195--212 (2018; Zbl 1407.05215)
Mao, Yaping; Wang, Zhao; Xiao, Yuzhi; Ye, Chengfu Steiner Wiener index and connectivity of graphs. (English) Zbl 1368.05037 Util. Math. 102, 51-57 (2017). MSC: 05C12 05C40 05C05 05C35 PDFBibTeX XMLCite \textit{Y. Mao} et al., Util. Math. 102, 51--57 (2017; Zbl 1368.05037)
Ning, Wantao; Feng, Xiaoli A simple proof to the connectivity of exchanged hypercubes. (English) Zbl 1293.05191 Util. Math. 92, 337-340 (2013). MSC: 05C40 PDFBibTeX XMLCite \textit{W. Ning} and \textit{X. Feng}, Util. Math. 92, 337--340 (2013; Zbl 1293.05191)
Dankelmann, Peter; Mukwembi, Simon; Swart, Henda C. An upper bound on the radius of a 3-edge-connected graph. (English) Zbl 1138.05017 Util. Math. 73, 207-215 (2007). Reviewer: Mikhail Ostrovskii (Queens) MSC: 05C12 05C40 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Util. Math. 73, 207--215 (2007; Zbl 1138.05017)