Spectral characterization of the complete graph removing a path: Completing the proof of Cámara-Haemers Conjecture.
Muhuo LiuXiaofeng GuPublished in: Discret. Math. (2021)
Keyphrases
- spectral decomposition
- solution path
- spectral methods
- normalized cut
- graph representation
- random walk
- pairwise
- laplacian matrix
- theorem prover
- spectral analysis
- shortest path problem
- hamiltonian path
- graph theoretic
- graph structure
- weighted graph
- shortest path
- edge weights
- theorem proving
- graph clustering
- provably correct
- graph laplacian
- structured data
- connected components
- graph based algorithm
- strongly connected
- undirected graph
- graph construction
- directed acyclic graph
- graph model
- graph databases