Consider some vertices of a graph G are omitted, there are some criteria for measuring the vulnerability of the graph; Tenacity is one of them. In the definition 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 component of G − S and ω(G − S) is the number of components of G − S. In this paper we work on tenacity of organic compound C_{n}H_{2n+2}. The graph of this molecule is a tree. We try on tenacity of it by the definition of the tenacity.
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, The Macmillan Press Ltd., (1976).
D. Moazzami, Tenacity of a graph with maximum connectivity, J. Discrete Appl. Math., 159: 367–380, (2011).
A. Mamut and E. Vumar, Vertex vulnerability parameters of Kronecker products of complete graphs, Inform. Process. Lett., 106: 258–262, (2008).
D. Moazzami and B. Salehian, On the edge-tenacity of graphs, Int. Math, Forum, 3: 929–936, (2008).
V. Aytac, Compuing the tenacity of some graphs, Seluk J. Appl. Math., 10: 107–120, (2009).
M.B. Cozzens, D. Moazzami, and S. Stueckle, The tenacity of a graph, Graph Theory, Combinatorics, and Algorithms, Wiley-Intersci. Publ., Wiley, New York, 1(2): 1111–1112, (1995).
Y-K. Li, S-g. Zhang, X-L. Li, and Y. Wu, Relationships between tenacity and some other vulnerability parameters, Basic Sci. J. Text. Univ., 17: 1–4, (2004).
D. Moazzami, Vulnerability in Graphs –a comparative survey, J. Combin. Math. Combin. Comput., 30: 23–31, (1999).
D. Moazzami, Stability measure of a graph: A survy, Util. Math., 57: 171–191, (2000).
D. Moazzami and S. Salehian, Some results related to the tenacity and existencs of k-trees, Discrete Appl. Math., 157: 1794–1798, (2009).
M.B. Cozzens, D. Moazzami, and S. Stueckle, The tenacity of the Harary graphs, J. Combin. Math. Combin. Comput., 16: 33–56, (1994).
Z-P Wang, G. Ren, and L-c. Zhao, Edge-Tenacity in graphs, J. Math. Res. Exposition, 24: 405–410, (2004).
Y. Wu and X.S. Wei, Edge-teancity of graphs, Gongcheng Shuxue Xue- Bao, 21: 704– 708, (2004).
Shirdel, G. H., & Vaezzadeh, B. (2020). Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2. Global Analysis and Discrete Mathematics, 5(1), 29-50. doi: 10.22128/gadm.2020.311.1023
MLA
Gholam Hassan Shirdel; Boshra Vaezzadeh. "Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2", Global Analysis and Discrete Mathematics, 5, 1, 2020, 29-50. doi: 10.22128/gadm.2020.311.1023
HARVARD
Shirdel, G. H., Vaezzadeh, B. (2020). 'Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2', Global Analysis and Discrete Mathematics, 5(1), pp. 29-50. doi: 10.22128/gadm.2020.311.1023
VANCOUVER
Shirdel, G. H., Vaezzadeh, B. Vertex-Cut Sets and Tenacity of Organic Compounds CnH2n+2. Global Analysis and Discrete Mathematics, 2020; 5(1): 29-50. doi: 10.22128/gadm.2020.311.1023