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. Since the hypergraph generalize the standard graph by defining any edge between multiple vertices instead of only two vertices, the above question is about the hypergraph. When a hyperedge is omitted from hypergraph, we have two kinds of deletion: strong deletion and weak deletion. Weak hyperedge deletion just deletes the connection between the vertices in the hyperedge and the vertices became in the hypergraph. In this paper, we obtain the tenacity of hypercycles by weak hyperedge deletion.
Shirdel, G. H. and Vaez-Zadeh, B.
The Weak Hyperedge Tenacity of the Hypercycles,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 14,
2, Article 43.
Available at: https://digitalcommons.pvamu.edu/aam/vol14/iss2/43