COLORING r-DYNAMIC POINT ON CRICKET GRAPH

  • Nurita Kusumawati(1)
    Universitas Jember
  • Arika Indah Kristiana(2*)
    University of Jember
  • Ridho Alfarisi(3)
    Universitas Jember
  • Robiatul Adawiyah(4)
    Universitas Jember
  • Toto Bara Setiawan(5)
    Universitas Jember
  • Rafiantika Megahnia Prihandini(6)
    Universitas Jember
  • (*) Corresponding Author
Keywords: Graf Cricket, Coloring, r-Dinamis

Abstract

A graph is defined as an ordered set (V,E) where V is a non-empty set of elements called vertices and E is a set of edges which are finite and may be empty and each edge connects two different points of V(G).The r-dynamic coloring is defined as c:V(G)→{1,2,3,…,k} such that it satisfies the following conditions if uv∈V(G), then c(u)≠ c(v), and ∀v∈V(G), |c(N(v))|≥min⁡{r,d(v)}, for positive integers r and degree of vertex v. The purpose of r-dynamic coloring is to find the minimum chromatic number of graph coloring with unlimited parameter r. Dynamic coloring is performed on cricket graphs because no research has been done before. The method used in this research is the axiomatic deductive research method and the pattern detection method.

Downloads

Download data is not yet available.

PlumX Metrics

Published
2024-01-09
How to Cite
1.
Kusumawati N, Kristiana A, Alfarisi R, Adawiyah R, Setiawan T, Prihandini R. COLORING r-DYNAMIC POINT ON CRICKET GRAPH. JD [Internet]. 9Jan.2024 [cited 16Apr.2024];6(1):29-. Available from: https://ejurnal.undana.ac.id/index.php/JD/article/view/12191
Section
Articles