Results 11 to 20 of about 1,705,971 (292)
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 +4 more sources
Interlacing Properties of Eigenvalues of Laplacian and Net-Laplacian Matrix of Signed Graphs [PDF]
, 2023 This paper explores interlacing inequalities in the Laplacian spectrum of signed cycles and investigates interlacing relationship between the spectrum of the net-Laplacian of a signed graph and its subgraph formed by removing a vertex together with its incident edges.
Guragain, Satyam, Srivastava, Ravi
openaire +3 more sources
On the Adjacency, Laplacian, and Signless Laplacian Spectrum of Coalescence of Complete Graphs [PDF]
Journal of Mathematics, 2016 Coalescence as one of the operations on a pair of graphs is significant due to its simple form of chromatic polynomial. The adjacency matrix, Laplacian matrix, and signless Laplacian matrix are common matrices usually considered for discussion under ...
S. R. Jog, Raju Kotambari
doaj +2 more sources
A bound for the permanent of the Laplacian matrix
Linear Algebra and its Applications, 1986 Let L(G) be D-A where D is the diagonal matrix of vertex degrees and A the adjacency matrix. The author proves by an explicit formula that the permanent of L is at least 2(n-1)k where k, the complexity, is the number of spanning trees.
Bapat, R. B.
openaire +2 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
openaire +2 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
Acta Scientiarum: Technology, 2023 Spectral Graph theory has been utilized frequently in the field of Computer Vision and Pattern Recognition to address challenges in the field of Image Segmentation and Image Classification.
Subramaniam Usha +3 more
doaj +1 more source
Laplacian Matrix for Dimensionality Reduction and Clustering [PDF]
, 2020 Many problems in machine learning can be expressed by means of a graph with nodes representing training samples and edges representing the relationship between samples in terms of similarity, temporal proximity, or label information. Graphs can in turn be represented by matrices. A special example is the Laplacian matrix, which allows us to assign each
Laurenz Wiskott, Fabian Schönfeld
openaire +3 more sources
Computing the Permanent of the Laplacian Matrices of Nonbipartite Graphs
Journal of Mathematics, 2021 Let G be a graph with Laplacian matrix LG. Denote by per LG the permanent of LG. In this study, we investigate the problem of computing the permanent of the Laplacian matrix of nonbipartite graphs.
Xiaoxue Hu, Grace Kalaso
doaj +1 more source
Chromatic number and signless Laplacian spectral radius of graphs [PDF]
Transactions on Combinatorics, 2022 For any simple graph $G$, the signless Laplacian matrix of $G$ is defined as $D(G)+A(G)$, where $D(G)$ and $A(G)$ are the diagonal matrix of vertex degrees and the adjacency matrix of $G$, respectively.
Mohammad Reza Oboudi
doaj +1 more source