Quantum Probability Aspects to Lexicographic and Strong Products of Graphs

Abstract

The adjacency matrix of the lexicographic product of graphs is decomposed into a sum of monotone independent random variables in a certain product state. The adjacency matrix of the strong product of graphs admits an expression in terms of commutative independent random variables in a product state. Their spectral distributions are obtained by using the monotone, classical and Mellin convolutions of probability distributions.