Results 11 to 20 of about 14,497 (259)
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
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
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 +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 +2 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
On graphs with distance Laplacian eigenvalues of multiplicity n−4
AKCE International Journal of Graphs and Combinatorics, 2023 Let G be a connected simple graph with n vertices. The distance Laplacian matrix [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the diagonal matrix of vertex transmissions and [Formula: see text] is the distance ...
Saleem Khan, S. Pirzada, A. Somasundaram
doaj +1 more source
Monophonic Distance Laplacian Energy of Transformation Graphs Sn^++-,Sn^{+-+},Sn^{+++}
Ratio Mathematica, 2023 Let $G$ be a simple connected graph of order $n$, $v_{i}$ its vertex. Let $\delta^{L}_{1}, \delta^{L}_{2}, \ldots, \delta^{L}_{n}$ be the eigenvalues of the distance Laplacian matrix $D^{L}$ of $G$. The distance Laplacian energy is denoted by $LE_{D}(G)$.
Diana R, Binu Selin T
doaj +1 more source
Sparse Graph Learning Under Laplacian-Related Constraints
IEEE Access, 2021 We consider the problem of learning a sparse undirected graph underlying a given set of multivariate data. We focus on graph Laplacian-related constraints on the sparse precision matrix that encodes conditional dependence between the random variables ...
Jitendra K. Tugnait
doaj +1 more source
The normalized distance Laplacian
Special Matrices, 2021 The distance matrix 𝒟(G) of a connected graph G is the matrix containing the pairwise distances between vertices. The transmission of a vertex vi in G is the sum of the distances from vi to all other vertices and T(G) is the diagonal matrix of ...
Reinhart Carolyn
doaj +1 more source