The spectral spread of the eccentricity matrix E (G) of a graph G is defined as the difference
between the largest and the smallest eigenvalue of E (G). While the trace norm of the …

For the distance matrix D (G) and diagonal matrix of the vertex transmissions T r (G) of a
simple connected graph G, the generalized distance matrix D α (G) is the convex …

Abstract Let D (G) and Tr (G) be, respectively, the distance matrix and the diagonal matrix of
the vertex transmissions of a connected graph G. The generalized distance matrix is defined …

The development of the Internet and big data has led to the emergence of graphs as an
important data representation structure in various real-world scenarios. However, as data …

The generalized distance matrix of a connected graph $ G $, denoted by $ D_ {\alpha}(G) $,
is defined as $ D_ {\alpha}(G)=\alpha Tr (G)+(1-\alpha) D (G),~~~~ 0\leq\alpha\leq 1$. Here …

For a simple connected graph $ G $, the convex linear combinations $ D_ {\alpha}(G) $ of\$
Tr (G) $ and $ D (G) $ is defined as $ D_ {\alpha}(G)=\alpha Tr (G)+(1-\alpha) D (G) …

For a simple connected graph G, let D (G), Tr (G), DL (G) and DQ (G) respectively be the
distance matrix, the diagonal matrix of the vertex transmissions, the distance Laplacian …

For a simple connected graph G of order n, let D (G), Tr (G), DL (G) and DQ (G) be,
respectively, the distance matrix, the diagonal matrix of the vertex transmissions, the …

The work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix,
normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian …

The power graph $ G= P (\Omega) $ of a finite group $\Omega $ is a graph with the vertex
set $\Omega $ and two vertices $ u, v\in\Omega $ form an edge if and only if one is an …