Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Contemporary Mathematics and Applications (ConMathA)
Muhammad Usaid Hudloir
Unknown Affiliation
Materials Science & Nanotechnology Mathematics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Rainbow Connection on Amal(Fn,xz,m) Graphs and Amal(On,xz,m) Graphs Muhammad Usaid Hudloir; Dafik; Adawiyah, Robiatul; Rafiantika Megahnia Prihandini; Arika Indah Kristiana
Contemporary Mathematics and Applications (ConMathA) Vol. 6 No. 2 (2024)
Publisher : Universitas Airlangga

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20473/conmatha.v6i2.56201

Abstract

Coloring graph is giving a color to a set of vertices and a set of edges on a graph. The condition for coloring a graph is that each color is different for each neighboring member graph. Coloring graph can be done by mapping a different color to each vertex or edge. Rainbow coloring is a type of rainbow connected with coloring edge. It ensures that every graph G has a rainbow path. A rainbow path is a path in a graph where no two vertices have the same color. The minimum number of colors in a rainbow connected graph is called the rainbow connection number denoted by rc(G). The graphs used in this study are the Amal(Fn,xz,m) graph and the Amal(On,xz,m) graph.
Co-Authors Arika Indah Kristiana Dafik Rafiantika Megahnia Prihandini Robiatul Adawiyah