Corona product
In graph theory, the corona product of graphs G and H, denoted , can be obtained by taking one copy of G, called the center graph, and a number of copies of H equal to the order of G. Then, each copy of H is assigned a vertex in G, and that one vertex is attached to each vertex in its corresponding H copy by an edge.[1]
The star edge coloring of a graph G is a proper edge coloring without bichromatic paths and cycles of length four, similar to the star coloring of a graph, but coloring the edges instead of the vertices. The star edge chromatic index of the corona product of a path graph with cycle, wheel, helm and gear graphs are known.[2]
See also
[edit]References
[edit]- ^ Gomathi, P.; Murali, R. (2020). "Laceability Properties in Edge Tolerant Corona Product Graphs". TWMS Journal of Applied & Engineering Mathematics. 10 (3): 734–741. ISSN 2146-1147.
- ^ Kaliraj, K.; Sivakami, R.; Vivin, J. Vernold (2018). "Star Edge Coloring of Corona Product of Path and Wheel Graph Families" (PDF). Proyecciones - Journal of Mathematics. 37 (4): 593–608. doi:10.4067/S0716-09172018000400593. Retrieved 2025-03-22.
External links
[edit]- Titus, P.; Subha, M.; Kumari, S. Santha (April 2023). "Monophonic graphoidal covering number of corona product graphs". Proyecciones - Journal of Mathematics. 42 (2). Antofagasta, Chile: Universidad Católica del Norte: 303–318. doi:10.22199/issn.0717-6279-4781.
- Putri, Rembulan; Suprajitno, Adirasari Herry; Susilowati, Liliek (January 2021). "The Dominant Metric Dimension of Corona Product Graphs". Baghdad Science Journal. 18 (2): 349-??. doi:10.21123/bsj.2021.18.2.0349. ISSN 2078-8665.
 | This graph theory-related article is a stub. You can help Wikipedia by expanding it. |