An upper bound for thek-domination number of a graph
From MaRDI portal
Publication:3815347
DOI10.1002/jgt.3190090414zbMath0664.05053OpenAlexW1925349455MaRDI QIDQ3815347
No author found.
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090414
Related Items (27)
The difference between the metric dimension and the determining number of a graph ⋮ Generalized threshold processes on graphs ⋮ Graphs with unique minimum specified domination sets ⋮ Total $k$-domination in strong product graphs ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Domination on hyperbolic graphs ⋮ On \(k\)-domination and \(j\)-independence in graphs ⋮ Algorithmic aspects of the \(k\)-domination problem in graphs ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Independence andk-domination in graphs ⋮ New bounds on the \(k\)-domination number and the \(k\)-tuple domination number ⋮ Exponential domination in subcubic graphs ⋮ Restricted domination parameters in graphs ⋮ A note on some parameters of domination on the edge neighborhood graph of a graph ⋮ Bounds on the exponential domination number ⋮ On the global offensive alliance number of a graph ⋮ Offensive \(r\)-alliances in graphs ⋮ A bound on the k-domination number of a graph ⋮ Bounds for the 2-domination number of toroidal grid graphs ⋮ Multiple Domination ⋮ ANOTHER LOOK AT k-DOMINATION IN GRAPHS ⋮ Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number ⋮ On the \(k\)-domination number of digraphs ⋮ Upper bounds for \(f\)-domination number of graphs ⋮ Global offensive alliances in graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ The k-neighbor domination problem
Cites Work
This page was built for publication: An upper bound for thek-domination number of a graph
