wdtoto

royal123

maha212

Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application
Articles

ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS

Debi Zulkarnain
Department of Mathematics and Science Data, Faculty of Mathematics and Natural Sciences Universitas Andalas, Indonesia
Lyra Yulianti
Department of Mathematics and Science Data, Faculty of Mathematics and Natural Sciences Universitas Andalas, Indonesia
Des Welyyanti
Department of Mathematics and Science Data, Faculty of Mathematics and Natural Sciences Universitas Andalas, Indonesia
Kiki Khaira Mardimar
Department of Mathematics and Science Data, Faculty of Mathematics and Natural Sciences Universitas Andalas, Indonesia
Muhammad Rafif Fajri
Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia
Published May 25, 2024
Keywords
  • Locating-chromatic number,
  • Buckminsterfullerene graph,
  • Disjoint union of Buckminsterfullerene graphs
How to Cite
[1]
D. Zulkarnain, L. Yulianti, D. Welyyanti, K. Mardimar, and M. Fajri, “ON THE LOCATING CHROMATIC NUMBER OF DISJOINT UNION OF BUCKMINSTERFULLERENE GRAPHS”, BAREKENG: J. Math. & App., vol. 18, no. 2, pp. 0915-0922, May 2024.

Abstract

Let  be a connected non-trivial graph. Let c be a proper vertex-coloring using k colors, namely . Let  be a partition of  induced by , where  is the color class that receives the color . The color code, denoted by , is defined as , where  for , and  is the distance between two vertices  and  in G. If all vertices in  have different color codes, then  is called as the locating-chromatic -coloring of . The locating-chromatic number of , denoted by , is the minimum  such that  has a locating coloring. Let   be the Buckminsterfullerene graph on   vertices. Buckminsterfullerene graph is a 3-connected planar graph and a member of the fullerene graphs, representing fullerene molecules in chemistry. In this paper, we determine the locating chromatic number of the disjoint union of Buckminsterfullerene graphs, denoted by .

Downloads

Download data is not yet available.

References

  1. Chartrand, G., Erwin, D., Henning, M.A., Slater, P.J., Zhang, P., 2002, The locating chromatic number of a graph, Bulletin of the Institute of Combinatorics and Its Applications Vol. 36: 89 – 101
  2. Diestel, R. 2017, Graph Theory, 5th ed., Springer-Verlag New York Inc., New York
  3. Chartrand, G., Erwin, D., Henning, M.A., Slater, P.J., Zhang, P., 2003, Graphs of order n – 1, Discrete Mathematics Vol. 269(1-3): 65 – 79
  4. Baskoro, E.T, Asmiati, A., 2013, Characterizing all trees with locating chromatic number 3, Electronic Journal of Graph Theory and Applications Vol. 1(2): 109 – 117
  5. Welyyanti, D., Baskoro, E.T., Simanjuntak, R., Uttunggadewa, S., 2013, On locating chromatic number of complete n-ary tree, AKCE International Journal of Graphs and Combinatorics Vol. 10(3): 309 – 315
  6. Syofyan, D.K., Baskoro, E.T., Assiyatun, H., 2016, Trees with certain locating chromatic number, Journal of Mathematical and Fundamental Sciences Vol. 48(1): 39 – 47
  7. Asmiati, A., Assiyatun, H., Baskoro, E.T., 2011, Locating chromatic number of amalgamation of stars, ITB Journal of Science Vol. 43A(1): 1 – 8
  8. Asmiati, A., Yulianti, L., Widyastuti, C.I.T., 2018, Further Results on Locating Chromatic Number for Amalgamation of Stars Linking by One Path, Indonesian Journal of Combinatorics Vol. 2(1): 50 – 56
  9. Asmiati, A., Wamiliana, W., Devriyadi, D., Yulianti, L., 2017, On some petersen graphs having locating chromatic number four or five, Far East Journal of Mathematical Sciences Vol. 102(4): 769 – 778
  10. Asmiati, A., Yana, I.K.S.G., Yulianti, L., 2018, On the Locating Chromatic Number of Certain Barbell Graphs, International Journal of Mathematics and Mathematical Sciences Volume 2018: article ID 5327504
  11. Welyyanti, D., Baskoro, E.T., Simanjuntak, R., Uttunggadewa, S., 2014, The locating chromatic number of disconnected graphs, Far East Journal of Mathematical Sciences Vol. 94(2): 169 – 182
  12. Welyyanti, D., Simanjuntak, R., Utunggadewa, S., Baskoro, E.T., 2016, Locating chromatic number for a graph of two components, AIP Conf. Proc. 1707: 02002410.1063/1.4940825
  13. Welyyanti, D., Simanjuntak, R., Utunggadewa, S., Baskoro, E.T., 2018, Locating chromatic number for a graph of two homogenous components, IOP Conf Proc. 893: 012040
  14. Welyyanti, Putri, S.R., Azhari, M., Lestari, R., 2021, On locating chromatic number of disconnected graphs with path, cycle, stars or double stars as its Components. Journal of Physics: Conference Series 1742: 012020
  15. Zikra, F., D. Welyyanti, L. Yulianti, 2022, The Locating chromatic Number of Disjoint Union of Fan Graphs, Jurnal Matematika UNAND Vol. 11(3): 159 – 179
  16. Andova, V., Kardos, F., Skrekovsi, R., 2014, Fullerene Graphs and Some Relevant Graphs Invariant. in : Topics in Chemical Graph Theory, University of Kragujevac and Faculty of Science, Kragujevac, pp 39 – 54. Mathematical Chemistry Monographs. 978-86-6009-027-2
  17. Akhter, S., Farooq, R. Metric Dimension of Fullerene Graph. 2019. Electronic Journal of Graph Theory and Applications 7(1): pp 91 – 103
  18. Mehreen, N., Farooq, R., Akhter, S., 2018, On Partition Dimension of Fullerene Graphs, AIMS Mathematics 3(3): 343 – 352
  19. Kroto, H., Heath, J., O’Brien, S. et al. C60: Buckminsterfullerene. Nature 318, 162–163 (1985). https://doi.org/10.1038/318162a0
  20. Putri, A. H., L. Yulianti, D. Welyyanti, 2019, Dimensi Metrik dari Graf Buckminsterfullerene (in Bahasa), Jurnal Matematika UNAND Vol. 8(4): 91 – 100
  21. Mardimar, K.K., Yulianti, L., Welyyanti, D., 2021, Bilangan kromatik lokasi dari graf Buckmisterfullerene B60 (in Bahasa), Jurnal Matematika UNAND Vol. 10(1): 159 – 163
  22. Putri, Y.S., L. Yulianti, Y. Yanita, 2021, On The Locating Chromatic Number Of Some Buckminsterfullerene-Type Graphs, IOP Conf Series: Journal of Physics: Conf Series 1836 (2021) 012005