%0 Journal Article
%T A Survey on Tenacity Parameter\\Part II
%J Journal of Algorithms and Computation
%I University of Tehran
%Z 2476-2776
%A Moazzami, Dara
%A Khoshnood, Asieh
%D 2022
%\ 06/01/2022
%V 54
%N 1
%P 47-72
%! A Survey on Tenacity Parameter\\Part II
%K edge-tenacious
%K Cartesian products
%K Middle Graph
%K connectivity
%K binding number
%K toughness
%K maximum graphical structure
%R 10.22059/jac.2022.88027
%X In this paper, we study the edge tenacity of graphs. We will be primarilyinterested in edge-tenacious graphs, which can be considered very stable and are somewhat analogous in edge tenacityto honest graphs in edge-integrity. We show several results about edge-tenacious graphs as well asfind numerous classes of edge-tenacious graphs.The Cartesian Products of graphs like hypercube, grids, and tori are widely used to design interconnection networks in multiprocessor computing systems.These considerations motivated us to study tenacity of Cartesian products of graphs. We find the tenacity of Cartesian product of complete graphs (thus setting a conjecture stated in Cozzens and al.) and grids.The Middle Graph, M(G) of a graph G is the graph obtained from G by inserting a new vertex into every edge of G and by joining by edges those pairs of these new vertices which lie on adjacent edges of G
%U https://jac.ut.ac.ir/article_88027_7aabe4f5b8610fd31d2ec24c291c6d86.pdf