GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Q3622244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic circuits from zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total forcing sets and zero forcing sets in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total forcing number of a graph / 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: Domination in Graphs Applied to Electric Power Networks / 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: Characterizations of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / rank
 
Normal rank

Latest revision as of 13:24, 26 July 2024

scientific article; zbMATH DE number 7389710
Language Label Description Also known as
English
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED
scientific article; zbMATH DE number 7389710

    Statements

    Identifiers