Zobrazeno 1 - 10
of 208
pro vyhledávání: '"Ganie, Hilal A."'
Autor:
Altassan, Alaa1 (AUTHOR) aaltassan@kau.edu.sa, Ganie, Hilal A.2 (AUTHOR) hilahmad1119kt@gmail.com, Shang, Yilun3 (AUTHOR) hilahmad1119kt@gmail.com
Publikováno v:
Information (2078-2489). Oct2024, Vol. 15 Issue 10, p586. 17p.
Publikováno v:
In Heliyon 30 November 2024 10(22)
For a simple connected graph $G$ of order $n$ having distance Laplacian eigenvalues $ \rho^{L}_{1}\geq \rho^{L}_{2}\geq \cdots \geq \rho^{L}_{n}$, the distance Laplacian energy $DLE(G)$ is defined as $DLE(G)=\sum_{i=1}^{n}\left|\rho^{L}_i-\frac{2 W(G
Externí odkaz:
http://arxiv.org/abs/2112.02527
Autor:
Rather, Bilal A.1 (AUTHOR) bilalahmadrr@gmail.com, Ganie, Hilal A.2 (AUTHOR) hilahmad1119kt@gmail.com, Shang, Yilun3 (AUTHOR) yilun.shang@northumbria.ac.uk
Publikováno v:
Mathematics (2227-7390). Aug2024, Vol. 12 Issue 15, p2366. 23p.
For a simple graph $G$, the generalized adjacency matrix $A_{\alpha}(G)$ is defined as $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G), \alpha\in [0,1]$, where $A(G)$ is the adjacency matrix and $D(G)$ is the diagonal matrix of vertex degrees of $G$. This
Externí odkaz:
http://arxiv.org/abs/2110.12476
Publikováno v:
Carpathian Journal of Mathematics, 2023 Jan 01. 39(1), 213-230.
Externí odkaz:
https://www.jstor.org/stable/27178485
Let $A(G)$ be the adjacency matrix and $D(G)$ be the diagonal matrix of the vertex degrees of a simple connected graph $G$. Nikiforov defined the matrix $A_{\alpha}(G)$ of the convex combinations of $D(G)$ and $A(G)$ as $A_{\alpha}(G)=\alpha D(G)+(1-
Externí odkaz:
http://arxiv.org/abs/2005.01037
For a simple connected graph $G$, let $D(G)$, $Tr(G)$, $D^{L}(G)$ and $D^{Q}(G)$, respectively be the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix of a graph $G
Externí odkaz:
http://arxiv.org/abs/1907.09462