arXiv · 1501.03623
A note on the Brush Numbers of Mycielski Graphs, $μ(G)$
Abstract
The concept of the brush number $b_r(G)$ was introduced for a simple connected undirected graph $G$. The concept will be applied to the Mycielskian graph $μ(G)$ of a simple connected graph $G$ to find $b_r(μ(G))$ in terms of an \emph{optimal orientation} of $G$. We prove a surprisingly simple general result for simple connected graphs on $n \geq 2$ vertices namely: $b_r(μ(G))= b_r(μ^{\rightarrow}(G)) = 2\sum\limits_{i=1}^{n}d^+_{G^{\rightarrow}_{b_r(G)}}(v_i).$
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Johan Kok, Susanth C, Sunny Joseph Kalayathankal. 2015-01-15. A note on the Brush Numbers of Mycielski Graphs, $μ(G)$. https://arxiv.org/abs/1501.03623
Cite the original work for its findings. Save a collection to share your selection of sources.