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)
On the tenacity of cycle permutation graph

D. Jelodar; D. Moazzami; P. Nasehpour

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

https://doi.org/10.22059/jac.2016.7938

Abstract
  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

https://doi.org/10.22059/jac.2016.7953

Abstract
  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

https://doi.org/10.22059/jac.2016.7955

Abstract
  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