On the relationship between the zero forcing number and path cover number for some graphs (Q779727): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126404012, #quickstatements; #temporary_batch_1719354588915 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the relationships between zero forcing numbers and certain graph coverings / 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: Propagation time for zero forcing on a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree / 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 sets and the minimum rank of graphs / rank | |||
Normal rank |
Latest revision as of 01:50, 23 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the relationship between the zero forcing number and path cover number for some graphs |
scientific article |
Statements
On the relationship between the zero forcing number and path cover number for some graphs (English)
0 references
14 July 2020
0 references
zero forcing number
0 references
path cover number
0 references
Rook's graph
0 references