Perfect T(G)-triple system for each graph G with five vertices and seven edges.
Yanli ZhangQingde KangYingtao HouPublished in: Ars Comb. (2013)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- minimum weight
- maximum matching
- graph structure
- adjacency matrix
- bipartite graph
- graph model
- directed acyclic graph
- minimum spanning tree
- shortest path
- random graphs
- graph clustering
- hamiltonian cycle
- strongly connected
- labeled graphs
- approximation algorithms
- densely connected
- graph partitioning
- social networks
- connected components
- graph structures
- graph representation
- minimum cost
- phase transition
- edge detector
- average degree
- complex networks
- connected subgraphs
- random walk