some result on weak-tenacity of a graph

Connectivity has been used in the past to describe the stability of graphs. if two graphs, have the same connectivity, then it dose not distinguish between these graphs. that is, the connectivity is not a good measure of graph stability. then we need other graph parameters to describe the stability. suppose that two graphs have the same connectivity and the order (the number of vertices or edges) of the largest components of these graphs are not equal. hence, we say that these graphs must be different in respect to stability and so we can define a new measure which distinguishes these graphs. in this paper, the weak-tenacity of graph g is introduced as a new measure of stability in this sense and it is defined as tw(g) = mins⊆v(g) { (|s| + me (g-s)) / ω(g-s) : ω(g-s) > 1}, where me(g-s) denotes the number of, edges of the largest component of g-s. at last, we give the weak-tenacity of graphs obtained via various operations.