Super-λ3 and Super-κ3 Graphs on Girth and Diameter

Keywords: 3-Restricted edge connectivity, Super-λ3, Super-κ3 REFERENCES [1] C. Balbuena, P. Garcia-Vazquez, X. Marcote, ´ Sufficient conditions for λ 0 -optimality in graphs with girth g, J. Graph Theroy 52, 2006, pp. 73- 86. [1] C. Balbuena, P. Garcia-Vazquez, X. Marcote, ´ Sufficient conditions for λ 0 -optimality in graphs with girth g, J. Graph Theroy 52, 2006, pp. 73- 86. [2] C. Balbuena, Y. Lin, M. Miller, Diametersufficient conditions for a graph to be superrestricted connected, Discrete Appl. Math. 156, 2008, pp. 2827-2834. [3] A. Esfahanian, S. Hakimi, On computing a condintional edge connectivity of a graph, Inform. Process. Lett. 27, 1988, pp. 195-199. [4] J. Fabrega, M.A. Foil, Extraconnectivity of ´ graphs with large girth, Discrete Math. 127, 1994, pp. 163-170. [5] L. Guo, W.Yang, X. Guo, On a kind of reliability analysis of networks, Applied Mathematics and Computation 218, 2011, pp. 2711-2715. [6] L. Guo, J.X. Meng, 3-restricted connectivity of graphs with given girth, Appl. Math. J. Chinese Univ. Series B 23(3), 2008, pp. 351-358. [7] Y. Wang, Q. Li, Upper bound of the third edgeconnectivity of graphs, Science in China Ser. A Mathematics 48(3), 2005, pp. 360ł371. [8] Z. Zhang, J.J. Yuan, Degree conditions for retricted edge connectivity and isoperimetric-edgeconnectivity to be optimal, Discrete Math. 307, 2007, pp. 293-298.