Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2

Document Type: Research Paper


1 University of Qom

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



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 nd some edge cut sets
for organic compounds CnH2n+2 and obtain an upper bound for Te(CnH2n+2)
by these edge cut sets.