The spectral radius of tricyclic graphs with n vertices and k pendant edges.
Miroslav PetrovicBojana BorovicaninPublished in: Ars Comb. (2008)
Keyphrases
- weighted graph
- undirected graph
- directed edges
- edge weights
- directed graph
- vertex set
- spanning tree
- random graphs
- adjacency matrix
- shortest path
- graph partitioning
- labeled graphs
- normalized cut
- graph structure
- graph model
- approximation algorithms
- minimum weight
- graph clustering
- minimum cost
- densely connected
- spectral methods
- spectral decomposition
- spectral analysis
- shortest distance
- real world graphs
- subgraph isomorphism
- directed acyclic graph
- random walk
- graph theoretic
- average degree
- attributed graphs
- hamiltonian cycle
- complex networks
- planar graphs
- maximal cliques
- graph mining
- hyperspectral images
- image segmentation
- circular arcs
- bipartite graph
- multispectral images
- graph matching
- edge detector
- connected components