Circulant graphs are an extremely well-studied subclass of regular graphs, partially because they model many practical computer network topologies. It has long been known that the number of spanning trees in n-node circulant graphs with constant jumps satisfies a recurrence relation in n. For the non-constant-jump case, i.e., where some jump sizes can be functions of the graph size, only a few ...

Stable recurrence relations are presented for the numerical computation of the Calais-Löwdin integrals

Abstract. In the model of progressive type II censoring, point and interval estimation as well as relations for single and product moments are considered. Based on two-parameter exponential distributions, maximum likelihood estimators (MLEs), uniformly minimum variance unbiased estimators (UMVUEs) and best linear unbiased estimators (BLUEs) are derived for both location and scale parameters. So...

In this study, we define the hyperbolic Jacobsthal-Lucas numbers and obtain recurrence relations, Binet’s formula, generating function summation formulas for these numbers.