Rainbow colouring of certain product graphs

  • Pushpa Siddappa
  • Girisha A Acharya Institute of Technology
  • Praveena Kumara Kammasandra Munivenkataswamy
  • Suma Thimmarayappa
  • Shashidhar Shekar Neelannavar
DOI: https://doi.org/10.5269/bspm.79970

Resumo

Graphs play an essential role in computer science and network analysis, representing complex
relationships among entities. A rainbow colouring of a connected graph is an edge colouring process in which
every pair of vertices is linked by at least one path with distinct coloured edges. This study examines the
rainbow colouring properties of the cyclic product graph G = C(2n, 1), determining its rainbow connection
number rc(G) and strong rainbow connection number src(G). Additional analyses are carried out for corona
product graphs to establish their vertex and strong rainbow connection numbers.

Downloads

Não há dados estatísticos.
Publicado
2026-02-26
Edição
v. 44 n. 4 (2026): Recent Trends in Applied and Computational Mathematics (ICRTACM-2025)
Seção
Special Issue: International Conf. on Recent Trends in Appl. and Comput. Math.

Copyright (c) 2026 Boletim da Sociedade Paranaense de Matemática

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).

The journal utilize the Creative Common Attribution (CC-BY 4.0).

 

Crossref
Scopus
Google Scholar
Europe PMC