Results 11 to 20 of about 120,979 (218)
Hermitian Laplacian Matrix of Directed Graphs [PDF]
Jisuanji kexue, 2023 Laplacian matrix plays an important role in the research of undirected graphs.From its spectrum,some structure and properties of a graph can be deduced.Based on this,several efficient algorithms have been designed for relevant tasks in graphs,such as ...
LIU Kaiwen, HUANG Zengfeng
doaj +2 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 +4 more sources
On the Spectrum of Laplacian Matrix [PDF]
Mathematical Problems in Engineering, 2021 Let G be a simple graph of order n . The matrix ℒ
Akbar Jahanbani +2 more
openalex +3 more sources
Matrix-Tree Theorem of digraphs via signless Laplacians
Linear Algebra and its Applications, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shu Li +3 more
openalex +4 more sources
Laplacian matrix of power 3 mean graphs [PDF]
AIP Conference Proceedings, 2022 S. Sarasree, S. S. Sandhya
openalex +2 more sources
An analog of Matrix Tree Theorem for signless Laplacians [PDF]
Linear Algebra and its Applications, 2018 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
openalex +5 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.
openaire +2 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 +1 more source
LAPLACIAN MATRIX AND DISTANCE IN TREES
Kragujevac journal of mathematics, 2004 Laplacian matrix and distance in trees.
Damir Vukičević, İvan Gutman
openalex +3 more sources
Trees with matrix weights: Laplacian matrix and characteristic-like vertices
Linear Algebra and its Applications, 2022 It is known that there is an alternative characterization of characteristic vertices for trees with positive weights on their edges via Perron values and Perron branches. Moreover, the algebraic connectivity of a tree with positive edge weights can be expressed in terms of Perron value.
Swetha Ganesh, Sumit Mohanty
openaire +2 more sources