Results 1 to 10 of about 1,304 (147)
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 +7 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
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 +6 more sources
The spectral radius of signless Laplacian matrix and sum-connectivity index of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 The sum-connectivity index of a graph G is defined as the sum of weights [Formula: see text] over all edges uv of G, where du and dv are the degrees of the vertices u and v in G, respectively.
A. Jahanbani, S. M. Sheikholeslami
doaj +3 more sources
Signless Laplacian energy of a first KCD matrix [PDF]
Acta Universitatis Sapientiae, Informatica, 2022 Abstract The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.
Mirajkar Keerthi G., Morajkar Akshata
openaire +3 more sources
Principal eigenvector of the signless Laplacian matrix [PDF]
Computational and Applied Mathematics, 2021 In this paper, we study the entries of the principal eigenvector of the signless Laplacian matrix of a hypergraph. More precisely, we obtain bounds for this entries. These bounds are computed trough other important parameters, such as spectral radius, maximum and minimum degree.
Kauê Cardoso
openaire +4 more sources
On the spread of the distance signless Laplacian matrix of a graph [PDF]
Acta Universitatis Sapientiae, Informatica, 2023 Abstract Let G be a connected graph with n vertices, m edges. The distance signless Laplacian matrix DQ(G) is defined as DQ(G) = Diag(Tr(G)) + D(G), where Diag(Tr(G)) is the diagonal matrix of vertex transmissions and D(G) is the distance matrix of G.
Pirzada S., Haq Mohd Abrar Ul
openaire +4 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 +3 more
openaire +4 more sources
An analog of Matrix Tree Theorem for signless Laplacians [PDF]
Linear Algebra and its Applications, 2019 A spanning tree of a graph is a connected subgraph on all vertices with the minimum number of edges. The number of spanning trees in a graph $G$ is given by Matrix Tree Theorem in terms of principal minors of Laplacian matrix of $G$. We show a similar combinatorial interpretation for principal minors of signless Laplacian $Q$.
Keivan Hassani Monfared, Sudipta Mallik
openaire +5 more sources
Some bounds on spectral radius of signless Laplacian matrix of k-graphs [PDF]
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.
Zhang, Junhao, Zhu, Zhongxun
openaire +2 more sources