Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs.
Patrick HealyPublished in: CoDIT (2014)
Keyphrases
- graph mining
- graph databases
- graph isomorphism
- graph patterns
- subgraph mining
- graph theory
- planar graphs
- graph structures
- graph matching
- frequent subgraphs
- structured data
- graph structure
- subgraph isomorphism
- connected components
- directed graph
- graph model
- graph data
- spanning tree
- data structure
- upper bound
- lower bound