


Volume 20 No 10 (2022)
Download PDF
Rainbow Colouring of Hypertree Networks
R. Prabha , S.Vasanthi
Abstract
A path in an edge coloured graph with no two edges sharing the same colour is called a rainbow path. The rainbow
Keywords
Diameter; hypertree network; rainbow connection number; rainbow colouring
Copyright
Copyright © Neuroquantology
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Articles published in the Neuroquantology are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJECSE right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.