Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...
PROC MODEL provides several features to aid in analyzing the structure of the model program. These features summarize properties of the model in various forms. The following Klein's model program is ...
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