On the sum of the distance signless Laplacian eigenvalues of a graph and some inequalities involving them.
Abdollah AlhevazMaryam BaghipurEbrahim HashemiSomnath PaulPublished in: Discret. Math. Algorithms Appl. (2020)
Keyphrases
- laplacian matrix
- graph laplacian
- planar graphs
- adjacency matrix
- random walk
- graph structure
- eigenvalues and eigenvectors
- spectral methods
- absolute difference
- spectral clustering
- structured data
- spectral decomposition
- distance measure
- pseudo inverse
- bipartite graph
- weighted graph
- graph model
- graph representation
- low dimensional
- graph theory
- covariance matrix
- graph partitioning
- directed acyclic graph
- path length
- graph matching
- linear inequalities
- heat kernel
- pairwise
- clustering algorithm
- linear programming
- euclidean distance
- connected components
- distance matrix
- distance transform
- undirected graph
- spanning tree
- graph databases