Results 181 to 190 of about 63,846 (213)
Some of the next articles are maybe not open access.
Signless Laplacians of finite graphs
The 2010 International Conference on Apperceiving Computing and Intelligence Analysis Proceeding, 2010We survey properties of spectra of signless Laplacain of graphs and discuss possibilities based on this matrix. In this paper, the eigen-value condition of Q(G), bounder of multiplicities of eigen-values, and several signless Laplacain eigenvector principles under some conditions, which are our results.
Bao Jiao, Yang Chun, Tianyong Qiang
openaire +1 more source
Matrix-Tree Theorem of digraphs via signless Laplacians
Linear Algebra and its Applications, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu Li +3 more
openaire +2 more sources
Discrete Mathematics, Algorithms and Applications, 2018
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex ...
Alhevaz, Abdollah +2 more
openaire +1 more source
The distance signless Laplacian spectral radius of a connected graph [Formula: see text] is the largest eigenvalue of the distance signless Laplacian matrix of [Formula: see text], defined as [Formula: see text], where [Formula: see text] is the distance matrix of [Formula: see text] and [Formula: see text] is the diagonal matrix of vertex ...
Alhevaz, Abdollah +2 more
openaire +1 more source
The Signless Laplacian Spread of Power Graphs of Finite Groups
Ikonion journal of mathematicsGiven a finite group G, let P(G) denote the power graph of the group G. Let Q(G) denote the signless Laplacian matrix of a graph G. Moreover, let λ1 and λn denote the largest and smallest eigenvalues of Q(G).
Subarsha Banerjee
semanticscholar +1 more source
Laplacian and signless Laplacian Z-eigenvalues of uniform hypergraphs
Frontiers of Mathematics in China, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bu, Changjiang, Fan, Yamin, Zhou, Jiang
openaire +1 more source
Comparison of Different Properties of Graph Using Adjacency Matrix and Signless Laplacian Matix
International Journal of Scientific Research in Science Engineering and TechnologyThis study highlights the advantages of using the Signless Laplacian spectrum over the traditional Adjacency matrix spectrum for graph representation.
Km. Priti Sahrawat, Dr. Ashish Kumar
semanticscholar +1 more source
Maximum signless Laplacian Estrada index of tetracyclic graphs
FilomatIn this study, we aim to determine the unique tetracyclic graph that maximizes the signless Laplacian Estrada index (SLEE) among all tetracyclic graphs. The SLEE of a graph ?
Palaniyappan Nithya +3 more
semanticscholar +1 more source
Linear and multilinear algebra
Let G be a multidigraph without self-loops. The complex Laplacian matrix of G, denoted by $ {L_{\mathbb {C}}}(G) $ LC(G), is defined in Barik et al. [On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs.
S. Barik, Sane Umesh Reddy
semanticscholar +1 more source
Let G be a multidigraph without self-loops. The complex Laplacian matrix of G, denoted by $ {L_{\mathbb {C}}}(G) $ LC(G), is defined in Barik et al. [On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs.
S. Barik, Sane Umesh Reddy
semanticscholar +1 more source
On the Energy and Spread of the Adjacency, Laplacian and Signless Laplacian Matrices of Graphs
Match-communications in Mathematical and in Computer ChemistryIn this paper, we explore the connection between the energy and spread of the adjacency, Laplacian, and signless Laplacian matrices for graphs. We then introduce new limitations for the energy and spread of these matrices, based on previous research and ...
K. Das, A. Ghalavand, Mostafa Tavakoli
semanticscholar +1 more source
On the eigenvalues of the distance signless Laplacian matrix of graphs
Proyecciones (Antofagasta)Let G be a connected graph and let DQ(G) be the distance signless Laplacian matrix of G with eigenvalues ρ1≥ ρ2≥…≥ ρn. The spread of the matrix DQ}(G) is defined as s(DQ(G)) := maxi,j| ρi-ρj| = ρ1- ρn.
A. Jahanbani +3 more
semanticscholar +1 more source