2014/12/18 by Johan Kok, Kok, Johan
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO
paper · pdf · doi:10.48550/arxiv.1412.5733
7 pages
arxiv created 2014/12/18 · arxiv updated 2014/12/19
The concept of the brush number br(G) was introduced for a simple connected undirected graph G. This note extends the concept to a special family of directed graphs and declares that the brush number br(Jn(1)) of a finite Jaco graph, Jn(1), n ∈ \Bbb N with prime Jaconian vertex vi is given by: br(Jn(1)) = ∑j=1I(d+(vj) - d-(vj)) + ∑j=I+1nmax\0, (n-j) - d-(vj)\.