Results 131 to 140 of about 1,618,968 (159)

On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph

Lecture Notes in Computer Science, 2017
In a simple graph, Laplacian matrix and signless Laplacian matrix are derived from both adjacency matrix and degree matrix. Although, determinant of Laplacian matrix is always zero, yet we express it using only the adjacency matrix and square of its adjacency matrix.
Olayiwola Babarinsa, Hailiza Kamarulhaili   +1 more
exaly   +2 more sources

Permanental bounds for the signless Laplacian matrix of bipartite graphs and unicyclic graphs

Linear and Multilinear Algebra, 2011
Let G be a graph and let Q(G) be its signless Laplacian matrix. When G is a unicyclic (respectively, bipartite) graph we obtain sharp upper and lower bounds for the permanent of Q(G) in terms of the order of G. Improved bounds are obtained in terms of the given girth of G. In each of these cases, we characterize the extremal graphs.
Shuchao Li
exaly   +2 more sources

Matrix-Tree Theorem of digraphs via signless Laplacians

Linear Algebra and its Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu Li, Lu Lu, Jianfeng Wang, Weifang Wang   +3 more
openaire   +2 more sources

On the spectral radius of the adjacency matrix and signless Laplacian matrix of a graph

Linear and Multilinear Algebra, 2021
Let G be a simple graph of order n. The matrix S(G)=D(G)+A(G) is called the signless Laplacian matrix of G, where D(G) and A(G) denote the diagonal matrix of vertex degrees and the adjacency matrix...
A. Jahanbani, S.M. Sheikholeslami
openaire   +1 more source

On eigenvalues of the reciprocal distance signless Laplacian matrix of graphs

Asian-European Journal of Mathematics, 2021
For a simple connected graph [Formula: see text], the reciprocal transmission [Formula: see text] of a vertex [Formula: see text] is defined as [Formula: see text] The reciprocal distance signless Laplacian (briefly RDSL) matrix of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the Harary matrix ...
Abdollah Alhevaz, Maryam Baghipur, Yaser Alizadeh, Shariefuddin Pirzada   +3 more
openaire   +1 more source

Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph

Graphs and Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huiqiu Lin, Yuan Hong 0008, Jinlong Shu
openaire   +2 more sources

The $γ$-Signless Laplacian Adjacency Matrix of Mixed Graphs

2022
The $α$-Hermitian adjacency matrix $H_α$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number $α$. This enables us to define an incidence matrix of mixed graphs.
Alomari, Omar, Abudayah, Mohammad, Ghanem, Manal   +2 more
openaire   +1 more source

Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuchao Li, Li Zhang
openaire   +2 more sources

Bounds on the entries of the principal eigenvector of the distance signless Laplacian matrix

Linear Algebra and its Applications, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Das, Kinkar Ch., da Silva, Celso M. jun., Aguieiras A. de Freitas, Maria, Del-Vecchio, Renata R.   +3 more
openaire   +1 more source

Brouwer type conjecture for the eigenvalues of distance signless Laplacian matrix of a graph

Linear and Multilinear Algebra, 2019
AbstractLet G be a simple connected graph with n vertices, m edges and having distance signless Laplacian eigenvalues ρ1≥ρ2≥…≥ρn≥0.
A. Alhevaz, M. Baghipur, Hilal A. Ganie, S. Pirzada   +3 more
openaire   +1 more source