On graphs containing a given graph as center.
Fred BuckleyZevi MillerPeter J. SlaterPublished in: J. Graph Theory (1981)
Keyphrases
- graph theory
- graph representation
- graph databases
- weighted graph
- graph structure
- adjacency matrix
- graph construction
- labeled graphs
- graph model
- directed graph
- graph theoretical
- graph matching
- graph structures
- graph theoretic
- graph classification
- graph mining
- subgraph isomorphism
- graph data
- undirected graph
- graph search
- graph clustering
- random graphs
- graph representations
- spanning tree
- graph properties
- graph partitioning
- bipartite graph
- series parallel
- dynamic graph
- graph kernels
- edge weights
- graph transformation
- maximum common subgraph
- graph isomorphism
- minimum spanning tree
- structural pattern recognition
- maximum clique
- independent set
- evolving graphs
- inexact graph matching
- disk resident
- directed acyclic
- adjacency graph
- social graphs
- densely connected
- graph drawing
- reachability queries
- attributed graphs
- structured data
- graph patterns
- topological information
- polynomial time complexity
- graph edit distance
- neighborhood graph
- proximity graph
- dense subgraphs
- finding the shortest path
- maximal cliques
- graph layout
- planar graphs
- maximum cardinality
- massive graphs
- connected graphs
- maximum independent set
- attributed relational graph
- random walk
- vertex set
- association graph
- community discovery
- frequent subgraphs
- fully connected
- small world
- web graph
- directed acyclic graph
- connected components
- real world graphs
- hyper graph
- query graph
- graph embedding
- pattern mining
- np complete
- connected dominating set