Distance spectrum of the generalized lexicographic product of a graph with a family of regular graphs.
Fenglei TianXinlei WangDein WongPublished in: Ars Comb. (2018)
Keyphrases
- graph representation
- graph theory
- graph matching
- graph structure
- directed graph
- graph mining
- neighborhood graph
- weighted graph
- graph databases
- labeled graphs
- edge weights
- adjacency matrix
- graph theoretic
- graph construction
- graph model
- graph classification
- graph clustering
- graph structures
- graph properties
- graph theoretical
- bipartite graph
- graph search
- undirected graph
- graph partitioning
- graph isomorphism
- random graphs
- directed acyclic
- subgraph isomorphism
- series parallel
- dense subgraphs
- structural pattern recognition
- graph kernels
- graph data
- reachability queries
- dynamic graph
- distance measure
- social graphs
- spanning tree
- evolving graphs
- graph representations
- graph transformation
- breadth first search
- graph drawing
- random walk
- graph layout
- attributed graphs
- maximum common subgraph
- maximum cardinality
- finding the shortest path
- web graph
- maximum clique
- planar graphs
- connected graphs
- proximity graph
- minimum spanning tree
- massive graphs
- frequent subgraphs
- bounded treewidth
- inexact graph matching
- community discovery
- real world graphs
- adjacency graph
- maximal cliques
- graph patterns
- shortest path
- query graph
- association graph
- topological information
- graph embedding
- equivalence class
- edit distance
- connected components
- pattern mining
- structured data
- connected dominating set