Damghan University Press Analytical and Numerical Solutions for Nonlinear Equations 3060-785X 5 1 2020 06 01 Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2 مجموعه های برش گره ای و چسبندگی ترکیبات عالی Cn H2n+2 29 50 165 10.22128/gadm.2020.311.1023 EN Gholam Hassan Shirdel University of Qom 0000-0003-2759-4606 Boshra Vaezzadeh Department of Mathematics, University of Qom, Qom, IRAN. Journal Article 2019 07 09 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 C_nH_2n+2. The graph of this molecule is a tree. We try on tenacity of it by the definition of the tenacity.  https://ansne.du.ac.ir/article_165_2aa873e24e60c522e410ec93f5873f48.pdf