Quantum field theory over .
Some properties of the distance Laplacian eigenvalues of a graph
The distance Laplacian of a connected graph is defined by , where is the distance matrix of , and is the diagonal matrix whose main entries are the vertex transmissions in . The spectrum of is called the distance Laplacian spectrum of . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties of the distance...
Spectra of copies of Bethe trees attached to path and applications
Zeros of the Jones polynomial are dense in the complex plane.