A note on independent vertex-edge domination in graphs.
Xue-Gang ChenKai YinTing GaoPublished in: Discret. Optim. (2017)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- directed acyclic graph
- spanning tree
- approximation algorithms
- hamiltonian cycle
- minimum spanning trees
- labeled graphs
- bipartite graph
- complex networks
- graph theoretic
- graph structure
- connected components
- minimum cost
- attributed graphs
- edge detection
- minimum weight
- random graphs
- edge information
- subgraph isomorphism
- graph clustering
- graph matching
- data sets
- average degree
- maximum cardinality
- connected subgraphs
- adjacency graph
- strongly connected
- minimum spanning tree
- shortest path
- knn