CAJ | 학술논문

设G是一个有限的无向简单图，研究了图G在重子图条件下的坚韧性。在对低连通图坚韧性研究的基础上，通过分析图的结构，刻画了k-连通图是τ（τ≤1）-坚韧的重子图条件的特点，给出了k-连通-S重图是τ（τ≤1）-坚韧的充要条件，进一步推广了对图的坚韧性的研究。
설G시일개유한적무향간단도，연구료도G재중자도조건하적견인성。재대저련통도견인성연구적기출상，통과분석도적결구，각화료k-련통도시τ（τ≤1）-견인적중자도조건적특점，급출료k-련통-S중도시τ（τ≤1）-견인적충요조건，진일보추엄료대도적견인성적연구。
Let G be a graph on n vertices .The toughness of graphs under special heavy subgraph condi-tions is studied in the paper .On the basis of studying the toughness of the low connective graphs ,the graph S was characterized such that every k-connected S-heavy graph was τ-tough and gave the necessa-ry and sufficient conditions ,w hich promotes the research of the toughness of graphs .