The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs
The signless Laplacian eigenvalues of a graph $G$ are eigenvalues of the matrix $Q(G) = D(G) + A(G)$, where $D(G)$ is the diagonal matrix of the degrees of the vertices in $G$ and $A(G)$ is the adjacency matrix of $G$. Using a result on the sum of the largest and smallest signless Laplacian eigenval...
Furkejuvvon:
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Emrah Evren KARA
2018-09-01
|
| Ráidu: | Communications in Advanced Mathematical Sciences |
| Fáttát: | |
| Liŋkkat: | https://dergipark.org.tr/tr/download/article-file/544105 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|