Results 131 to 140 of about 110,880 (163)
Sum of the k Largest Signless Laplacian Eigenvalues
Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, 2018 Guilherme Porto, Vilmar Trevisan
openaire +2 more sources
On Zagreb Index, Signless Laplacian Eigenvalues and Signless Laplacian Energy of a Graph
Computational and Applied Mathematics, 2023 13
Shariefuddin Pirzada, Saleem Khan
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Multiplicity of the Least Signless Laplacian Eigenvalue of a Graph
Discrete Mathematics, 2022Given an \(n\)-vertex connected simple graph \(G,\) let \(A(G),\, D(G)\) be the adjacency matrix and degree diagonal matrix of \(G\), respectively. Then \(Q(G)=D(G)+A(G)\) is the well-known signless Laplacian matrix of \(G\). The eigenvalues of \(Q(G)\) are called the \(Q\)-eigenvalues of \(G\).
Fenglei Tian, Shu-Guang Guo
exaly +3 more sources
The Maximum Clique and the Signless Laplacian Eigenvalues [PDF]
Czechoslovak Mathematical Journal, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bolian Liu
exaly +3 more sources
Distance (Signless) Laplacian Eigenvalues of k-Uniform Hypergraphs
Taiwanese Journal of Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ligong Wang, Xiangxiang Liu
exaly +2 more sources
A Note on the Sum of the Largest Signless Laplacian Eigenvalues
Electronic Notes in Discrete Mathematics, 2016 Abstract Let G be a graph with n vertices and e ( G ) edges. The signless Laplacian of G, denoted by Q ( G ) , is given by Q ( G ) = D ( G ) + A ( G ) , where D ( G ) and A ( G ) are the diagonal matrix of its vertex degree and A ( G ) is the adjacency matrix. Let q 1 ( G ) ,
Nair Maria Maia de Abreu +2 more
exaly +3 more sources
On the Sum of the Powers of Distance Signless Laplacian Eigenvalues of Graphs
Indian Journal of Pure and Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdollah Alhevaz +2 more
exaly +2 more sources
Bounds on Signless Laplacian Eigenvalues of Hamiltonian Graphs
Bulletin of the Brazilian Mathematical Society, New Series, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Milica Anđelić +2 more
openaire +1 more source
Some Results on the Bounds of Signless Laplacian Eigenvalues
Bulletin of the Malaysian Mathematical Sciences Society, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Shuchao, Tian, Yi
openaire +1 more source
On the smallest signless Laplacian eigenvalue of graphs
Linear Algebra and its Applications, 2022Let \(G\) be a graph, and let \(D\) be the diagonal matrix of the vertex degrees. Let \(A\) be the adjacency matrix of \(G\). The matrix \(Q:=D+A\) is called the signless Laplacian of \(G\): like the more usual Laplacian \(L:=D-A\), \(Q\) is a positive semi-definite, real symmetric matrix, but it has different spectral features: among other things, its
openaire +2 more sources