English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The concept of the brush number $b_r(G)$ was introduced for a simpleconnected undirected graph $G$. The concept will be applied to the MycielskiJaco graph $\mu(J_n(1)), n \in \Bbb N,$ in respect of an \emph{optimalorientation} of $J_n(1)$ associated with $b_r(J_n(1)).$ Further for theaforesaid, the concept of a \emph{brush centre} of a simple connected graphwill be introduced. Because brushes themselves may be technology of kind, thetechnology in real world application will normally be the subject ofmaintenance or calibration or virus vetting or alike. Finding a \emph{brushcentre} of a graph will allow for well located maintenance centres of thebrushes prior to a next cycle of cleaning.

Contemplating on Brush Numbers of Mycielski Jaco Graphs, $\mu(J_n(1)), n \in \Bbb N$