Damghan University PressGlobal Analysis and Discrete Mathematics2476-53415120200601Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2مجموعه های برش گره ای و چسبندگی ترکیبات عالی Cn H2n+2295016510.22128/gadm.2020.311.1023ENGholam HassanShirdelUniversity of Qom0000-0003-2759-4606BoshraVaezzadehDepartment of Mathematics, University of Qom, Qom, IRAN.Journal Article20190709Consider 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 C<sub>n</sub>H<sub>2n+2</sub>. The graph of this molecule is a tree. We try on tenacity of it by the definition of the tenacity. https://gadm.du.ac.ir/article_165_2aa873e24e60c522e410ec93f5873f48.pdf