Toughness of the corona of two graphs

References

• Aytaç , V. 2005 . Vulnerability in graphs: The neighbour-integrity of line graphs . Int. J. Comput. Math. , 82 ( 1 ) : 35 – 40 .
   Web of Science ®Google Scholar
• Barefoot , C. A. , Entringer , R. and Swart , H. 1987 . Vulnerability in graphs – a comparative survey . J. Combin. Math. Combin. Comput. , 1 : 13 – 22 .
   Google Scholar
• Bauer , D. , Broersma , H. and Schmeichel , E. 2006 . Toughness in graphs – a survey . Graphs Combin. , 22 ( 1 ) : 1 – 35 .
   Web of Science ®Google Scholar
• Bauer , D. , Hakimi , S. L. and Schmeichel , E. 1990 . Recognizing tough graphs is NP-hard . Discrete Appl. Math. , 28 : 191 – 195 .
   Web of Science ®Google Scholar
• Boesch , F. T. 1986 . Synthesis of reliable networks – a survey . IEEE Trans. Reliab. , 35 : 240 – 246 .
   Web of Science ®Google Scholar
• Boesch , F. T. , Satyanarayana , A. and Suffel , C. L. 2009 . A survey of some network reliability analysis and synthesis results . Networks , 54 ( 2 ) : 99 – 107 .
   Google Scholar
• Boesch , F. T. and Tindell , R. 1984 . Circulants and their connectivities . J. Graph Theory , 8 ( 4 ) : 487 – 499 .
   Web of Science ®Google Scholar
• Broersma , H. J. , Engbers , E. and Trommel , H. 1999 . Various results on the toughness of graphs . Networks , 33 : 233 – 238 .
   Google Scholar
• Chartrand , G. and Lesniak , L. 2005 . Graphs and Digraphs , USA : Chapman and Hall/CRC .
   Google Scholar
• Chvátal , V. 1973 . Tough graphs and Hamiltonian circuits . Discrete Math. , 5 : 215 – 228 .
   Google Scholar
• Fàbrega , J. and Fiol , M. A. 1994 . Extraconnectivity of graphs with large girth . Discrete Math , 127 : 163 – 170 .
   Web of Science ®Google Scholar
• Fàbrega , J. and Fiol , M. A. 1996 . On the extraconnectivity of graphs . Discrete Math , 155 : 49 – 57 .
   Web of Science ®Google Scholar
• Faudree , R. , Gould , R. , Jacobson , M. , Lesniak , L. and Saito , A. 2004 . Toughness, degrees and 2-factors . Discrete Math. , 286 : 245 – 249 .
   Google Scholar
• Frucht , R. and Harary , F. 1970 . On the corona of two graphs . Aequationes Math. , 4 : 322 – 325 .
   Google Scholar
• Goddard , W. D. and Swart , H. C. 1990 . On the toughness of a graph . Quaestiones Math. , 13 : 217 – 232 .
   Google Scholar
• Hellwig , A. and Volkmann , L. 2008 . Maximally edge-connected and vertex-connected graphs and digraphs: A survey . Discrete Math. , 308 ( 15 ) : 3265 – 3296 .
   Google Scholar
• Katerinis , P. and Wang , T. 2010 . Toughness of graphs and 2-factors with given properties . Ars Combin. , 95 : 161 – 177 .
   Google Scholar
• Li , Y. , Zhang , S. and Zhang , Q. 2008 . Vulnerability parameters of split graphs . Int. J. Comput. Math. , 85 ( 1 ) : 19 – 23 .
   Web of Science ®Google Scholar
• Liu , S. 2010 . On toughness and fractional (g, f, n)-critical graphs . Inform. Process. Lett. , 110 ( 10 ) : 378 – 382 .
   Web of Science ®Google Scholar
• Liu , S. and Cai , J. 2009 . Toughness and existence of fractional (g, f)-factors in graphs . Ars Combin. , 93 : 305 – 311 .
   Google Scholar
• Mamut , A. and Vumar , E. 2008 . Vertex vulnerability parameters of Kronecker products of complete graphs . Inform. Process. Lett. , 106 : 258 – 262 .
   Google Scholar
• Metsidik , M. and Vumar , E. 2008 . Edge vulnerability parameters of bisplit graphs . Comput. Math. Appl. , 56 ( 7 ) : 1741 – 1747 .
   Google Scholar
• Metsidik , M. and Vumar , E. 2010 . Toughness and matching extension in P3-dominated graphs . Graphs Combin. , 26 ( 3 ) : 425 – 432 .
   Google Scholar
• Moazzami , D. and Salehian , B. 2009 . Some results related to the tenacity and existence of k-trees . Discrete Appl. Math. , 157 ( 8 ) : 1794 – 1798 .
   Google Scholar
• Pippert , R. E. 1972 . “ On the Toughness of a Graph ” . In Lecture Notes in Mathematics , Vol. 303 , 225 – 233 . Berlin : Springer .
   Google Scholar
• Wei , Z. and Zhang , S. 2008 . Vertex-neighbour-integrity of composition graphs of paths and cycles . Int. J. Comput. Math. , 85 ( 5 ) : 727 – 733 .
   Web of Science ®Google Scholar
• Zhang , S. , Li , X. and Han , X. 2002 . Computing the scattering number of graphs . Int. J. Comput. Math. , 79 ( 2 ) : 179 – 187 .
   Web of Science ®Google Scholar