Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2

Consider some vertices of a graph G are omitted, there are some criteria for measuring the vulnerability of the graph; Tenacity is one of them. In the definition of tenacity we use vertex cut S and some items, τ (G − S) and ω(G − S), such that τ (G − S) is the number of vertices in the largest component of G − S and ω(G − S) is the number of components of G − S. In this paper we work on tenacity of organic compound CnH2n+2. The graph of this molecule is a tree. We try on tenacity of it by the definition of the tenacity.