Bilangan Kromatik Lokasi Graf Helm Hm Dengan 3 ≤ m ≤ 9
DOI:
https://doi.org/10.25077/jmua.12.3.222-228.2023Keywords:
Bilangan Kromatik Lokasi, Graf Helm, Kode WarnaAbstract
Misalkan G = (V, E) adalah graf terhubung dan c suatu k−pewarnaan dari G. Kelas warna pada G adalah himpunan titik-titik yang berwarna i, dinotasikan dengan Si untuk 1 ≤ i ≤ k. Misalkan Π= {S1, S2. · · · , Sk} merupakan partisi terurut dari V (G) kedalam kelas-kelas warna yang saling bebas. Berdasarkan pewarnaan titik, maka representasi titik v terhadap Πdisebut kode warna dari v, dinotasikan dengan cΠ(v) dari suatu titik v ∈ V (G) didefinisikan sebagai k−pasang terurut, yaitu: cΠ(v) = (d(v, S1), d(v, S2), · · · , d(v, Sk)) dengan d(v, Si) = min{d(v, x)|x ∈ Si} untuk 1 ≤ i ≤ k. Jika setiap titik pada G memiliki kode warna yang berbeda terhadap Π, maka c disebut pewarnaan lokasi. Banyaknya warna minimum yang digunakan disebut bilangan kromatik lokasi, dinotasikan dengan χL(G). Pada tulisan ini akan dibahas bilangan kromatik lokasi graf helm Hm dengan 3 ≤ m ≤ 9.References
Asmiati dan E.T. Baskoro, 2012. Characterizing All Graphs
Containing Cycles With Locating-Chromatic Number 3. The 5th
International Conference on Research and Education in Mathematics AIP Conf. Prof. 1450:321-357.
Asmiati, E. T. Baskoro, H. Assiyatun, D. Suprijanto, R. Simanjuntak, dan S. Uttunggadewa. 2012. The Locating-Chromatic Number of Firecracker Graphs. Far East Journal of Mathematical Sciences. 63(1):11-23.
Behtoei, A. dan Anbarloei, M. 2014. The Locating Chromatic
Number of The Join Graphs. Bulletin of the Iranian Mathematical
Society. 40(6):1491-1504.
Bondy, J.A.,U.S.R. Murty. 1976. Graph Theory with Application.
Elsevier Science Publishing, New York.
Chartrand, G., M.A. Henning, P.J. Slater, dan P. Zhang. 2002.
The Locating-Chromatic Number of a Graph. Bull.Inst. Combin. Appl. 36:89-101.
Chartrand, G., Erwin, D., Henning, M.A., Slater, P.J. dan Zhang, P. 2003. Graph of Order n With Locating-Chromatic Number n-1. Discrete Math. 269:65-79.
Rahayu, R. D., Y. Kuswardi. 2018. Dekomposisi Graf Helm. Journal of Mathematics and Mathematics Education. 8(1):31-45.
Sancoko, S.W. 2020. Pelabelan Antiajaib Jarak Beberapa Kelas Graf Terkait Graf Helm. Jurnal Riset dan Aplikasi Matematika. 4(2): 93 - 102.
Welyyanti, D., E. T. Baskoro., R. Simanjuntak., S. Uttunggadewa.
The Locating-Chromatic Number of Disconnected Graph. Far East Journal of Mathematical Science. 94(2):169-182.
Welyyanti, D., E. T. Baskoro., R. Simanjuntak., S. Uttunggadewa. 2015. On Locating-Chromatic Number for Graphs with Dominant Vertices. Procedia Computer Science. 74:89-92.
Welyyanti, D. 2018. Beberapa Syarat Cukup untuk Bilangan Kromatik Lokasi Hingga pada Graf Tak Terhubung. Eksakta. 19(1): 76 - 82.
Welyyanti, D., R. Lestari dan S.R. Putri. 2019. The locating-Chromatic Number of Disconnected Graph with Path and Cycle Graph as its Components. IOP Conference Series. 1317:1 - 7
Downloads
Additional Files
Published
Issue
Section
License
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike (CC BY-SA) license. This ensures that the content is freely available to all users and can be shared and adapted, provided appropriate credit is given and any adaptations are distributed under the same license.
Copyright Holder
The copyright of all articles published in Jurnal Matematika UNAND is held by the Departemen Matematika dan Sains Data, Fakultas Matematika dan Ilmu Pengetahuan Alam (FMIPA), Universitas Andalas (UNAND). This applies to all published versions, including the HTML and PDF formats of the articles.
Author Rights
While the Departemen Matematika dan Sains Data FMIPA UNAND holds the copyright for all published content, authors retain important rights under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA). This license grants authors and users the following rights:
- Reuse: Authors can reuse and distribute their work for any lawful purpose, including sharing on personal websites, institutional repositories, or in subsequent publications.
- Attribution and Adaptation: Authors and others may remix, adapt, and build upon the published work for any purpose, even commercially, as long as proper credit is given to the original authors, and any derivative works are distributed under the same CC BY-SA license.
Creative Commons License (CC BY-SA)
Under the terms of the CC BY-SA license, users are free to:
- Share: Copy and redistribute the material in any medium or format.
- Adapt: Remix, transform, and build upon the material for any purpose, even commercially.
However, the following conditions apply:
- Attribution: Users must give appropriate credit to the original author(s) and Departemen Matematika dan Sains Data FMIPA UNAND, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author or the journal.
- ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same license as the original.
For more information about the CC BY-SA license, please visit the Creative Commons website.
Third-Party Content
If authors include third-party material (such as figures, tables, or images) that is not covered by a Creative Commons license, they must obtain the necessary permissions for reuse and provide proper attribution. Authors are required to ensure that any third-party content complies with open-access licensing requirements or includes permissions for redistribution under similar terms.
Copyright and Licensing Information Display
The copyright and licensing terms will be clearly displayed on each article's landing page, as well as within the full-text versions (HTML and PDF) of all published articles.
No "All Rights Reserved"
As an open-access journal, JMUA does not use "All Rights Reserved" policies. Instead, the CC BY-SA license ensures that the works remain accessible and reusable for a wide audience while still protecting both the authors' and the copyright holder's rights.
Â
