Chromatic numbers in some graphs

Kazemi, Adel P.

doi:10.12988/imf.2007.07152

Search citation statements

Order By: Relevance

Paper Sections

Select...

Pendahuluan1

Citation Types

Supporting

Mentioning

Contrasting

Unclassified

Year Published

2022

2024

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Berikut penelitian yang telah dilakukan sebelumnya terkait pewarnaan titik pada beberapa graf, yaitu pada beberapa graf harary [12], graf roda, graf kipas, graf helm, graf prisma, dan graf anti prisma [10], graf dual dari graf roda [1], korona graf kipas dengan graf kipas, graf buku segitiga dengan graf buku segitiga berorder sama [14].…”

Section: Pendahuluanunclassified

Pewarnaan Titik pada Keluarga Graf Sentripetal

Retnoningsih

Dafik

Hussen

2022

CGANT. JOU. OF MATH. AND APP.

View full text Add to dashboard Cite

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)$.

show abstract

Section: Pendahuluanunclassified