The restricted Toda chain, exponential Riordan arrays, and Hankel transforms.
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all connected graphs with fixed order and given number of cut vertices.
Let G = (V, E) be a connected graph with 2-connected blocks H1, H2, . . . , Hr. Motivated by the exponential distance matrix, Bapat and Sivasubramanian in [4] defined its product distance matrix DG and showed that det DG only depends on det DHi for 1 ≤ i ≤ r and not on the manner in which its blocks are connected. In this work, when distances are symmetric, we generalize this result to the Smith Normal Form of DG and give an explicit formula for the invariant factors of DG.