On trees and unicyclic graphs with equal forcing-type numbers (Q2147600): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Zero forcing sets and the minimum rank of graphs / 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: Q3097395 / 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: A Graph Reduction Step Preserving Element-Connectivity and Applications / 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: Total forcing versus total domination in cubic graphs / 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: Bounds on the connected forcing number 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: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Zero Forcing Number of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the zero forcing number of a graph involving some classical parameters / 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: 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

Latest revision as of 09:04, 29 July 2024

scientific article
Language Label Description Also known as
English
On trees and unicyclic graphs with equal forcing-type numbers
scientific article

    Statements

    On trees and unicyclic graphs with equal forcing-type numbers (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2022
    0 references
    forcing number
    0 references
    total forcing number
    0 references
    connected forcing number
    0 references
    tree
    0 references
    unicyclic graph
    0 references

    Identifiers