On the total \(\{k\}\)-domination number of Cartesian products of graphs (Q1037451): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer domination in graphs and Vizing-like problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / 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: Q3620551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative graph products and their independence, domination and coloring numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total domination number of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564127 / rank
 
Normal rank

Latest revision as of 03:57, 2 July 2024

scientific article
Language Label Description Also known as
English
On the total \(\{k\}\)-domination number of Cartesian products of graphs
scientific article

    Statements

    Identifiers