Results 31 to 40 of about 13,572 (222)
The normalized distance Laplacian
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
Laplacian Matrix for Dimensionality Reduction and Clustering [PDF]
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
On graphs with a few distinct reciprocal distance Laplacian eigenvalues
For a $ \nu $-vertex connected graph $ \Gamma $, we consider the reciprocal distance Laplacian matrix defined as $ RD^L(\Gamma) = RT(\Gamma)-RD(\Gamma) $, i.e., $ RD^L(\Gamma) $ is the difference between the diagonal matrix of the reciprocal distance ...
Milica Anđelić +2 more
doaj +1 more source
More on Spectral Analysis of Signed Networks
Spectral graph theory plays a key role in analyzing the structure of social (signed) networks. In this paper we continue to study some properties of (normalized) Laplacian matrix of signed networks. Sufficient and necessary conditions for the singularity
Guihai Yu, Hui Qu
doaj +1 more source
A special class of triple starlike trees characterized by Laplacian spectrum
Two graphs are said to be cospectral with respect to the Laplacian matrix if they have the same Laplacian spectrum. A graph is said to be determined by the Laplacian spectrum if there is no other non-isomorphic graph with the same Laplacian spectrum.
10.3934/math.2021260 +4 more
doaj +1 more source
RECOGNITION OF HUMAN POSE FROM IMAGES BASED ON GRAPH SPECTRA [PDF]
Recognition of human pose is an actual problem in computer vision. To increase the reliability of the recognition it is proposed to use structured information in the form of graphs.
A. A. Zakharov +2 more
doaj +1 more source
Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga +2 more
doaj +1 more source
Hermitian Laplacian Matrix of Directed Graphs [PDF]
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
The permanent of the Laplacian matrix of a bipartite graph [PDF]
Lower bounds for the permanent of the Laplacian matrix L(G) of a bipartite graph G with v vertices and e edges are proved: per L(G)\(\geq 3e-v+1\), per L(G)\(\geq 2(2e-v+1)\). Equality is attained iff G is the star. The combinatorial nature of per L(G) is demonstrated at its expansion by means of a certain collection of subgraphs of G.
openaire +3 more sources
Approximations of the Generalized Inverse of the Graph Laplacian Matrix [PDF]
We devise methods for finding approximations of the generalized inverse of the graph Laplacian matrix, which arises in many graph-theoretic applications. Finding this matrix in its entirety involves solving a matrix inversion problem, which is resource-demanding in terms of consumed time and memory and hence impractical whenever the graph is relatively
BOZZO, Enrico, FRANCESCHET, Massimo
openaire +4 more sources

