Asymptotic Spectral Distributions of Distance kk-Graphs of Cartesian Product Graphs

preprint2013arXivOpen access

Abstract

Let GG be a finite connected graph on two or more vertices and G[N,k]G^{[N,k]} the distance kk-graph of the NN-fold Cartesian power of GG. For a fixed k≥1k\ge1, we obtain explicitly the large NN limit of the spectral distribution (the eigenvalue distribution of the adjacency matrix) of G[N,k]G^{[N,k]}. The limit distribution is described in terms of the Hermite polynomials. The proof is based on asymptotic combinatorics along with quantum probability theory.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.