Restricted power domination and zero forcing problems (Q2424658): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1711.05190 / 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: Q5374237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational approaches for zero forcing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PMU Placement Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized power domination of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \({k}\)-power domination of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on power propagation time and lower bounds for the power domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between \(k\)-forcing and \(k\)-power domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted domination parameters in 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: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation time for zero forcing on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination with bounded time constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A technique for computing the zero forcing number of a graph with a cut-vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds related to domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-power domination in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for positive semidefinite zero forcing and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank

Latest revision as of 17:06, 19 July 2024

scientific article
Language Label Description Also known as
English
Restricted power domination and zero forcing problems
scientific article

    Statements

    Restricted power domination and zero forcing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    power domination
    0 references
    restricted power domination
    0 references
    zero forcing
    0 references
    restricted zero forcing
    0 references
    0 references
    0 references