On the total forcing number of a graph (Q1730228): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2018.09.001 / 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: Upper bounds on the \(k\)-forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and computation of connected zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic circuits from zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic approach to k-forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Reduction Step Preserving Element-Connectivity and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The forcing number of graphs with given girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the connected forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the Zero Forcing Number of Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the zero forcing number / 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: Extremal values and bounds for the zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds on the zero forcing number of a graph / 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: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total 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: Proof of a conjecture on the zero forcing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing number, constrained matchings and strong structural controllability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domination in graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2018.09.001 / rank
 
Normal rank

Latest revision as of 06:14, 11 December 2024

scientific article
Language Label Description Also known as
English
On the total forcing number of a graph
scientific article

    Statements

    On the total forcing number of a graph (English)
    0 references
    0 references
    0 references
    11 March 2019
    0 references
    forcing sets
    0 references
    total forcing sets
    0 references
    dominating sets
    0 references
    total forcing number
    0 references

    Identifiers