Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
Fu-Hsing Wang () and
Cheng-Ju Hsu
Additional contact information
Fu-Hsing Wang: Department of Information Management, Chinese Culture University, Taipei 11114, Taiwan
Cheng-Ju Hsu: Department of Information Management, Chien Hsin University of Science and Technology, Taoyuan City 32097, Taiwan
Mathematics, 2024, vol. 12, issue 7, 1-11
Abstract:
An edge coloring of a graph G results in G being rainbow connected when every pair of vertices is linked by a rainbow path. Such a path is defined as one where each edge possesses a distinct color. A rainbow coloring refers to an edge coloring that guarantees the rainbow connectedness of G . The rainbow connection number of G represents the smallest quantity of colors required to achieve rainbow connectedness under a rainbow coloring scheme. Wang and Hsu (ICICM 2019: 75–79) provided upper bounds on the size of the rainbow connection numbers in WK-recursive networks WK d , t and WK-recursive pyramids WKP d , n . In this paper, we revise their results and determine the exact values of the rainbow connection numbers of WK d , 2 for d = 3 and 4. The rainbow connection numbers of WK d , 2 are bounded between 4 and ⌊ d 2 ⌋ + 2 for d > 4 . In addition to our previous findings, we further investigate and determine upper bounds for the size of the rainbow connection numbers of WKP d , n . This involves analyzing various aspects of the graph structure and exploring potential limitations on the rainbow connection numbers. By establishing these upper bounds, we gain deeper insights into the potential range and constraints of the rainbow connection numbers within the given context.
Keywords: edge coloring; rainbow path; rainbow coloring; rainbow connection number; WK-recursive networks; WK-recursive pyramids (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/12/7/944/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/7/944/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:7:p:944-:d:1362250
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().