TY - JOUR
ID - 163
TI - Some Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
JO - Global Analysis and Discrete Mathematics
JA - GADM
LA - en
SN - 2476-5341
AU - Shirdel, Gholam Hassan
AU - Vaezzadeh, Boshra
AD - University of Qom
AD - Department of Mathematics, University of Qom, Qom, IRAN.
Y1 - 2020
PY - 2020
VL - 5
IS - 1
SP - 1
EP - 21
KW - Edge Tenacity
KW - Edge cut sets
KW - Organic compounds CnH2n+2
KW - Tree
DO - 10.22128/gadm.2020.316.1024
N2 - 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.
UR - http://gadm.du.ac.ir/article_163.html
L1 - http://gadm.du.ac.ir/article_163_0c58cb3e8b11a0d91c2f5ea4560a21c1.pdf
ER -