On domination number of Cartesian product of directed cycles (Q991743): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2009.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023782877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domination numbers of the 5 × <i>n</i> and 6 × <i>n</i> grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3981362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domination number of the Cartesian product of the cycle of length \(n\) and any graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Cartesian products of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination numbers of Cartesian products of paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominating the Cartesian product of a graph and K<sub>2</sub> / rank
 
Normal rank

Latest revision as of 04:40, 3 July 2024

scientific article
Language Label Description Also known as
English
On domination number of Cartesian product of directed cycles
scientific article

    Statements

    On domination number of Cartesian product of directed cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 September 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    Cartesian product
    0 references
    domination number
    0 references
    combinatorial problems
    0 references
    0 references