REVIEW
Brushing Directed Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Brushing Directed Graphs
read the original abstract
Brushing of graphs is a graph searching process in which the searching agents are called brushes. We focus on brushing directed graphs based on a new model in which the brushes can only travel in the same direction as the orientation of the arcs that they traverse. We discuss strategies to brush directed graphs as well as values and bounds for the brushing number of directed graphs. We determine the brushing number for any transitive tournament, which we use to give an upper bound for the brushing number of directed acyclic graphs in general. We also establish exact values for the brushing numbers of complete directed graphs, rooted trees, and rotational tournaments.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.