Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Siddiqui Merajuddin"'
Publikováno v:
Transactions on Combinatorics, Vol 12, Iss 4, Pp 217-225 (2023)
Let $G$ be a simple connected graph of order $n$ and size $m$. The matrix $L(G)=D(G)-A(G)$ is the Laplacian matrix of $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix, respectively. For the graph $G$, let $d_{1}\ge
Externí odkaz:
https://doaj.org/article/ef84531001d24309888fbf5305f9e9f1