Rainbow Connection Numbers of WK-Recursive Networks and WK-Recursive Pyramids
An edge coloring of a graph <i>G</i> results in <i>G</i> 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 th...
| Published in: | Mathematics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-03-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/12/7/944 |