Results 11 to 20 of about 1,618,968 (159)
On the spectral radius and energy of signless Laplacian matrix of digraphs [PDF]
Heliyon, 2022 Let D be a digraph of order n and with a arcs. The signless Laplacian matrix Q(D) of D is defined as Q(D)=Deg(D)+A(D), where A(D) is the adjacency matrix and Deg(D) is the diagonal matrix of vertex out-degrees of D.
Hilal A. Ganie, Yilun Shang
doaj +9 more sources
The signless Laplacian matrix of hypergraphs [PDF]
Special Matrices, 2022 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 ...
Cardoso Kauê, Trevisan Vilmar
doaj +5 more sources
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs [PDF]
Theory and Applications of Graphs, 2023 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 α.
Omar Alomari +2 more
doaj +5 more sources
Journal of Mathematics, 2021 Let G be a graph with n vertices, and let LG and QG denote the Laplacian matrix and signless Laplacian matrix, respectively. The Laplacian (respectively, signless Laplacian) permanental polynomial of G is defined as the permanent of the characteristic ...
Tingzeng Wu, Tian Zhou
doaj +3 more sources
On Distance Signless Laplacian Spectral Radius and Distance Signless Laplacian Energy
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.
Luis Medina, Hans Nina, Macarena Trigo
doaj +4 more sources
Inequalities for Distance Signless Laplacian Matrix Under Minimum-Degree Constraints
Journal of MathematicsFor a connected graph G of order n, let DG denote its distance matrix and let TrG be the diagonal matrix formed by the vertex transmissions. The distance signless Laplacian of G is defined by DQ=DG+TrG.
Mohd Abrar Ul Haq, S. Pirzada, Y. Shang
doaj +3 more sources
Bipartite subgraphs and the signless Laplacian matrix [PDF]
Applicable Analysis and Discrete Mathematics, 2011 For a connected graph G, we derive tight inequalities relating the smallest signless Laplacian eigenvalue to the largest normalized Laplacian eigenvalue. We investigate how vectors yielding small values of the Rayleigh quotient for the signless Laplacian matrix can be used to identify bipartite subgraphs.
Steve Kirkland, Debdas Paul
openaire +3 more sources
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +2 more sources
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
doaj +3 more sources
Some bounds on spectral radius of signless Laplacian matrix of k-graphs
RAIRO - Operations Research, 2023 For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signless Laplacian matrix, and this name comes from the fact that Q(H) is exactly the well-known signless Laplacian matrix for 2-graph. Define the largest eigenvalue ρ(H) of Q(H) as the spectral radius of H.
Junhao Zhang, Zhongxun Zhu
openaire +3 more sources