On the Power Domination Number of Graph Products (Q2795962): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Domination in graphs with bounded propagation: Algorithms, formulations and hardness results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in cylinders, tori, and generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating direct products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized power domination of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Power Domination in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power Domination in Product Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on power domination in grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms and complexity results for power domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 15:42, 11 July 2024

scientific article
Language Label Description Also known as
English
On the Power Domination Number of Graph Products
scientific article

    Statements

    Identifiers