Edge Distribution of Graphs with Few Copies of a Given Graph.
Vladimir NikiforovPublished in: Comb. Probab. Comput. (2006)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed graph
- graph theory
- adjacency matrix
- graph representation
- graph structure
- graph matching
- graph clustering
- graph theoretic
- graph partitioning
- graph databases
- spanning tree
- vertex set
- graph mining
- graph classification
- labeled graphs
- graph model
- graph theoretical
- degree distribution
- subgraph isomorphism
- bipartite graph
- power law
- strongly connected
- minimum spanning tree
- series parallel
- graph search
- graph properties
- random graphs
- densely connected
- graph structures
- shortest path
- disjoint paths
- graph transformation
- graph data
- structural pattern recognition
- directed acyclic graph
- evolving graphs
- dynamic graph
- reachability queries
- connected dominating set
- graph isomorphism
- directed edges
- probability distribution
- graph construction
- adjacency graph
- small world
- connected components
- planar graphs
- graph kernels
- random walk
- graph representations
- maximal cliques
- neighborhood graph
- finding the shortest path
- proximity graph
- maximum common subgraph
- random variables
- inexact graph matching
- connected graphs
- directed acyclic
- graph drawing
- social graphs
- real world graphs