On Orderings of Some Graphs by the Extreme Roots of their Graph Polynomials.
Haizhen RenPublished in: CIS (1) (2009)
Keyphrases
- graph representation
- graph structure
- graph theory
- graph matching
- weighted graph
- directed graph
- labeled graphs
- graph databases
- graph mining
- graph clustering
- graph construction
- graph classification
- graph structures
- graph model
- adjacency matrix
- graph theoretical
- graph data
- graph theoretic
- random graphs
- graph isomorphism
- series parallel
- graph search
- dynamic graph
- graph partitioning
- undirected graph
- subgraph isomorphism
- bipartite graph
- graph properties
- maximum common subgraph
- structural pattern recognition
- average degree
- graph transformation
- reachability queries
- maximum clique
- finding the shortest path
- graph edit distance
- connected graphs
- directed acyclic
- disk resident
- dense subgraphs
- structured data
- minimum spanning tree
- graph representations
- spanning tree
- graph layout
- graph drawing
- web graph
- inexact graph matching
- connected components
- graph kernels
- evolving graphs
- social graphs
- real world graphs
- hyper graph
- maximum independent set
- planar graphs
- random walk
- topological information
- attributed graphs
- spectral decomposition
- edge weights
- connected dominating set
- densely connected
- frequent subgraphs
- graph embedding
- community discovery
- query graph
- small world
- graph patterns
- quasi cliques
- relational graph
- maximum cardinality
- relational structures
- pattern mining
- association graph