Open access
Jurnal
r-Chromatic Number On r-Dynamic Vertex Coloring of Comb Graph
Jurnal Matematika, Statistika dan Komputasi
ISSN 2614-8811, 1858-1382
Published 2023-12-24
Publisher Department of Mathematics, Hasanuddin University
Language en
Abstract
Let be a graph with vertex set and edge set. An r-dynamic vertex coloring of a graph is a assigning colors to the vertices of such that for every vertex receives at least colors in its neighbors. The minimum color used in r-dynamic vertex coloring of graph is called the r-dynamic chromatic number denoted as. In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph, central graph of comb graph, middle graph of comb graph, line graph of comb graph, sub-division graf of comb graph, and para-line graph of comb graph Let be a graph with vertex set and edge set. An r-dynamic vertex coloring of a graph is a assigning colors to the vertices of such that for every vertex receives at least colors in its neighbors. The minimum color used in r-dynamic vertex coloring of graph is called the r-dynamic chromatic number denoted as. In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph, central graph of comb graph, middle graph of comb graph, line graph of comb graph, sub-division graf of comb graph, and para-line graph of comb graph
Collaboration network of the authors
23 authors ·
44 co-authorship links
Hover or tap a name to highlight its co-authors. Double-click to open the author's page.
Thicker line = more joint articles · bigger circle = more articles
Show as table
Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.
Metadata source: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai,
first harvested 5 Nov 2026,
last seen 5 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title xml:lang="en">r-Chromatic Number On r-Dynamic Vertex Coloring of Comb Graph</dc:title>
<dc:creator xml:lang="en">Sari, Heryati Nur Fatimah</dc:creator>
<dc:creator xml:lang="en">Nurwahyu, Budi </dc:creator>
<dc:creator xml:lang="en">Massalesse, Jusmawati </dc:creator>
<dc:subject xml:lang="en">r-Dynamic coloring</dc:subject>
<dc:subject xml:lang="en">chromatic number</dc:subject>
<dc:subject xml:lang="en">comb graph</dc:subject>
<dc:subject xml:lang="en">central graph</dc:subject>
<dc:subject xml:lang="en">middle graph</dc:subject>
<dc:description xml:lang="en">Let be a graph with vertex set and edge set . An r-dynamic vertex coloring of a graph is a assigning colors to the vertices of such that for every vertex receives at least colors in its neighbors. The minimum color used in r-dynamic vertex coloring of graph is called the r-dynamic chromatic number denoted as . In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph , central graph of comb graph , middle graph of comb graph , line graph of comb graph , sub-division graf of comb graph , and para-line graph of comb graph Let be a graph with vertex set and edge set . An r-dynamic vertex coloring of a graph is a assigning colors to the vertices of such that for every vertex receives at least colors in its neighbors. The minimum color used in r-dynamic vertex coloring of graph is called the r-dynamic chromatic number denoted as . In this research we well determine the coloring pattern and the r-dynamic chromatic number of the comb graph , central graph of comb graph , middle graph of comb graph , line graph of comb graph , sub-division graf of comb graph , and para-line graph of comb graph </dc:description>
<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
<dc:date>2023-12-24</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:format>application/pdf</dc:format>
<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/32143</dc:identifier>
<dc:identifier>10.20956/j.v20i2.32143</dc:identifier>
<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 20 No. 2 (2024): JANUARY 2024; 360-370</dc:source>
<dc:source>2614-8811</dc:source>
<dc:source>1858-1382</dc:source>
<dc:language>en</dc:language>
<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/32143/10957</dc:relation>
<dc:relation>10.20956/j.v20i2.32143.g10957</dc:relation>
<dc:rights xml:lang="en">Copyright (c) 2023 Author and publisher</dc:rights>
<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>
Citations and indexing
OpenAlex
Not checked
Crossref
Not checked
Cite this article
APA 7
Sari, H. N. F., Nurwahyu, B., & Massalesse, J. (2023). r-Chromatic Number On r-Dynamic Vertex Coloring of Comb Graph. Jurnal Matematika, Statistika dan Komputasi, 20(2), 360–370. https://doi.org/10.20956/j.v20i2.32143
Copy
IEEE
H. N. F. Sari, B. Nurwahyu, and J. Massalesse, “r-Chromatic Number On r-Dynamic Vertex Coloring of Comb Graph,” Jurnal Matematika, Statistika dan Komputasi, vol. 20, no. 2, pp. 360–370, 2023, doi: 10.20956/j.v20i2.32143.
Copy
Generated from the journal's metadata; check author names before use.