The eigenvalue of a graph is the eigenvalue of its adjacency matrix. A graph G is integral if all of its eigenvalues are integers. In this paper some new classes of integral graphs are constructed.

Well, if I remember my graph theory well enough, if A is the adjacency matrix of the graph, each entry of A^n is the number of ways to get between the corresponding nodes in n steps or less. So, to do ...

Carpathian Journal of Mathematics, Vol. 39, No. 1 (2023), pp. 213-230 (18 pages) The normalized distance Laplacian matrix of a connected graph G, denoted by D𝓛(G), is defined by D𝓛(G) = ...