Damghan University Press Analytical and Numerical Solutions for Nonlinear Equations 3060-785X 5 1 2020 06 01 Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2 مجموعه های برش یالی و کران بالا چسبندگی یالی ترکیبات الی Cn H2n+2 1 21 163 10.22128/gadm.2020.316.1024 EN Gholam Hassan Shirdel University of Qom 0000-0003-2759-4606 Boshra Vaezzadeh Department of Mathematics, University of Qom, Qom, IRAN. Journal Article 2019 08 04 The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the tenacity is the best criteria for measuring it. In this paper, we find some edge cut sets for organic compounds C<sub>n</sub>H<sub>2n+2</sub> and obtain an upper bound for T<sub>e</sub>(C<sub>n</sub>H<sub>2n+2</sub>) by these edge cut sets.  Edge Tenacity Edge cut sets Organic compounds CnH2n+2 Tree https://ansne.du.ac.ir/article_163_0c58cb3e8b11a0d91c2f5ea4560a21c1.pdf