Universal Adjacency Matrices with Two Eigenvalues [PDF]
AMS Mathematics Subject Classification: 05C50.Adjacency matrix;Universal adjacency matrix;Laplacian matrix;signless Laplacian;Graph spectra;Eigenvalues;Strongly regular ...
Haemers, W.H., Omidi, G.R.
core +1 more source
Laplacian Matrix Based Spectral Graph Clustering
Recent attention in the research field of clustering is focused on grouping of clusters based on structure of a graph. At present, there are plentiful literature work has been proposed towards the clustering techniques but it is still an open challenge to find the best technique for clustering.
openaire +1 more source
Maximizing the smallest eigenvalue of grounded Laplacian matrix
For a connected graph $\mathcal{G}=(V,E)$ with $n$ nodes, $m$ edges, and Laplacian matrix $\boldsymbol{\mathit{L}}$, a grounded Laplacian matrix $\boldsymbol{\mathit{L}}(S)$ of $\mathcal{G}$ is a $(n-k) \times (n-k)$ principal submatrix of $\boldsymbol{\mathit{L}}$, obtained from $\boldsymbol{\mathit{L}}$ by deleting $k$ rows and columns corresponding ...
Xiaotian Zhou +3 more
openaire +3 more sources
Normalized Laplacian spectrum of some subdivision-joins and R-joins of two regular graphs
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, subdivision-edge join, R-vertex join, and R-edge join of two regular graphs in terms of the normalized Laplacian eigenvalues of the graphs.
Arpita Das, Pratima Panigrahi
doaj +1 more source
On the spectral radius and energy of signless Laplacian matrix of digraphs. [PDF]
Ganie HA, Shang Y.
europepmc +1 more source
A Sylvester-Kac matrix type and the Laplacian controllability of half graphs
Milica Anđelić +3 more
openalex +2 more sources
On the Signless Laplacian ABC-Spectral Properties of a Graph
In the paper, we introduce the signless Laplacian ABC-matrix Q̃(G)=D¯(G)+Ã(G), where D¯(G) is the diagonal matrix of ABC-degrees and Ã(G) is the ABC-matrix of G. The eigenvalues of the matrix Q̃(G) are the signless Laplacian ABC-eigenvalues of G.
Bilal A. Rather +2 more
doaj +1 more source
Robust joint clustering of multi-omics single-cell data via multi-modal high-order neighborhood Laplacian matrix optimization. [PDF]
Jiang H, Zhan S, Ching WK, Chen L.
europepmc +1 more source
A boosted outlier detection method based on the spectrum of the Laplacian matrix of a graph [PDF]
Nicolas Cofre
openalex +1 more source
On distance signless Laplacian spectrum and energy of graphs
The distance signless Laplacian spectral radius of a connected graph G is the largest eigenvalue of the distance signless Laplacian matrix of G, defined as DQ(G) = Tr(G) + D(G), where D(G) is the distance matrix of G and Tr(G) is the diagonal ...
Abdollah Alhevaz +2 more
doaj +1 more source

