scientific article; zbMATH DE number 867701

zbMath0840.05041MaRDI QIDQ4873818

Gayla S. Domke, Stephen T. Hedetniemi, Renu C. Laskar, Gerd H. Fricke

Publication date: 22 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dominating setdomination numberclosed neighborhoodirredundant set\(k\)-domination numberfractional parameters\(k\)-dominating function\(k\)-irredundant function\(k\)-packing function\(k\)-packing number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (21)

Roman \(\{2 \}\)-domination ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Universal maximal packing functions of graphs ⋮ Total \(\{k\}\)-domination in special graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Roman \(k\)-domination: hardness, approximation and parameterized results ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Restrained {2}-domination in graphs ⋮ Roman {2}-domination in Graphs and Graph Products ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ Complexity of Total {k}-Domination and Related Problems ⋮ Italian domination of Cartesian products of directed cycles ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Varieties of Roman Domination ⋮ Fractional Dominating Parameters ⋮ Rainbow Domination in Graphs ⋮ On the \(\{k\}\)-domination number of Cartesian products of graphs ⋮ Real and integer domination in graphs ⋮ Integer domination of Cartesian product graphs ⋮ The integer {k}-domination number of circulant graphs

This page was built for publication: