Sharp upper bounds on the signless Laplacian spectral radius of strongly connected digraphs.
Ligong WangWeige XiPublished in: Discuss. Math. Graph Theory (2016)
Keyphrases
- strongly connected
- upper bound
- directed graph
- spectral decomposition
- lower bound
- undirected graph
- random walk
- upper and lower bounds
- laplacian matrix
- optimum path forest
- spectral analysis
- worst case
- spectral methods
- lower and upper bounds
- graph structure
- graph laplacian
- tight upper and lower bounds
- hyperspectral
- data structure
- np hard
- efficiently computable
- tight bounds
- directed acyclic graph
- equivalence classes
- generalization error
- complex networks
- shortest path
- sufficient conditions
- edge detection
- data streams