A sharp upper bound on the independent 2-rainbow domination in graphs with minimum degree at least two.
Rana KhoeilarMahla KeibariMustapha ChellaliSeyed Mahmoud SheikholeslamiPublished in: Comput. Sci. J. Moldova (2020)
Keyphrases
- upper bound
- lower bound
- constant factor
- spanning tree
- random graphs
- high quality
- lower and upper bounds
- worst case
- graph theoretic
- branch and bound algorithm
- graph matching
- branch and bound
- minimum distance
- minimum cost
- bipartite graph
- graph model
- data sets
- graph structure
- directed graph
- case study
- weighted graph
- error probability
- power law
- graph representation
- sample complexity
- search engine