| Autor: |
Arti, Desi, Barack, Zeveliano Zidane, Silaban, Denny Riama |
| Předmět: |
|
| Zdroj: |
AIP Conference Proceedings; 2024, Vol. 3176 Issue 1, p1-5, 5p |
| Abstrakt: |
Let 퐺 = (푉, 퐸) be a graph with order 푛 = |푉| and size 푚 = |퐸|. A bijection 푓: 퐸→{1,2, ..., 푚} is called a local antimagic labeling if for any adjacent vertices 푢 and 푣, 푤(푢)≠푤(푣) with 푤(푢) = ∑푢푣∈퐸(푢) 푓(푢푣), where 퐸(푢) is the set of edges incident to 푢. A graph 퐺 is called local antimagic graph if it has local antimagic labeling. The local antimagic chromatic number of 퐺 is the minimum number of colors taken over all colorings induced by local antimagic labelings of 퐺. The corona product of two graphs 퐺 and 퐻 is the graph 퐺 ∘ 퐻 obtained by taking one copy of 퐺 and 푛 copies of 퐻 and joining the 푖푡ℎ vertex of 퐺 to every vertex in the 푖푡ℎ copy of 퐻. In this study, we determine the local antimagic chromatic number for (푃푛 ∘ 퐾1) ∘ 퐾1 where 푃푛 is a path of order 푛 for 푛 is even and 푛 ≥ 4. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
