The forcing number of graphs with given girth (Q4639236): 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: 1610.08435 / 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: 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: Girth and treewidth / 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: Bounds for the Zero Forcing Number of Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs without three‐cycles or four‐cycles / 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: 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: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / 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 13:57, 15 July 2024

scientific article; zbMATH DE number 6866033
Language Label Description Also known as
English
The forcing number of graphs with given girth
scientific article; zbMATH DE number 6866033

    Statements

    The forcing number of graphs with given girth (English)
    0 references
    0 references
    0 references
    3 May 2018
    0 references
    forcing sets
    0 references
    forcing number
    0 references
    triangle-free graphs
    0 references

    Identifiers