On the \(\{k\}\)-domination number of Cartesian products of graphs (Q1025971): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On integer domination in graphs and Vizing-like problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A partition approach to Vizing's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An inequality related to Vizing's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs having domination number half their order / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vizing's conjecture and the one-half argument / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5564127 / rank | |||
Normal rank |
Latest revision as of 17:29, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the \(\{k\}\)-domination number of Cartesian products of graphs |
scientific article |
Statements
On the \(\{k\}\)-domination number of Cartesian products of graphs (English)
0 references
23 June 2009
0 references
packing number
0 references
domination number
0 references
\(\{k\}\)-domination number
0 references
Cartesian product
0 references