Results 51 to 60 of about 68,836 (161)
Signless laplacian spectral characterization of roses
Kuwait Journal of Science, 2020 A p-rose graph Γ = RG(a3, a4, . . . , as) is a graph consisting of p =a3 + a4 + · · · + as ≥ 2 cycles that all meet in one vertex, and ai (3 ≤ i ≤ s) is the number of cycles in Γ of length i. A graph G is said to be DLS (resp., DQS) if it is determined by the spectrum of its Laplacian (resp. signless Laplacian) matrix, i. e.
Brunetti M, Ashrafi A R, Abdian A Z
openaire +2 more sources
Signless Laplacians of finite graphs
Linear Algebra and its Applications, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cvetkovic, Dragos +2 more
openaire +3 more sources
Journal of Mathematics, Volume 2025, Issue 1, 2025.This study investigates the spectral and topological properties of rounded knot networks K2n, a helical extension of phenylene quadrilateral structures, through signless Laplacian spectral analysis. Motivated by the need to understand how helical topology influences network dynamics and robustness, we derive exact analytical expressions for three key ...
Fareeha Hanif +3 more
wiley +1 more source
Bicyclic graphs with exactly two main signless Laplacian eigenvalues [PDF]
, 2013 A signless Laplacian eigenvalue of a graph $G$ is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero.
Deng, Hanyuan, Huang, He
core
, 2015 Let $\mathcal{A(}G\mathcal{)},\mathcal{L(}G\mathcal{)}$ and $\mathcal{Q(}% G\mathcal{)}$ be the adjacency tensor, Laplacian tensor and signless Laplacian tensor of uniform hypergraph $G$, respectively.
Qi, Liqun, Shao, Jiayu, Yuan, Xiying
core +1 more source
On the spread of the distance signless Laplacian matrix of a graph
Acta Universitatis Sapientiae: Informatica, 2023 Let G be a connected graph with n vertices, m edges. The distance signless Laplacian matrix DQ(G) is defined as DQ(G) = Diag(Tr(G)) + D(G), where Diag(Tr(G)) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix of G.
S. Pirzada, M. Abrar, Ul Haq
semanticscholar +1 more source
Distance (Signless) Laplacian Eigenvalues of $k$-uniform Hypergraphs
Taiwanese Journal of Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Xiangxiang, Wang, Ligong
openaire +1 more source
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
A graph theoretical approach to states and unitary operations
, 2016 Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian matrix, what ...
Adhikari, Bibhas +2 more
core +1 more source
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