Using a result on the sum of the largest and smallest signless Laplacian eigenvalues obtained by Das in \cite{Das}, we in this note present sufficient conditions based on the sum of the largest and smallest signless Laplacian eigenvalues for some Hamiltonian properties of graphs.
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez: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$.
📊
Temel Bulgular & Veri: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$.
💡
Sonuç & Katkı:Using a result on the sum of the largest and smallest signless Laplacian eigenvalues obtained by Das in \cite{Das}, we in this note present sufficient conditions based on the sum of the largest and smallest signless Laplacian eigenvalues for 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 eigenvalues obtained by Das in \cite{Das}, we in this note present sufficient conditions based on the sum of the largest and smallest signless Laplacian eigenvalues for some Hamiltonian properties of graphs.
Lİ, R. (2018). The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs. Communications in Advanced Mathematical Sciences, Cilt: 1 - Sayı: 1, 65–66. https://ajindex.com/articles/748320
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York (1976)
K. C. Das, Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs, Discrete Mathematics 312 (2012) 992 – 998.