Applicable Analysis and Discrete Mathematics, Vol. 11, No. 1 (April 2017), pp. 81-107 (27 pages) Let 𝐺 be a graph with adjacency matrix 𝐴(𝐺), and let 𝐷(𝐺) be the diagonal matrix of the degrees of ...
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) = ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback