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

Document Type: Research Paper


1 University of Qom

2 Department of Mathematics, University of Qom, Qom, IRAN.



Abstract Consider some vertices of a graph G are omitted, there are some
ceriteria for measuring the vulnerability of the graph; Tenacity is one of them.
In the de nition 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 compnent
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 molecoule is a tree. We try on tenacity of it by the de nition of the