Graphs with unique minimum vertex-edge dominating sets.
B. SenthilkumarMustapha ChellaliH. Naresh KumarYanamandram B. VenkatakrishnanPublished in: RAIRO Oper. Res. (2023)
Keyphrases
- undirected graph
- spanning tree
- vertex set
- edge weights
- minimum cost
- directed graph
- weighted graph
- minimum spanning trees
- approximation algorithms
- minimum weight
- labeled graphs
- edge information
- strongly connected
- edge detection
- graph structure
- graph matching
- average degree
- minimum length
- attributed graphs
- clustering algorithm
- minimum spanning tree
- connected components
- complex networks
- neural network
- graph theoretic
- graph partitioning
- directed acyclic graph
- bipartite graph
- hamiltonian cycle
- np hard
- connected subgraphs