Graph designs for eight graphs with six vertices and eight edges (index >1).
Landang YuanQingde KangPublished in: Ars Comb. (2008)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- adjacency matrix
- vertex set
- spanning tree
- query graph
- graph partitioning
- graph structure
- labeled graphs
- densely connected
- random graphs
- bipartite graph
- graph clustering
- real world graphs
- graph model
- shortest path
- directed acyclic graph
- minimum weight
- approximation algorithms
- minimum spanning tree
- graph mining
- graph databases
- subgraph isomorphism
- planar graphs
- average degree
- graph representation
- connected components
- graph properties
- index structure
- graph search
- dynamic graph
- graph theory
- data objects
- hamiltonian cycle
- spectral embedding
- connected graphs
- graph data
- maximal cliques
- graph structures
- social networks
- complex networks
- random walk