加载中…
The concept of the brush number was introduced for a simple connected undirected graph . This note extends the concept to a special family of directed graphs and declares that the brush number of a finite Jaco graph, with prime Jaconian vertex is given by:\ \ $b_r(J_n(1)) = \sum\limits_{j=1}^{I}(d^+(v_j) - d^-(v_j)) + \sum\limits_{j=I+1}^{n}max{0, (n-j) - d^-(v_j)}.

生成讲解博客的中文版本

生成AI智能校验的中文版本