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.Downloads
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
How to Cite
Issue
Section
License
All articles published in Jurnal Matematika UNAND (JMUA) are open access and licensed under the Creative Commons Attribution-ShareAlike 4.0 International License (CC BY-SA 4.0). This license allows published content to be freely accessed, shared, redistributed, and adapted for any purpose, including commercial use, provided that the applicable license conditions are followed.
Copyright Holder
The copyright of 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), in accordance with the journal's stated copyright policy.
Author Rights
Under the CC BY-SA 4.0 license, authors may share, distribute, and reuse their published articles, subject to the applicable license conditions. These rights include:
-
Self-Archiving: Authors may deposit their published articles in institutional repositories, personal websites, or academic platforms.
-
Reuse: Authors may reuse their published work in subsequent publications, research, teaching materials, or other lawful purposes, provided that appropriate attribution is maintained.
-
Distribution: Authors may share and distribute their published articles without requiring additional permission under the terms of the license.
Creative Commons License (CC BY-SA 4.0)
Under the CC BY-SA 4.0 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, including commercial purposes.
These permissions are subject to the following conditions:
-
Attribution: Users must give appropriate credit to the original author(s), retain relevant copyright notices, provide a link to the license, and indicate if changes were made. Attribution must not imply endorsement by the author(s), copyright holder, or journal.
-
ShareAlike: If users remix, transform, or build upon the material, they must distribute their contributions under the same CC BY-SA 4.0 license or a compatible license.
-
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from exercising the rights granted by the license.
For more information about the CC BY-SA 4.0 license, please visit:
https://creativecommons.org/licenses/by-sa/4.0/
Third-Party Content
Third-party materials, including figures, tables, photographs, and illustrations, are covered by the article's CC BY-SA 4.0 license only when their inclusion under that license is authorized.
Materials excluded from the license must be clearly identified with appropriate copyright notices and attribution. Authors are responsible for obtaining any necessary permissions, while users must comply with the applicable licensing terms or permissions when reusing excluded materials.
Copyright and Licensing Information
Copyright and licensing information should be clearly displayed on each published article's landing page and included in the full-text versions (HTML and PDF), where applicable, to ensure transparency regarding copyright ownership and permitted reuse.
