Results 81 to 90 of about 42,138 (164)
On some forests determined by their Laplacian or signless Laplacian spectrum
Computers & Mathematics with Applications, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Slobodan K. Simic, Zoran Stanic
openaire +3 more sources
International Journal of Quantum Chemistry, Volume 124, Issue 11, June 5, 2024.Molecular structures. Abstract Malaria has a wide impact on the healthcare system, affecting everyone from hyperendemic areas who dearth access to medical treatment to international tourists returning to nonendemic regions with tertiary referral care. Implementing timely and accurate diagnosis is necessary to stop malaria's growing global effect, which
Nadeem ul Hassan Awan +5 more
wiley +1 more source
AKCE International Journal of Graphs and Combinatorics, 2020 A graph is said to be borderenergetic (-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph .
Qingyun Tao, Yaoping Hou
doaj +1 more source
Nordhaus-Gaddum Type Inequalities for Laplacian and Signless Laplacian Eigenvalues [PDF]
The Electronic Journal of Combinatorics, 2014 Let $G$ be a graph with $n$ vertices. We denote the largest signless Laplacian eigenvalue of $G$ by $q_1(G)$ and Laplacian eigenvalues of $G$ by $\mu_1(G)\ge\cdots\ge\mu_{n-1}(G)\ge\mu_n(G)=0$. It is a conjecture on Laplacian spread of graphs that $\mu_1(G)-\mu_{n-1}(G)\le n-1$ or equivalently $\mu_1(G)+\mu_1(\overline G)\le2n-1$.
F. Ashraf, Behruz Tayfeh-Rezaie
openaire +4 more sources
Mathematische Nachrichten, Volume 297, Issue 5, Page 1749-1771, May 2024.Abstract Landscape functions are a popular tool used to provide upper bounds for eigenvectors of Schrödinger operators on domains. We review some known results obtained in the last 10 years, unify several approaches used to achieve such bounds, and extend their scope to a large class of linear and nonlinear operators. We also use landscape functions to
Delio Mugnolo
wiley +1 more source
Signless Laplacian eigenvalues and circumference of graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jianfeng Wang 0002, Francesco Belardo
openaire +5 more sources
Distance Spectra of Some Double Join Operations of Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2024, Issue 1, 2024.In literature, several types of join operations of two graphs based on subdivision graph, Q‐graph, R‐graph, and total graph have been introduced, and their spectral properties have been studied. In this paper, we introduce a new double join operation based on (H1, H2)‐merged subdivision graph.
B. J. Manjunatha +4 more
wiley +1 more source
On maximum signless Laplacian Estrada index of graphs with given parameters II
Electronic Journal of Graph Theory and Applications, 2018 The signless Laplacian Estrada index of a graph G is defined as SLEE(G) = ∑ni = 1eqi where q1, q2, …, qn are the eigenvalues of the signless Laplacian matrix of G.
Ramin Nasiri +3 more
doaj +1 more source
Bounds on the index of the signless Laplacian of a graph
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carla Silva Oliveira +3 more
openaire +2 more sources
The signless Laplacian spectral radii of modified graphs [PDF]
, 2013 In this paper, various modications of a connected graph G are regarded as perturbations of its signless Laplacian matrix. Several results concerning the resulting changes to the signless Laplacian spectral radius of G are obtained by solving ...
Li, Jianxi, Guo, Ji-Ming
core