The behavior of Wiener indices and polynomials of graphs under five graph decorations.
Weigen YanBo-Yin YangYeong-Nan YehPublished in: Appl. Math. Lett. (2007)
Keyphrases
- graph theory
- graph representation
- graph structure
- graph construction
- graph model
- weighted graph
- directed graph
- graph matching
- graph mining
- adjacency matrix
- series parallel
- graph theoretic
- graph clustering
- graph databases
- graph theoretical
- labeled graphs
- random graphs
- graph structures
- graph classification
- graph properties
- bipartite graph
- graph data
- graph isomorphism
- graph partitioning
- graph search
- graph kernels
- spanning tree
- dynamic graph
- structural pattern recognition
- connected graphs
- subgraph isomorphism
- random walk
- connected dominating set
- minimum spanning tree
- maximum common subgraph
- maximum independent set
- dense subgraphs
- topological information
- attributed graphs
- graph representations
- graph transformation
- community discovery
- reachability queries
- undirected graph
- real world graphs
- maximum clique
- adjacency graph
- graphical models
- maximal cliques
- bounded treewidth
- structured data
- dominating set
- graph drawing
- link analysis
- graph embedding
- connected components
- fully connected
- evolving graphs
- directed acyclic
- average degree
- social graphs
- small world
- web graph