Pages that link to "Item:Q1003575"
From MaRDI portal
The following pages link to Upper bounds on the paired-domination number (Q1003575):
Displaying 21 items.
- Upper bounds on the paired domination subdivision number of a graph (Q354438) (← links)
- 2-distance paired-dominating number of graphs (Q489733) (← links)
- An upper bound on the paired-domination number in terms of the number of edges in the graph (Q710582) (← links)
- Graphs with large paired-domination number (Q867028) (← links)
- Paired-domination number of a graph and its complement (Q998404) (← links)
- Paired-domination in \(P_{5}\)-free graphs (Q1014817) (← links)
- An upper bound on conductors for pairs (Q1363092) (← links)
- Paired-domination in claw-free graphs with minimum degree at least three (Q1730243) (← links)
- Combinatorial bounds on paired and multiple domination in triangulations (Q1792065) (← links)
- Paired versus double domination in \(K_{1,r}\)-free graphs (Q2015806) (← links)
- Bounds on the paired domination number of graphs with minimum degree at least three (Q2060245) (← links)
- Graphs with maximum size and given paired-domination number (Q2449089) (← links)
- Upper bounds for the paired-domination numbers of graphs (Q2631089) (← links)
- Paired-domination in claw-free graphs (Q2637727) (← links)
- All graphs with paired-domination number two less than their order (Q2864651) (← links)
- Paired domination in graphs: a survey and recent results (Q2878211) (← links)
- A note on the upper bound for the paired-domination number of a graph with minimum degree at least two (Q3082598) (← links)
- Paired Domination in Graphs (Q3384606) (← links)
- The paired-domination and the upper paired-domination numbers of graphs (Q3459009) (← links)
- Paired-domination (Q4222381) (← links)
- Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula> (Q5346437) (← links)
