Results on toughness in graphs under heavy subgraph conditions
Lin Wen · Basic Sciences Journal of Textile Universities · 2013
Let Gbe a graph on n vertices.The toughness of graphs under special heavy subgraph conditions is studied in the paper.On the basis of studying the toughness of the low connective graphs,the graph Swas characterized such that every k-connected S-heavy graph was τ-tough and gave the necessary and sufficient conditions,which promotes the research of the toughness of graphs.