Results 71 to 80 of about 68,836 (161)
Maximality of the signless Laplacian energy
Discrete Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lucélia Kowalski Pinheiro +1 more
openaire +2 more sources
Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Haemers, W.H., Omidi, G.R.
core +1 more source
IEEE AccessExploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza +3 more
semanticscholar +1 more source
On the Signless Laplacian ABC-Spectral Properties of a Graph
MathematicsIn the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G. We give
B. Rather, H. A. Ganie, Y. Shang
semanticscholar +1 more source
Signless Laplacian spectral radius and Hamiltonicity
Linear Algebra and its Applications, 2010 For an \(n\) vertex of a graph \(G\), the matrix \(L^*(G)=D(G)+A(G)\) is the signless Laplacian matrix of \(G\), where \(D(G)\) is the diagonal matrix of vertex degrees and \(A(G)\) is the adjacency matrix of \(G\). Let \(\gamma(G)\) be the largest eigenvalue of \(L^*(G)\).
openaire +1 more source
H$^+$-Eigenvalues of Laplacian and Signless Laplacian Tensors
, 2013 We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors.
openaire +2 more sources
On the signless Laplacian spectra of k-trees
Linear Algebra and its Applications, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Minjie, Li, Shuchao
openaire +2 more sources
Some graphs determined by their (signless) Laplacian spectra [PDF]
Czechoslovak Mathematical Journal, 2012 Let \(A(G)\) be the adjacency matrix of a graph \(G\) and let \(D(G)\) be the diagonal matrix whose entries are the degrees of the vertices of \(G\) in the order corresponding to the matrix \(A\). Then \(L(G) = D(G) - A(G)\) is called the Laplacian of \(G\) and \(Q(G) = D(G) + A(G)\) is the signless Laplacian of \(G\).
openaire +2 more sources
Some sufficient conditions on hamilton graphs with toughness. [PDF]
Front Comput Neurosci, 2022 Cai G, Yu T, Xu H, Yu G.
europepmc +1 more source
Quantitative structure-properties relationship analysis of Eigen-value-based indices using COVID-19 drugs structure. [PDF]
Int J Quantum Chem, 2023 Rauf A, Naeem M, Hanif A.
europepmc +1 more source