Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH۲n+۲

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 CnH۲n+۲ and obtain an upper bound for Te(CnH۲n+۲) by these edge cut sets.

کلیدواژه ها:

Edge Tenacity ، Edge cut sets ، Organic compounds CnH۲n+۲ ، Tree