Coverings of a complete graph with five-vertex and five-edge graphs.
Salvatore MiliciPublished in: Discret. Math. (2004)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- vertex set
- directed graph
- labeled graphs
- spanning tree
- minimum weight
- directed acyclic graph
- bipartite graph
- graph structure
- strongly connected
- adjacency matrix
- disjoint paths
- random graphs
- approximation algorithms
- graph clustering
- graph structures
- graph construction
- graph partitioning
- graph theory
- connected components
- average degree
- maximum cardinality
- minimum spanning tree
- complex networks
- graph model
- random walk
- shortest path
- graph matching
- attributed graphs
- hamiltonian cycle
- minimum cost
- graph theoretical
- connected subgraphs
- rough sets
- graph representation
- graph kernels
- series parallel
- graph properties
- graph theoretic
- dynamic graph