Dominating a Family of Graphs with Small Connected Subgraphs
From MaRDI portal
Publication:2703021
DOI10.1017/S0963548300004260zbMath0964.05049OpenAlexW2025543857MaRDI QIDQ2703021
Publication date: 27 March 2001
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300004260
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (12)
Upper bounds for \(\alpha \)-domination parameters ⋮ Bounds on the connected \(k\)-domination number in graphs ⋮ Total \(k\)-domination in Cartesian product graphs ⋮ On upper bounds for multiple domination numbers of graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ On the (M, D) number of a graph ⋮ Simultaneous domination in graphs ⋮ New bounds on the \(k\)-domination number and the \(k\)-tuple domination number ⋮ Graphs of Large Linear Size Are Antimagic ⋮ Multiple Domination ⋮ Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number ⋮ On general frameworks and threshold functions for multiple domination
This page was built for publication: Dominating a Family of Graphs with Small Connected Subgraphs
