Damghan UniversityGlobal Analysis and Discrete Mathematics2476-53415120200601Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2مجموعه های برش یالی و کران بالا چسبندگی یالی ترکیبات الی Cn H2n+212116310.22128/gadm.2020.316.1024ENGholam HassanShirdelUniversity of QomBoshraVaezzadehDepartment of Mathematics, University of Qom, Qom, IRAN.Journal Article20190804The graphs play an important role in our daily life. For example,<br /> the urban transport network can be represented by a graph, as the intersections<br /> are the vertices and the streets are the edges of the graph. Suppose that some<br /> edges of the graph are removed, the question arises, how damaged the graph is.<br /> There are some criteria for measuring the vulnerability of graph; the tenacity<br /> is the best criteria for measuring it. In this paper, we nd some edge cut sets<br /> for organic compounds CnH2n+2 and obtain an upper bound for Te(CnH2n+2)<br /> by these edge cut sets.http://gadm.du.ac.ir/article_163_0c58cb3e8b11a0d91c2f5ea4560a21c1.pdf