The A γ matrix of a graph G is determined by A γ (G)=(1− γ) A (G)+ γ D (G), where 0≤ γ≤ 1,
A (G) and D (G) are the adjacency and the diagonal matrices of node degrees, respectively …

Let G be a simple, connected graph of order n. Its distance Laplacian energy DLE (G) is
given by DLE (G)=∑ i= 1 n| ρ i L− 2 W (G) n|, where ρ 1 L≥ ρ 2 L≥⋯≥ ρ n L are the …

For a finite group G and a subset X∅ of G, the commuting graph, indicated by G= C (G, X), is
the simple connected graph with vertex set X and two distinct vertices x and y are edge …

For a simple graph G, the generalized adjacency matrix A α (G) is defined as A α (G)= α D
(G)+(1− α) A (G), α∈[0, 1], where A (G) is the adjacency matrix and D (G) is the diagonal …

For a simple graph with vertex set {v 1, v 2,…, vn} and degree sequence dvii= 1, 2,…, n, the
inverse sum indeg matrix (ISI matrix) A ISI (G)=(aij) of G is a square matrix of order n, where …

Let $ G_1\circledast G_2 $, $ G_1\sqcupdot G_2 $ and $ G_1\sqcupplus G_2 $ denote the
total corona, $ Q $-vertex corona and $ Q $-edge corona of two graphs $ G_1 $ and $ G_2 …

Let G be a graph with the adjacency matrix A (G), and let D (G) be the diagonal matrix of the
degrees of G. Nikiforov first defined the matrix A α (G) as A α (G)= α D (G)+(1− α) A (G), 0≤ …

Let $ G $ be a graph on $ p $ vertices with adjacency matrix $ A (G) $ and degree matrix $ D
(G) $. For each $\alpha\in [0, 1] $, the $ A_\alpha $-matrix is defined as $ A_\alpha …

The A7 matrix of a graph G is determined by A7 (G)=(1− 7) A (G)+ 7D (G), where 0≤ 7≤ 1, A
(G) and D (G) are the adjacency and the diagonal matrices of node degrees, respectively. In …

The unitary addition Cayley graph $ G_n $, $ n\in Z^+ $ is the graph whose vertex set is $
Z_n $, the ring of integers modulo $ n $ and two vertices $ u $ and $ v $ are adjacent if and …