A characterization of some distance-regular graphs by strongly closed subgraphs.
Akira HirakiPublished in: Eur. J. Comb. (2009)
Keyphrases
- graph mining
- graph databases
- subgraph isomorphism
- graph properties
- graph structures
- subgraph matching
- reachability queries
- labeled graphs
- maximum common subgraph
- graph matching
- connected subgraphs
- graph data
- pattern mining
- maximum clique
- subgraph mining
- frequent subgraph mining
- topological information
- dense subgraphs
- frequent subgraphs
- graph patterns
- distance measure
- euclidean distance
- maximal cliques
- query graph
- distance metric
- bipartite graph
- graph search
- quasi cliques
- functional modules
- association graph
- graph theoretic
- biological networks
- directed graph
- structured data
- distance function