Journals / Communications in Advanced Mathematical Sciences / 2018 / Cilt: 1 - Sayı: 1

The sum of the largest and smallest signless laplacian eigenvalues and some Hamiltonian properties of graphs

Pages
65–66
Publication Date
2018-09-30
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

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 Key Takeaways

🎯
Objective & Hypothesis: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$.
📊
Key Findings & Data: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$.
💡
Conclusion & Impact: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.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Signless Laplacian Eigenvalues · Hamiltonian Properties

Abstract

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.

🔖

Cite This Article

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

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (2)

  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London and Elsevier, New York (1976)
  2. K. C. Das, Proof of conjectures involving the largest and the smallest signless Laplacian eigenvalues of graphs, Discrete Mathematics 312 (2012) 992 – 998.