Results 61 to 70 of about 42,138 (164)
Bipartite subgraphs and the signless Laplacian matrix [PDF]
, 2011 For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue.
Debdas Paul, Steve Kirkland
core +1 more source
On the construction of L-equienergetic graphs
AKCE International Journal of Graphs and Combinatorics, 2015 For a graph G with n vertices and m edges, and having Laplacian spectrum μ1,μ2,…,μn and signless Laplacian spectrum μ1+,μ2+,…,μn+, the Laplacian energy and signless Laplacian energy of G are respectively, defined as LE(G)=∑i=1n|μi−2mn| and LE+(G)=∑i=1n ...
S. Pirzada, Hilal A. Ganie
doaj +1 more source
Seidel Signless Laplacian Energy of Graphs [PDF]
Mathematics Interdisciplinary Research, 2017 Let S(G) be the Seidel matrix of a graph G of order n and let DS(G)=diag(n-1-2d1, n-1-2d2,..., n-1-2dn) be the diagonal matrix with d_i denoting the degree of a vertex v_i in G.
Harishchandra Ramane +3 more
doaj +1 more source
The smallest eigenvalue of the signless Laplacian
, 2011 Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied.
Nikiforov, Vladimir +7 more
core +1 more source
The maximum clique and the signless Laplacian eigenvalues [PDF]
Czechoslovak Mathematical Journal, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Jianping, Liu, Bolian
openaire +2 more sources
Spectral Characterizations of the Aα−‐Matrix for Graph Products
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.For α ∈ [0, 1], the matrix Aα−G=αDG+α−1AG defines a Laplacian–type operator associated with a graph G, interpolating between −A(G) and D(G). In this paper, we develop a systematic study of the Aα−‐spectrum under several classical graph products.
Zakeiah Alkhamisi +4 more
wiley +1 more source
Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra [PDF]
, 2010 A graph is said to be determined by its signless Laplacian spectrum if there is no other non-isomorphic graph with the same spectrum. In this paper, it is shown that each starlike tree with maximum degree 4 is determined by its signless Laplacian ...
Omidi, Gholam R. +2 more
core +1 more source
On Generalized Harary Eigenvalues and Generalized Join of Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this work, we further study the generalized Harary matrix of a connected graph G, which we denote by RDα(G). This matrix is defined as the convex combination RDα(G) = αRT(G) + (1 − α)RD(G), where 0 ≤ α ≤ 1. In this formulation, RD(G) refers to the classical Harary matrix, and RT(G) represents a diagonal matrix of reciprocal transmission degrees of G.
Abdollah Alhevaz +4 more
wiley +1 more source
Quantum search with the signless Laplacian
Physical Review A16 pages, 9 ...
Molly E. McLaughlin, Thomas G. Wong
openaire +2 more sources
Refined Lower Bounds for the Laplacian Estrada Index of Connected Graphs via the Two Largest Degrees
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let G be a graph with n vertices and Laplacian eigenvalues μ1, μ2, …, μn. The Laplacian Estrada index of G is defined as LEEG=eμ1+⋯+eμn. In this paper, using the Karush–Kuhn–Tucker optimization framework under inequality constraints, we establish new lower bounds for LEE(G) in terms of the two largest degrees of G.
Hamidreza Bamdad +3 more
wiley +1 more source