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)
A Computational Criterion for the Irrationality of Some Real Numbers

Peyman Nasehpour

Volume 52, Issue 1 , June 2020, , Pages 97-104


  In this paper, we compute the asymptotic average of the decimals of some real numbers. With the help of this computation, we prove that if a real number cannot be represented as a finite decimal and the asymptotic average of its decimals is zero, then it is irrational. We also show that the asymptotic ...  Read More

A generalization of zero-divisor graphs

Peyman Nasehpour

Volume 51, Issue 2 , December 2019, , Pages 35-45


  In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores  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

A Survey on Stability Measure of Networks

Peyman Nasehpour

Volume 48, Issue 1 , December 2016, , Pages 141-148


  In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity.  Read More