Decomposition of lambda-fold complete graphs into a certain five-vertex graph.
Qiang LiYanxun ChangPublished in: Australas. J Comb. (2004)
Keyphrases
- labeled graphs
- undirected graph
- directed graph
- edge weights
- attributed graphs
- maximum cardinality
- graph representation
- weighted graph
- structural learning
- hamiltonian cycle
- graph theory
- vertex set
- graph structure
- bipartite graph
- minimum weight
- graph matching
- graph construction
- graph mining
- graph databases
- adjacency matrix
- graph classification
- graph kernels
- graph clustering
- average degree
- connected subgraphs
- spanning tree
- directed acyclic graph
- graph structures
- betweenness centrality
- graph search
- graph model
- random graphs
- graph properties
- strongly connected
- graph theoretical
- subgraph isomorphism
- graph data
- graph isomorphism
- graph theoretic
- approximation algorithms
- tree decomposition
- graph transformation
- reachability queries
- random walk
- query graph
- inexact graph matching
- graph drawing
- real world graphs
- graph partitioning
- graph embedding
- connected graphs
- strongly connected components
- social graphs
- directed acyclic
- graph representations
- series parallel
- graph patterns
- minimum spanning tree
- minimum cost
- connected components
- finding the shortest path
- social networks
- connected dominating set
- structural pattern recognition
- graph layout
- dynamic graph
- community discovery
- structured data
- graphical models