Pages that link to "Item:Q1185083"
From MaRDI portal
The following pages link to On packing and covering numbers of graphs (Q1185083):
Displaying 18 items.
- Liar's dominating sets in graphs (Q335352) (← links)
- More on limited packings in graphs (Q782753) (← links)
- Packing in trees (Q1584274) (← links)
- Extremal values on Zagreb indices of trees with given distance \(k\)-domination number (Q1691326) (← links)
- An algorithm to find two distance domination parameters in a graph (Q1917347) (← links)
- Some new results on distance \(k\)-domination in graphs (Q2248720) (← links)
- Packing parameters in graphs (Q2259558) (← links)
- The probabilistic approach to limited packings in graphs (Q2341760) (← links)
- Distance domination in graphs with given minimum and maximum degree (Q2410104) (← links)
- A lower bound for the distance \(k\)-domination number of trees (Q2581114) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- UPPER BOUNDS ON THE LOWER OPEN PACKING NUMBER OF A TREE (Q4262044) (← links)
- The ratio of the distance irredundance and domination numbers of a graph (Q4277983) (← links)
- Extremal multiplicative Zagreb indices among trees with given distance k-domination number (Q5001524) (← links)
- Cartesian product graphs and k-tuple total domination (Q5086876) (← links)
- A note on the open packing number in graphs (Q5227166) (← links)
- Girth, minimum degree, independence, and broadcast independence (Q5242945) (← links)
- Independent domination versus packing in subcubic graphs (Q6611014) (← links)
