Pages that link to "Item:Q3812287"
From MaRDI portal
The following pages link to An upper bound on the domination number of a graph. (Q3812287):
Displaying 14 items.
- Upper bounds on the balanced \(\langle \mathbf{r}, \mathbf{s} \rangle\)-domination number of a graph (Q477351) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Estimations for the domination number of a graph (Q912870) (← links)
- Tight upper bounds for the domination numbers of graphs with given order and minimum degree (Q1378519) (← links)
- On upper domination Ramsey numbers for graphs. (Q1421516) (← links)
- Upper bounds for the \(k\)-subdomination number of graphs (Q1598803) (← links)
- Upper majority domination number of a graph (Q1683554) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- Learning bounds via sample width for classifiers on finite metric spaces (Q2440828) (← links)
- BOUNDS ON THE DOMINATION NUMBER OF A GRAPH (Q3353049) (← links)
- A NEW UPPER BOUND FOR THE DOMINATION NUMBER OF A GRAPH (Q3677800) (← links)
- An upper bound for thek-domination number of a graph (Q3815347) (← links)
- (Q4681990) (← links)
- Upper eccentric domination in graphs (Q5036687) (← links)