On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices.
Mingzhu ChenBo ZhouPublished in: Appl. Math. Comput. (2017)
Keyphrases
- fixed number
- spectral decomposition
- laplacian matrix
- adjacency matrix
- weighted graph
- labeled graphs
- random graphs
- undirected graph
- attributed graphs
- graph laplacian
- graph matching
- graph structures
- spectral methods
- planar graphs
- hamiltonian cycle
- average degree
- graph kernels
- finite number
- graph clustering
- partial ordering
- directed edges
- connected subgraphs
- graph representation
- graph structure
- directed graph
- spectral analysis
- heat kernel
- edge detection
- edge weights
- maximal cliques
- graph mining
- spectral clustering
- graph classification
- pattern mining
- shortest path
- random walk
- special case
- objective function