Contemplating on Brush Numbers of Mycielski Jaco Graphs, μ(Jn(1)), n ∈ N
Abstract
The concept of the brush number br(G) was introduced for a simple connected undirected graph G. The concept will be applied to the Mycielski Jaco graph μ(Jn(1)), n ∈ N, in respect of an optimal orientation of Jn(1) associated with br(Jn(1)). Further for the aforesaid, the concept of a brush centre of a simple connected graph will be introduced. Because brushes themselves may be technology of kind, the technology in real world application will normally be the subject of maintenance or calibration or virus vetting or alike. Finding a brush centre of a graph will allow for well located maintenance centres of the brushes prior to a next cycle of cleaning.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.