Tenacities of hypercube graphs and its some compounds

When a network begins losing nodes or links, there might be a loss of its effectiveness. Therefore communication networks must be constructed as stable as possible, not only with respect to the initial disruption but also their possible reconstruction. If a graph is considered as a modelling network, many graph theorical parameters have been used to describe the stability of communication networks, including connectivity, integrity, toughness and the binding number. Several of these deal with two fundamental questions about the resulting graph. How many vertices can still communicate? How difficult is it to reconnect the graph? The tenacity of a graph G, T(G), is a new stability measure, incorporating ideas of both toughness and integrity and dealing with the above questions. A hypercube is a communication network in computer sciences. Other networks can be embedded into a hypercube. Furthermore, hypercube graphs are a special class of graphs. We gave a number of the basic results about tenacity. We add two tenacity sections, the edge-tenacity of hypercube graphs and some compounds which are obtained by graph operations