On a conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs [PDF]
Discrete Mathematics Letters, 2020 Enkhbayar Azjargal +2 more
doaj
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 +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 +2 more sources
On the Ky Fan norm of the signless Laplacian matrix of a graph
Computational and Applied Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Pirzada +3 more
openaire +2 more sources
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.
Li, Shuchao, Zhang, Li
openaire +2 more sources
On Determinant of Laplacian Matrix and Signless Laplacian Matrix of a Simple Graph
, 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 +1 more
openaire +2 more sources
Graphs and Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Huiqiu, Hong, Yuan, Shu, Jinlong
openaire +3 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. +3 more
openaire +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, Li Zhang
openaire +2 more sources
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 +3 more
openaire +2 more sources