Graph designs for nine graphs with six vertices and nine edges.
Qingde KangHongtao ZhaoChunping MaPublished in: Ars Comb. (2008)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed graph
- directed edges
- adjacency matrix
- vertex set
- spanning tree
- labeled graphs
- graph structure
- bipartite graph
- graph model
- graph clustering
- graph partitioning
- random graphs
- minimum weight
- minimum spanning tree
- shortest path
- densely connected
- directed acyclic graph
- average degree
- approximation algorithms
- graph representation
- spectral embedding
- real world graphs
- minimum cost
- dense subgraphs
- complex networks
- hamiltonian cycle
- attributed graphs
- planar graphs
- strongly connected
- query graph
- subgraph isomorphism
- maximum cardinality
- graph matching
- graph theory
- graph theoretical
- graph structures
- graph mining
- massive graphs
- connected graphs
- graph databases