Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Istamala Idha Retnoningsih
Universitas Jember
Computer Science & IT Other

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

Found 1 Documents
Search

 1 
Pewarnaan Titik pada Keluarga Graf Sentripetal Istamala Idha Retnoningsih; Dafik Dafik; Saddam Hussen
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1025.76 KB) | DOI: 10.25037/cgantjma.v3i1.75

Abstract

The graph $G$ is defined as a pair of sets $(V,E)$ denoted by $G=(V,E)$, where $V$ is a non-empty vertex set and $E$ is an edge set may be empty connecting a pair of vertex. Two vertices $u$ and $v$ in the graph $G$ are said to be adjacent if $u$ and $v$ are endpoints of edge $e=uv$. The degree of a vertex $v$ on the graph $G$ is the number of vertices adjacent to the vertex $v$. In this study, the topic of graphs is vertex coloring will be studied. Coloring of a graph is giving color to the elements in the graph such that each adjacent element must have a different color. Vertex coloring in graph $G$ is assigning color to each vertex on graph $G$ such that the adjecent vertices $u$ and $v$ have different colors. The minimum number of colorings produced to color a vertex in a graph $G$ is called the vertex chromatic number in a graph $G$ denoted by $\chi(G)$.
Co-Authors D. Dafik Saddam Hussen