Results 11 to 20 of about 76,384 (242)
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
Normalized Laplacians for gain graphs
American Journal of Combinatorics, 2022 We propose the notion of normalized Laplacian matrix \(\mathcal{L}(\Phi)\) for a gain graph \(\Phi\) and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of \(\mathcal{L}(\Phi)\) and characterize the classes of graphs for which equality holds.
M. Rajesh Kannan +2 more
openaire +4 more sources
Mathematics, 2021 Unravelling how the human brain structure gives rise to function is a central question in neuroscience and remains partially answered. Recent studies show that the graph Laplacian of the human brain’s structural connectivity (SC) plays a dominant role in
Jichao Ma +3 more
doaj +1 more source
On Eccentricity Version of Laplacian Energy of a Graph [PDF]
Mathematics Interdisciplinary Research, 2017 The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian
Nilanjan De
doaj +1 more source
On net-Laplacian energy of signed graphs
Communications in Combinatorics and Optimization, 2017 A signed graph is a graph where the edges are assigned either positive or negative signs. Net degree of a signed graph is the difference between the number of positive and negative edges incident with a vertex. It is said to be net-regular if all its
Nutan G. Nayak
doaj +1 more source
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 +1 more source
Incremental eigenpair computation for graph Laplacian matrices: theory and applications [PDF]
, 2017 The smallest eigenvalues and the associated eigenvectors (i.e., eigenpairs) of a graph Laplacian matrix have been widely used for spectral clustering and community detection. However, in real-life applications, the number of clusters or communities (say,
Al Hasan, Mohammad +2 more
core +3 more sources
Indecomposable laplacian integral graphs
Linear Algebra and its Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grone, Robert, Merris, Russell
openaire +2 more sources
Kernels of Directed Graph Laplacians [PDF]
The Electronic Journal of Combinatorics, 2006 Let $G$ denote a directed graph with adjacency matrix $Q$ and in-degree matrix $D$. We consider the Kirchhoff matrix $L=D-Q$, sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when $G$ is undirected, the multiplicity of the eigenvalue 0 equals the number of connected components of $G$.
Caughman, John S., IV, Veerman, J. J. P.
openaire +2 more sources
Learning graph Laplacian with MCP
Optimization Methods and Software, 2023 32 ...
Yangjing Zhang +2 more
openaire +2 more sources