Further results on packing related parameters in graphs
From MaRDI portal
Publication:2118231
DOI10.7151/dmgt.2262zbMath1485.05152OpenAlexW2994789798MaRDI QIDQ2118231
Doost Ali Mojdeh, Ismael González Yero, Babak Samadi
Publication date: 22 March 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2262
independence numberpacking numbertotal domination numberNordhaus-Gaddum inequalityopen packing number
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Some comments on the Slater number
- On domination number and distance in graphs
- Limited packings in graphs
- Relations between packing and covering numbers of a tree
- Roman domination in graphs.
- On the \(k\)-limited packing numbers in graphs
- Total and paired-domination numbers of a tree
- A survey of Nordhaus-Gaddum type relations
- Packing parameters in graphs
- Packing parameters in graphs: new bounds and a solution to an open problem
- On Complementary Graphs
- Total domination in graphs
- On Open Packing Number of Graphs
- Total Domination in Graphs
- Total Domination in Categorical Products of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Further results on packing related parameters in graphs