A note on the Brush Numbers of Mycielski Graphs, \mu(G)

Publication date: 15 January 2015

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

m u (G)

of a simple connected graph

G

to find

b_{r} (m u (G))

in terms of an emph{optimal orientation} of

G

. We prove a surprisingly simple general result for simple connected graphs on

n g e q 2

vertices namely:

b_{r} (m u (G)) = b_{r} (m u^{i g h t a r r o w} (G)) = 2 s u m l i m i t s_{i = 1}^{n} d_{G_{b_{r} (G)}^{i g h t a r r o w}}^{+} (v_{i}) .

This page was built for publication: A note on the Brush Numbers of Mycielski Graphs, $\mu(G)$