Brushing number and zero-forcing number of graphs and their line graphs (Q1756097): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David A. Pike / rank
Normal rank
 
Property / author
 
Property / author: David A. Pike / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104253731 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.05854 / 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: Critical ideals, minimum rank and zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning Regular Graphs with Brushes / 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: Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grundy dominating sequences and zero forcing sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brushing without capacity restrictions / 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: Compressed cliques graphs, clique coverings and positive zero forcing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the positive semidefinite zero forcing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs: Their maximum nullities and zero forcing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clean the graph before you draw it! / 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: On minimum rank and zero forcing sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game brush number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero forcing number, Grundy domination number, and their variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cleaning a network with brushes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brush your trees! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast-mixed searching and related problems on graphs / rank
 
Normal rank

Latest revision as of 21:05, 17 July 2024

scientific article
Language Label Description Also known as
English
Brushing number and zero-forcing number of graphs and their line graphs
scientific article

    Statements

    Brushing number and zero-forcing number of graphs and their line graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    zero-forcing number
    0 references
    brushing number
    0 references
    line graph
    0 references
    0 references
    0 references