Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
Tenacity and some related results

Dara Moazzami

Volume 49, Issue 1 , June 2017, , Pages 83-91


  Conceptually graph vulnerability relates to the study of graphintactness when some of its elements are removed. The motivation forstudying vulnerability measures is derived from design and analysisof networks under hostile environment. Graph tenacity has been anactive area of research since the the concept ...  Read More

On the tenacity of cycle permutation graph

D. Jelodar; D. Moazzami; P. Nasehpour

Volume 48, Issue 1 , December 2016, , Pages 37-44


  A special class of cubic graphs are the cycle permutation graphs. A cycle permutation graph Pn( α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.In this paper we determine a good upper bound for tenacity of cycle permutation ...  Read More

Towards a measure of vulnerability, tenacity of a Graph

Dara Moazzami

Volume 48, Issue 1 , December 2016, , Pages 149-153


  If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including ...  Read More

A Survey On the Vulnerability Parameters of Networks

Mahmood Shabankhah

Volume 48, Issue 1 , December 2016, , Pages 155-162


  The analysis of vulnerability in networks generally involves some questions about how the underlying graph is connected. One is naturally interested in studying the types of disruption in the network that maybe caused by failures of certain links or nodes. In terms of a graph, the concept of connectedness ...  Read More

A Survey on Complexity of Integrity Parameter

Mahmood Shabankhah

Volume 47, Issue 1 , June 2016, , Pages 11-19


  Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity ...  Read More

Toughness of the Networks with Maximum Connectivity

D. Moazzami

Volume 46, Issue 1 , December 2015, , Pages 51-71


  The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed ...  Read More