Packings and coverings for four particular graphs each with six vertices and nine edges (λ = 1).
Qingde KangXiaoshan LiuHuixian JiaPublished in: Ars Comb. (2012)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- spanning tree
- vertex set
- densely connected
- adjacency matrix
- graph structure
- graph clustering
- maximum matching
- bipartite graph
- real world graphs
- minimum weight
- graph partitioning
- random graphs
- labeled graphs
- rough sets
- attributed graphs
- shortest path
- graph model
- connected components
- directed acyclic graph
- approximation algorithms
- average degree
- hamiltonian cycle
- data objects
- graph mining
- subgraph isomorphism
- random walk
- strongly connected
- connected subgraphs
- minimum spanning tree
- graph theoretic
- spectral embedding
- graph matching