Results 1 to 10 of about 68,836 (161)

Quantum search with the signless Laplacian [PDF]

Physical Review A
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise in layered ...
Molly E. McLaughlin, Thomas G. Wong
semanticscholar   +3 more sources

On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy [PDF]

Mathematics, 2020
In this article, we find sharp lower bounds for the spectral radius of the distance signless Laplacian matrix of a simple undirected connected graph and we apply these results to obtain sharp upper bounds for the distance signless Laplacian energy graph. The graphs for which those bounds are attained are characterized.
Luis Medina, Hans Nina, Macarena Trigo
openaire   +4 more sources

Signless Laplacian energy aware decision making for electric car batteries based on intuitionistic fuzzy graphs. [PDF]

Sci Prog
Fuzzy graphs (FGs) contain dual-nature characteristics that may be extended to intuitionistic fuzzy graphs. These FGs are better at capturing ambiguity in situations in reality involving decision-making than FGs. In this paper, we address decision-making
Mohamed Atheeque A, Sharief Basha S.
europepmc   +2 more sources

Unifying adjacency, Laplacian, and signless Laplacian theories [PDF]

Ars Mathematica Contemporanea
Let $G$ be a simple graph with associated diagonal matrix of vertex degrees $D(G)$, adjacency matrix $A(G)$, Laplacian matrix $L(G)$ and signless Laplacian matrix $Q(G)$.
Aniruddha Samanta, Deepshikha, K. Das
semanticscholar   +4 more sources

On Normalized Signless Laplacian Resolvent Energy

Kragujevac Journal of Mathematics
. Let G be a simple connected graph with n vertices. Denote by L + ( G ) = D ( G ) − 1 / 2 Q ( G ) D ( G ) − 1 / 2 the normalized signless Laplacian matrix of graph G , where Q ( G ) and D ( G ) are the signless Laplacian and diagonal degree matrices of ...
S. Altindag, I. Milovanović, E. Milovanović, M. Matejic   +3 more
semanticscholar   +3 more sources

Signless Laplacian energy, distance Laplacian energy and distance signless Laplacian spectrum of unitary addition Cayley graphs [PDF]

Linear and Multilinear Algebra, 2021
In this paper we compute bounds for signless Laplacian energy, distance signless Laplacian eigenvalues and signless Laplacian energy of unitary addition Cayley graph G_{n}. We also obtain distance Laplacian eigenvalues and distance Laplacian energy of G_{n}.
P., Naveen, A. V, Chithra
openaire   +2 more sources

Signless normalized Laplacian for hypergraphs

Electronic Journal of Graph Theory and Applications, 2022
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized Laplacian for bipartite chemical hypergraphs.
Eleonora Andreotti, Raffaella Mulas
openaire   +4 more sources

The signless Laplacian matrix of hypergraphs

Special Matrices, 2022
Abstract In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph such as the maximum degree, diameter, and the chromatic number.
Cardoso Kauê, Trevisan Vilmar
openaire   +3 more sources

On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph

Computational and Applied Mathematics, 2023
13
S. Pirzada, Saleem Khan
openaire   +2 more sources

Signless Laplacian spectral radius of graphs without short cycles or long cycles [PDF]

Linear Algebra and its Applications, 2022
The signless Laplacian spectral radius of a graph $G$, denoted by $q(G)$, is the largest eigenvalue of its signless Laplacian matrix. In this paper, we investigate extremal signless Laplacian spectral radius for graphs without short cycles or long cycles.
Wenwen Chen, Bing Wang, M. Zhai
semanticscholar   +1 more source