Bounds on the connected forcing number of a graph (Q1756082): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00373-018-1957-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963751491 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.02124 / 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: On the graph complement conjecture for minimum rank / 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: A lower bound on the zero forcing number / 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 for the Zero Forcing Number of Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum semidefinite rank of a triangle-free 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: Metric Dimension and Zero Forcing Number of Two Families of Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for a lower bound on the zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / 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: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing sets and bipartite circulants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-separating induced cycles 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
Property / Wikidata QID
 
Property / Wikidata QID: Q129125742 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00373-018-1957-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:35, 11 December 2024

scientific article
Language Label Description Also known as
English
Bounds on the connected forcing number of a graph
scientific article

    Statements

    Bounds on the connected forcing number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    zero forcing sets
    0 references
    zero forcing number
    0 references
    connected dominating sets
    0 references
    connected domination number
    0 references
    girth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references