Resistance distance-based graph invariants of subdivisions and triangulations of graphs.
Yujun YangDouglas J. KleinPublished in: Discret. Appl. Math. (2015)
Keyphrases
- graph representation
- graph structure
- graph matching
- directed graph
- labeled graphs
- graph construction
- graph theoretic
- graph theory
- graph databases
- graph mining
- graph classification
- graph clustering
- adjacency matrix
- graph model
- weighted graph
- graph theoretical
- graph data
- subgraph isomorphism
- graph properties
- graph search
- graph structures
- structural pattern recognition
- series parallel
- graph partitioning
- random graphs
- graph transformation
- graph isomorphism
- undirected graph
- spanning tree
- maximum cardinality
- graph kernels
- reachability queries
- maximum clique
- dense subgraphs
- frequent subgraphs
- edge weights
- planar graphs
- attributed graphs
- minimum spanning tree
- inexact graph matching
- maximum independent set
- random walk
- dynamic graph
- social graphs
- graph representations
- graph patterns
- distance measure
- topological information
- community discovery
- evolving graphs
- query graph
- neighborhood graph
- bipartite graph
- maximum common subgraph
- average degree
- structured data
- directed acyclic
- massive graphs
- finding the shortest path
- connected dominating set
- vertex set
- association graph
- maximal cliques
- web graph
- spectral decomposition
- graph drawing
- real world graphs
- graph layout
- bounded treewidth
- graph embedding
- connected graphs
- directed acyclic graph
- community detection
- connected components
- outlier detection