Properties of a \(q\)-analogue of zero forcing (Q2227980): Difference between revisions
From MaRDI portal
Changed an Item |
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: Zero forcing parameters and minimum rank problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Using variants of zero forcing to bound the inertia set of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Positive semidefinite zero forcing / 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: A technique for computing the zero forcing number of a graph with a cut-vertex / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast-mixed searching and related problems on graphs / rank | |||
Normal rank |
Latest revision as of 15:13, 24 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Properties of a \(q\)-analogue of zero forcing |
scientific article |
Statements
Properties of a \(q\)-analogue of zero forcing (English)
0 references
16 February 2021
0 references
zero forcing
0 references
propagation
0 references
trees
0 references
combs
0 references