2 research outputs found
On graph theory Mertens' theorems
In this paper, we study graph-theoretic analogies of the Mertens' theorems by
using basic properties of the Ihara zeta-function. One of our results is a
refinement of a special case of the dynamical system Mertens' second theorem
due to Sharp and Pollicott.Comment: 13 page
An algorithm to evaluate the spectral expansion
Assume that is a connected -regular undirected graph of finite
order . Let denote the adjacency matrix of . Let
denote the
eigenvalues of . The spectral expansion of is defined by By the Alon--Boppana
theorem, when is sufficiently large, is quite high if is close to . In
this paper, with the inputs and a real number we design an
algorithm to estimate if in time, where is the exponent of matrix
multiplication