Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Tattooing and the Tattoo Number of Graphs

    https://doi.org/10.1142/S0219265920500061Cited by:0 (Source: Crossref)

    Consider a network D of pipes which have to be cleaned using some cleaning agents, called brushes, assigned to some vertices. The minimum number of brushes required for cleaning the network D is called its brush number. The tattooing of a simple connected directed graph D is a particular type of the cleaning in which an arc are coloured by the colour of the colour-brush transiting it and the tattoo number of D is a corresponding derivative of brush numbers in it. Tattooing along an out-arc of a vertex v may proceed if a minimum set of colour-brushes is allocated (primary colours) or combined with those which have arrived (including colour blends) together with mutation of permissible new colour blends, has cardinality greater than or equal to d+G(v).

    MSC2010: 05C20, 05C35, 05C38, 05C99